665 search results - page 114 / 133 » Algorithms for Triangulated Terrains |
ALGORITHMICA
2010
13 years 8 months ago
2010
In this paper, we give a lower bound of (n(d-1)/2 ) on the quantum query complexity for finding a fixed point of a discrete Brouwer function over grid [1 : n]d . Our bound is near...
DM
2006
13 years 8 months ago
2006
For a chordal graph G = (V, E), we study the problem of whether a new vertex u V and a given set of edges between u and vertices in V can be added to G so that the resulting grap...
IJBC
2008
13 years 8 months ago
2008
The localization of critical parameter sets called bifurcations is often a central task of the analysis of a nonlinear dynamical system. Bifurcations of codimension 1 that can be ...
SIAMIS
2008
13 years 8 months ago
2008
Motion of curves governed by geometric evolution laws, such as mean curvature flow and surface diffusion, is the basis for many algorithms in image processing. If the images to be ...
IPM
2007
13 years 8 months ago
2007
The work described here initially formed part of a triangulation exercise to establish the effectiveness of the Query Term Order algorithm. The methodology produced subsequently p...