549 search results - page 63 / 110 » The corner arc algorithm |
CORR
2010
Springer
14 years 11 months ago
2010
Springer
We introduce the notion of Lombardi graph drawings, named after the abstract artist Mark Lombardi. In these drawings, edges are represented as circular arcs rather than as line seg...
115
click to vote
HEURISTICS
2006
14 years 11 months ago
2006
In case a CSP is over-constrained, it is natural to allow some constraints, called soft constraints, to be violated. We propose a generic method to soften global constraints that c...
MOC
1998
14 years 10 months ago
1998
Abstract. A Cauchy problem for a one–dimensional diffusion–reaction equation is solved on a grid by a random walk method, in which the diffusion part is solved by random walk...
121
click to vote
SODA
2010
ACM
15 years 8 months ago
2010
ACM
We present a simple and practical algorithm for the c-approximate near neighbor problem (c-NN): given n points P Rd and radius R, build a data structure which, given q Rd , can ...
IWCIA
2009
Springer
15 years 3 months ago
2009
Springer
Abstract. The paper studies local convexity properties of parts of digital boundaries. An online and linear-time algorithm is introduced for the decomposition of a digital boundary...