Sciweavers

24 search results - page 3 / 5
» Rational approximation of vertical segments
Sort
View
COMGEO
2008
ACM
13 years 7 months ago
Approximation of an open polygonal curve with a minimum number of circular arcs and biarcs
We present an algorithm for approximating a given open polygonal curve with a minimum number of circular arcs. In computer-aided manufacturing environments, the paths of cutting t...
Robert L. Scot Drysdale, Günter Rote, Astrid ...
ICCSA
2007
Springer
14 years 1 months ago
Shortest Path Queries Between Geometric Objects on Surfaces
Abstract. We consider geometric shortest path queries between arbitrary pairs of objects on a connected polyhedral surface P of genus g. The query objects are points, vertices, edg...
Hua Guo, Anil Maheshwari, Doron Nussbaum, Jör...
IROS
2007
IEEE
109views Robotics» more  IROS 2007»
14 years 1 months ago
A new approach to segmentation of 2D range scans into linear regions
— Toward obtaining a compact and multiresolution representation of 2D range scans, a wavelet framework is proposed for encoding an orientation measure called Running Angle (RA). ...
Ahad Harati, Roland Siegwart
SIGECOM
2009
ACM
112views ECommerce» more  SIGECOM 2009»
14 years 1 months ago
Network bargaining: algorithms and structural results
We consider models for bargaining in social networks, in which players are represented by vertices and edges represent bilateral opportunities for deals between pairs of players. ...
Tanmoy Chakraborty, Michael Kearns, Sanjeev Khanna
GEOINFO
2003
13 years 8 months ago
A Strategy for the Interpolation of Surfaces through the Use of Basis Functions
For the construction of digital terrain models based on surface interpolation, it is defined a bivariate function ¡£¢¥¤§¦©¨ that interpolates a finite set of  sample ...
Edson Ricardo de Andrade Silva, Creto Augusto Vida...