Implementation and evaluation of an efficient parallel Delaunay triangulation algorithm

No abstract is available for this paper.

• Publication year

  1997

• Venue

  ACM Symposium on Parallelism in Algorithms and Architectures

• Publication date

  1997-04-01

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1145/258492.258516
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Implementation and Evaluation of an E cient D Parallel Delaunay Triangulation Algorithm

  1997cited by this paper
• Practical Parallel Divide-and-Conquer Algorithms

  1997cited by this paper
• Merging free trees in parallel for efficient Voronoi diagram construction

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

  1996cited by this paper
• Developing a practical projection-based parallel Delaunay algorithm

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

  1996cited by this paper
• An Efficient Implementation of Nested Data Parallelism for Irregular Divide-and-Conquer Algorithms

  1996cited by this paper
• Dynamic load balancing in a 2D parallel delaunay mesh generator

  1996cited by this paper
• Concatenated parallelism: a technique for efficient parallel divide and conquer

  1996cited by this paper
• Evaluation of parallelization strategies for an incremental Delaunay triangulator in e3

  1995cited by this paper
• Output-sensitive construction of polytopes in four dimensions and clipped Voronoi diagrams in three

  1995cited by this paper
• A comparison of sequential Delaunay triangulation algorithms

  1995cited by this paper
• Efficient Parallel Algorithms for Closest Point Problems

  1994cited by this paper
• A dynamic and recursive parallel algorithm for constructing Delaunay triangulations

  1994influential reference
• An optimal mesh computer algorithm for constrained Delaunay triangulation

  1994cited by this paper
• The MPI Standard for Message Passing

  1994cited by this paper
• Efficient parallel algorithms for closet point problems

  1994cited by this paper
• Porting a vector library: a comparison of MPI, Paris, CMMD and PVM

  1994cited by this paper
• MPI: A message - passing interface standard

  1994cited by this paper
• Parallel 3D Delaunay Triangulation

  1993cited by this paper
• Implementation of a portable nested data-parallel language

  1993cited by this paper
• A data-parallel algorithm for three-dimensional Delaunay triangulation and its implementation

  1993cited by this paper
• Parallel implementation of an algorithm for Delaunay triangulation

  1992cited by this paper
• The divide-and-conquer paradigm as a basis for parallel language design

  1992cited by this paper
• Transforming high-level data-parallel programs into vector operations

  1992cited by this paper
• Triangulation Voronoi Diagram and Convex Hull in k-Space on Mesh-Connected Arrays and Hypercubes

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

  1991cited by this paper
• Merging Free Trees in Parallel for Efficient Voronoi Diagram Construction (Preliminary Version)

  1990cited by this paper
• Vector Models for Data-Parallel Computing

  1990cited by this paper
• Polling: a new randomized sampling technique for computational geometry

  1989cited by this paper
• A Note on Improving the Performance of Delaunay Triangulation

  1989cited by this paper
• Parallel computational geometry

  1988cited by this paper
• A simple divide-and-conquer algorithm for computing Delaunay triangulations in O(n log log n) expected time

  1986cited by this paper
• Computational Geometry

  1985cited by this paper
• Maintenance of Configurations in the Plane

  1981cited by this paper
• Gaussian elimination is not optimal

  1969cited by this paper
• Quicksort

  1962cited by this paper
• Algorithm 63: partition

  1961cited by this paper
• The Computer Journal

  1958cited by this paper

• Computing the Volume, Surface Area, Mean, and Gaussian Curvatures of Molecules and Their Derivatives

  2023cites this paper
• Parallel high-performance computing algorithm to generate FEM-compliant volumetric mesh representations of biomolecules at atomic scale

  2019cites this paper
• Performance Evaluation of Parallel Surface Modeling and Generation on Actual and Virtual Multicore Systems

  2018cites this paper
• TIPP: parallel Delaunay triangulation for large-scale datasets

  2018cites this paper
• Decoupling Mesh and Data Representations for Geo-spatial Data Visualization

  2012cites this paper
• ParaStream: A parallel streaming Delaunay triangulation algorithm for LiDAR points on multicore architectures

  2011cites this paper
• Dynamic Parallel 3D Delaunay Triangulation

  2011cites this paper
• Fast Two Dimensional Convex Hull on the GPU

  2011cites this paper
• Delaunay triangulation using a parallel architecture

  2011cites this paper
• The reconstruction of large three-dimensional meshes

  2010cites this paper
• Alchemist: A Transparent Dependence Distance Profiling Infrastructure

  2009cites this paper
• Parallel Poisson Surface Reconstruction

  2009cites this paper
• Using Delaunay triangulation in infrastructure design software

  2009cites this paper
• CONSTRAINED DELAUNAY TRIANGULATION FOR DIAGNOSIS AND GRADING OF COLON CANCER

  2009cites this paper
• A Performance Driven Layout Compaction Optimization Algorithm for Analog Circuits

  2007cites this paper
• Delaunay Triangulation with Transactions and Barriers

  2007cites this paper
• ACUT: Out-Of-Core Delaunay Triangulation of Large Terrain Data Sets

  2007cites this paper
• Comparison Between Mimetic and Two-Point Flux-Approximation Schemes on PEBI-grids

  2007cites this paper
• Parallel Delaunay triangulation for particle finite element methods

  2007cites this paper
• Compact data structures with fast queries

  2006cites this paper
• Engineering a compact parallel delaunay algorithm in 3D

  2006cites this paper
• Parallel Mesh Generation

  2006cites this paper
• Data Dependent Mesh Generation for Piecewise Linear Interpolation

  2005cites this paper
• Parallel Delaunay triangulation in E2 and E3 for computers with shared memory

  2005influential citation
• Ejecución paralela de algoritmos incrementales aleatorizados

  2005cites this paper
• Practically oriented parallel Delaunay triangulation in E2 for computers with shared memory

  2004cites this paper
• Constrained Delaunay Triangulation using Plane Subdivision

  2004cites this paper
• Empirical Studies of Optimization Techniques in the Event-Driven Simulation of Mechanically Alloyed Materials

  2004cites this paper
• Parallel Delaunay triangulation in E3: make it simple

  2003cites this paper
• Parallel Delaunay triangulation based on circum-circle criterion

  2003cites this paper
• Optimistic parallel Delaunay triangulation

  2002influential citation
• On a Nearest-Neighbor Problem Under Minkowski and Power Metrics for Large Data Sets

  2002cites this paper
• Parallel 2D Delaunay triangulations in HPP and MPI

  2001cites this paper
• A distributed object model for solving irregularly structured problemson distributed systems

  2001cites this paper
• Practical Parallel Divide-and-Conquer Algorithms

  1997cites this paper
• Implementation and Evaluation of an E cient D Parallel Delaunay Triangulation Algorithm

  1997cites this paper