Search Results - analysis of algorithms and (problem OR problems) complexity—nonnumerical algorithms and problems

Mandatory Critical Points of 2D Uncertain Scalar Fields by 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…”
Get full text

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

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

New Bounds on the Size of Optimal Meshes by 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…”
Get full text

Improved grid map layout by point set matching by 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…”
Get full text

Approximate topological matching of quadrilateral meshes by 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…”
Get full text

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

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

A new approach to rectangle intersections: Part II by 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…”
Get full text

Counter examples to adjudicating a towers of hanoi contest by 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…”
Get full text

Adjudicating a towers of hanoi contest by Wood, D.

“… We present linear time and space adjudication algorithms, that is optimal adjudication algorithms…”
Get full text

The multiway trees of hanoi by 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…”
Get full text

Optimal Algorithms for Compact Linear Layouts by Sonke, Willem, Verbeek, Kevin, Meulemans, Wouter, Verbeek, Eric, Speckmann, Bettina

“… In this paper we present a novel and versatile algorithm to optimally fold a linear layout of a graph such that it…”
Get full text

Jewels of stringology: text algorithms by Crochemore, Maxime, Rytter, Wojciech

“… and the classification of algorithms according to the measures of complexity considered…”
Get full text

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

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

Jewels of stringology by Crochemore, Maxime, Rytter, Wojciech

“… The book reflects the relationships between applications of text-algorithmic techniques and the classification of algorithms according to the measures of complexity considered…”
Get full text