Maarten Löffler

Christiane Schmidt

Comput. Geom., 2023

Computing the Fréchet distance between uncertain curves in one dimension.

[BibT_eX]

[DOI]

Comput. Geom., 2023

Morphing Planar Graph Drawings Through 3D.

[BibT_eX]

[DOI]

Comput. Geom. Topol., 2023

Pushing Blocks by Sweeping Lines.

[BibT_eX]

[DOI]

Hugo A. Akitaya

Giovanni Viglietta

Comput. Geom. Topol., 2023

Removing Popular Faces in Curve Arrangements.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 31st International Symposium, 2023

Shortest Paths in Portalgons.

[BibT_eX]

[DOI]

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

The Influence of Dimensions on the Complexity of Computing Decision Trees.

[BibT_eX]

[DOI]

Stephen G. Kobourov

Fabrizio Montecchiani

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

Minimum color spanning circle of imprecise points.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

How to Fit a Tree in a Box.

[BibT_eX]

[DOI]

Hugo A. Akitaya

Irene Parada

Graphs Comb., 2022

Blocking Delaunay Triangulations from the Exterior.

[BibT_eX]

[DOI]

CoRR, 2022

Flipping Plane Spanning Paths.

[BibT_eX]

[DOI]

CoRR, 2022

Finding a Battleship of Uncertain Shape.

[BibT_eX]

[DOI]

CoRR, 2022

Nearest-Neighbor Decompositions of Drawings.

[BibT_eX]

[DOI]

Proceedings of the 18th Scandinavian Symposium and Workshops on Algorithm Theory, 2022

Preprocessing Imprecise Points for the Pareto Front.

[BibT_eX]

[DOI]

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Segment Visibility Counting Queries in Polygons.

[BibT_eX]

[DOI]

Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

Minimum Link Fencing.

[BibT_eX]

[DOI]

Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

Chromatic k-Nearest Neighbor Queries.

[BibT_eX]

[DOI]

Thijs van der Horst

Proceedings of the 30th Annual European Symposium on Algorithms, 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

The Complexity of Norm Synthesis and Revision.

[BibT_eX]

[DOI]

Proceedings of the Coordination, Organizations, Institutions, Norms, and Ethics for Governance of Multi-Agent Systems XV, 2022

2021

The Complexity of Data-Driven Norm Synthesis and Revision.

[BibT_eX]

[DOI]

CoRR, 2021

Terrain prickliness: theoretical grounds for low complexity viewsheds.

[BibT_eX]

[DOI]

CoRR, 2021

Labeling nonograms: Boundary labeling for curve arrangements.

[BibT_eX]

[DOI]

Fabian Klute

Comput. Geom., 2021

Largest and smallest area triangles on imprecise points.

[BibT_eX]

[DOI]

Vahideh Keikha

Ali Mohades

Comput. Geom., 2021

Folding polyominoes with holes into a cube.

[BibT_eX]

[DOI]

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

Mapping Multiple Regions to the Grid with Bounded Hausdorff Distance.

[BibT_eX]

[DOI]

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

Uncertain Curve Simplification.

[BibT_eX]

[DOI]

Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

Terrain Prickliness: Theoretical Grounds for High Complexity Viewsheds.

[BibT_eX]

[DOI]

Proceedings of the 11th International Conference on Geographic Information Science, 2021

Embedding Ray Intersection Graphs and Global Curve Simplification.

[BibT_eX]

[DOI]

Mees van de Kerkhof

Irina Kostitsyna

Proceedings of the Graph Drawing and Network Visualization - 29th International Symposium, 2021

Unit Disk Representations of Embedded Trees, Outerplanar and Multi-legged Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 29th International Symposium, 2021

Adjacency Graphs of Polyhedral Surfaces.

[BibT_eX]

[DOI]

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

Chasing Puppies: Mobile Beacon Routing on Closed Curves.

[BibT_eX]

[DOI]

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

Minimum Color Spanning Circle in Imprecise Setup.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 27th International Conference, 2021

Mapping Points to the Grid with Bounded Hausdor Distance.

[BibT_eX]

Jérôme Urhausen

Proceedings of the 33rd Canadian Conference on Computational Geometry, 2021

2020

A fully polynomial time approximation scheme for the smallest diameter of imprecise points.

[BibT_eX]

[DOI]

Vahideh Keikha

Ali Mohades

Theor. Comput. Sci., 2020

Multi-colored spanning graphs.

[BibT_eX]

[DOI]

Hugo A. Akitaya

Csaba D. Tóth

Theor. Comput. Sci., 2020

On optimal polyline simplification using the Hausdorff and Fréchet distance.

[BibT_eX]

[DOI]

Lionov Wiratma

J. Comput. Geom., 2020

Maximum-area triangle in a convex polygon, revisited.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2020

Geometric Multicut: Shortest Fences for Separating Groups of Objects in the Plane.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2020

Trajectory Visibility.

[BibT_eX]

[DOI]

Proceedings of the 17th Scandinavian Symposium and Workshops on Algorithm Theory, 2020

Route-preserving Road Network Generalization.

[BibT_eX]

[DOI]

Proceedings of the SIGSPATIAL '20: 28th International Conference on Advances in Geographic Information Systems, 2020

2019

Lombardi drawings of knots and links.

[BibT_eX]

[DOI]

J. Comput. Geom., 2019

Computation in Low-Dimensional Geometry and Topology (Dagstuhl Seminar 19352).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2019

Design and Automated Generation of Japanese Picture Puzzles.

[BibT_eX]

[DOI]

Comput. Graph. Forum, 2019

Region-Based Approximation of Probability Distributions (for Visibility Between Imprecise Points Among Obstacles).

[BibT_eX]

[DOI]

Algorithmica, 2019

Most Vital Segment Barriers.

[BibT_eX]

[DOI]

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

Approximating (k, ℓ)-center clustering for curves.

[BibT_eX]

[DOI]

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

Geometric Multicut.

[BibT_eX]

[DOI]

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

An Experimental Evaluation of Grouping Definitions for Moving Entities.

[BibT_eX]

[DOI]

Proceedings of the 27th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2019

Global Curve Simplification.

[BibT_eX]

[DOI]

Proceedings of the 27th Annual European Symposium on Algorithms, 2019

A Manual Comparison of Convex Hull Algorithms (Multimedia Exposition).

[BibT_eX]

[DOI]

Proceedings of the 35th International Symposium on Computational Geometry, 2019

Preprocessing Ambiguous Imprecise Points.

[BibT_eX]

[DOI]

Proceedings of the 35th International Symposium on Computational Geometry, 2019

2018

Planar and poly-arc Lombardi drawings.

[BibT_eX]

[DOI]

J. Comput. Geom., 2018

A Refined Definition for Groups of Moving Entities and Its Computation.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2018

On Optimal Min-# Curve Simplification Problem.

[BibT_eX]

[DOI]

CoRR, 2018

Approximating (k, 𝓁)-center clustering for curves.

[BibT_eX]

[DOI]

CoRR, 2018

On the complexity of barrier resilience for fat regions and bounded ply.

[BibT_eX]

[DOI]

Comput. Geom., 2018

Colored spanning graphs for set visualization.

[BibT_eX]

[DOI]

Comput. Geom., 2018

Convex Partial Transversals of Planar Regions.

[BibT_eX]

[DOI]

Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

An Experimental Comparison of Two Definitions for Groups of Moving Entities (Short Paper).

[BibT_eX]

[DOI]

Lionov Wiratma

Proceedings of the 10th International Conference on Geographic Information Science, 2018

Dynamic Smooth Compressed Quadtrees.

[BibT_eX]

[DOI]

Ivor van der Hoog

Elena Khramtcova

Proceedings of the 34th International Symposium on Computational Geometry, 2018

Width and Bounding Box of Imprecise Points.

[BibT_eX]

[DOI]

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

Theoretical analysis of beaconless geocast protocols in 1D.

[BibT_eX]

[DOI]

Proceedings of the Fifteenth Workshop on Analytic Algorithmics and Combinatorics, 2018

2017

Multi-Granular Trend Detection for Time-Series Analysis.

[BibT_eX]

[DOI]

IEEE Trans. Vis. Comput. Graph., 2017

Central trajectories.

[BibT_eX]

[DOI]

J. Comput. Geom., 2017

On the complexity of minimum-link path problems.

[BibT_eX]

[DOI]

J. Comput. Geom., 2017

Packing plane spanning trees and paths in complete geometric graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2017

Applications of Topology to the Analysis of 1-Dimensional Objects (Dagstuhl Seminar 17072).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2017

Largest and Smallest Area Triangles on a Given Set of Imprecise Points.

[BibT_eX]

[DOI]

Vahideh Keikha

Ali Mohades

CoRR, 2017

Dynamic smooth compressed quadtrees (Fullversion).

[BibT_eX]

[DOI]

Ivor van der Hoog

Elena Khramtcova

CoRR, 2017

Maximum-Area Quadrilateral in a Convex Polygon, Revisited.

[BibT_eX]

[DOI]

CoRR, 2017

Maximum-Area Triangle in a Convex Polygon, Revisited.

[BibT_eX]

[DOI]

CoRR, 2017

Obedient Plane Drawings for Disk Intersection Graphs.

[BibT_eX]

[DOI]

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

Graph Drawing Contest Report.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

Dynamic Stabbing Queries with Sub-logarithmic Local Updates for Overlapping Intervals.

[BibT_eX]

[DOI]

Elena Khramtcova

Proceedings of the Computer Science - Theory and Applications, 2017

Folding Free-Space Diagrams: Computing the Fréchet Distance between 1-Dimensional Curves (Multimedia Contribution).

[BibT_eX]

[DOI]

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

Discretized Approaches to Schematization.

[BibT_eX]

Wouter Meulemans

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

On Measures for Groups of Trajectories.

[BibT_eX]

[DOI]

Lionov Wiratma

Proceedings of the Societal Geo-innovation, 2017

2016

Range Searching.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Segmentation of Trajectories on Nonmonotone Criteria.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2016

Minimizing Co-location Potential of Moving Entities.

[BibT_eX]

[DOI]

SIAM J. Comput., 2016

Mixed Map Labeling.

[BibT_eX]

[DOI]

J. Spatial Inf. Sci., 2016

Strict confluent drawing.

[BibT_eX]

[DOI]

J. Comput. Geom., 2016

Adjacency-preserving spatial treemaps.

[BibT_eX]

[DOI]

J. Comput. Geom., 2016

Counting Carambolas.

[BibT_eX]

[DOI]

Graphs Comb., 2016

The Flip Diameter of Rectangulations and Convex Subdivisions.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2016

Space-Efficient Hidden Surface Removal.

[BibT_eX]

[DOI]

Frank Kammer

CoRR, 2016

Single-Player and Two-Player Buttons & Scissors Games.

[BibT_eX]

[DOI]

CoRR, 2016

Recognizing a DOG is Hard, But Not When It is Thin and Unit.

[BibT_eX]

[DOI]

Proceedings of the 8th International Conference on Fun with Algorithms, 2016

Homotopy Measures for Representative Trajectories.

[BibT_eX]

[DOI]

Proceedings of the 24th Annual European Symposium on Algorithms, 2016

Grouping Time-Varying Data for Interactive Exploration.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Computational Geometry, 2016

Critical Placements of a Square or Circle amidst Trajectories for Junction Detection.

[BibT_eX]

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

2015

Optimizing airspace closure with respect to politicians' egos.

[BibT_eX]

[DOI]

Irina Kostitsyna

Valentin Polishchuk

Theor. Comput. Sci., 2015

Single-Player and Two-Player Buttons & Scissors Games - (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Discrete and Computational Geometry and Graphs - 18th Japan Conference, 2015

Linear-Size Universal Point Sets for One-Bend Drawings.

[BibT_eX]

[DOI]

Csaba D. Tóth

Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

Graph Drawing Contest Report.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

Realization of Simply Connected Polygonal Linkages and Recognition of Unit Disk Contact Trees.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

Trajectory Grouping Structure under Geodesic Distance.

[BibT_eX]

[DOI]

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

Automated puzzle difficulty estimation.

[BibT_eX]

[DOI]

Paul Mutser

Proceedings of the 2015 IEEE Conference on Computational Intelligence and Games, 2015

Region-based Approximation Algorithms for Visibility between Imprecise Locations.

[BibT_eX]

[DOI]

Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments, 2015

2014

The Connect-The-Dots family of puzzles: design and automatic generation.

[BibT_eX]

[DOI]

ACM Trans. Graph., 2014

Unions of Onions: Preprocessing Imprecise Points for Fast Onion Decomposition.

[BibT_eX]

[DOI]

J. Comput. Geom., 2014

Terrain Visibility with Multiple Viewpoints.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2014

Practical Approaches to Partially Guarding a Polyhedral Terrain.

[BibT_eX]

[DOI]

Proceedings of the Geographic Information Science - 8th International Conference, 2014

Graph Drawing Contest Report.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 22nd International Symposium, 2014

The Connect-The-Dots Family of Puzzles: The Video.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

2013

Category-based routing in social networks: Membership dimension and the small-world phenomenon.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Computing Correlation between Piecewise-Linear Functions.

[BibT_eX]

[DOI]

SIAM J. Comput., 2013

Flow computations on imprecise terrains.

[BibT_eX]

[DOI]

J. Comput. Geom., 2013

Optimal 3D Angular Resolution for Low-Degree Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2013

Listing All Maximal Cliques in Large Sparse Real-World Graphs.

[BibT_eX]

[DOI]

Darren Strash

ACM J. Exp. Algorithmics, 2013

Bounds on the Complexity of Halfspace Intersections when the Bounded Faces have Small Dimension.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2013

Unions of Onions

[BibT_eX]

[DOI]

CoRR, 2013

Median Trajectories.

[BibT_eX]

[DOI]

Algorithmica, 2013

Dynamic Planar Point Location with Sub-logarithmic Local Updates.

[BibT_eX]

[DOI]

Joseph A. Simons

Darren Strash

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

Unions of Onions: Preprocessing Imprecise Points for Fast Onion Layer Decomposition.

[BibT_eX]

[DOI]

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

Segmentation of Trajectories for Non-Monotone Criteria.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Colored Spanning Graphs for Set Visualization.

[BibT_eX]

[DOI]

Vera Sacristán Adinolfi

Bettina Speckmann

Proceedings of the Graph Drawing - 21st International Symposium, 2013

Competitive query strategies for minimising the ply of the potential locations of moving points.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Computational Geometry 2013, 2013

Counting Carambolas.

[BibT_eX]

[DOI]

André Schulz

Csaba D. Tóth

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

On the Complexity of Barrier Resilience for Fat Regions.

[BibT_eX]

[DOI]

Proceedings of the Algorithms for Sensor Systems, 2013

2012

Triangulating the Square and Squaring the Triangle: Quadtrees and Delaunay Triangulations are Equivalent.

[BibT_eX]

[DOI]

SIAM J. Comput., 2012

Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2012

Processing aggregated data: the location of clusters in health data.

[BibT_eX]

[DOI]

GeoInformatica, 2012

Geometric Computations on Indecisive and Uncertain Points

[BibT_eX]

[DOI]

Allan Jørgensen

Jeff M. Phillips

CoRR, 2012

Removing local extrema from imprecise terrains.

[BibT_eX]

[DOI]

Comput. Geom., 2012

How Many Potatoes Are in a Mesh?

[BibT_eX]

[DOI]

János Pach

Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

Planar Lombardi Drawings of Outerpaths.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 20th International Symposium, 2012

2011

The directed Hausdorff distance between imprecise point sets.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Connect the dot: Computing feed-links for network extension.

[BibT_eX]

[DOI]

J. Spatial Inf. Sci., 2011

Connected Rectilinear Graphs on Point Sets.

[BibT_eX]

[DOI]

Elena Mumford

J. Comput. Geom., 2011

Existence and Computation of Tours through Imprecise Points.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2011

Detecting Commuting Patterns by Clustering Subtrajectories.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2011

Flow Computations on Imprecise Terrains

[BibT_eX]

[DOI]

Anne Driemel

Herman J. Haverkort

CoRR, 2011

Category-Based Routing in Social Networks: Membership Dimension and the Small-World Phenomenon (Full)

[BibT_eX]

[DOI]

CoRR, 2011

Category-Based Routing in Social Networks: Membership Dimension and the Small-World Phenomenon (Short)

[BibT_eX]

[DOI]

CoRR, 2011

Almost all Delaunay triangulations have stretch factor greater than pi/2.

[BibT_eX]

[DOI]

Comput. Geom., 2011

Preprocessing Imprecise Points for Delaunay Triangulation: Simplified and Extended.

[BibT_eX]

[DOI]

Algorithmica, 2011

Peeling Meshed Potatoes.

[BibT_eX]

[DOI]

Algorithmica, 2011

Geometric Computations on Indecisive Points.

[BibT_eX]

[DOI]

Allan Jørgensen

Jeff M. Phillips

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

Tracking Moving Objects with Few Handovers.

[BibT_eX]

[DOI]

Michael T. Goodrich

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

Planar and Poly-arc Lombardi Drawings.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 19th International Symposium, 2011

2010

Preprocessing Imprecise Points and Splitting Triangulations.

[BibT_eX]

[DOI]

Joseph S. B. Mitchell

SIAM J. Comput., 2010

Finding the Most Relevant Fragments in Networks.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2010

Smoothing Imprecise 1.5D Terrains.

[BibT_eX]

[DOI]

Chris Gray

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

The dilation of the Delaunay triangulation is greater than π/2

[BibT_eX]

[DOI]

CoRR, 2010

Delaunay triangulation of imprecise points in linear time after preprocessing.

[BibT_eX]

[DOI]

Jack Snoeyink

Comput. Geom., 2010

Largest bounding box, smallest diameter, and related problems on imprecise points.

[BibT_eX]

[DOI]

Comput. Geom., 2010

Optimization for first order Delaunay triangulations.

[BibT_eX]

[DOI]

Comput. Geom., 2010

Largest and Smallest Convex Hulls for Imprecise Points.

[BibT_eX]

[DOI]

Algorithmica, 2010

Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time.

[BibT_eX]

[DOI]

Darren Strash

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

Computing similarity between piecewise-linear functions.

[BibT_eX]

[DOI]

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

Shooting bricks with orthogonal laser beams: A first step towards internal/external map labeling.

[BibT_eX]

[DOI]

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

2009

Data Imprecision in Computational Geometry.

[BibT_eX]

[DOI]

PhD thesis, 2009

Planar bichromatic minimum spanning trees.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2009

Polychromatic 4-coloring of guillotine subdivisions.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2009

Delaunay Triangulation of Imprecise Points Simplified and Extended.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

Connect the Dot: Computing Feed-Links with Minimum Dilation.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

Shape Fitting on Point Sets with Probability Distributions.

[BibT_eX]

[DOI]

Jeff M. Phillips

Proceedings of the Algorithms, 2009

Minimizing Slope Change in Imprecise 1.5D terrains.

[BibT_eX]

[DOI]

Chris Gray

Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009

The spanning ratio of the Delaunay triangulation is greater than pi/2.

[BibT_eX]

[DOI]

Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009

Detecting Hotspots in Geographic Networks.

[BibT_eX]

[DOI]

Proceedings of the Advances in GIScience, 2009

2008

Approximating largest convex hulls for imprecise points.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2008

Clusters in Aggregated Health Data.

[BibT_eX]

[DOI]

Proceedings of the Headway in Spatial Data Handling, 2008

Feed-links for network extensions.

[BibT_eX]

[DOI]

Proceedings of the 16th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, 2008

Delaunay triangulations of imprecise pointsin linear time after preprocessing.

[BibT_eX]

[DOI]

Jack Snoeyink

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

2007

Generating realistic terrains with higher-order Delaunay triangulations.

[BibT_eX]

[DOI]

Thierry de Kok

Comput. Geom., 2007

Largest Subsets of Triangles in a Triangulation.

[BibT_eX]

[DOI]

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

2006

Largest and Smallest Tours and Convex Hulls for Imprecise Points.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2006

2005

Minimizing local minima in terrains with higher-order Delaunay triangulations.

[BibT_eX]

[DOI]

Thierry de Kok