Closest pair of points problem

Results: 18



#Item
1Kinetic 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

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

Add to Reading List

Source URL: cs.smith.edu

Language: English - Date: 2003-11-07 21:08:52
2Dynamic Euclidean Minimum Spanning Trees and Extrema of Binary Functions David Eppstein Department of Information and Computer Science University of California, Irvine, CA 92717

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
3CMSC 754 Computational Geometry1 David M. Mount Department of Computer Science University of Maryland Spring 2012

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

Add to Reading List

Source URL: www.cs.umd.edu

Language: English - Date: 2012-05-21 17:04:35
4Data Structures for Range-Aggregate Extent Queries Prosenjit Gupta∗ Ravi Janardan†  Yokesh Kumar†

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

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-29 00:01:33
5CCCG 2011, Toronto ON, August 10–12, 2011  Space-efficient Algorithms for Empty Space Recognition among a Point Set in 2D and 3D Minati De∗†

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∗†

Add to Reading List

Source URL: 2011.cccg.ca

Language: English - Date: 2011-08-06 04:11:13
6CCCG 2011, Toronto ON, August 10–12, 2011  Space-efficient Algorithms for Empty Space Recognition among a Point Set in 2D and 3D Minati De∗†

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∗†

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2011-08-06 04:11:13
7Faster Construction of Planar Two-centers David Eppstein∗ Abstract  tical implementation. The method is complicated, and

Faster Construction of Planar Two-centers David Eppstein∗ Abstract tical implementation. The method is complicated, and

Add to Reading List

Source URL: www.ics.uci.edu

Language: English - Date: 1997-12-08 20:38:05
8CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008  Data Structures for Range-Aggregate Extent Queries Prosenjit Gupta∗  Ravi Janardan†

CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 Data Structures for Range-Aggregate Extent Queries Prosenjit Gupta∗ Ravi Janardan†

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-29 00:05:03
9Gestures as Point Clouds: A $P Recognizer for User Interface Prototypes Radu-Daniel Vatavu Lisa Anthony

Gestures as Point Clouds: A $P Recognizer for User Interface Prototypes Radu-Daniel Vatavu Lisa Anthony

Add to Reading List

Source URL: faculty.washington.edu

Language: English - Date: 2012-10-24 13:22:37
10A Fair Assignment Algorithm for Multiple Preference Queries Leong Hou U Nikos Mamoulis

A Fair Assignment Algorithm for Multiple Preference Queries Leong Hou U Nikos Mamoulis

Add to Reading List

Source URL: www.vldb.org

Language: English - Date: 2009-07-27 10:29:02