Ponencia
Verification of partitions of 2d and 3d objects
Autor/es | Palios, Leonidas |
Fecha de publicación | 2004 |
Fecha de depósito | 2017-03-06 |
Publicado en |
|
Resumen | We consider the problems of deciding whether a given collection of polygons (polyhedra resp.) forms (i) a partition or (ii) a cell complex decomposition of a given polygon (polyhedron resp.). We describe simple O(n log ... We consider the problems of deciding whether a given collection of polygons (polyhedra resp.) forms (i) a partition or (ii) a cell complex decomposition of a given polygon (polyhedron resp.). We describe simple O(n log n)-time and O(n)-space algorithms for these problems, where n is the total description size of the input. If, in the input, vertices are referenced by means of indices to an array of distinct vertices, then our cell complex decomposition verification algorithms run in O(n) time. |
Cita | Palios, L. (2004). Verification of partitions of 2d and 3d objects. En 20th European Workshop on Computational Geometry, Sevilla. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
Verification of partitions of ... | 96.66Kb | [PDF] | Ver/ | |