Search results
Jump to navigation
Jump to search
Page title matches
- ...t|discuss=Talk:Diameter of a set#Proposed merge of Diameter (computational geometry) into Diameter of a set|date=January 2025}} In [[computational geometry]], the diameter of a [[finite set]] of points or of a [[polygon]] is its [[ ...8 KB (1,109 words) - 08:52, 9 January 2025
- In [[computational geometry]], an '''''ε''-net''' (pronounced [[epsilon]]-net) is the approximation of | journal = [[Discrete & Computational Geometry]] ...5 KB (717 words) - 11:25, 26 April 2024
Page text matches
- ...rete geometry]], is the problem of determination of the object's [[vertex (geometry)|vertices]] given some formal representation of the object. A classical exa ==Computational complexity== ...3 KB (446 words) - 19:49, 6 August 2022
- ...ic spanner]], a weighted [[undirected graph]] connecting a set of [[point (geometry)|geometric points]] with the property that, for every pair of points in the ...Yao graph is to surround each of the given points by equally spaced [[ray (geometry)|rays]], partitioning the plane into sectors with equal angles, and to conn ...2 KB (344 words) - 19:27, 18 February 2019
- ...dex.php/jocg/about/editorialTeam Editorial Team], Journal of Computational Geometry. Retrieved 2024-01-31.</ref> ...e [[Association for Computing Machinery|ACM]] [[Symposium on Computational Geometry]]. ...6 KB (726 words) - 08:26, 13 September 2024
- ...ts Applications| journal =[[Computational Geometry (journal)|Computational Geometry]]| volume =77| pages = 10–26 | year = 2019| doi = 10.1016/j.comgeo.2015.11 [[Category:Computational geometry]] ...3 KB (417 words) - 15:10, 4 August 2021
- {{short description|Computational geometry concept}} ...is the smallest fraction (or number) of points in any closed [[Half-space (geometry)|halfspace]] that contains ''x''. ...2 KB (402 words) - 02:15, 13 May 2024
- ...ynomial time]]. This is of importance for many problems in [[computational geometry]], since the computation of the [[Euclidean distance]] between two points i [[Category:Computational problems]] ...2 KB (315 words) - 15:16, 1 December 2024
- In [[geometry]], a '''slab''' is a region between two [[parallel lines]] in the [[Euclide ...b|last1=Jacob|first1=Goodman |title=Handbook of Discrete and Computational Geometry |url=http://www.csun.edu/~ctoth/Handbook/HDCG3.html |publisher=CRC Press LL ...2 KB (326 words) - 00:22, 13 May 2024
- ...ional [[linear space|linear]], [[affine geometry|affine]], or [[projective geometry|projective]] space into connected [[abstract cell complex|cell]]s of differ |title=Handbook of Computational Geometry ...4 KB (584 words) - 18:15, 13 May 2020
- In [[computational geometry]], the '''source unfolding''' of a [[convex polyhedron]] is a [[Net (polyhe ...of the net that do not lie along edges of the polyhedron, as a [[Blooming (geometry)|blooming]] of the polyhedron.{{r|ddhilo}} The unfolded shape of the source ...3 KB (436 words) - 07:34, 11 January 2024
- ...ed after Roderick B. Urquhart, is obtained by removing the longest [[edge (geometry)|edge]] from each [[triangle]] in the [[Delaunay triangulation]]. | title = Proc. 13th Canadian Conference on Computational Geometry ...3 KB (411 words) - 17:23, 7 December 2024
- ...nt = Special Issue on the Twenty-First Annual [[Symposium on Computational Geometry]] — SoCG 2005 | journal = [[Computational Geometry (journal)|Computational Geometry: Theory and Applications]] ...3 KB (546 words) - 12:36, 18 August 2023
- ...nal geometry]], the positive and negative '''Voronoi poles''' of a [[cell (geometry)|cell]] in a [[Voronoi diagram]] are certain vertices of the diagram, chose | title = Proceedings of the Fourteenth Annual Symposium on Computational Geometry, Minneapolis, Minnesota, USA, June 7–10, 1998 ...4 KB (518 words) - 06:48, 19 June 2024
- ...[[polygon]] by choosing a [[Vertex (geometry)|vertex]] and drawing [[Edge (geometry)|edges]] to all of the other vertices of the polygon. Not every polygon can ...nerates <math>n - 2</math> triangles.<ref>{{Cite book |title=Computational geometry in C |last=O'Rourke |first=Joseph |date=1998 |publisher=Cambridge Universit ...3 KB (410 words) - 03:45, 9 June 2022
- ...s to several related concepts in [[computer graphics]] and [[computational geometry]] for measuring the size of a geometric object near a particular point. ...e reconstruction by Voronoi filtering | journal=Discrete and Computational Geometry | year=1999 | issue=4 | pages= 481–504 | volume=22| url=https://escholarshi ...2 KB (269 words) - 20:56, 23 May 2021
- ...nk.springer.com/10.1007/s41468-022-00110-9 |journal=Journal of Applied and Computational Topology |language=en |doi=10.1007/s41468-022-00110-9 |arxiv=2109.05513 |s2 ....springer.com/10.1007/s00454-022-00476-8 |journal=Discrete & Computational Geometry |language=en |doi=10.1007/s00454-022-00476-8 |issn=0179-5376|arxiv=2103.078 ...5 KB (752 words) - 11:55, 21 March 2024
- ...gorithmische Geometrie" [algorithmic geometry] to refer to [[computational geometry]].{{r|raf}} He is a professor of computer science at the [[Free University ...Geometry]].{{r|raf}} At the same International Symposium on Computational Geometry, Alt's work with Michael Godau on using Fréchet distance to measure the sim ...6 KB (725 words) - 02:42, 14 August 2024
- In [[computational geometry]], a '''constrained Delaunay triangulation''' is a generalization of the [[ | journal = [[Discrete & Computational Geometry]] ...4 KB (585 words) - 17:39, 18 October 2024
- In [[computational geometry]], the '''star unfolding''' of a [[convex polyhedron]] is a [[Net (polyhedr ...there is a unique shortest geodesic from <math>p</math> to each [[Vertex (geometry)|vertex]] of <math>P</math>.{{r|ao|aaos|ch}} ...6 KB (747 words) - 07:47, 11 March 2024
- ...e set]] of points is in convex position if all of the points are [[Vertex (geometry)|vertices]] of their [[convex hull]].{{r|m02}} More generally, a [[family o An assumption of convex position can make certain computational problems easier to solve. For instance, the [[traveling salesman problem]], ...5 KB (661 words) - 11:14, 18 December 2023
- ...cess-date=2020-02-20}}</ref> His main research interest is [[computational geometry]]. ...y the [[arXiv]] [[Forum moderator#Moderators|moderator]] for computational geometry and [[discrete mathematics]].<ref>{{citation|url=http://www.dlib.org/dlib/n ...6 KB (855 words) - 03:39, 25 January 2025