Marcel Roeloffzen

J. Graph Algorithms Appl., 2024

Capturing the Shape of a Point Set with a Line Segment.

[BibT_eX]

[DOI]

Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

2023

Kinetic Geodesic Voronoi Diagrams in a Simple Polygon.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., December, 2023

Fréchet Distance for Uncertain Curves.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, July, 2023

2022

Segment Visibility Counting Queries in Polygons.

[BibT_eX]

[DOI]

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

Physically consistent map matching.

[BibT_eX]

[DOI]

Proceedings of the 30th International Conference on Advances in Geographic Information Systems, 2022

2021

Rectilinear link diameter and radius in a rectilinear polygonal domain.

[BibT_eX]

[DOI]

Comput. Geom., 2021

Snipperclips: Cutting tools into desired polygons using themselves.

[BibT_eX]

[DOI]

Comput. Geom., 2021

Uncertain Curve Simplification.

[BibT_eX]

[DOI]

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

2020

Symmetric assembly puzzles are hard, beyond a few pieces.

[BibT_eX]

[DOI]

Erik D. Demaine

Matias Korman

Jason S. Ku

Joseph S. B. Mitchell

Comput. Geom., 2020

Balanced line separators of unit disk graphs.

[BibT_eX]

[DOI]

Comput. Geom., 2020

Routing in polygonal domains.

[BibT_eX]

[DOI]

Comput. Geom., 2020

Routing in Histograms.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation - 14th International Conference, 2020

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

Packing plane spanning graphs with short edges in complete geometric graphs.

[BibT_eX]

[DOI]

Comput. Geom., 2019

Dynamic Graph Coloring.

[BibT_eX]

[DOI]

Algorithmica, 2019

Understanding Movement in Context with Heterogeneous Data.

[BibT_eX]

[DOI]

Proceedings of the 1st ACM SIGSPATIAL International Workshop on Computing with Multifaceted Movement Data, 2019

2018

Improved time-space trade-offs for computing Voronoi diagrams.

[BibT_eX]

[DOI]

J. Comput. Geom., 2018

Line segment covering of cells in arrangements.

[BibT_eX]

[DOI]

Matias Korman

Sheung-Hung Poon

Inf. Process. Lett., 2018

Time-space trade-offs for triangulations and Voronoi diagrams.

[BibT_eX]

[DOI]

Comput. Geom., 2018

2017

Hanabi is NP-hard, even for cheaters who look at their cards.

[BibT_eX]

[DOI]

Jean-François Baffier

Theor. Comput. Sci., 2017

On interference among moving sensors and related problems.

[BibT_eX]

[DOI]

J. Comput. Geom., 2017

Time-space trade-offs for triangulating a simple polygon.

[BibT_eX]

[DOI]

J. Comput. Geom., 2017

Routing in Polygons with Holes.

[BibT_eX]

[DOI]

CoRR, 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

Packing Short Plane Spanning Graphs in Complete Geometric Graphs.

[BibT_eX]

[DOI]

CoRR, 2017

Snipperclips: Cutting Tools into Desired Polygons using Themselves.

[BibT_eX]

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

2016

Point Location.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Distance-sensitive planar point location.

[BibT_eX]

[DOI]

Comput. Geom., 2016

Packing Short Plane Spanning Trees in Complete Geometric Graphs.

[BibT_eX]

[DOI]

Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

Hanabi is NP-complete, Even for Cheaters who Look at Their Cards.

[BibT_eX]

[DOI]

Jean-François Baffier

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

2015

On Kinetic Range Spaces and their Applications.

[BibT_eX]

[DOI]

CoRR, 2015

2013

Distance-Sensitive Planar Point Location.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 13th International Symposium, 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

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 convex hulls and delaunay triangulations in the black-box model.

[BibT_eX]

[DOI]