Sciweavers

1557 search results - page 26 / 312
» On measuring areas of polygons
Sort
View
VRST
2003
ACM
15 years 11 months ago
Time-critical collision detection using an average-case approach
We present a novel, generic framework and algorithm for hierarchical collision detection, which allows an application to balance speed and quality of the collision detection. We p...
Jan Klein, Gabriel Zachmann
HICSS
2010
IEEE
196views Biometrics» more  HICSS 2010»
16 years 29 days ago
Combining Phasor Measurements to Monitor Cutset Angles
Power systems under stress can show large voltage angle differences between areas that can be monitored by wide area phasor measurements. One way to make this idea more specific ...
Ian Dobson, Manu Parashar, Chelsea Carter
COMPGEOM
1999
ACM
15 years 10 months ago
Folding Flat Silhouettes and Wrapping Polyhedral Packages: New Results in Computational Origami
We show a remarkable fact about folding paper: From a single rectangular sheet of paper, one can fold it into a flat origami that takes the (scaled) shape of any connected polygo...
Erik D. Demaine, Martin L. Demaine, Joseph S. B. M...
CAD
2011
Springer
15 years 1 months ago
Mesh repair with user-friendly topology control
Limitations of current 3D acquisition technology often lead to polygonal meshes exhibiting a number of geometrical and topological defects which prevent them from widespread use. ...
Franck Hétroy, Stéphanie Rey, Carlos...
FOCS
2008
IEEE
16 years 16 days ago
Learning Geometric Concepts via Gaussian Surface Area
We study the learnability of sets in Rn under the Gaussian distribution, taking Gaussian surface area as the “complexity measure” of the sets being learned. Let CS denote the ...
Adam R. Klivans, Ryan O'Donnell, Rocco A. Servedio