Sciweavers

15 search results - page 1 / 3
» Improved Binary Space Partition merging
Sort
View
CAD
2008
Springer
13 years 4 months ago
Improved Binary Space Partition merging
This paper presents a new method for evaluating boolean set operations between Binary Space Partition (BSP) trees. Our algorithm has many desirable features including both numeric...
Mikola Lysenko, Roshan D'Souza, Ching-Kuan Shene
IMR
2003
Springer
13 years 9 months ago
BSP-Assisted Constrained Tetrahedralization
In this paper we tackle the problem of tetrahedralization by breaking non-convex polyhedra into convex subpolyhedra, tetrahedralizing these convex subpolyhedra and merging them to...
Bhautik Joshi, Sébastien Ourselin
ICIP
2009
IEEE
13 years 2 months ago
A contrario hierarchical image segmentation
Hierarchies are a powerful tool for image segmentation, they produce a multiscale representation which allows to design robust algorithms and can be stored in tree-like structures...
Juan Cardelino, Vicent Caselles, Marcelo Bertalm&i...
SIBGRAPI
2006
IEEE
13 years 10 months ago
Point set compression through BSP quantization
This work introduces a new compression scheme for point sets. This scheme relies on an adaptive binary space partition (BSP) which takes into account the geometric structure of the...
Alex Laier Bordignon, Thomas Lewiner, Hélio...
ISSTA
1998
ACM
13 years 8 months ago
Improving Efficiency of Symbolic Model Checking for State-Based System Requirements
We present various techniques for improving the time and space efficiency of symbolic model checking for system requirements specified as synchronous finite state machines. We use...
William Chan, Richard J. Anderson, Paul Beame, Dav...