94 search results - page 7 / 19 » Minimum-Perimeter Intersecting Polygons |
CGF
2010
13 years 6 months ago
2010
In this paper we present a novel method to compute Boolean operations on polygonal meshes. Given a Boolean expression over an arbitrary number of input meshes we reliably and effi...
COMPGEOM
2006
ACM
14 years 21 days ago
2006
ACM
Abstract This paper describes an algorithm for generating a guaranteed intersectionfree interpolation sequence between any pair of compatible polygons. Our algorithm builds on prio...
ICIAP
2007
ACM
13 years 10 months ago
2007
ACM
We describe a new decomposition algorithm for twodimensional, polygonal shapes. The algorithm first finds a set of overlapping ribbon-like subshapes ("ribbons") by group...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
The problem of finding "small" sets that meet every straight-line which intersects a given convex region was initiated by Mazurkiewicz in 1916. We call such a set an opa...
STOC
2003
ACM
14 years 7 months ago
2003
ACM
We initiate an investigation of sublinear algorithms for geometric problems in two and three dimensions. We give optimal algorithms for intersection detection of convex polygons a...