Find link

language:

Find link is a tool written by Edward Betts.

searching for Discrete & Computational Geometry 57 found (230 total)

alternate case: discrete & Computational Geometry

Timothy M. Chan (356 words) [view diff] exact match in snippet view article find links to article

is also a member of the editorial board of Algorithmica, Discrete & Computational Geometry, and Computational Geometry: Theory and Applications. Chan

Nonobtuse mesh (231 words) [view diff] exact match in snippet view article find links to article

(1995), "Linear-size nonobtuse triangulation of polygons", Discrete & Computational Geometry, 14 (4): 411–428, doi:10.1007/BF02570715, MR 1360945 Maehara

Offset filtration (1,735 words) [view diff] exact match in snippet view article find links to article

Zomorodian (2002). "Topological Persistence and Simplification". Discrete & Computational Geometry. 28 (4): 511–533. doi:10.1007/s00454-002-2885-2. ISSN 0179-5376

Multicover bifiltration (584 words) [view diff] exact match in snippet view article find links to article

(2021). "The Multi-Cover Persistence of Euclidean Balls". Discrete & Computational Geometry. 65 (4): 1296–1313. doi:10.1007/s00454-021-00281-9. ISSN 0179-5376

Regular skew apeirohedron (1,769 words) [view diff] no match in snippet view article find links to article

Egon (1997). "Regular Polytopes in Ordinary Space" (PDF). Discrete Computational Geometry. 17 (47): 449–478. doi:10.1007/PL00009304. McMullen, Peter;

Dot product representation of a graph (273 words) [view diff] exact match in snippet view article find links to article

Šiňajová, E. (1989), "Embeddings of graphs in Euclidean spaces", Discrete & Computational Geometry, 4 (4): 349–364, doi:10.1007/BF02187736, MR 0996768. Reiterman

Topological complexity (373 words) [view diff] exact match in snippet view article find links to article

M. (2003). "Topological complexity of motion planning". Discrete & Computational Geometry. Vol. 29, no. 2. pp. 211–221. Armindo Costa: Topological Complexity

Carathéodory's theorem (convex hull) (2,153 words) [view diff] exact match in snippet view article

Roman (2012-07-20). "Notes About the Carathéodory Number". Discrete & Computational Geometry. 48 (3): 783–792. arXiv:1112.5942. doi:10.1007/s00454-012-9439-z

Kenneth L. Clarkson (543 words) [view diff] exact match in snippet view article find links to article

for his "contributions to computational geometry." Editors, Discrete & Computational Geometry. Retrieved 2024-01-31. Editorial Team, Journal of Computational

Császár polyhedron (682 words) [view diff] exact match in snippet view article find links to article

Oliveira, A. (2000), "On the Generation of Oriented Matroids", Discrete & Computational Geometry, 24: 197–208, doi:10.1007/s004540010027 Ziegler, Günter M

Visibility graph (883 words) [view diff] exact match in snippet view article find links to article

and characterizing visibility graphs of simple polygons". Discrete & Computational Geometry. 17 (2): 143–162. doi:10.1007/BF02770871. ISSN 0179-5376.

Chiral polytope (632 words) [view diff] no match in snippet view article find links to article

Pellicer, Daniel (2014), "A Finite Chiral 4-polytope in ℝ4", Discrete Computational Geometry Monson, Barry (2021), On Roli's Cube, arXiv:2102.08796 Monson

Persistence module (2,966 words) [view diff] exact match in snippet view article find links to article

Carlsson, Gunnar (2005). "Computing Persistent Homology". Discrete & Computational Geometry. 33 (2): 249–274. doi:10.1007/s00454-004-1146-y. ISSN 0179-5376

Star coloring (477 words) [view diff] exact match in snippet view article find links to article

(2003), "Colorings and homomorphisms of minor closed classes", Discrete & Computational Geometry: The Goodman-Pollack Festschrift, Algorithms & Combinatorics

Raimund Seidel (370 words) [view diff] exact match in snippet view article find links to article

"Small-dimensional linear programming and convex hulls made easy", Discrete & Computational Geometry, 6 (1): 423–434, doi:10.1007/BF02574699. Aragon, Cecilia R

Pizza theorem (1,394 words) [view diff] exact match in snippet view article find links to article

Readdy, Margaret (October 17, 2023), "Pizza and 2-Structures", Discrete & Computational Geometry, 70: 1221–1244, arXiv:2105.07288, doi:10.1007/s00454-023-00600-2

Therese Biedl (204 words) [view diff] exact match in snippet view article find links to article

October 2013). "Computing Cartograms with Optimal Complexity". Discrete & Computational Geometry. 50 (3): 784–810. arXiv:1201.0066. doi:10.1007/s00454-013-9521-1

3-3 duoprism (823 words) [view diff] exact match in snippet view article find links to article

Olshevsky. Apollonian Ball Packings and Stacked Polytopes Discrete & Computational Geometry, June 2016, Volume 55, Issue 4, pp 801–826 The Fourth Dimension

Víctor Neumann-Lara (623 words) [view diff] exact match in snippet view article find links to article

Jorge Urrutia "A Combinatorial Property of Convex Sets" Discrete & Computational Geometry 17(3): 307–318 (1997) Manuel Abellanas, G. Hernandez, Rolf

Subdivision bifiltration (1,169 words) [view diff] exact match in snippet view article find links to article

Georg (2023-02-20). "Computing the Multicover Bifiltration". Discrete & Computational Geometry. 70 (2): 376–405. arXiv:2103.07823. doi:10.1007/s00454-022-00476-8

Uniform star polyhedron (719 words) [view diff] exact match in snippet view article find links to article

Closed-Form Expressions for Uniform Polyhedra and Their Duals., Discrete & Computational Geometry 27:353-375 (2002). Klitzing, Richard. "3D uniform polyhedra"

Pyramid (geometry) (1,422 words) [view diff] exact match in snippet view article

p. 85. Grünbaum, Branko (1997), "Isogonal Prismatoids", Discrete & Computational Geometry, 18: 13–52, doi:10.1007/PL00009307. Polya, G. (1954), Mathematics

Flip distance (1,422 words) [view diff] exact match in snippet view article find links to article

(2017-02-10). "Computing the Flip Distance Between Triangulations". Discrete & Computational Geometry. 58 (2). Springer Science and Business Media LLC: 313–344

Bernard Chazelle (395 words) [view diff] exact match in snippet view article find links to article

(1991), "Triangulating a Simple Polygon in Linear Time", Discrete & Computational Geometry, 6 (3): 485–524, doi:10.1007/BF02574703, ISSN 0179-5376 Chazelle

László Fejes Tóth (2,553 words) [view diff] exact match in snippet view article find links to article

(2006), "Historical overview of the Kepler conjecture", Discrete & Computational Geometry, 36 (1): 5–20, doi:10.1007/s00454-005-1210-2, ISSN 0179-5376

Alexander duality (1,429 words) [view diff] exact match in snippet view article find links to article

Combinatorial Alexander Duality—A Short and Elementary Proof". Discrete & Computational Geometry. 42 (4): 586–593. arXiv:0710.1172. doi:10.1007/s00454-008-9102-x

Péter Komjáth (243 words) [view diff] exact match in snippet view article find links to article

Komjáth, P. (1990). "Countable decompositions ofR 2 andR 3". Discrete & Computational Geometry. 5 (4): 325–331. doi:10.1007/BF02187793. ISSN 0179-5376. Péter

Regular skew polyhedron (747 words) [view diff] exact match in snippet view article find links to article

2020. Peter McMullen, Four-Dimensional Regular Polyhedra, Discrete & Computational Geometry September 2007, Volume 38, Issue 2, pp 355–387 Coxeter, Regular

Ronen Eldan (437 words) [view diff] exact match in snippet view article find links to article

Random Points Does Not Determine the Volume of a Convex Body". Discrete & Computational Geometry. 46 (1). Springer Science and Business Media LLC: 29–47. arXiv:0903

Prism (geometry) (1,852 words) [view diff] exact match in snippet view article

Figure 11.3b. Grünbaum, Branko (1997). "Isogonal Prismatoids". Discrete & Computational Geometry. 18: 13–52. doi:10.1007/PL00009307. Malton, Thomas (1774)

Matchstick graph (1,571 words) [view diff] exact match in snippet view article find links to article

Tight Bound for the Number of Edges of Matchstick Graphs", Discrete & Computational Geometry, arXiv:2209.09800, doi:10.1007/s00454-023-00530-z, ISSN 1432-0444

Davenport–Schinzel sequence (1,677 words) [view diff] exact match in snippet view article find links to article

realizations of nonlinear Davenport–Schinzel sequences by segments", Discrete & Computational Geometry, 3 (1): 15–47, doi:10.1007/BF02187894, MR 0918177. Pettie

Rectified 5-cell (901 words) [view diff] exact match in snippet view article find links to article

"The Et-construction for lattices, spheres and polytopes", Discrete & Computational Geometry, 32 (4): 601–621, arXiv:math.MG/0304492, doi:10.1007/s00454-004-1140-4

Ben Green (mathematician) (1,331 words) [view diff] exact match in snippet view article

(1 September 2013). "On Sets Defining Few Ordinary Lines". Discrete & Computational Geometry. 50 (2): 409–468. arXiv:1208.4714. doi:10.1007/s00454-013-9518-9

Ricci curvature (5,859 words) [view diff] exact match in snippet view article find links to article

Method for Cell Complexes and Combinatorial Ricci Curvature". Discrete & Computational Geometry. 29 (3): 323–374. doi:10.1007/s00454-002-0743-x. ISSN 1432-0444

Vietoris–Rips filtration (2,409 words) [view diff] exact match in snippet view article find links to article

Robert (2010). "Vietoris–Rips Complexes of Planar Point Sets". Discrete & Computational Geometry. 44 (1): 75–90. doi:10.1007/s00454-009-9209-8. ISSN 0179-5376

Floating-point error mitigation (1,110 words) [view diff] exact match in snippet view article find links to article

Floating-Point Arithmetic and Fast Robust Geometric Predicates" (PDF). Discrete & Computational Geometry. 18 (3): 305–363. doi:10.1007/PL00009321. S2CID 189937041

Χ-bounded (1,503 words) [view diff] exact match in snippet view article find links to article

Bartosz (2019), "Coloring Curves that Cross a Fixed Curve", Discrete & Computational Geometry, 61 (4): 830–851, arXiv:1512.06112, doi:10.1007/s00454-018-0031-z

Tutte embedding (2,010 words) [view diff] exact match in snippet view article find links to article

placement of periodic graphs and convexity of plane tilings", Discrete & Computational Geometry, 33 (1): 67–81, doi:10.1007/s00454-004-1147-x, MR 2105751

Geometric set cover problem (836 words) [view diff] exact match in snippet view article find links to article

(1995), "Almost optimal set covers in finite VC-dimension", Discrete & Computational Geometry, 14 (4): 463–479, doi:10.1007/bf02570718 Clarkson, Kenneth

Orthogonal convex hull (1,508 words) [view diff] exact match in snippet view article find links to article

Plecháč, P. (1998), "On Functional Separately Convex Hulls", Discrete & Computational Geometry, 19 (1): 105–130, doi:10.1007/PL00009331. Montuno, D. Y.;

Persistent Betti number (902 words) [view diff] exact match in snippet view article find links to article

Zomorodian (2002). "Topological Persistence and Simplification". Discrete & Computational Geometry. 28 (4): 511–533. doi:10.1007/s00454-002-2885-2. ISSN 0179-5376

Short integer solution problem (3,164 words) [view diff] exact match in snippet view article find links to article

Lenny, and Xun Sun. [On the geometry of cyclic lattices.] Discrete & Computational Geometry 52.2 (2014): 240–259. Craig Gentry. Fully Homomorphic Encryption

Karin Gatermann (573 words) [view diff] exact match in snippet view article find links to article

by dynamic lifting applied to polynomial system solving", Discrete & Computational Geometry, 16 (1): 69–112, doi:10.1007/BF02711134, MR 1397788, S2CID 35284268

Exact trigonometric values (3,272 words) [view diff] exact match in snippet view article find links to article

angles whose squared trigonometric functions are rational". Discrete & Computational Geometry. 22 (3): 321–332. arXiv:math-ph/9812019. doi:10.1007/PL00009463

Solid angle (4,116 words) [view diff] exact match in snippet view article find links to article

(2006). "Measuring Solid Angles Beyond Dimension Three". Discrete & Computational Geometry. 36 (3): 479–487. doi:10.1007/s00454-006-1253-4. Jaffey, A

Finite sphere packing (2,641 words) [view diff] exact match in snippet view article find links to article

Betke, U.; Henk, M. (1998). "Finite Packings of Spheres". Discrete & Computational Geometry. 19 (2): 197–227. doi:10.1007/PL00009341. ISSN 0179-5376.

Kahan summation algorithm (3,532 words) [view diff] exact match in snippet view article find links to article

Floating-Point Arithmetic and Fast Robust Geometric Predicates" (PDF). Discrete & Computational Geometry. 18 (3): 305–363. doi:10.1007/PL00009321. S2CID 189937041

Degree-Rips bifiltration (1,396 words) [view diff] exact match in snippet view article find links to article

(2009-07-01). "The Theory of Multidimensional Persistence". Discrete & Computational Geometry. 42 (1): 71–93. doi:10.1007/s00454-009-9176-0. ISSN 1432-0444

Constantin Carathéodory (4,812 words) [view diff] exact match in snippet view article find links to article

Roman (2012-07-20). "Notes About the Carathéodory Number". Discrete & Computational Geometry. 48 (3): 783–792. arXiv:1112.5942. doi:10.1007/s00454-012-9439-z

Projective plane (6,625 words) [view diff] exact match in snippet view article find links to article

15-vertex triangulation of the quaternionic projective plane", Discrete & Computational Geometry, 62 (2): 348–373, arXiv:1603.05541, doi:10.1007/s00454-018-00055-w

Persistent homology group (1,604 words) [view diff] exact match in snippet view article find links to article

Zomorodian (2002). "Topological Persistence and Simplification". Discrete & Computational Geometry. 28 (4): 511–533. doi:10.1007/s00454-002-2885-2. ISSN 0179-5376

List of regular polytopes (5,294 words) [view diff] exact match in snippet view article find links to article

McMullen, Peter (2004), "Regular polytopes of full rank", Discrete & Computational Geometry, 32: 1–35, doi:10.1007/s00454-004-0848-5, S2CID 46707382 Coxeter

Sparsity matroid (3,454 words) [view diff] exact match in snippet view article find links to article

"Finite and Infinitesimal Rigidity with Polyhedral Norms". Discrete & Computational Geometry. 54 (2): 390–411. arXiv:1401.1336. doi:10.1007/s00454-015-9706-x

Cayley configuration space (4,161 words) [view diff] exact match in snippet view article find links to article

Graphs with Convex and Connected Cayley Configuration Spaces". Discrete & Computational Geometry. 43 (3): 594–625. doi:10.1007/s00454-009-9160-8. ISSN 1432-0444

Self-assembly of nanoparticles (6,088 words) [view diff] exact match in snippet view article find links to article

(2006-07-01). "Historical Overview of the Kepler Conjecture". Discrete & Computational Geometry. 36 (1): 5–20. doi:10.1007/s00454-005-1210-2. ISSN 1432-0444

Geometric rigidity (5,449 words) [view diff] exact match in snippet view article find links to article

Connelly, Robert (2005-04-01). "Generic Global Rigidity". Discrete & Computational Geometry. 33 (4): 549–563. doi:10.1007/s00454-004-1124-4. ISSN 1432-0444