default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputational Geometry: Theory and Applications, Volume 51
Volume 51, January 2016
- Dongwoo Park, Sang Won Bae
, Helmut Alt, Hee-Kap Ahn:
Bundling three convex polygons to minimize area or perimeter. 1-14 - Sergey Bereg, Seok-Hee Hong, Naoki Katoh, Sheung-Hung Poon, Shin-ichi Tanigawa:
On the edge crossing properties of Euclidean minimum weight Laman graphs. 15-24 - Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno:
A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares. 25-39 - Matthias Henze, Rafel Jaume:
Bottleneck partial-matching Voronoi diagrams and applications. 40-54 - José Miguel Díaz-Báñez, Marco A. Heredia, Canek Peláez, Joan Antoni Sellarès, Jorge Urrutia, Inmaculada Ventura:
Convex blocking and partial orders on the plane. 55-66 - Sergio Cabello, Otfried Cheong, Christian Knauer, Lena Schlipf:
Finding largest rectangles in convex polygons. 67-74
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-10-22 02:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
