Sciweavers

90 search results - page 17 / 18
» Formalizing complex plane geometry
Sort
View
CHI
2006
ACM
14 years 10 months ago
"Sketching" nurturing creativity: commonalities in art, design, engineering and research
icians or philosophers use abstract symbols to derive formulas or form proofs. Indeed, these sketches are structural geometric proofs, consistent with Plato's supposition that...
Kumiyo Nakakoji, Atau Tanaka, Daniel Fallman
ICCV
2007
IEEE
14 years 11 months ago
Coplanar Shadowgrams for Acquiring Visual Hulls of Intricate Objects
Acquiring 3D models of intricate objects (like tree branches, bicycles and insects) is a hard problem due to severe self-occlusions, repeated thin structures and surface discontin...
Shuntaro Yamazaki, Srinivasa G. Narasimhan, Simon ...
STOC
2006
ACM
92views Algorithms» more  STOC 2006»
14 years 10 months ago
On the importance of idempotence
Range searching is among the most fundamental problems in computational geometry. An n-element point set in Rd is given along with an assignment of weights to these points from so...
Sunil Arya, Theocharis Malamatos, David M. Mount
SI3D
2003
ACM
14 years 3 months ago
Shear-image order ray casting volume rendering
This paper describes shear-image order ray casting, a new method for volume rendering. This method renders sampled data in three dimensions with image quality equivalent to the be...
Yin Wu, Vishal Bhatia, Hugh C. Lauer, Larry Seiler
VMV
2004
185views Visualization» more  VMV 2004»
13 years 11 months ago
Convexification of Unstructured Grids
Unstructured tetrahedral grids are a common data representation of three-dimensional scalar fields. For convex unstructured meshes efficient rendering methods are known. For conca...
Stefan Röttger, Stefan Guthe, Andreas Schiebe...