Zsolt Lángi

dblp:22/2875 · DBLP profile ↗

← Back

8ranked-venue papers

0as first author

4since 2021 · last 2026

0000-0002-5999-5343ORCID · verified

Graphics, computer vision, multimedia, augmented reality and games · 5 · 2 since 2021Theory of computation · 3 · 2 since 2021

Year	Publication	Venue	Position
2026	Selected topics from the theory of intersections of balls Károly Bezdek, Zsolt Lángi, Márton Naszódi	Discret. Appl. Math.	2
2024	Corrigendum to "An algorithm to find maximum area polygons circumscribed about a convex polygon" [Discrete Appl. Math. 255 (2019) 98-108] Markus Ausserhofer, Susanna Dann, Zsolt Lángi, Géza Tóth 0001	Discret. Appl. Math.	3
2024	From the Separable Tammes Problem to Extremal Distributions of Great Circles in the Unit Sphere Károly Bezdek, Zsolt Lángi	Discret. Comput. Geom.	2
2022	Extremal convex polygons inscribed in a given convex polygon abstract A convex polygon Q is inscribed in a convex polygon P if every side of P contains at least one vertex of Q. We present algorithms for finding a minimum area and a minimum perimeter convex polygon inscribed in any given convex n-gon in O(n) and O(n3) time, respectively. We also investigate other variants of this problem. Csenge Lili Ködmön, Zsolt Lángi	Comput. Geom.	2
2020	Bounds for Totally Separable Translative Packings in the Plane Károly Bezdek, Zsolt Lángi	Discret. Comput. Geom.	2
2019	An algorithm to find maximum area polygons circumscribed about a convex polygon Markus Ausserhofer, Susanna Dann, Zsolt Lángi, Géza Tóth 0001	Discret. Appl. Math.	3
2016	On Non-separable Families of Positive Homothetic Convex Bodies Károly Bezdek, Zsolt Lángi	Discret. Comput. Geom.	2
2007	Ball-Polyhedra Károly Bezdek, Zsolt Lángi, Márton Naszódi, Peter Papez	Discret. Comput. Geom.	2