Sciweavers

691 search results - page 28 / 139
» Axiomatizing geometric constructions
Sort
View
CCCG
2008
13 years 10 months ago
Memory Requirements for Local Geometric Routing and Traversal in Digraphs
Local route discovery in geometric, strongly connected, undirected plane graphs is guaranteed by the Face Routing algorithm. The algorithm is local and geometric in the sense that...
Maia Fraser, Evangelos Kranakis, Jorge Urrutia
GIS
2008
ACM
13 years 9 months ago
Towards a geometric interpretation of double-cross matrix-based similarity of polylines
One of the formalisms to qualitatively describe polylines in the plane are double-cross matrices. In a double-cross matrix the relative position of any two line segments in a poly...
Bart Kuijpers, Bart Moelans
CAD
2007
Springer
13 years 8 months ago
Interpolation by geometric algorithm
We present a novel geometric algorithm to construct a smooth surface that interpolates a triangular or a quadrilateral mesh of arbitrary topological type formed by n vertices. Alt...
Takashi Maekawa, Yasunori Matsumoto, Ken Namiki
ALGORITHMICA
2000
80views more  ALGORITHMICA 2000»
13 years 8 months ago
Geometric Eccentricity and the Complexity of Manipulation Plans
Complexity bounds for algorithms for robotic motion and manipulation can be misleading when they are constructed with pathological `worst-case' scenarios that rarely appear i...
A. Frank van der Stappen, Kenneth Y. Goldberg
COMSIS
2010
13 years 6 months ago
3D point pattern matching based on spatial geometric flexibility
We propose a new method for matching two 3D point sets of identical cardinality with global similarity but local non-rigid deformations and distribution errors. This problem arises...
Xiaopeng Wei, Xiaoyong Fang, Qiang Zhang, Dongshen...