Complexity of projected images of convex subdivisions

DOI10.1016/0925-7721(94)00009-3zbMath0816.68121OpenAlexW1981851079MaRDI QIDQ1841991

Xue-Hou Tan, Tomio Hirata, Takeshi Tokuyama, Ji{ří} Matoušek

Publication date: 9 April 1995

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0925-7721(94)00009-3

zbMATH Keywords

projectioncombinatorial complexityconvex subdivision

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some dynamic computational geometry problems
• Small-dimensional linear programming and convex hulls made easy
• Construction of Voronoi polyhedra
• Searching and storing similar lists
• Efficient Point Location in a Convex Spatial Cell-Complex
• Multidimensional Searching Problems
• Location of a Point in a Planar Subdivision and Its Applications
• An optimal algorithm for intersecting line segments in the plane

This page was built for publication: Complexity of projected images of convex subdivisions