Sciweavers

1557 search results - page 9 / 312
» On measuring areas of polygons
Sort
View
WSCG
2004
156views more  WSCG 2004»
14 years 11 months ago
Efficient Collision Detection between 2D Polygons
Collision detection between moving objects is an open question which raises major problems concerning its algorithmic complexity. In this paper we present a polygon collision dete...
Juan José Jiménez, Rafael Jesú...
GEOINFORMATICA
2008
144views more  GEOINFORMATICA 2008»
14 years 9 months ago
Area Collapse and Road Centerlines based on Straight Skeletons
Skeletonization of polygons is a technique, which is often applied to problems of cartography and geographic information science. Especially it is needed for generalization tasks ...
Jan-Henrik Haunert, Monika Sester
82
Voted
CGVR
2006
14 years 11 months ago
Real-time Computation of Area Shadows - A Geometrical Algorithm
The computation of soft shadows created by area light sources is a well-known problem in computer graphics. Due to the complexity of the problem, soft shadows commonly are generat...
Michael Boehl, Wolfgang Stürzlinger
GD
2003
Springer
15 years 2 months ago
Drawing Area-Proportional Venn and Euler Diagrams
We consider the problem of drawing Venn diagrams for which each region’s area is proportional to some weight (e.g., population or percentage) assigned to that region. These area-...
Stirling Chow, Frank Ruskey
NA
2007
118views more  NA 2007»
14 years 9 months ago
Extrapolation methods for approximating arc length and surface area
A well-known method of estimating the length of a parametric curve in Rd is to sample some points from it and compute the length of the polygon passing through them. In this paper...
Michael S. Floater, Atgeirr F. Rasmussen, Ulrich R...