Skip to main content
SpringerLink
Log in

An Efficient Output-Size Sensitive Parallel Algorithm for Hidden-Surface Removal for Terrains

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract.

We describe an efficient parallel algorithm for hidden-surface removal for terrain maps. The algorithm runs in O(log 4 n) steps on the CREW PRAM model with a work bound of O((n+k) \polylog ( n)) where n and k are the input and output sizes, respectively. In order to achieve the work bound we use a number of techniques, among which our use of persistent data structures is somewhat novel in the context of parallel algorithms.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Indian Institute of Technology, New Delhi 110016, India. {neelima,ssen}@cse.iitd.ernet.in., IN

    N. Gupta & S. Sen

Authors
  1. N. Gupta
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. Sen
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received July 29, 1998; revised October 5, 1999.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gupta, N., Sen, S. An Efficient Output-Size Sensitive Parallel Algorithm for Hidden-Surface Removal for Terrains. Algorithmica 31, 179–207 (2001). https://doi.org/10.1007/s00453-001-0042-6

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-001-0042-6

Search

Navigation