The Geometric Algorithms Lab is a research group at Ulsan National Institute of Technology (UNIST). Led by Dr. Antoine Vigneron, Associate Professor of Computer Science and Engineering, our team conducts research in computational geometry, and focuses on the design and analysis of worst-case efficient algorithms for geometric problems.
Our research areas include:
Geometric optimization refers to optimization problems involving geometric objects such as points, lines or balls. These problems are motivated by applications in operations research, statistics and computer vision.
The goal is to find feasible or optimal paths in geometric environments. This can involve obstacles, direction constraints and anistropic metrics.
The straight skeleton of a polygon is a straight-line graph obtained as the trace of the vertices when the polygon is shrunk, each edge moving at the same speed. This structure has many applications, such as the efficient computation of offset polygons and can give the edges of a roof from a building groundplan. .
- Reachability in a planar subdivision with direction constraints. Daniel Binham, Pedro Machado Manhães de Castro and Antoine Vigneron. In Proc. 33rd International Symposium on Computational Geometry (SoCG 2017), pages 17:1-17:15.
- A faster algorithm for computing straight skeletons. Siu-Wing Cheng, Liam Mencel and Antoine Vigneron. ACM Transactions on Algorithms 12(3): 44 (2016). Manuscript in arXiv:1405.4691.
- A faster algorithm for computing motorcycle graphs. Antoine Vigneron and Lie Yan. Discrete & Computational Geometry 52(3): 492-514 (2014). Special issue on SoCG 2013. Manuscript in arXiv:1303.5958.
- Geometric optimization and sums of algebraic functions. Antoine Vigneron. ACM Transactions on Algorithms 10(1):4 (2014). Manuscript.
- Fitting a step function to a point set. Hervé Fournier and Antoine Vigneron. Algorithmica 60(1): 95-109 (2011). On invitation, special issue on ESA 2008. Manuscript, slides.