Sciweavers

71 search results - page 7 / 15
» Touring a sequence of polygons
Sort
View
ARSCOM
2008
118views more  ARSCOM 2008»
13 years 7 months ago
Proper Partitions of a Polygon and k-Catalan Numbers
Let P be a polygon whose vertices have been colored (labeled) cyclically with the numbers 1, 2, . . . , c. Motivated by conjectures of Propp, we are led to consider partitions of ...
Bruce E. Sagan
CAGD
2008
158views more  CAGD 2008»
13 years 7 months ago
On the deviation of a parametric cubic spline interpolant from its data polygon
When fitting a parametric curve through a sequence of points, it is important in applications that the curve should not exhibit unwanted oscillations. In this paper we take the vi...
Michael S. Floater
CVPR
2011
IEEE
13 years 3 months ago
Clues from the Beaten Path: Location Estimation with Bursty Sequences of Tourist Photos
Image-based location estimation methods typically recognize every photo independently, and their resulting reliance on strong visual feature matches makes them most suited for dis...
Chao-Yeh Chen, Kristen Grauman
GIS
2006
ACM
14 years 8 months ago
Exploiting a page-level upper bound for multi-type nearest neighbor queries
Given a query point and a collection of spatial features, a multi-type nearest neighbor (MTNN) query finds the shortest tour for the query point such that only one instance of eac...
Xiaobin Ma, Shashi Shekhar, Hui Xiong, Pusheng Zha...
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 ...