Sciweavers

64 search results - page 4 / 13
» Resultant-Based Methods for Plane Curves Intersection Proble...
Sort
View
CORR
2010
Springer
103views Education» more  CORR 2010»
13 years 7 months ago
On Graph Crossing Number and Edge Planarization
Given an n-vertex graph G, a drawing of G in the plane is a mapping of its vertices into points of the plane, and its edges into continuous curves, connecting the images of their ...
Julia Chuzhoy, Yury Makarychev, Anastasios Sidirop...
EJC
2010
13 years 7 months ago
Perfect matchings with restricted intersection in cubic graphs
A conjecture of G. Fan and A. Raspaud asserts that every bridgeless cubic graph contains three perfect matchings with empty intersection. We suggest a possible approach to problem...
Tomás Kaiser, André Raspaud
JMIV
2000
125views more  JMIV 2000»
13 years 7 months ago
Recognizing 3D Objects Using Tactile Sensing and Curve Invariants
A general paradigm for recognizing 3D objects is offered, and applied to some geometric primitives (spheres, cylinders, cones, and tori). The assumption is that a curve on the surf...
Daniel Keren, Ehud Rivlin, Ilan Shimshoni, Isaac W...
COMGEO
2006
ACM
13 years 7 months ago
An exact and efficient approach for computing a cell in an arrangement of quadrics
We present an approach for the exact and efficient computation of a cell in an arrangement of quadric surfaces. All calculations are based on exact rational algebraic methods and ...
Elmar Schömer, Nicola Wolpert
BMVC
1998
13 years 8 months ago
Planar Curve Representation and Matching
In this paper, we discuss a method for representing and matching planar curves. The technique is based on using calculations from concentric circles to represent each curve by two...
Maher Al-Khaiyat, Farhad Kamangar