<--- Back to Details
First PageDocument Content
Spanning tree / NP-complete problems / Euclidean minimum spanning tree / Minimum spanning tree / Delaunay triangulation / Relative neighborhood graph / Steiner tree problem / Closest pair of points problem / Planar graph / Graph theory / Theoretical computer science / Mathematics
Date: 1999-07-26 14:14:46
Spanning tree
NP-complete problems
Euclidean minimum spanning tree
Minimum spanning tree
Delaunay triangulation
Relative neighborhood graph
Steiner tree problem
Closest pair of points problem
Planar graph
Graph theory
Theoretical computer science
Mathematics

Add to Reading List

Source URL: www.ics.uci.edu

Download Document from Source Website

File Size: 146,48 KB

Share Document on Facebook

Similar Documents

Computer science / Geometry / Computing / Computational geometry / Triangulation / Delaunay triangulation / Kinetic data structure / John Hershberger / Convex hull / Voronoi diagram / Leonidas J. Guibas / Closest pair of points problem

Kinetic Data Structures: Animating Proofs Through Time Julien Basch∗ Jo˜ao Comba† Leonidas J. Guibas‡ John Hershberger§ Craig D. Silverstein¶ Li Zhangk When motion begins, each certificate remains valid until th

DocID: 1rmpv - View Document

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

Computational geometry / Discrete geometry / Convex hull / Delaunay triangulation / Point location / Voronoi diagram / Nearest neighbor search / Motion planning / Line / Proximity problems / Closest pair of points problem

CMSC 754 Computational Geometry1 David M. Mount Department of Computer Science University of Maryland Spring 2012

DocID: 1nPH1 - View Document

Closest pair of points problem / Fractional cascading / Voronoi diagram / Discrete mathematics / Group theory / Clifford algebra / Proofs of quadratic reciprocity / Mathematics / Geometry / Bin

Data Structures for Range-Aggregate Extent Queries Prosenjit Gupta∗ Ravi Janardan† Yokesh Kumar†

DocID: 18Syu - View Document

Largest empty rectangle / Algorithm / Closest pair of points problem / Reduction / Computer science / Computational geometry / Beta skeleton / Mathematics / Applied mathematics / Computational complexity theory

CCCG 2011, Toronto ON, August 10–12, 2011 Space-efficient Algorithms for Empty Space Recognition among a Point Set in 2D and 3D Minati De∗†

DocID: 18PLf - View Document