Výsledky vyhľadávania - f.2.2[analysis of algorithms and problems complexity]~

Mandatory Critical Points of 2D Uncertain Scalar Fields Autor 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…”
Získať plný text

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

“… We describe a subdivision algorithm for computing a clustered ε‐isotopic approximation of the minimization diagram of X…”
Získať plný text

New Bounds on the Size of Optimal Meshes Autor 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…”
Získať plný text

Description and Solution of an Unreported Intrinsic Bias in Photon Mapping Density Estimation with Constant Kernel Autor García, R., Ureña, C., Sbert, M.

“…This paper presents an analysis of the irradiance estimator often used in photon mapping algorithms and concludes that the classical approach with a constant kernel overestimates the correct value…”
Získať plný text

Improved grid map layout by point set matching Autor 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…”
Získať plný text

Fast and Robust Approximation of Smallest Enclosing Balls in Arbitrary Dimensions Autor 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…”
Získať plný text

Approximate topological matching of quadrilateral meshes Autor 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…”
Získať plný text

Minimum area polygons with two reflex angles enclosing k Points Autor Krithivasan, Kamala, Srilakshmi, Vanam

“… We also analyse the complexities of each of the algorithms. We find that out of the four orthogonal polygons with two reflex angles, three are orthoconvex and the algorithms presented for these polygons work in time, where n could be O(n-k…”
Získať plný text

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

“…Rectangle intersections involving rectilinearly-oriented (hyper-) rectangles in d-dimensional real space are examined from two points of view. First, a data…”
Získať plný text

Finding a hamilton path through a family of intervals Autor Sridhar, M. A., Goyal, S.

“…We develop an o(nx(n)) algorithm for computing a hamilton path in a family of n intervals, where x is an inverse of Ackerman's function…”
Získať plný text

Towers of hanoi problem with arbitrary k≧3 pages Autor Xue-Miao, Lu

“… In this paper we present a nice recursive algorithm for this extended problem and then analyze its complexity…”
Získať plný text

Fast sequential and parallel algorithms for finding the largest rectangle separating two sets Autor Datta, Amitava, Srikant, R., Krithivasan, Kamala

“… (resp. set ,A). We present efficient sequential and parallel algorithms for these two problems…”
Získať plný text

A new approach to rectangle intersections: Part II Autor 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…”
Získať plný text

A LIBRARY FOR DOING POLYHEDRAL OPERATIONS Autor WILDE, DORAN K.

“… And finally, the algorithms used to implement the various functions in the library are presented…”
Získať plný text

A study of binary tree traversal algorithms and a tag-free threaded representation Autor Fenner, T.I., Loizou, G.

“…Starting from a stack-based binary tree traversal algorithm for preorder and/or inorder, we derive an algorithm recently discovered by J. M…”
Získať plný text

The average performance analysis of a closest-pair algorithm Autor Chang, R. C., Lee, R. C. T.

“…Bentley proposed a divide-and-conquer approach to solve the planar closest pair problem…”
Získať plný text

Counter examples to adjudicating a towers of hanoi contest Autor 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…”
Získať plný text

Adjudicating a towers of hanoi contest Autor Wood, D.

“…The notion of a Towers of Hanoi contest is introduced and the complexity of some adjudication methods are investigated…”
Získať plný text

The multiway trees of hanoi Autor 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…”
Získať plný text

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

“… ideals.Categories and Subject Descriptors F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems…”
Získať plný text