498 search results - page 2 / 100 » Measuring the Complexity of Polygonal Objects |
GRAPHICSINTERFACE
1997
13 years 7 months ago
1997
This paper presents a system for rendering very large collections of randomly parameterized plants while generating manageable scene geometries for rendering. A given botanical de...
ICRA
2003
IEEE
13 years 11 months ago
2003
IEEE
—We prove a new necessary and sufficient condition for 2D three-finger equilibrium grasps and implement a geometrical algorithm for computing force-closure grasps of polygonal ob...
ICCSA
2007
Springer
14 years 4 days ago
2007
Springer
Abstract. Determining whether two segments s and t in a planar polygonal scene weakly see each other is a classical problem in computational geometry. In this problem we seek for a...
WSCG
2003
13 years 7 months ago
2003
In this paper we present the geometrical construction of an approximate generalized Voronoi diagram for generalized polygons and circular objects based on their minimum geometrica...
DAWAK
2011
Springer
12 years 5 months ago
2011
Springer
In recent years, there has been a large increase in the amount of spatial data obtained from remote sensing, GPS receivers, communication terminals and other domains. Data warehous...