On the possibility of simple parallel computing of Voronoi diagrams and Delaunay graphs

No abstract is available for this paper.

• Publication year

  2012

• Venue

  arXiv.org

• Publication date

  2012-12-04

• Fields of study

  Mathematics, Computer Science

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Localizing the Delaunay Triangulation and its Parallel Implementation

  2012cited by this paper
• Optimal in-place and cache-oblivious algorithms for 3-d convex hulls and 2-d segment intersection

  2010cited by this paper
• Divide-and-conquer for Voronoi diagrams revisited

  2009cited by this paper
• An Algorithm for Computing Voronoi Diagrams of General Generators in General Normed Spaces

  2009influential reference
• Constructing Two-Dimensional Voronoi Diagrams via Divide-and-Conquer of Envelopes in Space

  2009cited by this paper
• Parallel Delaunay triangulation for particle finite element methods

  2007cited by this paper
• Convergence of the Lloyd Algorithm for Computing Centroidal Voronoi Tessellations

  2006cited by this paper
• Design and Multithreading Implementation of the Wave-Front Algorithm for Constructing Voronoi Diagrams

  2005cited by this paper
• Constructing higher-order Voronoi diagrams in parallel

  2005cited by this paper
• Parallel algorithms to find the Voronoi diagram and the order-k Voronoi diagram

  2003cited by this paper
• Parallel Delaunay Refinement: Algorithms and Analyses

  2002cited by this paper
• Optimal Parallel Randomized Algorithms for the Voronoi Diagram of Line Segments in the Plane

  2002cited by this paper
• Design and Implementation of a Practical Parallel Delaunay Algorithm

  1999cited by this paper
• Centroidal Voronoi Tessellations: Applications and Algorithms

  1999cited by this paper
• Computational geometry: algorithms and applications

  1997cited by this paper
• A nearly optimal deterministic parallel Voronoi diagram algorithm

  1996cited by this paper
• The quickhull algorithm for convex hulls

  1996cited by this paper
• Introduction to algorithms

  1996cited by this paper
• Triangle: Engineering a 2D Quality Mesh Generator and Delaunay Triangulator

  1996influential reference
• Efficient parallel geometric algorithms on a mesh of trees

  1995cited by this paper
• Davenport-Schinzel sequences and their geometric applications

  1995cited by this paper
• Computational Geometry in C.

  1995cited by this paper
• Parallel algorithms for higher-dimensional convex hulls

  1994cited by this paper
• Constructing the Voronoi diagram of a set of line segments in parallel

  1993cited by this paper
• Optimal Parallel Randomized Algorithms for Three-Dimensional Convex Hulls and Related Problems

  1992cited by this paper
• An efficient expected time parallel algorithm for Voronoi construction

  1992cited by this paper
• The parallel 3D convex hull problem revisited

  1992cited by this paper
• Voronoi diagrams—a survey of a fundamental geometric data structure

  1991influential reference
• Randomized incremental construction of Delaunay and Voronoi diagrams

  1990cited by this paper
• On parallel computation of Voronoï diagrams

  1989cited by this paper
• Parallel Computation of Discrete Voronoi Diagrams (Extended Abstract)

  1989cited by this paper
• Parallel Construction of Subdivision Hierarchies

  1989cited by this paper
• Parallel Computation of Discrete Voronoi Diagrams (Extended Abstract)

  1989cited by this paper
• Parallel computational geometry

  1988cited by this paper
• A linear-time algorithm for computing the voronoi diagram of a convex polygon

  1987cited by this paper
• Algorithms in Combinatorial Geometry

  1987cited by this paper
• A sweepline algorithm for Voronoi diagrams

  1986cited by this paper
• IMPROVEMENTS OF THE INCREMENTAL METHOD FOR THE VORONOI DIAGRAM WITH COMPUTATIONAL COMPARISON OF VARIOUS ALGORITHMS

  1984cited by this paper
• Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams

  1983cited by this paper
• Primitives for the manipulation of general subdivisions and the computation of Voronoi

  1983cited by this paper
• Optimal Expected-Time Algorithms for Closest Point Problems

  1980cited by this paper
• Parallel algorithms for geometric problems

  1980cited by this paper
• Geometric transforms for fast geometric algorithms

  1979cited by this paper
• Voronoi Diagrams from Convex Hulls

  1979cited by this paper
• Computing Dirichlet Tessellations in the Plane

  1978cited by this paper
• HOW GOOD IS THE SIMPLEX ALGORITHM

  1970cited by this paper
• The Computer Journal

  1958cited by this paper
• ACTIVITY ANALYSIS OF PRODUCTION AND ALLOCATION

  1952cited by this paper

• Parallel algorithms and data structures for interactive data problems. (Algorithmes et structures de données parallèles pour applications interactives)

  2017cites this paper
• Parallel Shortest Path Algorithm for Voronoi Diagrams with Generalized Distance Functions

  2014cites this paper
• Decentralized spatial partitioning algorithms for multi-vehicle systems based on the minimum control effort metric

  2014cites this paper
• A decentralized spatial partitioning algorithm based on the minimum control effort metric

  2014cites this paper
• Decentralized spatial partitioning for multi-vehicle systems in spatiotemporal flow-field

  2014cites this paper
• Localizing the Delaunay Triangulation and its Parallel Implementation

  2012cites this paper
• On the Computation of Zone and Double Zone Diagrams

  2012cites this paper