Efficient architectures for hidden surface removal

Research output: Contribution to journalArticle

Abstract

We present several new efficient architectures to solve the hidden surface problem in the feature domain. All the architectures operate on segments (instead of pixels) and create a list of visible segments for each scan line. We present two new semi-systolic architectures consisting of an array of M processors, where M is the maximum number of overlapping segments. Both architectures require presorting of the segment endpoints and have a latency of O(N), where N is the number of input segments. We present two new sorting network architectures which do not require any presorting of the endpoints. These architectures consist of O(log N) stages of segment merge units and are based on odd-even merge sort and running merge sort.

Original languageEnglish (US)
Article number413397
Pages (from-to)661-665
Number of pages5
JournalUnknown Journal
Volume1
DOIs
StatePublished - 1994

Fingerprint

Network architecture
Sorting
Pixels

ASJC Scopus subject areas

  • Software
  • Computer Vision and Pattern Recognition
  • Signal Processing

Cite this

Efficient architectures for hidden surface removal. / Chakrabarti, Chaitali; Lucke, L.

In: Unknown Journal, Vol. 1, 413397, 1994, p. 661-665.

Research output: Contribution to journalArticle

@article{479f0b84369643bb83d02b58294c7096,
title = "Efficient architectures for hidden surface removal",
abstract = "We present several new efficient architectures to solve the hidden surface problem in the feature domain. All the architectures operate on segments (instead of pixels) and create a list of visible segments for each scan line. We present two new semi-systolic architectures consisting of an array of M processors, where M is the maximum number of overlapping segments. Both architectures require presorting of the segment endpoints and have a latency of O(N), where N is the number of input segments. We present two new sorting network architectures which do not require any presorting of the endpoints. These architectures consist of O(log N) stages of segment merge units and are based on odd-even merge sort and running merge sort.",
author = "Chaitali Chakrabarti and L. Lucke",
year = "1994",
doi = "10.1109/ICIP.1994.413397",
language = "English (US)",
volume = "1",
pages = "661--665",
journal = "Scanning Electron Microscopy",
issn = "0586-5581",
publisher = "Scanning Microscopy International",

}

TY - JOUR

T1 - Efficient architectures for hidden surface removal

AU - Chakrabarti, Chaitali

AU - Lucke, L.

PY - 1994

Y1 - 1994

N2 - We present several new efficient architectures to solve the hidden surface problem in the feature domain. All the architectures operate on segments (instead of pixels) and create a list of visible segments for each scan line. We present two new semi-systolic architectures consisting of an array of M processors, where M is the maximum number of overlapping segments. Both architectures require presorting of the segment endpoints and have a latency of O(N), where N is the number of input segments. We present two new sorting network architectures which do not require any presorting of the endpoints. These architectures consist of O(log N) stages of segment merge units and are based on odd-even merge sort and running merge sort.

AB - We present several new efficient architectures to solve the hidden surface problem in the feature domain. All the architectures operate on segments (instead of pixels) and create a list of visible segments for each scan line. We present two new semi-systolic architectures consisting of an array of M processors, where M is the maximum number of overlapping segments. Both architectures require presorting of the segment endpoints and have a latency of O(N), where N is the number of input segments. We present two new sorting network architectures which do not require any presorting of the endpoints. These architectures consist of O(log N) stages of segment merge units and are based on odd-even merge sort and running merge sort.

UR - http://www.scopus.com/inward/record.url?scp=84997079460&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84997079460&partnerID=8YFLogxK

U2 - 10.1109/ICIP.1994.413397

DO - 10.1109/ICIP.1994.413397

M3 - Article

AN - SCOPUS:84997079460

VL - 1

SP - 661

EP - 665

JO - Scanning Electron Microscopy

JF - Scanning Electron Microscopy

SN - 0586-5581

M1 - 413397

ER -