Euclidean minimum spanning tree

Results: 19



#Item
1Mathematics / 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

Add to Reading List

Source URL: bioinfo.ict.ac.cn

Language: English - Date: 2014-11-28 11:05:21
2Mathematics / 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

Add to Reading List

Source URL: www.cs.duke.edu

Language: English - Date: 2011-05-25 21:15:25
3Operations 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

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-28 21:25:19
4NP-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†

Add to Reading List

Source URL: 2011.cccg.ca

Language: English - Date: 2011-08-06 04:11:16
5Network 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

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2005-07-31 13:55:46
6NP-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†

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2011-08-06 04:11:16
7Operations research / Spanning tree / Complexity classes / NP-complete problems / Minimum spanning tree / Steiner tree problem / R-tree / Approximation algorithm / Polynomial-time approximation scheme / 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

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-28 21:24:48
8Delaunay triangulation / Point location / Sweep line algorithm / Circumscribed circle / Pitteway triangulation / Euclidean minimum spanning tree / Triangulation / Geometry / Mathematics

CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Towards a Definition of Higher Order Constrained Delaunay Triangulations Rodrigo I. Silveira† ∗

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-28 21:26:59
9Maxima and minima / Mathematics / Mathematical analysis / Analysis / Euclidean minimum spanning tree / Spanning tree / Mathematical optimization

Microsoft Word - Document1

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2010-07-19 11:01:13
10Cell biology / Incubator / Laboratory equipment / Minimum spanning tree / Rope / Bridge / Graph / Connectivity / Combinatorics / Binary trees / Theoretical computer science / Mathematics

New Doubling Spanners: Better and Simpler T-H. Hubert Chan? , Mingfei Li? , Li Ning? , and Shay Solomon?? Abstract. In a seminal STOC’95 paper, Arya et al. conjectured that spanners for low-dimensional Euclidean spaces

Add to Reading List

Source URL: i.cs.hku.hk

Language: English - Date: 2013-07-31 15:58:56
UPDATE