


default search action
Computational Geometry: Theory and Applications, Volume 80
Volume 80, July 2019
- Paz Carmi, Lilach Chaitman-Yerushalmi, Bat-Chen Ozeri:

Minimizing the sum of distances to a server in a constraint network. 1-12 - Akitoshi Kawamura, Sonoko Moriyama

, Yota Otachi, János Pach:
A lower bound on opaque sets. 13-22 - Hee-Kap Ahn

, Sang Won Bae
, Jong Min Choi
, Matias Korman, Wolfgang Mulzer, Eunjin Oh, Ji-won Park, André van Renssen, Antoine Vigneron:
Faster algorithms for growing prioritized disks and rectangles. 23-39 - Sang Won Bae

, Chan-Su Shin
, Antoine Vigneron:
Tight bounds for beacon-based coverage in simple rectilinear polygons. 40-52 - Sattar Sattari

, Mohammad Izadi:
An improved upper bound on dilation of regular polygons. 53-68

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














