Sciweavers

1557 search results - page 14 / 312
» On measuring areas of polygons
Sort
View
PSIVT
2007
Springer
110views Multimedia» more  PSIVT 2007»
16 years 5 days ago
Measuring Linearity of Ordered Point Sets
It is often practical to measure how linear a certain ordered set of points is. We are interested in linearity measures which are invariant to rotation, scaling, and translation. T...
Milos Stojmenovic, Amiya Nayak
ESA
2005
Springer
113views Algorithms» more  ESA 2005»
15 years 11 months ago
Online Occlusion Culling
Abstract. Modern computer graphics systems are able to render sophisticated 3D scenes consisting of millions of polygons. For most camera positions only a small collection of these...
Gereon Frahling, Jens Krokowski
CGA
2008
15 years 6 months ago
Viewpoint-Based Ambient Occlusion
Ambient occlusion is a powerful technique that mimics indirect global illumination at a fraction of the cost. In this paper, we introduce a new ambient occlusion technique based o...
Francisco González, Mateu Sbert, Miquel Fei...
SODA
1993
ACM
119views Algorithms» more  SODA 1993»
15 years 7 months ago
Iterated Nearest Neighbors and Finding Minimal Polytopes
We introduce a new method for nding several types of optimal k-point sets, minimizing perimeter, diameter, circumradius, and related measures, by testing sets of the O(k) nearest ...
David Eppstein, Jeff Erickson
PR
2008
100views more  PR 2008»
15 years 6 months ago
Boundary based shape orientation
The computation of a shape's orientation is a common task in the area of computer vision and image processing, being used for example to define a local frame of reference and...
Jovisa D. Zunic, Milos Stojmenovic