Sciweavers

1672 search results - page 40 / 335
» Tightness problems in the plane
Sort
View
COMPGEOM
2005
ACM
13 years 10 months ago
Kinetic sorting and kinetic convex hulls
Let S be a set of n points moving on the real line. The kinetic sorting problem is to maintain a data structure on the set S that makes it possible to quickly generate a sorted li...
Mohammad Ali Abam, Mark de Berg
IEEEARES
2009
IEEE
14 years 3 months ago
Routing Protocol Security Using Symmetric Key Based Techniques
—In this paper, we address the security of routing protocols. Internet routing protocols are subject to attacks in the control plane as well as the data plane. In the control pla...
Bezawada Bruhadeshwar, Kishore Kothapalli, M. Poor...
ICRA
2007
IEEE
174views Robotics» more  ICRA 2007»
14 years 3 months ago
Full Motion Tracking in Ultrasound Using Image Speckle Information and Visual Servoing
— This paper presents a new visual servoing method that is able to stabilize a moving area of soft tissue within an ultrasound B-mode imaging plane. The approach consists of movi...
Alexandre Krupa, Gabor Fichtinger, Gregory D. Hage...
CAGD
2004
113views more  CAGD 2004»
13 years 8 months ago
Developable surface fitting to point clouds
Given a set of data points as measurements from a developable surface, the present paper investigates the recognition and reconstruction of these objects. We investigate the set o...
Martin Peternell
ESA
2010
Springer
188views Algorithms» more  ESA 2010»
13 years 6 months ago
Contractions of Planar Graphs in Polynomial Time
Abstract. We prove that for every graph H, there exists a polynomial-time algorithm deciding if a planar graph can be contracted to H. We introduce contractions and topological min...
Marcin Kaminski, Daniël Paulusma, Dimitrios M...