Sciweavers

71 search results - page 4 / 15
» Touring a sequence of polygons
Sort
View
TYPES
2000
Springer
13 years 11 months ago
A Tour with Constructive Real Numbers
Abstract. The aim of this work is to characterize constructive real numbers through a minimal axiomatization. We introduce, discuss and justify 16 constructive axioms. Then we addr...
Alberto Ciaffaglione, Pietro Di Gianantonio
RT
1997
Springer
13 years 11 months ago
Nailboards: A Rendering Primitive for Image Caching in Dynamic Scenes
Abstract. This paper proposes a simple augmentation to texture mapping hardware which produces the correct depth buffer content and hence correct visibility when replacing complex ...
Gernot Schaufler
ICRA
2005
IEEE
173views Robotics» more  ICRA 2005»
14 years 1 months ago
Decision Networks for Repair Strategies in Speech-Based Interaction with Mobile Tour-Guide Robots
– The main task of a voice-enabled tour-guide robot in mass exhibition setting is to engage visitors in dialogue and provide as much exhibit information as possible in a limited ...
Plamen J. Prodanov, Andrzej Drygajlo
COMPGEOM
2006
ACM
14 years 1 months ago
Refolding planar polygons
Abstract This paper describes an algorithm for generating a guaranteed intersectionfree interpolation sequence between any pair of compatible polygons. Our algorithm builds on prio...
Hayley N. Iben, James F. O'Brien, Erik D. Demaine
CAGD
2008
124views more  CAGD 2008»
13 years 7 months ago
All triangulations are reachable via sequences of edge-flips: an elementary proof
A simple proof is provided for the fact that the set of all possible triangulations of a planar point set in a polygonal domain is closed under the basic diagonal flip operation.
Eliyahu Osherovich, Alfred M. Bruckstein