Sciweavers

27 search results - page 5 / 6
» Shortest Paths in Two Intersecting Pencils of Lines
Sort
View
FAW
2008
Springer
225views Algorithms» more  FAW 2008»
13 years 9 months ago
Versioning Tree Structures by Path-Merging
We propose path-merging as a refinement of techniques used to make linked data structures partially persistent. Path-merging supports bursts of operations between any two adjacent ...
Khaireel A. Mohamed, Tobias Langner, Thomas Ottman...
SCALESPACE
2009
Springer
13 years 12 months ago
From a Single Point to a Surface Patch by Growing Minimal Paths
Abstract. We introduce a novel implicit approach for surface patch segmentation in 3D images starting from a single point. Since the boundary surface of an object is locally homeom...
Fethallah Benmansour, Laurent D. Cohen
STACS
2007
Springer
14 years 1 months ago
Light Orthogonal Networks with Constant Geometric Dilation
An orthogonal spanner network for a given set of n points in the plane is a plane straight line graph with axis-aligned edges that connects all input points. We show that for any ...
Adrian Dumitrescu, Csaba D. Tóth
ICDAR
2011
IEEE
12 years 7 months ago
Language-Independent Text Lines Extraction Using Seam Carving
Abstract—In this paper, we present a novel languageindependent algorithm for extracting text-lines from handwritten document images. Our algorithm is based on the seam carving ap...
Raid Saabni, Jihad El-Sana
SPATIALCOGNITION
2004
Springer
14 years 21 days ago
Investigation of Preference Between the Least-Angle Strategy and the Initial Segment Strategy for Route Selection in Unknown Env
This paper presents results from a desktop experiment in which the participants’ route selection behavior in an unknown street network is investigated. The participants were pres...
Hartwig H. Hochmair, Victoria Karlsson