94 search results - page 14 / 19 » Minimum-Perimeter Intersecting Polygons |
TVCG
2008
13 years 6 months ago
2008
Clip art is a simplified illustration form consisting of layered filled polygons or closed curves used to convey 3-D shape information in a 2-D vector graphics format. This paper f...
COMPGEOM
1994
ACM
13 years 10 months ago
1994
ACM
Ray (segment) shooting is the problem of determining the first intersection between a ray (directed line segment) and a collection of polygonal or polyhedral obstacles. In order t...
DCG
2007
13 years 6 months ago
2007
Steinitz’s Theorem states that a graph is the 1-skeleton of a convex polyhedron if and only if it is 3-connected and planar. The polyhedron is called a geometric realization of ...
GIS
2006
ACM
14 years 7 months ago
2006
ACM
Efficient evaluation of spatial queries is an important issue in spatial database. Among spatial operations, spatial join is very useful, intersection being the most common predic...
SIGMOD
2003
ACM
14 years 6 months ago
2003
ACM
Spatial database operations are typically performed in two steps. In the filtering step, indexes and the minimum bounding rectangles (MBRs) of the objects are used to quickly dete...