Suchergebnisse - Analysis of Algorithms and Problem Complexity—Nonnumerical Algorithms and Problems*

Planar Minimization Diagrams via Subdivision with Applications to Anisotropic Voronoi Diagrams von Bennett, H., Papadopoulou, E., Yap, C.

“… We describe a subdivision algorithm for computing a clustered ε‐isotopic approximation of the minimization diagram of X …”
Volltext

Mandatory Critical Points of 2D Uncertain Scalar Fields von Günther, David, Salmon, Joseph, Tierny, Julien

“… The characterization is based on the analysis of the support of the probability density functions (PDF) of the input data. Given two scalar fields representing reliable estimations …”
Volltext

New Bounds on the Size of Optimal Meshes von Sheehy, Donald R.

“… The theory of optimal size meshes gives a method for analyzing the output size (number of simplices) of a Delaunay refinement mesh in terms of the integral of …”
Volltext

Improved grid map layout by point set matching von Eppstein, David, van Kreveld, Marc, Speckmann, Bettina, Staals, Frank

“… Associating the regions of a geographic subdivision with the cells of a grid is a basic operation that is used in various types of maps, like spatially ordered …”
Volltext

Approximate topological matching of quadrilateral meshes von Eppstein, D., Goodrich, M.T., Kim, E., Tamstorf, R.

“… We study approximate topological matching of quadrilateral meshes, that is, the problem of finding as large a set as possible of matching portions of two quadrilateral meshes …”
Volltext

Fast and Robust Approximation of Smallest Enclosing Balls in Arbitrary Dimensions von Larsson, Thomas, Källberg, Linus

“… In this paper, an algorithm is introduced that computes an arbitrarily fine approximation of the smallest enclosing ball of a point set in any dimension …”
Volltext

A new approach to rectangle intersections part I von Edelsbrunner, Herbert

“… Rectangle intersections involving rectilinearly-oriented (hyper-) rectangles in d-dimensional real space are examined from two points of view. First, a data …”
Volltext

A new approach to rectangle intersections: Part II von Edelsbrunner, Herbert

“… The study begun in Part I is completed by providing an algorithm which reports all intersecting pairs of a set of rectangles in d dimensions …”
Volltext

Counter examples to adjudicating a towers of hanoi contest von Er, M.C.

“… This paper points out the inconsistency in the criteria for adjudicating a Towers of Hanoi contest proposed by Wood. Counter examples to some of Wood's claims …”
Volltext

Adjudicating a towers of hanoi contest von Wood, D.

“… We present linear time and space adjudication algorithms, that is optimal adjudication algorithms …”
Volltext

The multiway trees of hanoi von Jürgensen, Helmut, Wood, Derick

“… We consider the multiway generalisation of the binary Trees of Hanoi. We provide a recursive algorithm for its solution and prove its optimality …”
Volltext

The Complexity of Coverability in ν-Petri Nets von Lazic, Ranko, Schmitz, Sylvain

“… ideals.Categories and Subject Descriptors F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems …”
Volltext