David M. Mount

SIAM J. Comput., 2024

Evolving Distributions Under Local Motion.

[BibT_eX]

[DOI]

Aditya Acharya

CoRR, 2024

Ipelets for the Convex Polygonal Geometry.

[BibT_eX]

[DOI]

CoRR, 2024

Delaunay Triangulations in the Hilbert Metric.

[BibT_eX]

[DOI]

Proceedings of the 19th Scandinavian Symposium and Workshops on Algorithm Theory, 2024

Convex Approximation and the Hilbert Geometry.

[BibT_eX]

[DOI]

Proceedings of the 2024 Symposium on Simplicity in Algorithms, 2024

Ipelets for the Convex Polygonal Geometry (Media Exposition).

[BibT_eX]

[DOI]

Proceedings of the 40th International Symposium on Computational Geometry, 2024

2023

Tracking Evolving labels using Cone based Oracles.

[BibT_eX]

[DOI]

Aditya Acharya

CoRR, 2023

Smooth Distance Approximation.

[BibT_eX]

[DOI]

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

Voronoi Diagrams in the Hilbert Metric.

[BibT_eX]

[DOI]

Auguste H. Gezalyan

Proceedings of the 39th International Symposium on Computational Geometry, 2023

Optimal Volume-Sensitive Bounds for Polytope Approximation.

[BibT_eX]

[DOI]

Proceedings of the 39th International Symposium on Computational Geometry, 2023

Software and Analysis for Dynamic Voronoi Diagrams in the Hilbert Metric.

[BibT_eX]

Proceedings of the 35th Canadian Conference on Computational Geometry, 2023

2022

Proximity Queries on Terrain Surface.

[BibT_eX]

[DOI]

Victor Junqiu Wei

Raymond Chi-Wing Wong

Cheng Long

Hanan Samet

ACM Trans. Database Syst., 2022

Optimal Bound on the Combinatorial Complexity of Approximating Polytopes.

[BibT_eX]

[DOI]

Rahul Arya

ACM Trans. Algorithms, 2022

Diamonds are Forever in the Blockchain: Geometric Polyhedral Point-Set Pattern Matching.

[BibT_eX]

[DOI]

CoRR, 2022

Optimally Confining Lattice Polymers.

[BibT_eX]

Proceedings of the 34th Canadian Conference on Computational Geometry, 2022

Optimally Tracking Labels on an Evolving Tree.

[BibT_eX]

Aditya Acharya

Proceedings of the 34th Canadian Conference on Computational Geometry, 2022

2021

A PTAS for the Min-Max Euclidean Multiple TSP.

[BibT_eX]

[DOI]

Mary Monroe

CoRR, 2021

Guarantees on nearest-neighbor condensation heuristics.

[BibT_eX]

[DOI]

Alejandro Flores-Velazco

Comput. Geom., 2021

Boundary-Sensitive Approach for Approximate Nearest-Neighbor Classification.

[BibT_eX]

[DOI]

Alejandro Flores-Velazco

Proceedings of the 29th Annual European Symposium on Algorithms, 2021

Approximate Nearest-Neighbor Search for Line Segments.

[BibT_eX]

[DOI]

Proceedings of the 37th International Symposium on Computational Geometry, 2021

2020

Coresets for the Nearest-Neighbor Rule.

[BibT_eX]

[DOI]

Alejandro Flores-Velazco

Proceedings of the 28th Annual European Symposium on Algorithms, 2020

2019

Bounds on the cost of compatible refinement of simplex decomposition trees in arbitrary dimensions.

[BibT_eX]

[DOI]

Comput. Geom., 2019

Modular Circulation and Applications to Traffic Management.

[BibT_eX]

[DOI]

Philip Dasler

Algorithmica, 2019

Approximate Nearest Neighbor Searching with Non-Euclidean and Weighted Distances.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Online Algorithms for Warehouse Management.

[BibT_eX]

[DOI]

Philip Dasler

Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

New Directions in Approximate Nearest-Neighbor Searching.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Discrete Applied Mathematics, 2019

2018

Approximate Polytope Membership Queries.

[BibT_eX]

[DOI]

SIAM J. Comput., 2018

Economical Delone Sets for Approximating Convex Bodies.

[BibT_eX]

[DOI]

Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory, 2018

Approximate Convex Intersection Detection with Applications to Width and Minkowski Sums.

[BibT_eX]

[DOI]

Proceedings of the 26th Annual European Symposium on Algorithms, 2018

2017

On the Combinatorial Complexity of Approximating Polytopes.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2017

Near-Optimal ε-Kernel Construction and Related Problems.

[BibT_eX]

[DOI]

CoRR, 2017

Optimal Approximate Polytope Membership.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Distance Oracle on Terrain Surface.

[BibT_eX]

[DOI]

Victor Junqiu Wei

Raymond Chi-Wing Wong

Cheng Long

Proceedings of the 2017 ACM International Conference on Management of Data, 2017

Near-Optimal epsilon-Kernel Construction and Related Problems.

[BibT_eX]

[DOI]

Proceedings of the 33rd International Symposium on Computational Geometry, 2017

2016

Space Exploration via Proximity Search.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2016

A practical approximation algorithm for the LTS estimator.

[BibT_eX]

[DOI]

Comput. Stat. Data Anal., 2016

A Fast and Simple Algorithm for Computing Approximate Euclidean Minimum Spanning Trees.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

2015

A sensor-based framework for kinetic data compression.

[BibT_eX]

[DOI]

Comput. Geom., 2015

On the Complexity of an Unregulated Traffic Crossing.

[BibT_eX]

[DOI]

Philip Dasler

Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Approximate Geometric MST Range Queries.

[BibT_eX]

[DOI]

Proceedings of the 31st International Symposium on Computational Geometry, 2015

2014

On the Least Trimmed Squares Estimator.

[BibT_eX]

[DOI]

Algorithmica, 2014

A Succinct, Dynamic Data Structure for Proximity Queries on Point Sets.

[BibT_eX]

[DOI]

Prayaag Venkat

Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

2013

Output-sensitive well-separated pair decompositions for dynamic point sets.

[BibT_eX]

[DOI]

Proceedings of the 21st SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2013

2012

Tight Lower Bounds for Halfspace Range Searching.

[BibT_eX]

[DOI]

Jian Xia

Discret. Comput. Geom., 2012

Optimal uniformly monotone partitioning of polygons with holes.

[BibT_eX]

[DOI]

Xiangzhi Wei

Ajay Joneja

Comput. Aided Des., 2012

Polytope approximation and the Mahler volume.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

A Self-adjusting Data Structure for Multidimensional Point Sets.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2012, 2012

Optimal area-sensitive bounds for polytope approximation.

[BibT_eX]

[DOI]

Proceedings of the 28th ACM Symposium on Computational Geometry, 2012

2011

New approaches to robust, point-based image registration.

[BibT_eX]

San Ratanasanya

Proceedings of the Image Registration for Remote Sensing, 2011

2010

Approximation algorithm for the kinetic robust K-center problem.

[BibT_eX]

[DOI]

Comput. Geom., 2010

Approximate range searching: The absolute model.

[BibT_eX]

[DOI]

Comput. Geom., 2010

Spatio-temporal Range Searching over Compressed Kinetic Sensor Data.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2010

A Unified Approach to Approximate Proximity Searching.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2010

A dynamic data structure for approximate range searching.

[BibT_eX]

[DOI]

Proceedings of the 26th ACM Symposium on Computational Geometry, 2010

2009

Space-time tradeoffs for approximate nearest neighbor searching.

[BibT_eX]

[DOI]

J. ACM, 2009

The Effect of Corners on the Complexity of Approximate Range Searching.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2009

Maintaining Nets and Net Trees under Incremental Motion.

[BibT_eX]

[DOI]

Minkyoung Cho

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Compressing Kinetic Data from Sensor Networks.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects of Wireless Sensor Networks, 2009

2008

Improved Approximation Bounds for Planar Point Pattern Matching.

[BibT_eX]

[DOI]

Minkyoung Cho

Algorithmica, 2008

Tradeoffs in Approximate Range Searching Made Simpler.

[BibT_eX]

[DOI]

Proceedings of the SIBGRAPI 2008, 2008

Space-Time Tradeoffs for Proximity Searching in Doubling Spaces.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2008

Embedding and similarity search for point sets under translation.

[BibT_eX]

[DOI]

Minkyoung Cho

Proceedings of the 24th ACM Symposium on Computational Geometry, 2008

2007

A simple entropy-based algorithm for planar point location.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2007

Optimal Expected-Case Planar Point Location.

[BibT_eX]

[DOI]

SIAM J. Comput., 2007

A Fast Implementation of the Isodata Clustering Algorithm.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2007

Pointerless Implementation of Hierarchical Simplicial Meshes and Efficient Neighbor Finding in Arbitrary Dimensions.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2007

A practical approximation algorithm for the LMS line estimator.

[BibT_eX]

[DOI]

Comput. Stat. Data Anal., 2007

Efficient Implementation of an Optimal Interpolator for Large Spatial Data Sets.

[BibT_eX]

[DOI]

Nargess Memarsadeghi

Proceedings of the Computational Science - ICCS 2007, 7th International Conference, Beijing, China, May 27, 2007

2006

On the Least Median Square Problem.

[BibT_eX]

[DOI]

Jeff Erickson

Sariel Har-Peled

Discret. Comput. Geom., 2006

Proximity problems on line segments spanned by points.

[BibT_eX]

[DOI]

Ovidiu Daescu

Jun Luo

Comput. Geom., 2006

On the importance of idempotence.

[BibT_eX]

[DOI]

Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

The Cost of Compatible Refinement of Simplex Decomposition Trees.

[BibT_eX]

[DOI]

Proceedings of the 15th International Meshing Roundtable, 2006

Image Fusion Using Cokriging.

[BibT_eX]

[DOI]

Nargess Memarsadeghi

Proceedings of the IEEE International Geoscience & Remote Sensing Symposium, 2006

Image Registration and Fusion Studies for the Integration of Multiple Remote Sensing Data.

[BibT_eX]

[DOI]

Arlene A. Cole-Rhodes

Proceedings of the 2006 IEEE International Conference on Acoustics Speech and Signal Processing, 2006

Invited Lecture: On Approximate Range Searching - or - Get in Shape; Round is a Good Choice.

[BibT_eX]

[DOI]

Proceedings of the 18th Annual Canadian Conference on Computational Geometry, 2006

Keep Your Friends Close and Your Enemies Closer: The Art of Proximity Searching.

[BibT_eX]

[DOI]

Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments, 2006

2005

Editorial.

[BibT_eX]

[DOI]

Comput. Geom., 2005

Space-time tradeoffs for approximate spherical range counting.

[BibT_eX]

[DOI]

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

2004

Computational Geometry.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Data Structures and Applications., 2004

Geometric Intersection.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Discrete and Computational Geometry, Second Edition., 2004

A local search approximation algorithm for k-means clustering.

[BibT_eX]

[DOI]

Comput. Geom., 2004

The ABCs of AVDs: Geometric Retrieval Made Simple.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

A computational framework for incremental motion.

[BibT_eX]

[DOI]

Proceedings of the 20th ACM Symposium on Computational Geometry, 2004

Data structures and algorithms in C++.

[BibT_eX]

Michael T. Goodrich

Roberto Tamassia

Wiley, ISBN: 978-0-471-42924-1, 2004

2003

A fast implementation of the ISOCLUS algorithm.

[BibT_eX]

[DOI]

Proceedings of the 2003 IEEE International Geoscience and Remote Sensing Symposium, 2003

Interpolation over Light Fields with Applications in Computer Graphics.

[BibT_eX]

Proceedings of the Fifth Workshop on Algorithm Engineering and Experiments, 2003

2002

An Efficient k-Means Clustering Algorithm: Analysis and Implementation.

[BibT_eX]

[DOI]

IEEE Trans. Pattern Anal. Mach. Intell., 2002

Algorithmic issues in modeling motion.

[BibT_eX]

[DOI]

ACM Comput. Surv., 2002

Ray Interpolants for Fast Ray-Tracing Reflections and Refractions.

[BibT_eX]

[DOI]

Proceedings of the 10-th International Conference in Central Europe on Computer Graphics, 2002

Space-efficient approximate Voronoi diagrams.

[BibT_eX]

[DOI]

Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

2001

Approximating large convolutions in digital images.

[BibT_eX]

[DOI]

IEEE Trans. Image Process., 2001

A Point-Placement Strategy for Conforming Delaunay Tetrahedralization.

[BibT_eX]

[DOI]

Michael Murphy

Carl W. Gable

Int. J. Comput. Geom. Appl., 2001

Approximation Algorithm for Multiple-Tool Milling.

[BibT_eX]

[DOI]

Siu-Wing Cheng

Int. J. Comput. Geom. Appl., 2001

Efficient randomized algorithms for robust estimation of circular arcs and aligned ellipses.

[BibT_eX]

[DOI]

Comput. Geom., 2001

The Analysis of a Probabilistic Approach to Nearest Neighbor Searching.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 7th International Workshop, 2001

Algorithms for facility location problems with outliers.

[BibT_eX]

[DOI]

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Entropy-preserving cuttings and space-efficient planar point location.

[BibT_eX]

[DOI]

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

On the Efficiency of Nearest Neighbor Searching with Data Clustered in Lower Dimensions.

[BibT_eX]

[DOI]

Proceedings of the Computational Science - ICCS 2001, 2001

An Empirical Study of a New Approach to Nearest Neighbor Searching.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Engineering and Experimentation, Third International Workshop, 2001

2000

Quantile Approximation for Robust Statistical Estimation and k-Enclosing Problems.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2000

Visibility Stabs and Depth-First Spiralling on Line Segments in Output Sensitive Time.

[BibT_eX]

[DOI]

J. Mark Keil

Stephen K. Wismath

Int. J. Comput. Geom. Appl., 2000

Chromatic nearest neighbor searching: A query sensitive approach.

[BibT_eX]

[DOI]

Comput. Geom., 2000

Approximate range searching.

[BibT_eX]

[DOI]

Comput. Geom., 2000

Efficient Expected-Case Algorithms for Planar Point Location.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2000

Nearly Optimal Expected-Case Planar Point Location.

[BibT_eX]

[DOI]

Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

The analysis of a simple <i>k</i>-means clustering algorithm.

[BibT_eX]

[DOI]

Proceedings of the Sixteenth Annual Symposium on Computational Geometry, 2000

1999

Efficient algorithms for robust feature matching.

[BibT_eX]

[DOI]

Pattern Recognit., 1999

Dynamic algorithms for geometric spanners of small diameter: Randomized solutions.

[BibT_eX]

[DOI]

Michiel H. M. Smid

Comput. Geom., 1999

Computing Nearest Neighbors for Moving Points and Applications to Clustering.

[BibT_eX]

[DOI]

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Analysis of approximate nearest neighbor searching with clustered point sets.

[BibT_eX]

[DOI]

Proceedings of the Data Structures, 1999

Binary Space Partitions in Plücker Space.

[BibT_eX]

[DOI]

Fan-Tao Pu

Proceedings of the Algorithm Engineering and Experimentation, 1999

1998

An Optimal Algorithm for Approximate Nearest Neighbor Searching Fixed Dimensions.

[BibT_eX]

[DOI]

J. ACM, 1998

Efficient Randomized Algorithms for the Repeated Median Line Estimator.

[BibT_eX]

[DOI]

Jirí Matousek

Algorithmica, 1998

Improved Algorithms for Robust Point Pattern Matching and Applications to Image Registration.

[BibT_eX]

[DOI]

Proceedings of the Fourteenth Annual Symposium on Computational Geometry, 1998

Approximation Algorithms for Multiple-Tool Miling.

[BibT_eX]

[DOI]

Siu-Wing Cheng

Proceedings of the Fourteenth Annual Symposium on Computational Geometry, 1998

Quantile approximation for robust statistical estimation.

[BibT_eX]

[DOI]

Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

1997

Parallelizing and Algorithm for Visibility on Polyhedral Terrain.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 1997

Query-Sensitive Ray Shooting.

[BibT_eX]

[DOI]

Subhash Suri

Int. J. Comput. Geom. Appl., 1997

Testing Simple Polygons.

[BibT_eX]

[DOI]

Esther M. Arkin

Patrice Belleville

Comput. Geom., 1997

1996

Accounting for Boundary Effects in Nearest-Neighbor Searching.

[BibT_eX]

[DOI]

Onuttom Narayan

Discret. Comput. Geom., 1996

On the Area of Overlap of Translated Polygons.

[BibT_eX]

[DOI]

Ruth Silverman

Angela Y. Wu

Comput. Vis. Image Underst., 1996

1995

Euclidean spanners: short, thin, and lanky.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

1994

Computationally Efficient Algorithms for High-Dimensional Robust Estimators.

[BibT_eX]

[DOI]

CVGIP Graph. Model. Image Process., 1994

An Optimal Algorithm for Approximate Nearest Neighbor Searching.

[BibT_eX]

[DOI]

Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

Randomized and deterministic algorithms for geometric spanners of small diameter

[BibT_eX]

[DOI]

Michiel H. M. Smid

Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994

1993

Probabilistic analysis of some navigation strategies in a dynamic environment.

[BibT_eX]

[DOI]

Rajeev Sharma

Yiannis Aloimonos

IEEE Trans. Syst. Man Cybern., 1993

Point Probe Decision Trees for Geometric Concept Classes.

[BibT_eX]

[DOI]

Esther M. Arkin

Michael T. Goodrich

Christine D. Piatko

Steven Skiena

Proceedings of the Algorithms and Data Structures, Third Workshop, 1993

Approximate Nearest Neighbor Queries in Fixed Dimensions.

[BibT_eX]

[DOI]

Proceedings of the Fourth Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1993

Algorithms for Fast Vector Quantizaton.

[BibT_eX]

[DOI]

Proceedings of the IEEE Data Compression Conference, 1993

Efficient Algorithms for Robust Circular Arc Estimators.

[BibT_eX]

Proceedings of the 5th Canadian Conference on Computational Geometry, 1993

On the Maximum Number of Intersections of Two Polyhedra in 2 and 3 Dimensions.

[BibT_eX]

Michael B. Dillencourt

Alan Saalfeld

Proceedings of the 5th Canadian Conference on Computational Geometry, 1993

1992

A randomized algorithm for slope selection.

[BibT_eX]

[DOI]

Michael B. Dillencourt

Int. J. Comput. Geom. Appl., 1992

A parallel algorithm for enclosed and enclosing triangles.

[BibT_eX]

[DOI]

Sharat Chandran

Int. J. Comput. Geom. Appl., 1992

Parallel Computational Geometry of Rectangles.

[BibT_eX]

[DOI]

Sharat Chandran

Sung Kwon Kim

Algorithmica, 1992

Intersection Detection and Separators for Simple Polygons.

[BibT_eX]

[DOI]

Proceedings of the Eighth Annual Symposium on Computational Geometry, 1992

1991

An Output-Sensitive Algorithm for Computing Visibility Graphs.

[BibT_eX]

[DOI]

Subir Kumar Ghosh

SIAM J. Comput., 1991

Pyramid computation of neighbor distance statistics in dot patterns.

[BibT_eX]

[DOI]

Saibal Banerjee

Azriel Rosenfeld

CVGIP Graph. Model. Image Process., 1991

1990

The Number of Shortest Paths on the Surface of a Polyhedron.

[BibT_eX]

[DOI]

SIAM J. Comput., 1990

Packing and Covering the Plane with Translates of a Convex Polygon.

[BibT_eX]

[DOI]

Ruth Silverman

J. Algorithms, 1990

The Densest Double-Lattice Packing of a Convex Polygon.

[BibT_eX]

[DOI]

Proceedings of the Discrete and Computational Geometry: Papers from the DIMACS Special Year, 1990

1988

The Decomposition of a Rectangle into Rectangles of Minimal Perimeter.

[BibT_eX]

[DOI]

T. Yung Kong

A. W. Roscoe

SIAM J. Comput., 1988

Globally-Equiangular Triangulations of Co-Circular Points in 0(n log n) Time.

[BibT_eX]

[DOI]

Alan Saalfeld

Proceedings of the Fourth Annual Symposium on Computational Geometry, 1988

1987

The Discrete Geodesic Problem.

[BibT_eX]

[DOI]

Christos H. Papadimitriou

SIAM J. Comput., 1987

Storing the Subdivision of a Polyhedral Surface.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1987

The decomposition of a square into rectangles of minimal perimeter.

[BibT_eX]

[DOI]

T. Yung Kong

Michael Werman

Discret. Appl. Math., 1987

Algorithms for covering and packing and applications to CAD/CAM (abstract only): preliminary results.

[BibT_eX]

[DOI]

Ruth Silverman

Proceedings of the 15th ACM Annual Conference on Computer Science, 1987

1983

Graph spectra and isomorphism testing

[BibT_eX]

[DOI]

PhD thesis, 1983

1982

Isomorphism of Graphs with Bounded Eigenvalue Multiplicity

[BibT_eX]

[DOI]

László Babai

D. Yu. Grigoryev