par Aloupis, Greg 
;Bose, Prosenjit ;Dujmović, Vida V.;Gray, Chris;Langerman, Stefan ;Speckmann, Bettina
Référence Computational geometry, 47, 2 PART C, page (296-306)
Publication Publié, 2014
;Bose, Prosenjit ;Dujmović, Vida V.;Gray, Chris;Langerman, Stefan ;Speckmann, BettinaRéférence Computational geometry, 47, 2 PART C, page (296-306)
Publication Publié, 2014
Article révisé par les pairs
| Résumé : | We propose a new model of realistic input: k-guardable objects. An object is k-guardable if its boundary can be seen by k guards. We show that k-guardable polygons generalize two previously identified classes of realistic input. Following this, we give two simple algorithms for triangulating k-guardable polygons. One algorithm requires the guards as input while the other does not. Both take linear time assuming that k is constant and both are easily implementable. © 2013 Published by Elsevier B.V. |
