Sciweavers

756 search results - page 2 / 152
» A new algorithm for Boolean operations on general polygons
Sort
View
COMPGEOM
1995
ACM
13 years 8 months ago
Representation and Computation of Boolean Combinations of Sculptured Models
We outline an algorithm and implementation of a system that computes Boolean combinations of sculptured solids. We represent the surface of the solids in terms of trimmed and untr...
Shankar Krishnan, Atul Narkhede, Dinesh Manocha
COMPGEOM
2004
ACM
13 years 10 months ago
Inner and outer rounding of set operations on lattice polygonal regions
Robustness problems due to the substitution of the exact computation on real numbers by the rounded floating point arithmetic are often an obstacle to obtain practical implementa...
Olivier Devillers, Philippe Guigue
SIBGRAPI
2005
IEEE
13 years 10 months ago
Boolean Operations on Surfel-Bounded Objects Using Constrained BSP-Trees
Point-based modeling and rendering is an active area of research in Computer Graphics. The concept of points with attributes (e.g. normals) is usually referred to as surfels, and ...
Marcus A. C. Farias, Carlos Eduardo Scheidegger, J...
GEOINFO
2007
13 years 6 months ago
Polygon Clipping and Polygon Reconstruction
Polygon clipping is an important operation that computers execute all the time. An algorithm that clips a polygon is rather complex. Each edge of the polygon must be tested against...
Leonardo Guerreiro Azevedo, Ralf Hartmut Güti...
ICPR
2004
IEEE
14 years 6 months ago
Pattern Matching by Sequential Subdivision of Transformation Space
Pattern matching is a well-known pattern recognition technique. This paper proposes a novel pattern matching algorithm that searches transformation space by sequential subdivision...
Mingtian Ni, Stephen E. Reichenbach