Erased arrangements of linear and convex decompositions of polyhedra
type: Item
instance of: scholarly article
title: Erased arrangements of linear and convex decompositions of polyhedra
zbMATH Open document ID: 0894.68153
DOI: 10.1016/S0925-7721(97)00024-2
author: John Hershberger
author: Jack Snoeyink
published in: Computational Geometry
publication date: 1998-04-13T00:00:00Z
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 1140207
zbMATH Keywords: notch-cutting procedure
zbMATH Keywords: incrementally-constructed erased arrangement
MaRDI profile type: Publication
cites work: Q3359791
cites work: A theorem on arrangements of lines in the plane
cites work: Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm
cites work: The power of geometric duality
cites work: Triangulating a nonconvex polytope
cites work: Combinatorial complexity bounds for arrangements of curves and spheres
cites work: Applications of random sampling in computational geometry. II
cites work: An efficient algorithm for finding the CSG representation of a simple polygon
cites work: Q3772828
cites work: Constructing Arrangements of Lines and Hyperplanes with Applications
cites work: On the maximal number of edges of many faces in an arrangement
cites work: Primitives for the manipulation of general subdivisions and the computation of Voronoi
cites work: On disjoint concave chains in arrangements of (pseudo) lines
cites work: Q3856819
cites work: Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes
cites work: Sorting jordan sequences in linear time using level-linked search trees
cites work: Tetrahedral mesh generation in polyhedral regions based on convex polyhedron decompositions
cites work: On a problem of K. Zarankiewicz
cites work: Q3948588
cites work: Efficient binary space partitions for hidden-surface removal and solid modeling
cites work: On the difficulty of triangulating three-dimensional nonconvex polyhedra
cites work: Upper bounds on geometric permutations for convex sets
description: scientific article; zbMATH DE number 1140207