Sciweavers

736 search results - page 90 / 148
» Distinguishing geometric graphs
Sort
View
IROS
2006
IEEE
204views Robotics» more  IROS 2006»
15 years 5 months ago
Distributed Sensing and Prediction of Obstacle Motions for Mobile Robot Motion Planning
— This work recommends an architecture and its fundamental components for motion planning for mobile robots in dynamic environments. An adaptive behavior to typical motion patter...
Thorsten Rennekamp, Kai Homeier, Torsten Kroeger
SGP
2003
15 years 1 months ago
Stellar Subdivision Grammars
In this paper we develop a new description for subdivision surfaces based on a graph grammar formalism. Subdivision schemes are specified by a context sensitive grammar in which ...
Luiz Velho
CAGD
2006
73views more  CAGD 2006»
14 years 12 months ago
Rational surfaces with linear normals and their convolutions with rational surfaces
It is shown that polynomial (or rational) parametric surfaces with a linear field of normal vectors are dual to graphs bivariate polynomials (or rational functions). We discuss th...
Maria Lucia Sampoli, Martin Peternell, Bert Jü...
JCT
2006
69views more  JCT 2006»
14 years 12 months ago
The Bergman complex of a matroid and phylogenetic trees
We study the Bergman complex B(M) of a matroid M: a polyhedral complex which arises in algebraic geometry, but which we describe purely combinatorially. We prove that a natural su...
Federico Ardila, Caroline J. Klivans
WADS
1993
Springer
163views Algorithms» more  WADS 1993»
15 years 4 months ago
Minimum Weight Euclidean Matching and Weighted Relative Neighborhood Graphs
The Minimum Weight Euclidean Matching (MWEM) problem is: given 2n point sites in the plane with Euclidean metric for interpoint distances, match the sites into n pairs so that the...
Andy Mirzaian