Sciweavers

219 search results - page 42 / 44
» Drawing with Fat Edges
Sort
View
GD
2007
Springer
14 years 1 months ago
Constrained Simultaneous and Near-Simultaneous Embeddings
A geometric simultaneous embedding of two graphs G1 = (V1, E1) and G2 = (V2, E2) with a bijective mapping of their vertex sets γ : V1 → V2 is a pair of planar straightline drawi...
Fabrizio Frati, Michael Kaufmann, Stephen G. Kobou...
SCALESPACE
2007
Springer
14 years 1 months ago
Non-negative Sparse Modeling of Textures
This paper presents a statistical model for textures that uses a non-negative decomposition on a set of local atoms learned from an exemplar. This model is described by the varianc...
Gabriel Peyré
JMM2
2006
111views more  JMM2 2006»
13 years 7 months ago
Employing the Hand as an Interface Device
We propose algorithms and applications for using the hand as an interface device in virtual and physical spaces. In virtual drawing, by tracking the hand in 3D and estimating a vir...
Afshin Sepehri, Yaser Yacoob, Larry S. Davis
DAM
2011
13 years 2 months ago
Untangling planar graphs from a specified vertex position - Hard cases
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 ...
Mihyun Kang, Oleg Pikhurko, Alexander Ravsky, Math...
POPL
2007
ACM
14 years 7 months ago
Preferential path profiling: compactly numbering interesting paths
Path profiles provide a more accurate characterization of a program's dynamic behavior than basic block or edge profiles, but are relatively more expensive to collect. This h...
Kapil Vaswani, Aditya V. Nori, Trishul M. Chilimbi