7405 search results - page 870 / 1481 » Computer Graphics |
147
click to vote
GD
2009
Springer
15 years 11 months ago
2009
Springer
In this paper, we explore a new convention for drawing graphs, the (Manhattan-) geodesic drawing convention. It requires that edges are drawn as interior-disjoint monotone chains o...
165
Voted
GREC
2009
Springer
15 years 11 months ago
2009
Springer
In this paper, we study the segmentation of sketched engineering drawings into a set of straight and curved segments. Our immediate objective is to produce a benchmarking method fo...
177
click to vote
GD
2001
Springer
15 years 10 months ago
2001
Springer
In an orthogonal drawing of a plane graph each vertex is drawn as a point and each edge is drawn as a sequence of vertical and horizontal line segments. A bend is a point at which...
169
click to vote
SIGGRAPH
2010
ACM
15 years 10 months ago
2010
ACM
We present a deblurring algorithm that uses a hardware attachment coupled with a natural image prior to deblur images from consumer cameras. Our approach uses a combination of ine...
179
click to vote
SIGGRAPH
2010
ACM
15 years 10 months ago
2010
ACM
We present an approach to simulate flows driven by surface tension based on triangle meshes. Our method consists of two simulation layers: the first layer is an Eulerian method ...