Výsledky vyhľadávania - "F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems"
-
1
Mandatory Critical Points of 2D Uncertain Scalar Fields
ISSN: 0167-7055, 1467-8659Vydavateľské údaje: Oxford Blackwell Publishing Ltd 01.06.2014Vydané v Computer graphics forum (01.06.2014)“…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
Journal Article -
2
Planar Minimization Diagrams via Subdivision with Applications to Anisotropic Voronoi Diagrams
ISSN: 0167-7055, 1467-8659Vydavateľské údaje: Oxford Blackwell Publishing Ltd 01.08.2016Vydané v Computer graphics forum (01.08.2016)“…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
Journal Article -
3
New Bounds on the Size of Optimal Meshes
ISSN: 0167-7055, 1467-8659Vydavateľské údaje: Oxford, UK Blackwell Publishing Ltd 01.08.2012Vydané v Computer graphics forum (01.08.2012)“…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
Journal Article -
4
Improved grid map layout by point set matching
ISSN: 2165-8765Vydavateľské údaje: IEEE 01.02.2013Vydané v 2013 IEEE Pacific Visualization Symposium (PacificVis) (01.02.2013)“…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
Konferenčný príspevok.. -
5
Approximate topological matching of quadrilateral meshes
ISBN: 9781424422609, 1424422604Vydavateľské údaje: IEEE 01.06.2008Vydané v 2008 IEEE International Conference on Shape Modeling and Applications (01.06.2008)“…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
Konferenčný príspevok.. -
6
A new approach to rectangle intersections part I
ISSN: 0020-7160, 1029-0265Vydavateľské údaje: Gordon and Breach Science Publishers 01.01.1983Vydané v International journal of computer mathematics (01.01.1983)“…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
Journal Article -
7
A new approach to rectangle intersections: Part II
ISSN: 0020-7160, 1029-0265Vydavateľské údaje: Gordon and Breach Science Publishers 01.01.1983Vydané v International journal of computer mathematics (01.01.1983)“…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
Journal Article -
8
Counter examples to adjudicating a towers of hanoi contest
ISSN: 0020-7160, 1029-0265Vydavateľské údaje: Abingdon Gordon and Breach Science Publishers 01.01.1987Vydané v International journal of computer mathematics (01.01.1987)“…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
Journal Article -
9
Adjudicating a towers of hanoi contest
ISSN: 0020-7160, 1029-0265Vydavateľské údaje: Abingdon Gordon and Breach Science Publishers 01.01.1983Vydané v International journal of computer mathematics (01.01.1983)“…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
Journal Article -
10
The multiway trees of hanoi
ISSN: 0020-7160, 1029-0265Vydavateľské údaje: Abingdon Gordon and Breach Science Publishers 01.01.1983Vydané v International journal of computer mathematics (01.01.1983)“…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
Journal Article

