279 search results - page 7 / 56 » Implicit Convex Polygons |
TKDE
2002
13 years 7 months ago
2002
Spatial data mining is the discovery of interesting relationships and characteristics that may exist implicitly in spatial databases. To this end, this paper has three main contrib...
CGI
1998
IEEE
13 years 12 months ago
1998
IEEE
This paper describes an incremental polygonization technique for implicit surfaces built from skeletal elements. Our method lends itself for an interactive modeling system as the ...
ESA
2000
Springer
13 years 11 months ago
2000
Springer
Several algorithms for computing the Minkowski sum of two polygons in the plane begin by decomposing each polygon into convex subpolygons. We examine different methods for decompo...
ISAAC
2009
Springer
14 years 2 months ago
2009
Springer
We introduce a new probing problem: what is the minimum number of cameras at fixed positions necessary and sufficient to reconstruct any strictly convex polygon contained in a dis...
CCCG
2010
13 years 9 months ago
2010
In this paper we present a polynomial time algorithm for computing a Hausdorff core of a polygon with a single reflex vertex. A Hausdorff core of a polygon P is a convex polygon Q...