4850 search results - page 390 / 970 » Proof and Computation in Geometry |
201
click to vote
ICCSA
2007
Springer
16 years 1 months 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...
172
Voted
COMPGEOM
2004
ACM
16 years 9 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...
186
Voted
GRID
2004
Springer
16 years 7 days 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...
167
Voted
SIGGRAPH
2010
ACM
15 years 11 months ago
2010
ACM
We propose a technique that takes a triangulated surface as input and outputs a surface with the same topology but altered geometry such that each polygon falls into a set of disc...
181
Voted
SIGGRAPH
2010
ACM
15 years 11 months ago
2010
ACM
We show how to greatly accelerate self-collision detection (SCD) for reduced deformable models. Given a triangle mesh and a set of deformation modes, our method precomputes Subspa...