Výsledky vyhľadávania - "F.2.2[Analysis of Algorithms and Problem Complexity]"

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

“…This paper introduces a novel, non‐local characterization of critical points and their global relation in 2D uncertain scalar fields. The characterization is…”
Získať plný text

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

“…Let X = {f1, …, fn} be a set of scalar functions of the form fi : ℝ2 → ℝ which satisfy some natural properties. We describe a subdivision algorithm for…”
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…”
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

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…”
Získať plný text

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

“…We present in this paper, algorithms for finding the minimum area isothetic polygons having two reflex angles containing k points; (k<n) Our algorithms are…”
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. Our approach is based…”
Získať plný text

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

“…The Towers of Hanoi problem with arbitrary k≧3pegs is an extension of the standard one. In this paper we present a nice recursive algorithm for this extended…”
Získať plný text

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

“…Given a bounding isothetic rectangle BR and two sets of points A and B with cardinalities n and m inside it, we have to find an isothetic rectangle containing…”
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. This approach…”
Získať plný text

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

“…The design and implementation of a library of C-code procedures to perform operations on rational polyhedra is described. The library supports intersection,…”
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

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. Morris which…”
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. We present linear time and space…”
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. In this paper, we shall show that the average case performance of this…”
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. Finally we…”
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

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

“…Linear layouts are a simple and natural way to draw a graph: all vertices are placed on a single line and edges are drawn as arcs between the vertices. Despite…”
Získať plný text