Efficient binary space partitions for hidden-surface removal and solid modeling

From MaRDI portal
Publication:914380

DOI10.1007/BF02187806zbMath0701.68042OpenAlexW1983698126WikidataQ106190047 ScholiaQ106190047MaRDI QIDQ914380

F. Frances Yao, Michael S. Paterson

Publication date: 1990

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/131133




Related Items

On joints in arrangements of lines in space and related problemsConvex polygons made from few lines and convex decompositions of polyhedraNew results on binary space partitions in the plane (extended abstract)OPTIMAL BINARY SPACE PARTITIONS FOR SEGMENTS IN THE PLANECuttings for disks and axis-aligned rectangles in three-spaceOn optimal cuts of hyperrectanglesNew results on binary space partitions in the planeErased arrangements of linear and convex decompositions of polyhedraLinear size binary space partitions for fat objectsEliminating depth cycles among triangles in three dimensionsSpanning trees crossing few barriersUnnamed ItemConstructive Polynomial Partitioning for Algebraic Curves in $\mathbb{R}^3$ with ApplicationsRemoving depth-order cycles among triangles: an algorithm generating triangular fragmentsPerfect binary space partitionsEfficient hidden surface removal for objects with small union sizeBinary plane partitions for disjoint line segmentsApproximate range searching using binary space partitionsLocal polyhedra and geometric graphsOn communication protocols that compute almost privatelyDecompositions and boundary coverings of non-convex fat polyhedraBinary space partitions for axis-parallel line segments: Size-height tradeoffs.An Improved Ray Shooting Method for Constructive Solid Geometry Models Via Tree ContractionVisibility with a moving point of view



Cites Work