Sciweavers

127 search results - page 12 / 26
» The Directed Planar Reachability Problem
Sort
View
WADS
2005
Springer
95views Algorithms» more  WADS 2005»
14 years 3 months ago
Improved Approximation Bounds for Planar Point Pattern Matching
We analyze the performance of simple algorithms for matching two planar point sets under rigid transformations so as to minimize the directed Hausdorff distance between the sets....
Minkyoung Cho, David M. Mount
DBPL
1999
Springer
122views Database» more  DBPL 1999»
14 years 2 months ago
A Representation Independent Language for Planar Spatial Databases with Euclidean Distance
Linear constraint databases and query languages are appropriate for spatial database applications. Not only the data model is natural to represent a large portion of spatial data s...
Gabriel M. Kuper, Jianwen Su
CVPR
2003
IEEE
14 years 12 months ago
Transforming Camera Geometry to A Virtual Downward-Looking Camera: Robust Ego-Motion Estimation and Ground-Layer Detection
This paper presents a robust method to solve the two coupled problems: ground layer detection and vehicle egomotion estimation, which appear in visual navigation. We virtually rot...
Qifa Ke, Takeo Kanade
SODA
2000
ACM
114views Algorithms» more  SODA 2000»
13 years 11 months ago
The rectilinear Steiner arborescence problem is NP-complete
Given a set P of points in the first quadrant, a Rectilinear Steiner Arborescence (RSA) is a directed tree rooted at the origin, containing all points in P, and composed solely of...
Weiping Shi, Chen Su
COCOA
2009
Springer
14 years 2 months ago
On Open Rectangle-of-Influence Drawings of Planar Graphs
: Under water sensor network is an important research direction in computer science. There are many interesting optimization problems regarding its design, routing and applications...
Huaming Zhang, Milind Vaidya