<--- Back to Details
First PageDocument Content
Delaunay triangulation / Euclidean minimum spanning tree / Gabriel graph / Graph / Planar graph / Relative neighborhood graph / Nearest neighbor graph / Neighbourhood / Graph theory / Triangulation / Euclidean plane geometry
Date: 2001-02-22 04:48:28
Delaunay triangulation
Euclidean minimum spanning tree
Gabriel graph
Graph
Planar graph
Relative neighborhood graph
Nearest neighbor graph
Neighbourhood
Graph theory
Triangulation
Euclidean plane geometry

Add to Reading List

Source URL: www.cs.uu.nl

Download Document from Source Website

File Size: 168,07 KB

Share Document on Facebook

Similar Documents

Mathematics / Geometry / Computer science / Search algorithms / Discrete geometry / Computational geometry / Mathematical optimization / Closest pair of points problem / Nearest neighbor search / Nearest neighbor graph / K-nearest neighbors algorithm / Euclidean minimum spanning tree

Dynamic Euclidean Minimum Spanning Trees and Extrema of Binary Functions David Eppstein Department of Information and Computer Science University of California, Irvine, CA 92717

DocID: 1qXBI - View Document

Mathematics / Delaunay triangulation / Voronoi diagram / Relative neighborhood graph / Euclidean minimum spanning tree / Gabriel graph / Convex hull / Duality / Quadrilateral / Geometry / Triangulation / Computational geometry

Kinetic Stable Delaunay Graphs Pankaj K. Agarwal Duke University Haim Kaplan

DocID: 1gmD0 - View Document

Operations research / Spanning tree / Complexity classes / NP-complete problems / Minimum spanning tree / Steiner tree problem / R-tree / Approximation algorithm / Facility location / Theoretical computer science / Computational complexity theory / Applied mathematics

CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Approximating k-hop Minimum Spanning Trees in Euclidean Metrics∗ S¨oren Laue† Abstract

DocID: 18Ex7 - View Document

NP-complete problems / Hamiltonian path / Vertex cover / Independent set / Matching / Minimum spanning tree / Dominating set / Graph coloring / Theoretical computer science / Graph theory / Mathematics

CCCG 2011, Toronto ON, August 10–12, 2011 Euclidean Movement Minimization Nima Anari∗ MohammadAmin Fazli†

DocID: 18dW2 - View Document

Network theory / Shortest path problem / NP-complete problems / Connectivity / Euclidean plane geometry / Analysis of algorithms / Path decomposition / Minimum spanning tree / Theoretical computer science / Computational complexity theory / Mathematics

The min-# problem, a hybrid error criterion for near-linear time performance Lilian Buzer∗† Abstract 2.1

DocID: 18dku - View Document