Sciweavers

31 search results - page 2 / 7
» Continuous foldability of polygonal paper
Sort
View
CCCG
2007
13 years 8 months ago
Generalized Watchman Route Problem with Discrete View Cost
In this paper, we introduce a generalized version of the Watchman Route Problem (WRP) where the objective is to plan a continuous closed route in a polygon (possibly with holes) a...
Pengpeng Wang, Ramesh Krishnamurti, Kamal Gupta
NIPS
1998
13 years 8 months ago
A Polygonal Line Algorithm for Constructing Principal Curves
Principal curves have been defined as "self consistent" smooth curves which pass through the "middle" of a d-dimensional probability distribution or data cloud...
Balázs Kégl, Adam Krzyzak, Tam&aacut...
CW
2003
IEEE
13 years 12 months ago
Mesh Generation and Refinement of Polygonal Data Sets
This paper presents work in progress and continues a project devoted to developing shape modeling system based on implementation of radial based function (RBF) technology. In this...
Vladimir V. Savchenko, Irina B. Semenova, Nikita K...
IJRR
2002
129views more  IJRR 2002»
13 years 6 months ago
Deformable Free-Space Tilings for Kinetic Collision Detection
We present kinetic data structures for detecting collisions between a set of polygons that are moving continuously. Unlike classical collision detection methods that rely on bound...
Pankaj K. Agarwal, Julien Basch, Leonidas J. Guiba...
ADCM
2006
101views more  ADCM 2006»
13 years 6 months ago
A general construction of barycentric coordinates over convex polygons
Barycentric coordinates are unique for triangles, but there are many possible generalizations to convex polygons. In this paper we derive sharp upper and lower bounds on all baryc...
Michael S. Floater, Kai Hormann, Géza K&oac...