Erased arrangements of linear and convex decompositions of polyhedra
From MaRDI portal
Publication:1384196
DOI10.1016/S0925-7721(97)00024-2zbMath0894.68153MaRDI QIDQ1384196
J. E. Hershberger, Jack Scott Snoeyink
Publication date: 13 April 1998
Published in: Computational Geometry (Search for Journal in Brave)
Related Items
A Simple Algorithm to Triangulate a Special Class of 3d Non-convex Polyhedra Without Steiner Points ⋮ 3D boundary recovery by constrained Delaunay tetrahedralization ⋮ Formulas for the number of \((n-2)\)-gaps of binary objects in arbitrary dimension
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Upper bounds on geometric permutations for convex sets
- Triangulating a nonconvex polytope
- Efficient binary space partitions for hidden-surface removal and solid modeling
- Combinatorial complexity bounds for arrangements of curves and spheres
- On the maximal number of edges of many faces in an arrangement
- The power of geometric duality
- Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes
- On the difficulty of triangulating three-dimensional nonconvex polyhedra
- On disjoint concave chains in arrangements of (pseudo) lines
- An efficient algorithm for finding the CSG representation of a simple polygon
- Applications of random sampling in computational geometry. II
- A theorem on arrangements of lines in the plane
- Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm
- Primitives for the manipulation of general subdivisions and the computation of Voronoi
- Constructing Arrangements of Lines and Hyperplanes with Applications
- Tetrahedral mesh generation in polyhedral regions based on convex polyhedron decompositions
- Sorting jordan sequences in linear time using level-linked search trees
- On a problem of K. Zarankiewicz
