Sciweavers

192 search results - page 7 / 39
» Cut Points in PEG
Sort
View
DCG
2010
75views more  DCG 2010»
14 years 9 months ago
Star Unfolding Convex Polyhedra via Quasigeodesic Loops
We extend the notion of star unfolding to be based on a quasigeodesic loop Q rather than on a point. This gives a new general method to unfold the surface of any convex polyhedron ...
Jin-ichi Itoh, Joseph O'Rourke, Costin Vîlcu
DCG
2008
93views more  DCG 2008»
14 years 9 months ago
Metric Combinatorics of Convex Polyhedra: Cut Loci and Nonoverlapping Unfoldings
Let S be the boundary of a convex polytope of dimension d + 1, or more generally let S be a convex polyhedral pseudomanifold. We prove that S has a polyhedral nonoverlapping unfold...
Ezra Miller, Igor Pak
ICCV
2007
IEEE
15 years 11 months ago
Separating Parts from 2D Shapes using Relatability
It's often important to analyze shapes as made up of parts. But there are two ways to think of how parts fit together. We can characterize the remainder of a shape after a pa...
Xiaofeng Mi, Douglas DeCarlo
IUI
2012
ACM
13 years 5 months ago
Using intelligent natural user interfaces to support sales conversations
During sales conversations, gestures and mimics are of high importance to communicate information about a product. One prominent example for such sales gestures is the meat and ch...
Sven Gehring, Markus Löchtefeld, Florian Daib...
PG
2007
IEEE
15 years 3 months ago
Precomputed Visibility Cuts for Interactive Relighting with Dynamic BRDFs
This paper presents a novel PRT-based method that uses precomputed visibility cuts for interactive relighting with all-frequency environment maps and arbitrary dynamic BRDFs. Our ...
Oskar Åkerlund, Mattias Unger, Rui Wang