Sciweavers

969 search results - page 1 / 194
» A New Metric Between Polygons and How to Compute it
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
COMGEO
2004
ACM
13 years 4 months ago
Kinetic collision detection between two simple polygons
We design a kinetic data structure for detecting collisions between two simple polygons in motion. In order to do so, we create a planar subdivision of the free space between the ...
Julien Basch, Jeff Erickson, Leonidas J. Guibas, J...
VISUALIZATION
2002
IEEE
13 years 9 months ago
Compressing Polygon Mesh Geometry with Parallelogram Prediction
In this paper we present a generalization of the geometry coder by Touma and Gotsman [34] to polygon meshes. We let the polygon information dictate where to apply the parallelogra...
Martin Isenburg, Pierre Alliez
CG
2005
Springer
13 years 4 months ago
A new algorithm for Boolean operations on general polygons
A new algorithm for Boolean operations on general planar polygons is presented. It is available for general planar polygons (manifold or non-manifold, with or without holes). Edge...
Yu Peng, Jun-Hai Yong, Wei-Ming Dong, Hui Zhang, J...