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.<>


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Efficient architectures for hidden surface removal


    Contributors:
    Chakrabarti, C. (author) / Lucke, L. (author)


    Publication date :

    1994-01-01


    Size :

    487185 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Efficient Architectures for Hidden Surface Removal

    Chakrabarti, C. / Lucke, L. / IEEE; Signal Processing Society | British Library Conference Proceedings | 1994



    An Efficient Hidden-Line Removal Method Based on Z-Buffer Algorithm

    Tang, L.-A. / Huang, T. S. / IEEE; Signal Processing Society | British Library Conference Proceedings | 1994


    Surrogate-Based Optimization of System Architectures Subject to Hidden Constraints

    Bussemaker, Jasper H. / Saves, Paul / Bartoli, Nathalie et al. | AIAA | 2024