Search results

...rm), "Geometric tomography deals with the retrieval of information about a geometric object from data concerning its projections (shadows) on planes or cross-se Gardner, R.J., Geometric Tomography, Cambridge University Press, Cambridge, UK, 2nd ed., 2006</ref> ...

...[[Nimrod Megiddo]] in 1983.<ref name=lp3>Nimrod Megiddo (1983) Linear-time algorithms for linear programming in R³ and related problems. SIAM J. Compu ...by observing that the times for the recursive subproblems decrease in a [[geometric series]]. ...

...ed by the [[Intersection (set theory)|intersection]] of <math>X</math> and geometric shapes such as disks and axis-parallel rectangles. The goal is to select a ...same range space <math>\Sigma</math>, a closely related problem is the '''geometric hitting set problem''', where the goal is to select a ''minimum-size'' subs ...

...uter graphics]] and [[computational geometry]] for measuring the size of a geometric object near a particular point. ...t algorithm for quality 2-dimensional mesh generation | journal=Journal of Algorithms | year=1995 | issue=3 | pages= 548–585 | volume=18}}</ref> ...

==Properties and algorithms== ...)/2 edges, a rectilinear minimum spanning tree can be found using existing algorithms for finding a minimum spanning tree. In particular, using [[Prim's algorith ...

...]], a weighted [[undirected graph]] connecting a set of [[point (geometry)|geometric points]] with the property that, for every pair of points in the graph, the ....org/latest/Cone_spanners_2/ Cone-based Spanners in Computational Geometry Algorithms Library (CGAL)] ...

...tle=Algorithmic Topology and Classification of 3-Manifolds|volume=9|series=Algorithms and Computation in Mathematics|first=Sergei|last=Matveev|publisher=Springer [[Category:Geometric topology]] ...

...987). {{ISBN|978-0-19-503965-8}}<ref>Reviews of ''Art Gallery Theorems and Algorithms'': ...ne]] (2007). {{ISBN|978-0-521-85757-4}}<ref>Reviews of ''Geometric Folding Algorithms'': ...

...hm]]s and [[computational geometry]]. He is known for his work on matching geometric shapes, including methods for efficiently computing the [[Fréchet distance] ...horn]] at [[Saarland University]], where he completed his Ph.D. in 1976 on algorithms for parsing [[context-free language]]s.{{r|mg}} ...

| title = Geometric Folding Algorithms | title-link = Geometric Folding Algorithms ...

{{Short description|Unsolved problem in parallel algorithms}} In the theory of parallel algorithms, the '''1-vs-2 cycles problem''' concerns a simplified case of [[graph conn ...

'''Algorithms and Combinatorics''' ({{ISSN|0937-5511}}) is a [[book series]] in mathemati *''Geometric Algorithms and Combinatorial Optimization'' ([[Martin Grötschel]], [[László Lovász]], ...

[[Category:Geometric algorithms]] ...

...ise optimal [[randomized algorithm]]s for several problems of constructing geometric structures, following up on an earlier singly-authored paper by Clarkson on It includes algorithms for finding all <math>k</math> intersections among a set of <math>n</math> ...

'''''Davenport–Schinzel Sequences and Their Geometric Applications''''' is a book in [[discrete geometry]]. It was written by [[M ...these methods. Three chapters concern arrangements of curves in the plane, algorithms for arrangements, and higher-dimensional arrangements,{{r|ph}} following wh ...

...earning features and [[Object recognition|recognizing objects]] (figures). Geometric feature learning methods can not only solve recognition problems but also p ...images. Geometric features are features of objects constructed by a set of geometric elements like points, lines, curves or surfaces. These features can be corn ...

[[File:Greedy geometric spanner 2.svg|thumb|Greedy geometric spanner of 100 random points with stretch factor {{mvar|t}} = 2]] [[File:Greedy geometric spanner 1.1.svg|thumb|Greedy geometric spanner of the same points with stretch factor {{mvar|t}} = 1.1]] ...

...nce between strongly- and weakly-polynomial time is when the inputs to the algorithms consist of integer or rational numbers. It is particularly common in [[Opti Some algorithms run in polynomial time in one model but not in the other one. For example: ...

== Solutions via Geometric Algebra == ...h |first6=James |date=January 2024 |title=Revisiting the Hansen Problem: A Geometric Algebra Approach |journal=Mathematics |language=en |volume=12 |issue=13 |pa ...

...2=Joerg|last3=Santos|first3=Francisco|title=Triangulations: Structures for Algorithms and Applications|url=https://archive.org/details/triangulationsst00loer |ur [[Category:Geometric algorithms]] ...