Parallel triangulation of a polygon in two calls to the trapezoidal map
From MaRDI portal
(Redirected from Publication:1104087)
Recommendations
- Triangulating a polygon in parallel
- scientific article; zbMATH DE number 4074480
- scientific article; zbMATH DE number 512921
- Orthogonal triangulation of polygons
- scientific article; zbMATH DE number 219273
- On triangulation axes of polygons
- Parallel enumeration of triangulations
- Rectangulating rectilinear polygons in parallel
- Rectangulating rectilinear polygons in parallel
- Parallel Delaunay triangulation in three dimensions
Cites work
Cited in
(15)- Optimal cooperative search in fractional cascaded data structures
- Optimal parallel algorithms for point-set and polygon problems
- Intelligent computing systems with actors -- parallel dynamic programming algorithm of the polygon triangulation problem
- Planar separators and parallel polygon triangulation.
- scientific article; zbMATH DE number 4074480 (Why is no real title available?)
- scientific article; zbMATH DE number 219273 (Why is no real title available?)
- Parallel methods for visibility and shortest-path problems in simple polygons
- Triangulating a polygon in parallel
- Parallelized ear clipping for the triangulation and constrained Delaunay triangulation of polygons
- Testing a simple polygon for monotonicity optimally in parallel
- On the multisearching problem for hypercubes
- Determining Weak Visibility of a Polygon from an Edge in Parallel
- On parallel complexity of planar triangulations
- Lower bounds for parallel algebraic decision trees, parallel complexity of convex hulls and related problems
- AN IMPROVED HYPERCUBE BOUND FOR MULTISEARCHING AND ITS APPLICATIONS
This page was built for publication: Parallel triangulation of a polygon in two calls to the trapezoidal map
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1104087)
