Computing and Verifying Depth Orders

DOI10.1137/S0097539791223747MaRDI QIDQ4291567zbMATH OpenOpenAlexFDO

Authors Mark de Berg, Mark H. Overmars, Otfried Cheong

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

zbMATH Keywords

computational geometrydepth orderslinear extensions of partial ordersthree dimensions

Mathematics Subject Classification ID

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

Recommendations

• Computing depth orders and related problems
• Computational depth and reducibility
• Computational depth and reducibility
• Computing depth orders for fat objects and related problems
• The fine-grained complexity of multi-dimensional ordering properties
• On the depth complexity of the counting functions
• Derivational Complexity of Knuth-Bendix Orders Revisited
• On the complexity of partial order properties

Cited in

(12)

• Efficient ray shooting and hidden surface removal
• 3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects
• New lower bounds for Hopcroft's problem
• Computing depth orders for fat objects and related problems
• Eliminating depth cycles among triangles in three dimensions
• Removing depth-order cycles among triangles: an algorithm generating triangular fragments
• Reasoning about visibility
• Computing depth orders and related problems
• Intractability of assembly sequencing: unit disks in the plane
• Computing Depths of Patterns
• Linear size binary space partitions for fat objects
• Perfect binary space partitions

This page was built for publication: Computing and Verifying Depth Orders

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4291567)