On Shape Delaunay Tessellations∗ Franz Aurenhammer† G¨ unter Paulini†

Source URL: www.igi.tugraz.at

A Fast Algorithm for Well-Spaced Points and Approximate Delaunay Graphs Gary L. Miller∗ Donald R. Sheehy†

Source URL: donsheehy.net

Complexity of Delaunay Triangulation for Points on Lower-dimensional Polyhedra. Nina Amenta UC Davis ∗

Source URL: www.gipsa-lab.grenoble-inp.fr

Streaming Computation of Delaunay Triangulations Martin Isenburg University of California at Berkeley Yuanxin Liu

Source URL: cs.unc.edu

Algorithmica manuscript No. (will be inserted by the editor) Preprocessing Imprecise Points for Delaunay Triangulation: Simplified and Extended Kevin Buchin · Maarten L¨offler · Pat Morin ·

Source URL: page.mi.fu-berlin.de

Some properties of k-Delaunay and k-Gabriel graphs Prosenjit Bosea , S´ebastien Colletteb,1,2 , Ferran Hurtadoc,4,5 , Matias Kormanc,5,6 , Stefan Langermanb,1,3 , Vera Sacrist´anc,4,5 , Maria Saumelld,4,7,∗ a School

Source URL: llati.upc.es

Delaunay Triangulations in O(sort(n)) Time and More KEVIN BUCHIN TU Eindhoven and WOLFGANG MULZER Freie Universit¨at Berlin

Source URL: page.mi.fu-berlin.de

Local Properties of Geometric Graphs Jean Cardinal∗ S´ebastien Collette† Stefan Langerman‡ § relation between any pair of sites and the number of items in its neighborhood.

Source URL: www.ulb.ac.be

• Graph theory
• Bipartite graphs
• Geometric spanner
• Shortest path problem
• Planar graph
• Tree
• Delaunay triangulation
• NP-complete problems
• Planar separator theorem
• Trapezoid graph

Constructing Iso-Surfaces Satisfying the Delaunay Constraint. Application to the Skeleton Computation. Dominique Attali Laboratoire des Images et des Signaux, ENSIEG, Domaine Universitaire, BPSaint-Martin d’H

Source URL: www.gipsa-lab.grenoble-inp.fr

A linear bound on the Complexity of the Delaunay Triangulation of Points on Polyhedral Surfaces Dominique Attali

Source URL: www.gipsa-lab.grenoble-inp.fr