Computing smallest convex intersecting polygons
A polygon $C$ is an intersecting polygon for a set $\mathcal{O}$ of objects in $\mathbb{R}^2$ if $C$ intersects each object in $\mathcal{O}$, where the polygon includes its interior. We study the problem of computing the minimum-perimeter intersecting polygon and the minimum-area convex intersectin...
Kaydedildi:
| Asıl Yazarlar: | , , , |
|---|---|
| Materyal Türü: | Artigo |
| Dil: | Inglês |
| Baskı/Yayın Bilgisi: |
Carleton University
2025-04-01
|
| Seri Bilgileri: | Journal of Computational Geometry |
| Online Erişim: | https://jocg.org/index.php/jocg/article/view/4441 |
| Etiketler: |
Etiket eklenmemiş, İlk siz ekleyin!
|