Sciweavers

450 search results - page 36 / 90
» Quadrangulations of Planar Sets
Sort
View
DM
2002
104views more  DM 2002»
13 years 9 months ago
A polynomial time algorithm for determining zero Euler-Petrie genus of an Eulerian graph
A dual-eulerian graph is a plane graph which has an ordering defined on its edge set which forms simultaneously an Euler circuit in the graph and an euler circuit in the dual grap...
Brigitte Servatius, Herman Servatius
IPL
2002
65views more  IPL 2002»
13 years 8 months ago
A new bound for map labeling with uniform circle pairs
Given a planar point set, we wish to label the points with uniform circular labels such that each input point lies on the boundary of two labels, none of the interiors of the labe...
Michael J. Spriggs, J. Mark Keil
ICCV
2005
IEEE
14 years 11 months ago
Prior-Based Segmentation by Projective Registration and Level Sets
Object detection and segmentation can be facilitated by the availability of a reference object. However, accounting for possible transformations between the different object views...
Tammy Riklin-Raviv, Nahum Kiryati, Nir A. Sochen
ICRA
2007
IEEE
197views Robotics» more  ICRA 2007»
14 years 3 months ago
Detecting and Tracking Level Sets of Scalar Fields using a Robotic Sensor Network
— We introduce an algorithm which detects and traces a specified level set of a scalar field (a contour) on a plane. A network of static sensor nodes with limited communication...
Karthik Dantu, Gaurav S. Sukhatme
IPPS
2002
IEEE
14 years 2 months ago
Dominating Set Based Bluetooth Scatternet Formation with Localized Maintenance
This paper addresses the problem of scatternet formation and maintenance for multi-hop Bluetooth based personal area and ad hoc networks with minimal communication overhead. Each ...
Ivan Stojmenovic