2980 search results - page 544 / 596 » Computational Geometry |
137
Voted
SIGGRAPH
2000
ACM
15 years 7 months ago
2000
ACM
Visualization of very complex scenes can be significantly accelerated using occlusion culling. In this paper we present a visibility preprocessing method which efficiently compu...
142
Voted
SIBGRAPI
2008
IEEE
15 years 10 months ago
2008
IEEE
Range searching is a fundamental problem in computational geometry. The problem involves preprocessing a set of n points in Rd into a data structure, so that it is possible to det...
146
Voted
VRST
2003
ACM
15 years 8 months ago
2003
ACM
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...
172
Voted
ISCIS
2003
Springer
15 years 8 months ago
2003
Springer
Generating motion and capturing motion of an articulated body for computer animation is an expensive and time-consuming task. Conventionally, animators manually generate intermedia...
139
click to vote
FOCS
2002
IEEE
15 years 8 months ago
2002
IEEE
Two decades ago, Megiddo and Dyer showed that linear programming in two and three dimensions (and subsequently any constant number of dimensions) can be solved in linear time. In ...