A parallel algorithm for constructing projection polyhedra
From MaRDI portal
Publication:1313751
DOI10.1016/0020-0190(93)90252-5zbMATH Open0787.68102OpenAlexW2032916789MaRDI QIDQ1313751FDOQ1313751
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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimal Search in Planar Subdivisions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Finding extreme points in three dimensions and solving the post-office problem in the plane
- A convex 3-complex not simplicially isomorphic to a strictly convex complex
- APPROXIMATION OF A TESSELLATION OF THE PLANE BY A VORONOI DIAGRAM
Cited In (5)
- The projector algorithm: a simple parallel algorithm for computing Voronoi diagrams and Delaunay graphs
- A Simultaneous Iterative Method for Computing Projections on Polyhedra
- Output-sensitive generation of the perspective view of isothetic parallelepipeds
- Title not available (Why is that?)
- A parallel algorithm for volume projections on SIMD mesh-connected computers
Recommendations
This page was built for publication: A parallel algorithm for constructing projection polyhedra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1313751)
