3025 search results - page 241 / 605 » Computational geometry: a retrospective |
199
click to vote
ICCV
2003
IEEE
16 years 8 months ago
2003
IEEE
This paper presents a framework to reconstruct a scene captured in multiple camera views based on a prior model of the scene geometry. The framework is applied to the capture of a...
174
click to vote
COMPGEOM
2009
ACM
16 years 1 months ago
2009
ACM
We describe the first algorithms to compute minimum cuts in surface-embedded graphs in near-linear time. Given an undirected graph embedded on an orientable surface of genus g, w...
188
click to vote
ICCSA
2007
Springer
16 years 24 days ago
2007
Springer
Abstract. Determining whether two segments s and t in a planar polygonal scene weakly see each other is a classical problem in computational geometry. In this problem we seek for a...
167
click to vote
COMPGEOM
2004
ACM
16 years 2 days ago
2004
ACM
The computation of Delaunay triangulations from static point sets has been extensively studied in computational geometry. When the points move with known trajectories, kinetic dat...
179
click to vote
GRID
2004
Springer
16 years 23 hour ago
2004
Springer
In this paper we present the MASSIVE project that aims to use Grid technology to establish an enabling environment for distributed simulation and visualization of large-scale scie...