Sciweavers

15 search results - page 2 / 3
» Isotopy of Polygonal Domains for Generalized Polygons
Sort
View
CGF
2008
126views more  CGF 2008»
14 years 11 months ago
Maximum Entropy Coordinates for Arbitrary Polytopes
Barycentric coordinates can be used to express any point inside a triangle as a unique convex combination of the triangle's vertices, and they provide a convenient way to lin...
K. Hormann, N. Sukumar
MM
2006
ACM
175views Multimedia» more  MM 2006»
15 years 5 months ago
Real-time automatic 3D scene generation from natural language voice and text descriptions
Automatic scene generation using voice and text offers a unique multimedia approach to classic storytelling and human computer interaction with 3D graphics. In this paper, we pre...
Lee M. Seversky, Lijun Yin
123
Voted
COMGEO
2006
ACM
14 years 11 months ago
Computing homotopic shortest paths efficiently
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
Alon Efrat, Stephen G. Kobourov, Anna Lubiw
92
Voted
SIGGRAPH
1999
ACM
15 years 4 months ago
Computing Exact Shadow Irradiance Using Splines
We present a solution to the general problem of characterizing shadows in scenes involving a uniform polygonal area emitter and a polygonal occluder in arbitrary position by manif...
Michael M. Stark, Elaine Cohen, Tom Lyche, Richard...
89
Voted
COMPGEOM
2008
ACM
15 years 1 months ago
Routing a maximum number of disks through a scene of moving obstacles
This video illustrates an algorithm for computing a maximum number of disjoint paths for unit disks moving among a set of dynamic obstacles in the plane. The problem is motivated ...
Joondong Kim, Joseph S. B. Mitchell, Valentin Poli...