Decomposing the boundary of a nonconvex polyhedron
From MaRDI portal
Publication:5056155
DOI10.1007/3-540-55706-7_33zbMath1502.68304OpenAlexW1524809104MaRDI QIDQ5056155
Leonidas Palios, Bernard Chazelle
Publication date: 9 December 2022
Published in: Algorithm Theory — SWAT '92 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-55706-7_33
Analysis of algorithms and problem complexity (68Q25) Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Visibility and intersection problems in plane geometry
- Triangulating a nonconvex polytope
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- Finding the intersection of two convex polyhedra
- On separating two simple polygons by a single translation
- A linear time algorithm for minimum link paths inside a simple polygon
- Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm
- Primitives for the manipulation of general subdivisions and the computation of Voronoi
- Optimal Search in Planar Subdivisions
- Decomposing the boundary of a nonconvex polyhedron
This page was built for publication: Decomposing the boundary of a nonconvex polyhedron