Michiel H. M. Smid

Luís Fernando Schultz Xavier da Silveira

Algorithmica, June, 2023

An instance-based algorithm for deciding the bias of a coin.

[BibT_eX]

[DOI]

Luís Fernando Schultz Xavier da Silveira

Discret. Math. Algorithms Appl., April, 2023

The Minimum Moving Spanning Tree Problem.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2023

On Separating Path and Tree Systems in Graphs.

[BibT_eX]

[DOI]

CoRR, 2023

2022

Closest-pair queries and minimum-weight queries are equivalent for squares.

[BibT_eX]

[DOI]

Abrar Kazi

Comput. Geom., 2022

Computing maximum independent set on outerstring graphs and their relatives.

[BibT_eX]

[DOI]

Comput. Geom., 2022

Approximating Bottleneck Spanning Trees on Partitioned Tuples of Points.

[BibT_eX]

[DOI]

Comput. Geom. Topol., 2022

2021

Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2021

Window queries for intersecting objects, maximal points and approximations using coresets.

[BibT_eX]

[DOI]

Farah Chanchary

Discret. Appl. Math., 2021

An improved construction for spanners of disks.

[BibT_eX]

[DOI]

Comput. Geom., 2021

Tight Bounds on the Clique Chromatic Number.

[BibT_eX]

[DOI]

Electron. J. Comb., 2021

On the Minimum Consistent Subset Problem.

[BibT_eX]

[DOI]

Algorithmica, 2021

Euclidean Maximum Matchings in the Plane - Local to Global.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 17th International Symposium, 2021

Exact and Approximation Algorithms for Many-To-Many Point Matching in the Plane.

[BibT_eX]

[DOI]

Sayan Bandyapadhyay

Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021

2020

A simple randomized $O(n \log n)$-time closest-pair algorithm in doubling metrics.

[BibT_eX]

[DOI]

Wolfgang Mulzer

J. Comput. Geom., 2020

Faster algorithms for some optimization problems on collinear points.

[BibT_eX]

[DOI]

J. Comput. Geom., 2020

Bottleneck matchings and Hamiltonian cycles in higher-order Gabriel graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2020

Plane and planarity thresholds for random geometric graphs.

[BibT_eX]

[DOI]

Discret. Math. Algorithms Appl., 2020

Querying relational event graphs using colored range searching data structures.

[BibT_eX]

[DOI]

Farah Chanchary

Discret. Appl. Math., 2020

Special issue on the 29th Canadian Conference on Computational Geometry, Guest Editors' foreword.

[BibT_eX]

[DOI]

Comput. Geom., 2020

Minimizing the continuous diameter when augmenting a geometric tree with a shortcut.

[BibT_eX]

[DOI]

Comput. Geom., 2020

Optimal Art Gallery Localization is NP-hard.

[BibT_eX]

[DOI]

Comput. Geom., 2020

Covering Points with Pairs of Concentric Disks.

[BibT_eX]

Proceedings of the 32nd Canadian Conference on Computational Geometry, 2020

2019

The discrete Voronoi game in a simple polygon.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2019

The Most Likely Object to be Seen Through a Window.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2019

Partial Enclosure Range Searching.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2019

Flip distance to some plane configurations.

[BibT_eX]

[DOI]

Comput. Geom., 2019

Closest-pair queries in fat rectangles.

[BibT_eX]

[DOI]

Sang Won Bae

Comput. Geom., 2019

Maximum Plane Trees in Multipartite Geometric Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2019

Orthogonal Range Reporting and Rectangle Stabbing for Fat Rectangles.

[BibT_eX]

[DOI]

Timothy M. Chan

Yakov Nekrich

Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

On the Spanning and Routing Ratio of Theta-Four.

[BibT_eX]

[DOI]

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

2018

Plane Bichromatic Trees of Low Degree.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2018

Strong matching of points with geometric shapes.

[BibT_eX]

[DOI]

Comput. Geom., 2018

Geometric Path Problems with Violations.

[BibT_eX]

[DOI]

Algorithmica, 2018

Improved Spanning Ratio for Low Degree Plane Spanners.

[BibT_eX]

[DOI]

Darryl Hill

Algorithmica, 2018

Spanning Trees in Multipartite Geometric Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2018

Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams.

[BibT_eX]

[DOI]

Algorithmica, 2018

Compatible 4-Holes in Point Sets.

[BibT_eX]

[DOI]

Proceedings of the 30th Canadian Conference on Computational Geometry, 2018

Window Queries for Problems on Intersecting Objects and Maximal Points.

[BibT_eX]

[DOI]

Farah Chanchary

Proceedings of the Algorithms and Discrete Applied Mathematics, 2018

The Well-Separated Pair Decomposition and Its Applications.

[BibT_eX]

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

2017

Towards plane spanners of degree 3.

[BibT_eX]

[DOI]

J. Comput. Geom., 2017

Essential Constraints of Edge-Constrained Proximity Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2017

Faster Algorithms for the Minimum Red-Blue-Purple Spanning Graph Problem.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2017

Art Gallery Localization.

[BibT_eX]

[DOI]

CoRR, 2017

An optimal algorithm for plane matchings in multipartite geometric graphs.

[BibT_eX]

[DOI]

Comput. Geom., 2017

Approximation algorithms for the unit disk cover problem in 2D and 3D.

[BibT_eX]

[DOI]

Comput. Geom., 2017

Minimizing the Continuous Diameter When Augmenting a Tree with a Shortcut.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

2016

Planar Geometric Spanners.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Geometric Spanners.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Applications of Geometric Spanner Networks.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

On the stretch factor of convex polyhedra whose vertices are (almost) on a sphere.

[BibT_eX]

[DOI]

J. Comput. Geom., 2016

A plane 1.88-spanner for points in convex position.

[BibT_eX]

[DOI]

J. Comput. Geom., 2016

Guest Editors' Foreword.

[BibT_eX]

[DOI]

Christian Knauer

Int. J. Comput. Geom. Appl., 2016

Probing convex polygons with a wedge.

[BibT_eX]

[DOI]

Comput. Geom., 2016

Plane geodesic spanning trees, Hamiltonian cycles, and perfect matchings in a simple polygon.

[BibT_eX]

[DOI]

Comput. Geom., 2016

Discrete Voronoi games and ϵ-nets, in two and three dimensions.

[BibT_eX]

[DOI]

Comput. Geom., 2016

Minimizing the Continuous Diameter when Augmenting Paths and Cycles with Shortcuts.

[BibT_eX]

[DOI]

Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory, 2016

A Faster Algorithm for the Minimum Red-Blue-Purple Spanning Graph Problem for Points on a Circle.

[BibT_eX]

Proceedings of the 28th Canadian Conference on Computational Geometry, 2016

2015

Matchings in higher-order Gabriel graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Optimal Data Structures for Farthest-Point Queries in Cactus Networks.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2015

On the hardness of full Steiner tree problems.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2015

Packing Plane Perfect Matchings into a Point Set.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2015

Average Stretch Factor: How Low Does It Go?

[BibT_eX]

[DOI]

Vida Dujmovic

Pat Morin

Discret. Comput. Geom., 2015

Fast algorithms for approximate Fréchet matching queries in geometric trees.

[BibT_eX]

[DOI]

Comput. Geom., 2015

Higher-order triangular-distance Delaunay graphs: Graph-theoretical properties.

[BibT_eX]

[DOI]

Comput. Geom., 2015

On full Steiner trees in unit disk graphs.

[BibT_eX]

[DOI]

Comput. Geom., 2015

Approximating the bottleneck plane perfect matching of a point set.

[BibT_eX]

[DOI]

Comput. Geom., 2015

Fast Algorithms for Diameter-Optimally Augmenting Paths.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

A Faster 4-Approximation Algorithm for the Unit Disk Cover Problem.

[BibT_eX]

[DOI]

Proceedings of the 27th Canadian Conference on Computational Geometry, 2015

2014

Fixed-orientation equilateral triangle matching of point sets.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Matching in Gabriel Graphs.

[BibT_eX]

[DOI]

CoRR, 2014

Data structures for range-aggregate extent queries.

[BibT_eX]

[DOI]

Comput. Geom., 2014

A note on the unsolvability of the weighted region shortest path problem.

[BibT_eX]

[DOI]

Comput. Geom., 2014

An optimal algorithm for the Euclidean bottleneck full Steiner tree problem.

[BibT_eX]

[DOI]

Comput. Geom., 2014

The Convex Hull of Points on a Sphere is a Spanner.

[BibT_eX]

[DOI]

Simon Pratt

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

Bottleneck Bichromatic Plane Matching of Points.

[BibT_eX]

[DOI]

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

Approximating Full Steiner Tree in a Unit Disk Graph.

[BibT_eX]

[DOI]

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

Voronoi Games and Epsilon Nets.

[BibT_eX]

[DOI]

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

A Facility Coloring Problem in 1-D.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2014

2013

Robust Geometric Spanners.

[BibT_eX]

[DOI]

SIAM J. Comput., 2013

Network Farthest-Point Diagrams.

[BibT_eX]

[DOI]

J. Comput. Geom., 2013

Approximating the Bottleneck Plane Perfect Matching of a Point Set.

[BibT_eX]

[DOI]

CoRR, 2013

An in-place min-max priority search tree.

[BibT_eX]

[DOI]

Comput. Geom., 2013

On plane geometric spanners: A survey and open problems.

[BibT_eX]

[DOI]

Comput. Geom., 2013

On the power of the semi-separated pair decomposition.

[BibT_eX]

[DOI]

Comput. Geom., 2013

Fréchet Queries in Geometric Trees.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2013, 2013

Computing Covers of Plane Forests.

[BibT_eX]

[DOI]

Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

Range-Aggregate Queries for Geometric Extent Problems.

[BibT_eX]

[DOI]

Proceedings of the Nineteenth Computing: The Australasian Theory Symposium, 2013

2012

Approximating the average stretch factor of geometric graphs.

[BibT_eX]

[DOI]

J. Comput. Geom., 2012

An optimal algorithm for computing angle-constrained spanners.

[BibT_eX]

[DOI]

Paz Carmi

J. Comput. Geom., 2012

π/2-Angle Yao Graphs are Spanners.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2012

Two-Dimensional Range Diameter Queries.

[BibT_eX]

[DOI]

Pooya Davoodi

Freek van Walderveen

Proceedings of the LATIN 2012: Theoretical Informatics, 2012

On Farthest-Point Information in Networks.

[BibT_eX]

[DOI]

Proceedings of the 24th Canadian Conference on Computational Geometry, 2012

xy-Monotone Path Existence Queries in a Rectilinear Environment.

[BibT_eX]

[DOI]

Gregory Bint

Proceedings of the 24th Canadian Conference on Computational Geometry, 2012

Computing the Coverage of an Opaque Forest.

[BibT_eX]

[DOI]

Alexis Beingessner

Proceedings of the 24th Canadian Conference on Computational Geometry, 2012

2011

Low-interference networks in metric spaces of bounded doubling dimension.

[BibT_eX]

[DOI]

Norbert Zeh

Inf. Process. Lett., 2011

On a family of strong geometric spanners that admit local routing strategies.

[BibT_eX]

[DOI]

Comput. Geom., 2011

Algorithms for Marketing-Mix Optimization.

[BibT_eX]

[DOI]

Pat Morin

Algorithmica, 2011

Geometric Spanners for Weighted Point Sets.

[BibT_eX]

[DOI]

Algorithmica, 2011

Approximation Algorithms for a Triangle Enclosure Problem.

[BibT_eX]

[DOI]

Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

An In-Place Priority Search Tree.

[BibT_eX]

[DOI]

Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2010

On the Stretch Factor of Convex Delaunay Graphs.

[BibT_eX]

[DOI]

J. Comput. Geom., 2010

Sigma-local graphs.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2010

Dilation-Optimal Edge Deletion in Polygonal Cycles.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2010

Pi/2-Angle Yao Graphs are Spanners

[BibT_eX]

[DOI]

CoRR, 2010

Computing the Greedy Spanner in Near-Quadratic Time.

[BibT_eX]

[DOI]

Algorithmica, 2010

Improved Methods For Generating Quasi-gray Codes.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2010

Communication-Efficient Construction of the Plane Localized Delaunay Graph.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2010: Theoretical Informatics, 2010

<i>pi</i>/2-Angle Yao Graphs Are Spanners.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

Approximating range-aggregate queries using coresets.

[BibT_eX]

[DOI]

Yakov Nekrich

Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

2009

Spanners of Complete k-Partite Geometric Graphs.

[BibT_eX]

[DOI]

SIAM J. Comput., 2009

Algorithms for optimal outlier removal.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2009

An Omega(nlogn) lower bound for computing the sum of even-ranked elements.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2009

On Spanners of Geometric Graphs.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2009

Efficient Non-Intersection Queries on Aggregated Geometric Data.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2009

Delaunay and diamond Triangulations contain Spanners of Bounded Degree.

[BibT_eX]

[DOI]

Daming Xu

Int. J. Comput. Geom. Appl., 2009

An Omega(n log n) lower bound for computing the sum of even-ranked elements

[BibT_eX]

[DOI]

Marc Mörig

Jan Tusch

CoRR, 2009

On the dilation spectrum of paths, cycles, and trees.

[BibT_eX]

[DOI]

Comput. Geom., 2009

Rotationally monotone polygons.

[BibT_eX]

[DOI]

Comput. Geom., 2009

Geometric spanners with small chromatic number.

[BibT_eX]

[DOI]

Comput. Geom., 2009

A linear-space algorithm for distance preserving graph embedding.

[BibT_eX]

[DOI]

Comput. Geom., 2009

Clamshell Casting.

[BibT_eX]

[DOI]

Algorithmica, 2009

09451 Abstracts Collection - Geometric Networks, Metric Space Embeddings and Spatial Data Mining.

[BibT_eX]

[DOI]

Proceedings of the Geometric Networks, Metric Space Embeddings and Spatial Data Mining, 01.11., 2009

The Weak Gap Property in Metric Spaces of Bounded Doubling Dimension.

[BibT_eX]

[DOI]

Proceedings of the Efficient Algorithms, 2009

2008

Planar Geometric Spanners.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Geometric Spanners.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Applications of Geometric Spanner Networks.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Approximate distance oracles for geometric spanners.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2008

On the false-positive rate of Bloom filters.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2008

I/O-efficient algorithms for computing planar geometric spanners.

[BibT_eX]

[DOI]

Norbert Zeh

Comput. Geom., 2008

Sparse geometric graphs with small dilation.

[BibT_eX]

[DOI]

Comput. Geom., 2008

2007

The Well-Separated Pair Decomposition and Its Applications.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Distance-preserving approximations of polygonal paths.

[BibT_eX]

[DOI]

Comput. Geom., 2007

Space-efficient geometric divide-and-conquer algorithms.

[BibT_eX]

[DOI]

Comput. Geom., 2007

On Generalized Diamond Spanners.

[BibT_eX]

[DOI]

Aaron Lee

Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

Linear-Space Algorithms for Distance Preserving Embedding.

[BibT_eX]

[DOI]

Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

Geometric spanner networks.

[BibT_eX]

Cambridge University Press, 2007

2006

Heuristics for estimating contact area of supports in layered manufacturing.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2006

A Dynamic Dictionary for Priced Information with Application.

[BibT_eX]

[DOI]

Algorithmica, 2006

Indicator Random Variables in Traffic Analysis and the Birthday Problem.

[BibT_eX]

[DOI]

Proceedings of the LCN 2006, 2006

Diamond Triangulations Contain Spanners of Bounded Degree.

[BibT_eX]

[DOI]

Daming Xu

Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

06481 Abstracts Collection - Geometric Networks and Metric Space Embeddings.

[BibT_eX]

[DOI]

Proceedings of the Geometric Networks and Metric Space Embeddings, 26.11. - 01.12.2006, 2006

Geometric spanners with few edges and degree five.

[BibT_eX]

[DOI]

Proceedings of the Theory of Computing 2006, 2006

2005

Range Mode and Range Median Queries on Lists and Trees.

[BibT_eX]

Danny Krizanc

Pat Morin

Nord. J. Comput., 2005

Geometric Algorithms for Density-based Data Clustering.

[BibT_eX]

[DOI]

Danny Z. Chen

Bin Xu

Int. J. Comput. Geom. Appl., 2005

Constructing Plane Spanners of Bounded Degree and Low Weight.

[BibT_eX]

[DOI]

Algorithmica, 2005

Fast Pruning of Geometric Spanners.

[BibT_eX]

[DOI]

Proceedings of the STACS 2005, 2005

Exact and Approximation Algorithms for Computing the Dilation Spectrum of Paths, Trees, and Cycles.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

2004

Computational Geometry.

[BibT_eX]

[DOI]

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

Light edges in degree-constrained graphs.

[BibT_eX]

[DOI]

David R. Wood

Discret. Math., 2004

Computing large planar regions in terrains, with an application to fracture surfaces.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

Approximating geometric bottleneck shortest paths.

[BibT_eX]

[DOI]

Comput. Geom., 2004

Approximating contact-area of supports in layered manufacturing.

[BibT_eX]

[DOI]

Proceedings of the 16th Canadian Conference on Computational Geometry, 2004

2003

Protecting critical facets in layered manufacturing: implementation and experimental results.

[BibT_eX]

[DOI]

Comput. Aided Des., 2003

Minimizing the total projection of a set of vectors, with applications to layered manufacturing.

[BibT_eX]

[DOI]

Comput. Aided Des., 2003

Geometric Algorithms for Layered Manufacturing.

[BibT_eX]

[DOI]

Proceedings of the Geometric and Algorithmic Aspects of Computer-Aided Design and Manufacturing, 2003

2002

Approximation Algorithms for the Bottleneck Stretch Factor Problem.

[BibT_eX]

Nord. J. Comput., 2002

Computing the Smallest T-Shaped Polygon Containing k Points.

[BibT_eX]

[DOI]

Vanam Srilakshmi

Int. J. Comput. Math., 2002

Computing an Optimal Hatching Direction in Layered Manufacturing.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 2002

A decomposition-based approach to layered manufacturing.

[BibT_eX]

[DOI]

Comput. Geom., 2002

Improved Algorithms for Constructing Fault-Tolerant Spanners.

[BibT_eX]

[DOI]

Christos Levcopoulos

Algorithmica, 2002

Approximate distance oracles for geometric graphs.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Approximate Distance Oracles Revisited.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

Translating a Planar Object to Maximize Point Containment.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2002

Terrain Polygon Decomposition, with Application to Layered Manufacturing.

[BibT_eX]

[DOI]

Ivaylo Ilinkin

Proceedings of the Computing and Combinatorics, 8th Annual International Conference, 2002

2001

Computing large planar regions in terrains.

[BibT_eX]

[DOI]

Proceedings of the 8th International Workshop on Combinatorial Image Analysis, 2001

Lower bounds for computing geometric spanners and approximate shortest paths.

[BibT_eX]

[DOI]

Danny Z. Chen

Gautam Das

Discret. Appl. Math., 2001

I/O-Efficient Shortest Path Queries in Geometric Spanners.

[BibT_eX]

[DOI]

Norbert Zeh

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

Computing Optimal Hatching Directions in Layered Manufacturing.

[BibT_eX]

[DOI]

Proceedings of the Computational Science - ICCS 2001, 2001

2000

Approximating the Stretch Factor of Euclidean Graphs.

[BibT_eX]

[DOI]

SIAM J. Comput., 2000

A lower bound for approximating the geometric minimum weight matching.

[BibT_eX]

[DOI]

Gautam Das

Inf. Process. Lett., 2000

Protecting critical facets in layered manufacturing.

[BibT_eX]

[DOI]

Comput. Geom., 2000

Closest-Point Problems in Computational Geometry.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Computational Geometry, 2000

1999

Computing the Width of a Three-Dimensional Point Set: An Experimental Study.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 1999

Efficient Algorithms for Counting and Reporting Pairwise Intersections Between Convex Polygons.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1999

On the width and roundness of a set of points in the plane.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 1999

Minimizing support structures and trapped area in two-dimensional layered manufacturing.

[BibT_eX]

[DOI]

Comput. Geom., 1999

On some geometric optimization problems in layered manufacturing.

[BibT_eX]

[DOI]

Comput. Geom., 1999

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

[BibT_eX]

[DOI]

Sunil Arya

David M. Mount

Comput. Geom., 1999

Protecting Facets in Layered Manufacturing.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1999

1998

Randomized Data Structures for the Dynamic Closest-Pair Problem.

[BibT_eX]

[DOI]

SIAM J. Comput., 1998

Efficient Algorithms for Constructing Fault-Tolerant Geometric Spanners.

[BibT_eX]

[DOI]

Christos Levcopoulos

Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998

Multi-Criteria Geometric Optimization Problems in Layered Manufacturing.

[BibT_eX]

[DOI]

Proceedings of the Fourteenth Annual Symposium on Computational Geometry, 1998

1997

More Efficient Parallel Totally Monotone Matrix Searching.

[BibT_eX]

[DOI]

Phillip G. Bradford

Rudolf Fleischer

J. Algorithms, 1997

A Technique for Adding Range Restrictions to Generalized Searching Problems.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1997

The Rectangle Enclosure and Point-Dominance Problems Revisited.

[BibT_eX]

[DOI]

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

Computing a Largest Empty Anchored Cylinder, and Related Problems.

[BibT_eX]

[DOI]

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

On the Complexity of Approximating Euclidean Traveling Salesman Tours and Minimum Spanning Trees.

[BibT_eX]

[DOI]

Gautam Das

Sanjiv Kapoor

Algorithmica, 1997

Efficient Construction of a Bounded-Degree Spanner with Low Weight.

[BibT_eX]

[DOI]

Sunil Arya

Algorithmica, 1997

Computing the Minimum Diameter for Moving Points: An Exact Implementation Using Parametric Search.

[BibT_eX]

[DOI]

Jörg Schwerdt

Stefan Schirra

Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

1996

New Techniques for Exact and Approximate Dynamic Closest-Point Problems.

[BibT_eX]

[DOI]

Sanjiv Kapoor

SIAM J. Comput., 1996

Fast Algorithms for Collision and Proximity Problems Involving Moving Geometric Objects.

[BibT_eX]

[DOI]

Comput. Geom., 1996

Algorithms for Generalized Halfspace Range Searching and Other Intersection Searching Problems.

[BibT_eX]

[DOI]

Comput. Geom., 1996

Planar Spanners and Approximate Shortest Path Queries among Obstacles in the Plane.

[BibT_eX]

[DOI]

Srinivasa Rao Arikati

Christos D. Zaroliagis

Proceedings of the Algorithms, 1996

1995

Dynamic Rectangular Point Location, with an Application to the Closest Pair Problem

[BibT_eX]

[DOI]

Inf. Comput., January, 1995

Simple Randomized Algorithms for Closest Pair Problems.

[BibT_eX]

Nord. J. Comput., 1995

Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization.

[BibT_eX]

[DOI]

J. Algorithms, 1995

Static and Dynamic Algorithms for <i>k</i>-Point Clustering Problems.

[BibT_eX]

[DOI]

J. Algorithms, 1995

Sequential and parallel algorithms for the k closest pairs problem.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 1995

Maintaining the Visibility Map of Spheres While Moving the Viewpoint on a Circle at Infinity.

[BibT_eX]

[DOI]

Algorithmica, 1995

Euclidean spanners: short, thin, and lanky.

[BibT_eX]

[DOI]

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

1994

Using Persistent Data Structures for Adding Range Restrictions to Searching Problems.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1994

An Optimal Algorithm for the On-Line Closest-Pair Problem.

[BibT_eX]

[DOI]

Christian Schwarz

Jack Snoeyink

Algorithmica, 1994

On Intersection Searching Problems Involving Curved Objects.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 1994

Randomized and deterministic algorithms for geometric spanners of small diameter

[BibT_eX]

[DOI]

Sunil Arya

David M. Mount

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

An Animation of a Fixed-Radius All-Nearest-Neighbors Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Tenth Annual Symposium on Computational Geometry, 1994

Efficient Algorithms for Generalized Intersection Searching on Non-Iso-Oriented Objects.

[BibT_eX]

[DOI]

Proceedings of the Tenth Annual Symposium on Computational Geometry, 1994

1993

An optimal construction method for generalized convex layers.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 1993

Static and Dynamic Algorithms for k-Point Clustering Problems.

[BibT_eX]

[DOI]

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

1992

Maintaining the Minimal Distance of a Point Set in Polylogarithmic Time.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1992

An O(n log n log log n) Algorithm for the On-Line Closest Pair Problem.

[BibT_eX]

[DOI]

Christian Schwarz

Proceedings of the Third Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1992

Enumerating the k Closest Pairs Optimally

[BibT_eX]

[DOI]

Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

1991

Rectangular Point Location and the Dynamic Closest Pair Problem.

[BibT_eX]

[DOI]

Proceedings of the ISA '91 Algorithms, 1991

1990

Dynamic Deferred Data Structuring.

[BibT_eX]

[DOI]

Yu-Tai Ching

Kurt Mehlhorn

Inf. Process. Lett., 1990

Maintaining Range Trees in Secondary Memory. Part II: Lower Bounds.

[BibT_eX]

[DOI]

Mark H. Overmars

Acta Informatica, 1990

Maintaining Range Trees in Secondary Memory. Part I: Partitions.

[BibT_eX]

[DOI]

Acta Informatica, 1990

1989

Maintaining Multiple Representations of Dynamic Data Structures

[BibT_eX]

[DOI]

Inf. Comput., November, 1989

Two Models for the Reconstruction Problem for Dynamic Data Structures.

[BibT_eX]

J. Inf. Process. Cybern., 1989

Multiple Representations of Dynamic Data Structures.

[BibT_eX]

Proceedings of the Information Processing 89, Proceedings of the IFIP 11th World Computer Congress, San Francisco, USA, August 28, 1989

Dynamic data structures on multiple storage media.

[BibT_eX]

PhD thesis, 1989

1988

Maintaining Range Trees in Secondary Memory (Extended Abstract).

[BibT_eX]

[DOI]

Mark H. Overmars

Proceedings of the STACS 88, 1988

1987

Duadic codes.

[BibT_eX]