Visibility with a moving point of view

DOI10.1007/BF01187019zbMath0804.68147OpenAlexW3136595005MaRDI QIDQ1322569

David Eppstein, David P. Dobkin, Marshall W. Bern, Robert L. Grossman

Publication date: 5 May 1994

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01187019

zbMATH Keywords

visibilityterrainray-shootinghidden line removalflight simulation

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (8)

Linear data structures for fast ray-shooting amidst convex polyhedra ⋮ Maintaining visibility of a polygon with a moving point of view ⋮ On incremental rendering of silhouette maps of a polyhedral scene ⋮ Three dimensional weak visibility: Complexity and applications ⋮ REGION INTERVISIBILITY IN TERRAINS ⋮ Largest empty circle centered on a query line ⋮ Three-dimensional weak visibility: Complexity and applications ⋮ Visibility of rectagular objects inL₁metric

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding the upper envelope of n line segments in O(n log n) time
• Efficient binary space partitions for hidden-surface removal and solid modeling
• Some dynamic computational geometry problems
• Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes
• Almost linear upper bounds on the length of general Davenport-Schinzel sequences
• Planar realizations of nonlinear Davenport-Schinzel sequences by segments
• Making data structures persistent
• Algorithms for Reporting and Counting Geometric Intersections
• Constructing Arrangements of Lines and Hyperplanes with Applications
• A simple output-sensitive algorithm for hidden surface removal
• Location of a Point in a Planar Subdivision and Its Applications
• A simple parallel tree contraction algorithm
• Fully Dynamic Point Location in a Monotone Subdivision

This page was built for publication: Visibility with a moving point of view