A parallel algorithm for constructing projection polyhedra
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3153257 (Why is no real title available?)
- scientific article; zbMATH DE number 4032498 (Why is no real title available?)
- scientific article; zbMATH DE number 3696001 (Why is no real title available?)
- scientific article; zbMATH DE number 17657 (Why is no real title available?)
- scientific article; zbMATH DE number 482343 (Why is no real title available?)
- scientific article; zbMATH DE number 1142306 (Why is no real title available?)
- scientific article; zbMATH DE number 3261280 (Why is no real title available?)
- scientific article; zbMATH DE number 3345859 (Why is no real title available?)
- A convex 3-complex not simplicially isomorphic to a strictly convex complex
- A criterion for the affine equivalence of cell complexes in \(R^ d\) and convex polyhedra in \(R^{d+1}\)
- APPROXIMATION OF A TESSELLATION OF THE PLANE BY A VORONOI DIAGRAM
- Finding extreme points in three dimensions and solving the post-office problem in the plane
- Optimal Search in Planar Subdivisions
- Recognising polytopical cell complexes and constructing projection polyhedra
Cited in
(5)- scientific article; zbMATH DE number 3872172 (Why is no real title available?)
- The projector algorithm: a simple parallel algorithm for computing Voronoi diagrams and Delaunay graphs
- A parallel algorithm for volume projections on SIMD mesh-connected computers
- Output-sensitive generation of the perspective view of isothetic parallelepipeds
- A Simultaneous Iterative Method for Computing Projections on Polyhedra
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)