2980 search results - page 538 / 596 » Computational Geometry |
129
click to vote
STACS
2010
Springer
15 years 10 months ago
2010
Springer
We revisit several maximization problems for geometric networks design under the non-crossing constraint, first studied by Alon, Rajagopalan and Suri (ACM Symposium on Computation...
126
click to vote
FOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
We prove the existence of an algorithm A for computing 2-d or 3-d convex hulls that is optimal for every point set in the following sense: for every set S of n points and for ever...
143
Voted
VISUALIZATION
2005
IEEE
15 years 9 months ago
2005
IEEE
We present a robust method for 3D reconstruction of closed surfaces from sparsely sampled parallel contours. A solution to this problem is especially important for medical segment...
140
Voted
GRAPHITE
2005
ACM
15 years 9 months ago
2005
ACM
Linear perspective is a good approximation to the format in which the human visual system conveys 3D scene information to the brain. Artists expressing 3D scenes, however, create ...
135
Voted
NPAR
2010
ACM
15 years 8 months ago
2010
ACM
We present a simple technique for creating fluid silhouettes described with vector graphics, which we call ”Vector Fluid.” In our system, a solid region in the fluid is repr...