A parallel algorithm for constructing projection polyhedra
From MaRDI portal
Publication:1313751
DOI10.1016/0020-0190(93)90252-5zbMath0787.68102OpenAlexW2032916789MaRDI QIDQ1313751
Publication date: 24 February 1994
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(93)90252-5
parallel algorithmcomputational geometrypolytopical cell decompositionsprojection polyhedrasimple cell decomposition
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Distributed algorithms (68W15)
Cites Work
- Finding extreme points in three dimensions and solving the post-office problem in the plane
- A criterion for the affine equivalence of cell complexes in \(R^ d\) and convex polyhedra in \(R^{d+1}\)
- Recognising polytopical cell complexes and constructing projection polyhedra
- APPROXIMATION OF A TESSELLATION OF THE PLANE BY A VORONOI DIAGRAM
- A convex 3-complex not simplicially isomorphic to a strictly convex complex
- Optimal Search in Planar Subdivisions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A parallel algorithm for constructing projection polyhedra