Computing depth orders and related problems

DOI10.1007/3-540-58218-5_1zbMath1502.68294OpenAlexW2135471143MaRDI QIDQ5056161

Matthew J. Katz, Micha Sharir, Pankaj K. Agarwal

Publication date: 9 December 2022

Published in: Algorithm Theory — SWAT '94 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-58218-5_1

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Linear size binary space partitions for fat objects, Piercing pairwise intersecting convex shapes in the plane

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Visibility and intersection problems in plane geometry
• Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes
• Approximate motion planning and the complexity of the boundary of the union of simple geometric figures
• Efficient hidden surface removal for objects with small union size
• Ray shooting, depth orders and hidden surface removal
• On the union of fat wedges and separating a collection of segments by a line
• Red-Blue Intersection Detection Algorithms, with Applications to Motion Planning and Collision Detection
• Fat Triangles Determine Linearly Many Holes
• Computing and Verifying Depth Orders
• On fat partitioning, fat covering and the union size of polygons