Skip to main content
SpringerLink
Log in

Optimistic parallel Delaunay triangulation

  • Original article
  • Published:
The Visual Computer Aims and scope Submit manuscript

The paper describes a new parallel algorithm of Delaunay triangulation based on randomized incremental insertion. The algorithm is practical, simple and can be modified also for constrained triangulation or tetrahedralization. It was developed for architectures with a lower degree of parallelism, such as several-processor workstations, and tested on up to 8 processors.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Centre of Computer Graphics and Data Visualisation, Department of Computer Science and Engineering, University of West Bohemia, Univerzitní 8, 306 14 Plzeň, Czech Republic, , , , , , CZ

    Ivana Kolingerová & Josef Kohout

Authors
  1. Ivana Kolingerová
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Josef Kohout
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Published online: November 20, 2002

This work was supported by the Ministry of Education of The Czech Republic, project MSM 235 200 005

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kolingerová, I., Kohout, J. Optimistic parallel Delaunay triangulation. Visual Comp 18, 511–529 (2002). https://doi.org/10.1007/s00371-002-0173-z

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00371-002-0173-z

Search

Navigation