발행물

전체 논문

194

1

Farthest-point Voronoi diagrams in the presence of rectangular obstacles.
2022

2

A New Balanced Subdivision of a Simple Polygon for Time-Space Trade-off Algorithms.
Algorithmica, 2019

3

Voronoi Diagrams for a Moderate-Sized Point-Set in a Simple Polygon.
Discrete & Computational Geometry, 2019

4

Point Location in Dynamic Planar Subdivisions.
1970

5

A linear-time algorithm for the geodesic center of a simple polygon.
Discrete & Computational Geometry, 2016

6

Reachability by paths of bounded curvature in a convex polygon.
Computational Geometry: Theory and Applications, 2012

7

Minimum Convex Hull and Maximum Overlap of Two Convex Polytopes.
36th ACM-SIAM Symposium on Discrete Algorithms (SODA 2025), 2025

8

Largest similar copies of convex polygons in polygonal domains.
41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2021), 2021

9

Minimum Convex Container of Two Convex Polytopes under Translations.
Computational Geometry: Theory and Applications, 2019

10

Overlap of Convex Polytopes under Rigid Motion.
Computational Geometry: Theory and Applications, 2014