Elena Arseneva

Rahul Gangopadhyay

Aleksandra Istomina

J. Graph Algorithms Appl., 2023

Editorial.

[BibT_eX]

[DOI]

Tamara Mchedlidze

Comput. Geom., 2023

2022

Discretization to Prove the Nonexistence of "Small" Common Unfoldings Between Polyhedra.

[BibT_eX]

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

2021

Rectilinear link diameter and radius in a rectilinear polygonal domain.

[BibT_eX]

[DOI]

Comput. Geom., 2021

Upward Point Set Embeddings of Paths and Trees.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 2021

2020

A Complete List of All Convex Polyhedra Made by Gluing Regular Pentagons.

[BibT_eX]

[DOI]

Boris Zolotov

J. Inf. Process., 2020

Sublinear Explicit Incremental Planar Voronoi Diagrams.

[BibT_eX]

[DOI]

J. Inf. Process., 2020

Which Convex Polyhedra Can Be Made by Gluing Regular Hexagons?

[BibT_eX]

[DOI]

Graphs Comb., 2020

Upward Point Set Embeddings of Paths and Trees.

[BibT_eX]

[DOI]

CoRR, 2020

Flips in Higher Order Delaunay Triangulations.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2020: Theoretical Informatics, 2020

2019

Pole Dancing: 3D Morphs for Tree Drawings.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2019

Randomized incremental construction for the Hausdorff Voronoi diagram revisited and extended.

[BibT_eX]

[DOI]

J. Comb. Optim., 2019

Reconstructing a Convex Polygon from Its \omega ω -cloud.

[BibT_eX]

[DOI]

Proceedings of the Computer Science - Theory and Applications, 2019

2018

Reconstructing a convex polygon from its ω-cloud.

[BibT_eX]

[DOI]

CoRR, 2018

Stabbing Circles for Sets of Segments in the Plane.

[BibT_eX]

[DOI]

Mercè Claverol

Maria Saumell

Carlos Seara

Algorithmica, 2018

Dynamic Smooth Compressed Quadtrees.

[BibT_eX]

[DOI]

Ivor van der Hoog

Maarten Löffler

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

Compatible Paths on Labelled Point Sets.

[BibT_eX]

[DOI]

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

2017

Dynamic smooth compressed quadtrees (Fullversion).

[BibT_eX]

[DOI]

Ivor van der Hoog

Maarten Löffler

CoRR, 2017

Searching Edges in the Overlap of Two Plane Graphs.

[BibT_eX]

[DOI]

John Iacono

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

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

[BibT_eX]

[DOI]

Maarten Löffler

Proceedings of the Computer Science - Theory and Applications, 2017

2016

Randomized Incremental Construction for the Hausdorff Voronoi Diagram of point clusters.

[BibT_eX]

[DOI]

CoRR, 2016

A Randomized Incremental Algorithm for the Hausdorff Voronoi Diagram of Non-crossing Clusters.

[BibT_eX]

[DOI]

Panagiotis Cheilaris

Algorithmica, 2016

2015

Linear-Time Algorithms for the Farthest-Segment Voronoi Diagram and Related Tree Structures.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

2014

Linear-Time Algorithms for the Farthest-Segment Voronoi Diagram and Related Tree Structures.

[BibT_eX]

[DOI]

Sandeep K. Dey

CoRR, 2014

A Randomized Incremental Approach for the Hausdorff Voronoi Diagram of Non-crossing Clusters.

[BibT_eX]

[DOI]

Panagiotis Cheilaris