Computing and Verifying Depth Orders
From MaRDI portal
Publication:4291567
DOI10.1137/S0097539791223747zbMath0804.68150OpenAlexW2123869145MaRDI QIDQ4291567
Mark H. Overmars, Otfried Schwarzkopf, Mark T. de Berg
Publication date: 10 May 1994
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539791223747
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
Efficient ray shooting and hidden surface removal, Computing depth orders and related problems, 3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects, Computing depth orders for fat objects and related problems, Intractability of assembly sequencing: Unit disks in the plane, Linear size binary space partitions for fat objects, Reasoning about visibility, Eliminating depth cycles among triangles in three dimensions, Removing depth-order cycles among triangles: an algorithm generating triangular fragments, Perfect binary space partitions, Almost tight bounds for eliminating depth cycles in three dimensions, New lower bounds for Hopcroft's problem
