Sciweavers

94 search results - page 3 / 19
» Minimum-Perimeter Intersecting Polygons
Sort
View
ADCM
2007
100views more  ADCM 2007»
13 years 5 months ago
An efficient algorithm for the computation of the metric average of two intersecting convex polygons, with application to morphi
Motivated by the method for the reconstruction of 3D objects from a set of parallel cross sections, based on the binary operation between 2D sets termed “metric average”, we de...
Evgeny Lipovetsky, Nira Dyn
EUROGRAPHICS
2010
Eurographics
14 years 2 months ago
Exact and Robust (Self-)Intersections for Polygonal Meshes
We present a new technique to implement operators that modify the topology of polygonal meshes at intersections and self-intersections. Depending on the modification strategy, th...
Marcel Campen and Leif Kobbelt
DASFAA
2004
IEEE
124views Database» more  DASFAA 2004»
13 years 9 months ago
Polygon and Polyline Join Using Raster Filters
Processing spatial joins efficiently is crucial to rendering the spatial data analysis process feasible. As pointed out in many works, the exact intersection test of two spatial ob...
Rodrigo Salvador Monteiro, Leonardo Guerreiro Azev...
SSDBM
2000
IEEE
109views Database» more  SSDBM 2000»
13 years 10 months ago
Toward Spatial Joins for Polygons
Efficient evaluation of spatial join is an important issue in spatial databases. The traditional evaluation strategy is to perform a join of “minimum bounding rectangles” (mbr...
Hongjun Zhu, Jianwen Su, Oscar H. Ibarra