947 search results - page 130 / 190 » Discrete Geometry |
103
click to vote
COMPGEOM
2010
ACM
15 years 2 months ago
2010
ACM
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...
ICIP
2009
IEEE
14 years 7 months ago
2009
IEEE
This paper deals with the problem of efficiently computing the optical flow of image sequences acquired by omnidirectional (nearly full field of view) cameras. We formulate the pr...
TVCG
2012
13 years 6 days ago
2012
—The Morse-Smale complex is a useful topological data structure for the analysis and visualization of scalar data. This paper describes an algorithm that processes all mesh eleme...
DAC
2000
ACM
15 years 10 months ago
2000
ACM
We describe a new method for accurate large-scale capacitance calculations. The algorithm uses an integral equation formulation, but with a new representation for charge distribut...
COMPGEOM
2010
ACM
15 years 2 months ago
2010
ACM
We present a simple randomized scheme for triangulating a set P of n points in the plane, and construct a kinetic data structure which maintains the triangulation as the points of...