Optimal tetrahedralization of the 3D-region ``between'' a convex polyhedron and a convex polygon
type: Item
instance of: scholarly article
title: Optimal tetrahedralization of the 3D-region ``between'' a convex polyhedron and a convex polygon
zbMATH Open document ID: 0857.68100
DOI: 10.1016/0925-7721(95)00011-9
author: Leonidas Palios
published in: Computational Geometry
publication date: 1996-10-20T00:00:00Z
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 937222
zbMATH Keywords: tetrahedralization
MaRDI profile type: Publication
full work available at URL: 0925-7721(95)00011-9
OpenAlex ID: W2067919151
cites work: Convex Decomposition of Polyhedra and Robustness
cites work: Q4327374
cites work: POLYNOMIAL-SIZE NONOBTUSE TRIANGULATION OF POLYGONS
cites work: Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm
cites work: Triangulating a nonconvex polytope
cites work: Bounds on the size of tetrahedralizations
cites work: Q3772828
cites work: Cell decomposition of polytopes by bending
cites work: Primitives for the manipulation of general subdivisions and the computation of Voronoi
cites work: Finding the intersection of two convex polyhedra
cites work: Q3992847
cites work: On the difficulty of triangulating three-dimensional nonconvex polyhedra
description: scientific article; zbMATH DE number 937222