Repositorio de producción científica de la Universidad de Sevilla

Verification of partitions of 2d and 3d objects

 

Advanced Search
 
Opened Access Verification of partitions of 2d and 3d objects
Cites
Show item statistics
Icon
Export to
Author: Palios, Leonidas
Date: 2004
Document type: Presentation
Abstract: 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.
Size: 96.66Kb
Format: PDF

URI: http://hdl.handle.net/11441/55360

This work is under a Creative Commons License: 
Attribution-NonCommercial-NoDerivatives 4.0 Internacional

This item appears in the following Collection(s)