Exact, robust and efficient full visibility computation in the Plücker space

Abstract : We present a set of new techniques to compute an exact polygon-to-polygon visibility in the Plücker space. The contributions are based on the definition of the minimal representation of lines stabbing two convex polygons. The new algorithms are designed to highly discriminates useless computations, which result in more compact visibility data, fastest to exploit, and in a reduced computation time. We also define a simple robust and exact solution to handle degeneracies, where previous methods proposed aggressive solutions.
Type de document :
Article dans une revue
Visual Computer, Springer Verlag, 2007, 23 (9-11), p. 773-782
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00580632
Contributeur : Lilian Aveneau <>
Soumis le : lundi 28 mars 2011 - 18:03:07
Dernière modification le : jeudi 11 janvier 2018 - 06:19:29

Identifiants

  • HAL Id : hal-00580632, version 1

Collections

Citation

Sylvain Charneau, Lilian Aveneau, Laurent Fuchs. Exact, robust and efficient full visibility computation in the Plücker space. Visual Computer, Springer Verlag, 2007, 23 (9-11), p. 773-782. 〈hal-00580632〉

Partager

Métriques

Consultations de la notice

70