Sciweavers

6740 search results - page 72 / 1348
» An s -Hamiltonian Line Graph Problem
Sort
View
ACSC
2010
IEEE
13 years 5 months ago
Efficient contour line labelling for terrain modelling
Terrains are an essential part of outdoor environments. Terrain models are important for computer games and applications in architecture, urban design and archaeology. A popular a...
Xin Xie, Burkhard Wünsche
DM
2008
83views more  DM 2008»
13 years 10 months ago
The polynomial degrees of Grassmann and Segre varieties over GF(2)
A recent proof that the Grassmannian G1;n;2 of lines of PG(n; 2) has polynomial degree n 2 1 is outlined, and is shown to yield a theorem about certain kinds of subgraphs of any (...
R. Shaw
CORR
2008
Springer
141views Education» more  CORR 2008»
13 years 10 months ago
Obfuscated Drawings of Planar Graphs
Given a planar graph G, we consider drawings of G in the plane where edges are represented by straight line segments (which possibly intersect). Such a drawing is specified by an i...
Mihyun Kang, Oleg Pikhurko, Alexander Ravsky, Math...
ICCV
2007
IEEE
15 years 8 hour ago
Methods for space line localization from single catadioptric images: new proposals and comparisons
Line localization from a single image of a central camera is an ill-posed problem unless other constraints or apriori knowledge are exploited. Recently, it has been proved that no...
Vincenzo Caglioti, Simone Gasparini, Pierluigi Tad...
CVPR
2010
IEEE
14 years 3 months ago
Line Matching Leveraged By Point Correspondences
A novel method for line matching is proposed. The basic idea is to use tentative point correspondences, which can be easily obtained by keypoint matching methods, to significantly...
Bin Fan, Fuchao Wu, Zhanyi Hu