Mark de Berg

Arpan Sadhukhan

SIAM J. Discret. Math., March, 2024

A Clique-Based Separator for Intersection Graphs of Geodesic Disks in R2.

[BibT_eX]

[DOI]

Leonidas Theocharous

CoRR, 2024

A Coreset for Approximate Furthest-Neighbor Queries in a Simple Polygon.

[BibT_eX]

[DOI]

Leonidas Theocharous

CoRR, 2024

Stable and Dynamic Minimum Cuts.

[BibT_eX]

[DOI]

Andrés López Martínez

Proceedings of the WALCOM: Algorithms and Computation, 2024

2023

The Online Broadcast Range-Assignment Problem.

[BibT_eX]

[DOI]

Aleksandar Markovic

Seeun William Umboh

Algorithmica, December, 2023

An ETH-Tight Exact Algorithm for Euclidean TSP.

[BibT_eX]

[DOI]

SIAM J. Comput., June, 2023

Clique-Based Separators for Geometric Intersection Graphs.

[BibT_eX]

[DOI]

Algorithmica, June, 2023

Subquadratic algorithms for some 3Sum-hard geometric problems in the algebraic decision-tree model.

[BibT_eX]

[DOI]

Comput. Geom., 2023

A Note on Reachability and Distance Oracles for Transmission Graphs.

[BibT_eX]

[DOI]

Comput. Geom. Topol., 2023

Partitioning Axis-Parallel Lines in 3D.

[BibT_eX]

[DOI]

Comput. Geom. Topol., 2023

Improved Bounds for Discrete Voronoi Games.

[BibT_eX]

[DOI]

Geert van Wordragen

Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

Finding Diverse Minimum s-t Cuts.

[BibT_eX]

[DOI]

Andrés López Martínez

Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

Clustering in Polygonal Domains.

[BibT_eX]

[DOI]

Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

Geometric TSP on Sets.

[BibT_eX]

[DOI]

Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

k-Center Clustering with Outliers in the MPC and Streaming Model.

[BibT_eX]

[DOI]

Leyla Biabani

Morteza Monemizadeh

Proceedings of the IEEE International Parallel and Distributed Processing Symposium, 2023

Stable Approximation Algorithms for Dominating Set and Independent Set.

[BibT_eX]

[DOI]

Arpan Sadhukhan

Proceedings of the Approximation, 2023

2022

Preclustering Algorithms for Imprecise Points.

[BibT_eX]

[DOI]

Sina Farahzad

Mir Omid Haji Mirsadeghi

Morteza Saghafian

Algorithmica, 2022

Computing Smallest Convex Intersecting Polygons.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

TSP in a Simple Polygon.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

Unlabeled Multi-Robot Motion Planning with Tighter Separation Bounds.

[BibT_eX]

[DOI]

Proceedings of the 38th International Symposium on Computational Geometry, 2022

On Cyclic Solutions to the Min-Max Latency Multi-Robot Patrolling Problem.

[BibT_eX]

[DOI]

Proceedings of the 38th International Symposium on Computational Geometry, 2022

2021

Fine-grained Complexity Analysis of Two Classic TSP Variants.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2021

On β-Plurality Points in Spatial Voting Games.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2021

Removing Depth-Order Cycles Among Triangles: An Algorithm Generating Triangular Fragments.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2021

Approximation Algorithms for Multi-Robot Patrol-Scheduling with Min-Max Latency.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Foundations of Robotics XIV, 2021

A Novel Algorithm for Region-to-Region Tractography in Diffusion Tensor Imaging.

[BibT_eX]

[DOI]

Proceedings of the Computational Diffusion MRI - 12th International Workshop, 2021

Maximum-Weight Matching in Sliding Windows and Beyond.

[BibT_eX]

[DOI]

Leyla Biabani

Morteza Monemizadeh

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

k-Center Clustering with Outliers in the Sliding-Window Model.

[BibT_eX]

[DOI]

Morteza Monemizadeh

Yu Zhong

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

Rectilinear Steiner Trees in Narrow Strips.

[BibT_eX]

[DOI]

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

2020

A Framework for Exponential-Time-Hypothesis-Tight Algorithms and Lower Bounds in Geometric Intersection Graphs.

[BibT_eX]

[DOI]

Tom C. van der Zanden

SIAM J. Comput., 2020

Corrigendum to: Approximating minimum-area rectangular and convex containers for packing convex polygons.

[BibT_eX]

[DOI]

Christian Knauer

J. Comput. Geom., 2020

Minimum Perimeter-Sum Partitions in the Plane.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2020

Euclidean TSP in Narrow Strip.

[BibT_eX]

[DOI]

CoRR, 2020

On beta-Plurality Points in Spatial Voting Games.

[BibT_eX]

[DOI]

CoRR, 2020

Non-Monochromatic and Conflict-Free Colorings on Tree Spaces and Planar Network Spaces.

[BibT_eX]

[DOI]

Algorithmica, 2020

Euclidean TSP in Narrow Strips.

[BibT_eX]

[DOI]

Proceedings of the 36th International Symposium on Computational Geometry, 2020

Lower Bounds for Dominating Set in Ball Graphs and for Weighted Dominating Set in Unit-Ball Graphs.

[BibT_eX]

[DOI]

Proceedings of the Treewidth, Kernels, and Algorithms, 2020

2019

The complexity of Dominating Set in geometric intersection graphs.

[BibT_eX]

[DOI]

Gerhard J. Woeginger

Theor. Comput. Sci., 2019

Geodesic Spanners for Points on a Polyhedral Terrain.

[BibT_eX]

[DOI]

Mohammad Javad Rezaei Seraji

SIAM J. Comput., 2019

Covering many points with a small-area box.

[BibT_eX]

[DOI]

J. Comput. Geom., 2019

Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points.

[BibT_eX]

[DOI]

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

Faster DBSCAN and HDBSCAN in Low-Dimensional Euclidean Spaces.

[BibT_eX]

[DOI]

Ade Gunawan

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

Dynamic conflict-free colorings in the plane.

[BibT_eX]

[DOI]

Aleksandar Markovic

Comput. Geom., 2019

Shortcuts for the circle.

[BibT_eX]

[DOI]

Comput. Geom., 2019

The Homogeneous Broadcast Problem in Narrow and Wide Strips II: Lower Bounds.

[BibT_eX]

[DOI]

Hans L. Bodlaender

Algorithmica, 2019

The Homogeneous Broadcast Problem in Narrow and Wide Strips I: Algorithms.

[BibT_eX]

[DOI]

Hans L. Bodlaender

Algorithmica, 2019

On One-Round Discrete Voronoi Games.

[BibT_eX]

[DOI]

Mehran Mehr

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

ETH-Tight Algorithms for Geometric Network Problems Using Geometric Separators.

[BibT_eX]

Proceedings of the 31st Canadian Conference on Computational Geometry, 2019

Throughput and Packet Displacements of Dynamic Broadcasting Algorithms.

[BibT_eX]

[DOI]

Corrie Jacobien Carstens

Michel Mandjes

Proceedings of the Algorithms for Sensor Systems, 2019

2018

Faster Algorithms for Computing Plurality Points.

[BibT_eX]

[DOI]

Constantinos Tsirogiannis

Mehran Mehr

ACM Trans. Algorithms, 2018

An Efficient Algorithm for the 1D Total Visibility-Index Problem and Its Parallelization.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2018

Independent-set reconfiguration thresholds of hereditary graph classes.

[BibT_eX]

[DOI]

Bart M. P. Jansen

Debankur Mukherjee

Discret. Appl. Math., 2018

Finding Pairwise Intersections Inside a Query Range.

[BibT_eX]

[DOI]

Algorithmica, 2018

A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs.

[BibT_eX]

[DOI]

Tom C. van der Zanden

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

Non-monochromatic and Conflict-Free Coloring on Tree Spaces and Planar Network Spaces.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

2017

Approximating Minimum-Area Rectangular and Convex Containers for Packing Convex Polygons.

[BibT_eX]

[DOI]

Helmut Alt

Christian Knauer

J. Comput. Geom., 2017

Guarding monotone art galleries with sliding cameras in linear time.

[BibT_eX]

[DOI]

Stephane Durocher

Saeed Mehrabi

J. Discrete Algorithms, 2017

Guest Editors' Foreword.

[BibT_eX]

[DOI]

Adrian Dumitrescu

Khaled M. Elbassioni

Int. J. Comput. Geom. Appl., 2017

Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points.

[BibT_eX]

[DOI]

CoRR, 2017

Faster DB-scan and HDB-scan in Low-Dimensional Euclidean Spaces.

[BibT_eX]

[DOI]

Ade Gunawan

CoRR, 2017

Separability of imprecise points.

[BibT_eX]

[DOI]

Comput. Geom., 2017

The Homogeneous Broadcast Problem in Narrow and Wide Strips.

[BibT_eX]

[DOI]

Hans L. Bodlaender

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

The Dominating Set Problem in Geometric Intersection Graphs.

[BibT_eX]

[DOI]

Gerhard J. Woeginger

Proceedings of the 12th International Symposium on Parameterized and Exact Computation, 2017

A Dynamic Data Structure for Approximate Proximity Queries in Trajectory Data.

[BibT_eX]

[DOI]

Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2017

Removing Depth-Order Cycles among Triangles: An Efficient Algorithm Generating Triangular Fragments.

[BibT_eX]

[DOI]

Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

Range-Clustering Queries.

[BibT_eX]

[DOI]

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

Data Structures for Fréchet Queries in Trajectory Data.

[BibT_eX]

Constantinos Tsirogiannis

Tim Ophelders

Proceedings of the 29th Canadian Conference on Computational Geometry, 2017

An Efficient Algorithm for the 1D Total Visibility-Index Problem.

[BibT_eX]

[DOI]

Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments, 2017

2016

Hierarchical Space Decompositions for Low-Density Scenes.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Straight-path queries in trajectory data.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2016

Distance-sensitive planar point location.

[BibT_eX]

[DOI]

Comput. Geom., 2016

2015

Efficient Multi-Robot Motion Planning for Unlabeled Discs in Simple Polygons.

[BibT_eX]

[DOI]

IEEE Trans Autom. Sci. Eng., 2015

Progressive geometric algorithms.

[BibT_eX]

[DOI]

Sander P. A. Alewijnse

J. Comput. Geom., 2015

Separating bichromatic point sets by L-shapes.

[BibT_eX]

[DOI]

Comput. Geom., 2015

Fast computation of categorical richness on raster data sets and related problems.

[BibT_eX]

[DOI]

Constantinos Tsirogiannis

Bryan T. Wilkinson

Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2015

2014

Improved Bounds for the Union of Locally Fat Objects in the Plane.

[BibT_eX]

[DOI]

SIAM J. Comput., 2014

Treemaps with bounded aspect ratio.

[BibT_eX]

[DOI]

Vincent van der Weele

Comput. Geom., 2014

Separability of Imprecise Points.

[BibT_eX]

[DOI]

Farnaz Sheikhi

Proceedings of the Algorithm Theory - SWAT 2014, 2014

2013

Fat Polygonal Partitions with Applications to Visualization and Embeddings.

[BibT_eX]

[DOI]

Krzysztof Onak

Anastasios Sidiropoulos

J. Comput. Geom., 2013

Computing Push Plans for Disk-shaped Robots.

[BibT_eX]

[DOI]

Dirk H. P. Gerrits

Int. J. Comput. Geom. Appl., 2013

Fast Fréchet queries.

[BibT_eX]

[DOI]

Atlas F. Cook IV

Comput. Geom., 2013

Distance-Sensitive Planar Point Location.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

Labeling Moving Points with a Trade-Off between Label Speed and Label Overlap.

[BibT_eX]

[DOI]

Dirk H. P. Gerrits

Proceedings of the Algorithms - ESA 2013, 2013

Kinetic 2-centers in the black-box model.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Computational Geometry 2013, 2013

2012

Kinetic Convex Hulls, Delaunay Triangulations and Connectivity Structures in the Black-Box Model.

[BibT_eX]

[DOI]

J. Comput. Geom., 2012

Optimal Binary Space Partitions for Segments in the Plane.

[BibT_eX]

[DOI]

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

Unions of Fat Convex Polytopes Have Short Skeletons.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2012

Approximation algorithms for free-label maximization.

[BibT_eX]

[DOI]

Dirk H. P. Gerrits

Comput. Geom., 2012

Guest Editorial.

[BibT_eX]

[DOI]

Algorithmica, 2012

Kinetic Compressed Quadtrees in the Black-Box Model with Applications to Collision Detection for Low-Density Scenes.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2012, 2012

2011

Kinetic Spanners in ℝd.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2011

Geometric Spanners for Weighted Point Sets.

[BibT_eX]

[DOI]

Algorithmica, 2011

Out-of-Order Event Processing in Kinetic Data Structures.

[BibT_eX]

[DOI]

Algorithmica, 2011

On Rectilinear Partitions with Minimum Stabbing Number.

[BibT_eX]

[DOI]

Sander Verdonschot

Vincent van der Weele

Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011

Piecewise-Linear Approximations of Uncertain Functions.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011

Go with the Flow: The Direction-Based Fréchet Distance of Polygonal Curves.

[BibT_eX]

[DOI]

Atlas F. Cook

Proceedings of the Theory and Practice of Algorithms in (Computer) Systems, 2011

Implicit Flow Routing on Terrains with Applications to Surface Networks and Drainage Structures.

[BibT_eX]

[DOI]

Constantinos P. Tsirogiannis

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Exact and approximate computations of watersheds on triangulated terrains.

[BibT_eX]

[DOI]

Constantinos P. Tsirogiannis

Proceedings of the 19th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, 2011

Delineating imprecise regions via shortest-path graphs.

[BibT_eX]

[DOI]

Wouter Meulemans

Proceedings of the 19th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, 2011

Kinetic convex hulls and delaunay triangulations in the black-box model.

[BibT_eX]

[DOI]

Proceedings of the 27th ACM Symposium on Computational Geometry, 2011

Approximation algorithms for computing partitions with minimum stabbing number of rectilinear and simple polygons.

[BibT_eX]

[DOI]

Proceedings of the 27th ACM Symposium on Computational Geometry, 2011

2010

Visibility Maps of Realistic Terrains have Linear Smoothed Complexity.

[BibT_eX]

[DOI]

Constantinos P. Tsirogiannis

J. Comput. Geom., 2010

Optimal BSPs and Rectilinear Cartograms.

[BibT_eX]

[DOI]

Elena Mumford

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

Streaming Algorithms for Line Simplification.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2010

Star-quadtrees and guard-quadtrees: I/O-efficient indexes for fat triangulations and low-density planar subdivisions.

[BibT_eX]

[DOI]

Comput. Geom., 2010

Computing the visibility map of fat objects.

[BibT_eX]

[DOI]

Comput. Geom., 2010

Decompositions and boundary coverings of non-convex fat polyhedra.

[BibT_eX]

[DOI]

Comput. Geom., 2010

The complexity of flow on fat terrains and its i/o-efficient computation.

[BibT_eX]

[DOI]

Comput. Geom., 2010

A simple and efficient kinetic spanner.

[BibT_eX]

[DOI]

Comput. Geom., 2010

The Traveling Salesman Problem under Squared Euclidean Distances.

[BibT_eX]

[DOI]

Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, 2010

10491 Results of the break-out group: Gulls Data.

[BibT_eX]

[DOI]

Proceedings of the Representation, Analysis and Visualization of Moving Objects, 05.12., 2010

10491 Results of the break-out group: Aggregation.

[BibT_eX]

[DOI]

Proceedings of the Representation, Analysis and Visualization of Moving Objects, 05.12., 2010

Better bounds on the union complexity of locally fat objects.

[BibT_eX]

[DOI]

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

Optimal Binary Space Partitions in the Plane.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 16th Annual International Conference, 2010

Finding monochromatic l-shapes in bichromatic point sets.

[BibT_eX]

[DOI]

Farnaz Sheikhi

Ali Mohades

Mansoor Davoodi Monfared

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

2009

Kinetic kd-Trees and Longest-Side kd-Trees.

[BibT_eX]

[DOI]

SIAM J. Comput., 2009

Covering Many or Few Points with Unit Disks.

[BibT_eX]

[DOI]

Sergio Cabello

Sariel Har-Peled

Theory Comput. Syst., 2009

Maximizing the Area of Overlap of Two Unions of Disks under Rigid Motion.

[BibT_eX]

[DOI]

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

On rectilinear duals for vertex-weighted plane graphs.

[BibT_eX]

[DOI]

Elena Mumford

Discret. Math., 2009

Region-Fault Tolerant Geometric Spanners.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2009

Efficient c-oriented range searching with DOP-trees.

[BibT_eX]

[DOI]

Micha Streppel

Comput. Geom., 2009

Cache-Oblivious R-Trees.

[BibT_eX]

[DOI]

Lars Arge

Algorithmica, 2009

Kinetic Collision Detection for Convex Fat Objects.

[BibT_eX]

[DOI]

Algorithmica, 2009

Rotated-Box Trees: A Lightweight c-Oriented Bounding-Volume Hierarchy.

[BibT_eX]

[DOI]

Peter Hachenberger

Proceedings of the Experimental Algorithms, 8th International Symposium, 2009

Rectangular cartograms: the game.

[BibT_eX]

[DOI]

Proceedings of the 25th ACM Symposium on Computational Geometry, 2009

Kinetic spanners in Rd.

[BibT_eX]

[DOI]

Proceedings of the 25th ACM Symposium on Computational Geometry, 2009

2008

The priority R-tree: A practically efficient and worst-case optimal R-tree.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2008

Vertical Ray Shooting and Computing Depth Orders for Fat Objects.

[BibT_eX]

[DOI]

SIAM J. Comput., 2008

Cache-oblivious selection in sorted X.

[BibT_eX]

[DOI]

Shripad Thite

Inf. Process. Lett., 2008

Improved Bounds on the Union Complexity of Fat Objects.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2008

Cache-Oblivious Selection in Sorted X+Y Matrices

[BibT_eX]

[DOI]

Shripad Thite

CoRR, 2008

Ray shooting and intersection searching amidst fat convex polyhedra in 3-space.

[BibT_eX]

[DOI]

Comput. Geom., 2008

Sparse geometric graphs with small dilation.

[BibT_eX]

[DOI]

Comput. Geom., 2008

Cutting cycles of rods in space: hardness and approximation.

[BibT_eX]

[DOI]

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Spatial Support and Spatial Confidence for Spatial Association Rules.

[BibT_eX]

[DOI]

Patrick Laube

Proceedings of the Headway in Spatial Data Handling, 2008

The Complexity of Bisectors and Voronoi Diagrams on Realistic Terrains.

[BibT_eX]

[DOI]

Shripad Thite

Proceedings of the Algorithms, 2008

Fault-Tolerant Conflict-Free Coloring.

[BibT_eX]

Sheung-Hung Poon

Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008

Computational geometry: algorithms and applications, 3rd Edition.

[BibT_eX]

[DOI]

Springer, ISBN: 9783540779735, 2008

2007

An intersection-sensitive algorithm for snap rounding.

[BibT_eX]

[DOI]

Dan Halperin

Comput. Geom., 2007

Editorial.

[BibT_eX]

[DOI]

Comput. Geom., 2007

Kinetic sorting and kinetic convex hulls.

[BibT_eX]

[DOI]

Comput. Geom., 2007

I/O-Efficient Flow Modeling on Fat Terrains.

[BibT_eX]

[DOI]

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

I/O-Efficient Map Overlay and Point Location in Low-Density Subdivisions.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

2006

Approximate range searching using binary space partitions.

[BibT_eX]

[DOI]

Micha Streppel

Comput. Geom., 2006

2005

TSP with neighborhoods of varying size.

[BibT_eX]

[DOI]

J. Algorithms, 2005

Schematization of networks.

[BibT_eX]

[DOI]

Sergio Cabello

Comput. Geom., 2005

Optimal spanners for axis-aligned rectangles.

[BibT_eX]

[DOI]

Comput. Geom., 2005

A Polynomial-time Algorithm to Design Push Plans for Sensorless Parts Sorting.

[BibT_eX]

[DOI]

Xavier Goaoc

Proceedings of the Robotics: Science and Systems I, 2005

Sparse Geometric Graphs with Small Dilation.

[BibT_eX]

[DOI]

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

Lower bounds for kinetic sorting.

[BibT_eX]

[DOI]

Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

Vertical ray shooting for fat objects.

[BibT_eX]

[DOI]

Proceedings of the 21st ACM Symposium on Computational Geometry, 2005

Staying in the Middle: Exact and Approximate Medians in R1 and R2 for Moving Points.

[BibT_eX]

[DOI]

Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

2004

Computational Geometry.

[BibT_eX]

[DOI]

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

On the Design and Analysis of Competent Selecto-recombinative GAs.

[BibT_eX]

[DOI]

Evol. Comput., 2004

Guest Editor's Foreword.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2004

Box-trees for collision checking in industrial installations.

[BibT_eX]

[DOI]

Comput. Geom., 2004

On simplifying dot maps.

[BibT_eX]

[DOI]

Comput. Geom., 2004

2003

Spanning Trees Crossing Few Barriers.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2003

On R-trees with low query complexity.

[BibT_eX]

[DOI]

Comput. Geom., 2003

Guarding scenes against invasive hypercubes.

[BibT_eX]

[DOI]

Comput. Geom., 2003

Significant-Presence Range Queries in Categorical Data.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003

Kinetic Dictionaries: How to Shoot a Moving Target.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2003

2002

On the fatness of Minkowski sums.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2002

Guest Editor's Foreword.

[BibT_eX]

[DOI]

Stefan Schirra

Int. J. Comput. Geom. Appl., 2002

Using Genetic Algorithms for Solving Hard Problems in GIS.

[BibT_eX]

[DOI]

GeoInformatica, 2002

Box-Trees and R-Trees with Near-Optimal Query Time.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2002

Models and motion planning.

[BibT_eX]

[DOI]

Matthew J. Katz

Comput. Geom., 2002

Reporting intersecting pairs of convex polytopes in two and three dimensions.

[BibT_eX]

[DOI]

Comput. Geom., 2002

Separating an object from its cast.

[BibT_eX]

[DOI]

Comput. Aided Des., 2002

Realistic Input Models for Geometric Algorithms.

[BibT_eX]

[DOI]

Matthew J. Katz

Algorithmica, 2002

2001

Reporting Intersecting Pairs of Polytopes in Two and Three Dimensions.

[BibT_eX]

[DOI]

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

Schematization of road networks.

[BibT_eX]

[DOI]

Proceedings of the Seventeenth Annual Symposium on Computational Geometry, 2001

A segment-tree based kinetic BSP.

[BibT_eX]

[DOI]

João Comba

Leonidas J. Guibas

Proceedings of the Seventeenth Annual Symposium on Computational Geometry, 2001

2000

Lower Bounds for Kinetic Planar Subdivisions.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2000

Linear Size Binary Space Partitions for Uncluttered Scenes.

[BibT_eX]

[DOI]

Algorithmica, 2000

Scalability and Efficiency of Genetic Algorithms for Geometrical Applications.

[BibT_eX]

[DOI]

Proceedings of the Parallel Problem Solving from Nature, 2000

On R-trees with Low Stabbing Number.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2000

Computational geometry: algorithms and applications, 2nd Edition.

[BibT_eX]

[DOI]

Springer, ISBN: 3540656200, 2000

1999

Motion Planning for Multiple Robots.

[BibT_eX]

[DOI]

Petr Svestka

Discret. Comput. Geom., 1999

Multi-Method Dispatching: A Geometric Approach With Applications to String Matching Problems.

[BibT_eX]

[DOI]

Paolo Ferragina

S. Muthukrishnan

Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

On The Design of Genetic Algorithms for Geographical Applications.

[BibT_eX]

Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 1999), 1999

1998

Constructing Levels in Arrangements and Higher Order Voronoi Diagrams.

[BibT_eX]

[DOI]

SIAM J. Comput., 1998

Computing the Maximum Overlap of Two Convex Polygons under Translations.

[BibT_eX]

[DOI]

Theory Comput. Syst., 1998

Computing the Angularity Tolerance.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 1998

Motion Planning in Environments with Low Obstacle Density.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1998

On Levels of Detail in Terrains.

[BibT_eX]

[DOI]

Katrin Dobrindt

Graph. Model. Image Process., 1998

The union of moving polygonal pseudodiscs - Combinatorial bounds and applications.

[BibT_eX]

[DOI]

Hazel Everett

Leonidas J. Guibas

Comput. Geom., 1998

Computing constrained minimum-width annuli of point sets.

[BibT_eX]

[DOI]

Comput. Aided Des., 1998

Recovering lines with fixed linear probes.

[BibT_eX]

[DOI]

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

1997

Computing a Single Cell in the Overlay of Two Simple Polygons.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1997

Sparse Arrangements and the Number of Views of Polyhedral Scenes.

[BibT_eX]

[DOI]

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

Simple Traversal of a Subdivision Without Extra Storage.

[BibT_eX]

[DOI]

Int. J. Geogr. Inf. Sci., 1997

Perfect Binary Space Partitions.

[BibT_eX]

[DOI]

Marko de Groot

Comput. Geom., 1997

New Results on Binary Space Partitions in the Plane.

[BibT_eX]

[DOI]

Marko de Groot

Comput. Geom., 1997

Trends and Developments in Computational Geometry.

[BibT_eX]

[DOI]

Comput. Graph. Forum, 1997

Trekking in the Alps Without Freezing or Getting Tired.

[BibT_eX]

[DOI]

Algorithmica, 1997

Computational geometry: algorithms and applications.

[BibT_eX]

[DOI]

Springer, ISBN: 354061270X, 1997

1996

Vertical Decompositions for Triangles in 3-Space.

[BibT_eX]

[DOI]

Leonidas J. Guibas

Dan Halperin

Discret. Comput. Geom., 1996

Point Location in Zones of K-flats in Arrangements.

[BibT_eX]

[DOI]

Comput. Geom., 1996

Computing Half-plane and Strip Discrepancy of Planar Point Sets.

[BibT_eX]

[DOI]

Comput. Geom., 1996

Efficient Generation of k-Directional Assembly Sequences.

[BibT_eX]

[DOI]

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

Simple Traversal of a Subdivision Without Extra Storage.

[BibT_eX]

[DOI]

René van Oostrum

Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996

Visualization of TINs.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Foundations of Geographic Information Systems, 1996

The Complexity of Rivers in Triangulated Terrains.

[BibT_eX]

[DOI]

Proceedings of the 8th Canadian Conference on Computational Geometry, 1996

1995

Reaching a Goal with Directional Uncertainty.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1995

Two- and Three-Dimensional Point Location in Rectangular Subdivisions.

[BibT_eX]

[DOI]

Jack Snoeyink

J. Algorithms, 1995

Cuttings and applications.

[BibT_eX]

[DOI]

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

Translation queries for sets of polygons.

[BibT_eX]

[DOI]

Hazel Everett

Hubert Wagener

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

Piecewise Linear Paths Among Convex Obstacles.

[BibT_eX]

[DOI]

Jirí Matousek

Discret. Comput. Geom., 1995

On Lazy Randomized Incremental Construction.

[BibT_eX]

[DOI]

Katrin Dobrindt

Discret. Comput. Geom., 1995

Generalized Hidden Surface Removal.

[BibT_eX]

[DOI]

Comput. Geom., 1995

Linear Size Binary Space Partitions for Fat Objects.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1995

1994

Computing and Verifying Depth Orders.

[BibT_eX]

[DOI]

SIAM J. Comput., 1994

Rectilinear Decompositions with Low Stabbing Number.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1994

Efficient Ray Shooting and Hidden Surface Removal.

[BibT_eX]

[DOI]

Algorithmica, 1994

New Results on Binary Space Partitions in the Plane (Extended Abstract).

[BibT_eX]

[DOI]

Marko de Groot

Proceedings of the Algorithm Theory, 1994

1993

Ray Shooting, Depth Orders and Hidden Surface Removal

[BibT_eX]

[DOI]

Lecture Notes in Computer Science 703, Springer, ISBN: 3-540-57020-9, 1993

1992

A General Approach to Dominance in the Plane.

[BibT_eX]

[DOI]

Svante Carlsson

J. Algorithms, 1992

Shortest path queries in rectilinear worlds.

[BibT_eX]

[DOI]

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

Dynamic Output-sensitive Hidden Surface Removal for C-oriented Polyhedra.

[BibT_eX]

[DOI]

Comput. Geom., 1992

Two- and Three-Dimensional Point Location in Rectangular Subdivisions (Extended Abstract).

[BibT_eX]

[DOI]

Jack Snoeyink

Proceedings of the Algorithm Theory, 1992

Efficient algorithms for ray shooting and hidden surface removal.

[BibT_eX]

PhD thesis, 1992

1991

Hidden Surface Removal for C-oriented Polyhedra.

[BibT_eX]

[DOI]

Comput. Geom., 1991

On Rectilinear Link Distance.

[BibT_eX]

[DOI]

Comput. Geom., 1991

Finding Squares and Rectangles in Sets of Points.

[BibT_eX]

[DOI]

BIT, 1991

Shortest Path Queries in Rectilinear Worlds of Higher Dimension (Extended Abstract).

[BibT_eX]

[DOI]

Bengt J. Nilsson

Proceedings of the Seventh Annual Symposium on Computational Geometry, 1991

1990

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

[BibT_eX]

[DOI]

Acta Informatica, 1990

Finding Shortest Paths in the Presence of Orthogonal Obstacles Using a Combined L1 and Link Metric.

[BibT_eX]

[DOI]

Proceedings of the SWAT 90, 1990

Translating Polygons with Applications to Hidden Surface Removal.

[BibT_eX]

[DOI]

Proceedings of the SWAT 90, 1990

Hidden Surface Removal for Axis-Parallel Polyhedra (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

1988

Dominance in the Presence of Obstracles.

[BibT_eX]

[DOI]