Find link

Symposium on Computational Geometry not in Parameterized approximation algorithm

language:

jump to random article

Find link is a tool written by Edward Betts.

searching for Symposium on Computational Geometry 79 found (138 total)

alternate case: symposium on Computational Geometry

Tetragonal trapezohedron (568 words) [view diff] exact match in snippet view article find links to article

hexahedral mesh generation", Proceedings of the Twelfth Annual Symposium on Computational Geometry (SCG '96), New York, NY, USA: ACM, pp. 58–67, arXiv:cs/9809109
GNRS conjecture (893 words) [view diff] exact match in snippet view article find links to article
Euclidean metrics", Proceedings of the Fifteenth Annual Symposium on Computational Geometry (SoCG '99), New York: ACM, pp. 300–306, doi:10.1145/304893
Beck's theorem (geometry) (1,090 words) [view diff] exact match in snippet view article
Proceedings of the twenty-first annual symposium on Computational geometry. Pisa, Italy: Annual Symposium on Computational Geometry. pp. 16–21. doi:10.1145/1064092
Joseph S. B. Mitchell (414 words) [view diff] exact match in snippet view article find links to article
program committees and was co-chair of the PC for the 21st ACM Symposium on Computational Geometry (2005). Mitchell's primary research area is computational
Knot tabulation (524 words) [view diff] exact match in snippet view article find links to article
Cabello, Sergio; Chen, Danny Z. (eds.). 36th International Symposium on Computational Geometry (SoCG 2020). Leibniz International Proceedings in Informatics
Star unfolding (582 words) [view diff] exact match in snippet view article find links to article
"Shortest paths on a polyhedron", Proceedings of the 6th Annual Symposium on Computational Geometry (SoCG 1990), ACM Press, pp. 360–369, doi:10.1145/98524.98601
Vietoris–Rips complex (1,353 words) [view diff] exact match in snippet view article find links to article
planar Rips complexes", Proceedings of the 24th Annual ACM Symposium on Computational Geometry, pp. 251–259, CiteSeerX 10.1.1.296.6424, doi:10.1145/1377676
Discrete Morse theory (1,997 words) [view diff] case mismatch in snippet view article find links to article
connolly function". Proceedings of the nineteenth annual symposium on Computational geometry. ACM Press. pp. 351–360. doi:10.1145/777792.777845. ISBN 978-1-58113-663-0
Voronoi pole (421 words) [view diff] exact match in snippet view article find links to article
Janardan, Ravi (ed.). Proceedings of the Fourteenth Annual Symposium on Computational Geometry, Minneapolis, Minnesota, USA, June 7–10, 1998. ACM. pp. 39–48
Convex body (481 words) [view diff] exact match in snippet view article find links to article
Volume-Sensitive Bounds for Polytope Approximation". 39th International Symposium on Computational Geometry (SoCG 2023). 258: 9:1–9:16. doi:10.4230/LIPIcs.SoCG.2023
Double wedge (170 words) [view diff] exact match in snippet view article find links to article
geometry", in Yap, Chee (ed.), Proceedings of the Ninth Annual Symposium on Computational Geometry, San Diego, CA, USA, May 19–21, 1993, Association for Computing
Matthew T. Dickerson (959 words) [view diff] exact match in snippet view article find links to article
minimum-weight triangulation". Proceedings of the 12th Annual Symposium on Computational Geometry. Association for Computing Machinery. pp. 204–213. doi:10
Jorge Urrutia Galicia (478 words) [view diff] exact match in snippet view article find links to article
preliminary version in Proceedings of the Twelfth Annual Symposium on Computational Geometry (SoCG 1996), doi:10.1145/237218.237367 Kranakis, Evangelos;
H tree (1,047 words) [view diff] exact match in snippet view article find links to article
bounds for subadditive geometric graphs", Proc. 9th Annual Symposium on Computational Geometry (PDF), Association for Computing Machinery, pp. 183–188,
Bitonic tour (682 words) [view diff] exact match in snippet view article find links to article
Cabello, Sergio; Chen, Danny Z. (eds.), 36th International Symposium on Computational Geometry (SoCG 2020), Leibniz International Proceedings in Informatics
John Canny (385 words) [view diff] exact match in snippet view article find links to article
Dissertation Award. In 1999, he was the co-chair of the Annual Symposium on Computational Geometry. In 2002, he received the American Association for Artificial
Víctor Neumann-Lara (621 words) [view diff] exact match in snippet view article find links to article
and Containment of Families of Convex Sets on the Plane" Symposium on Computational Geometry 71–78 (1995) Jorge L. Arocha, Javier Bracho, Víctor Neumann-Lara
Upward planar drawing (2,328 words) [view diff] exact match in snippet view article find links to article
triconnected digraphs", Proceedings of the Seventh Annual Symposium on Computational Geometry (SCG '91, North Conway, New Hampshire, USA), New York, NY
Art gallery problem (2,530 words) [view diff] exact match in snippet view article find links to article
Aronov, Boris; Katz, Matthew J. (eds.), 33rd International Symposium on Computational Geometry, SoCG 2017, July 4-7, 2017, Brisbane, Australia, LIPIcs,
Dynamic convex hull (769 words) [view diff] exact match in snippet view article find links to article
convex hulls in dynamic simple polygons", 33rd International Symposium on Computational Geometry (SoCG 2017), LIPIcs, vol. 77, Schloss Dagstuhl, pp. 51:1–51:15
Tetrastix (686 words) [view diff] exact match in snippet view article find links to article
in Mehlhorn, Kurt (ed.), Proceedings of the Fifth Annual Symposium on Computational Geometry, Saarbrücken, Germany, June 5-7, 1989 (PDF), New York: ACM
Hinged dissection (547 words) [view diff] case mismatch in snippet view article find links to article
Dissections Exist". Proceedings of the twenty-fourth annual symposium on Computational geometry - SCG '08. p. 110. arXiv:0712.2094. doi:10.1145/1377676.1377695
Vietoris–Rips filtration (2,414 words) [view diff] case mismatch in snippet view article find links to article
"Zigzag zoology". Proceedings of the twenty-ninth annual symposium on Computational geometry. SoCG '13. New York, NY, USA: Association for Computing Machinery
Polygon partition (2,525 words) [view diff] case mismatch in snippet view article find links to article
partitioning rectilinear polygons". Proceedings of the first annual symposium on Computational geometry - SCG '85. Baltimore, Maryland, USA: Association for Computing
Birkhoff polytope (1,007 words) [view diff] exact match in snippet view article find links to article
Random-Walk Methods for Approximating Polytope Volume", Annual Symposium on Computational Geometry - SOCG'14, ACM, pp. 318–327, arXiv:1312.2873, doi:10.1145/2582112
Deltahedron (1,507 words) [view diff] case mismatch in snippet view article find links to article
of non convex polyhedra", Proceedings of the fifth annual symposium on Computational geometry - SCG '89, pp. 237–246, doi:10.1145/73833.73860, ISBN 0-89791-318-3
K-means++ (1,588 words) [view diff] case mismatch in snippet view article find links to article
k-means method?". Proceedings of the twenty-second annual symposium on Computational geometry. ACM New York, NY, USA. pp. 144–153. Kanungo, T.; Mount,
Largest empty rectangle (816 words) [view diff] case mismatch in snippet view article find links to article
largest empty rectangle". Proceedings of the third annual symposium on Computational geometry - SCG '87. pp. 278–290. doi:10.1145/41958.41988. ISBN 0897912314
Linear arboricity (863 words) [view diff] exact match in snippet view article find links to article
geometric thickness of low degree graphs", Proc. 20th ACM Symposium on Computational Geometry (SoCG 2004), pp. 340–346, arXiv:cs.CG/0312056, doi:10.1145/997817
Fortune's algorithm (1,544 words) [view diff] case mismatch in snippet view article find links to article
algorithm for Voronoi diagrams. Proceedings of the second annual symposium on Computational geometry. Yorktown Heights, New York, United States, pp.313–322. 1986
Hanani–Tutte theorem (960 words) [view diff] exact match in snippet view article find links to article
Kevin; Colin de Verdière, Éric (eds.), 37th International Symposium on Computational Geometry, SoCG 2021, June 7–11, 2021, Buffalo, NY, USA (Virtual Conference)
Chazelle polyhedron (311 words) [view diff] case mismatch in snippet view article find links to article
geometric graphs". SCG '03: Proceedings of the nineteenth annual symposium on Computational geometry. Association for Computing Machinery. pp. 171–180. doi:10
Bregman divergence (4,475 words) [view diff] exact match in snippet view article find links to article
"Visualizing Bregman Voronoi diagrams" (PDF). Proc. 23rd ACM Symposium on Computational Geometry (video track). doi:10.1145/1247069.1247089. Boissonnat, Jean-Daniel;
Triangle strip (1,055 words) [view diff] exact match in snippet view article find links to article
polygonal models into triangle strips. In Proceedings of Symposium on Computational Geometry'2002. pp.254~263 url=http://www.ams.sunysb.edu/~jsbm/papers/p151-mitchell
Offset filtration (1,740 words) [view diff] case mismatch in snippet view article find links to article
balls and its dual shape". Proceedings of the ninth annual symposium on Computational geometry - SCG '93. San Diego, California, United States: ACM Press
Polymake (1,306 words) [view diff] case mismatch in snippet view article find links to article
computational geometry". Proceedings of the seventeenth annual symposium on Computational geometry. SCG '01. New York, NY, USA: Association for Computing Machinery
Matchstick graph (1,597 words) [view diff] exact match in snippet view article find links to article
in Fekete, Sándor; Lubiw, Anna (eds.), 32nd International Symposium on Computational Geometry (SoCG 2016), Leibniz International Proceedings in Informatics
Geometric spanner (1,180 words) [view diff] exact match in snippet view article find links to article
almost as good as the complete graph", Proc. 2nd Annual Symposium on Computational Geometry, pp. 169–177, doi:10.1145/10515.10534, S2CID 42010166. Klein
Binary tiling (3,093 words) [view diff] exact match in snippet view article find links to article
Wolfgang; Phillips, Jeff M. (eds.). 40th International Symposium on Computational Geometry, SoCG 2024, June 11-14, 2024, Athens, Greece. LIPIcs. Vol
Tverberg's theorem (1,356 words) [view diff] case mismatch in snippet view article find links to article
the Whitney Trick", Proceedings of the thirtieth annual symposium on Computational geometry, pp. 171–180, doi:10.1145/2582112.2582134, ISBN 978-1-4503-2594-3
Beam tracing (663 words) [view diff] case mismatch in snippet view article find links to article
"Topological beam tracing". Proceedings of the fifteenth annual symposium on Computational geometry. pp. 59–68. doi:10.1145/304893.304911. ISBN 1-58113-068-6
NP-intermediate (1,547 words) [view diff] exact match in snippet view article find links to article
In Seidel, Raimund (ed.). Proceedings of the Sixth Annual Symposium on Computational Geometry, Berkeley, CA, USA, June 6-8, 1990. ACM. pp. 332–339. doi:10
Point-set triangulation (1,146 words) [view diff] case mismatch in snippet view article find links to article
MinMax angle triangulation. Proceedings of the sixth annual symposium on Computational geometry. SCG '90. ACM. pp. 44–52. CiteSeerX 10.1.1.66.2895. doi:10
Kinetic heap (1,097 words) [view diff] case mismatch in snippet view article find links to article
segments with a heap". Proceedings of the thirteenth annual symposium on Computational geometry. SCG. ACM. pp. 469–471. Retrieved May 17, 2012.{{cite conference}}:
Relative convex hull (1,112 words) [view diff] exact match in snippet view article find links to article
convex hulls in dynamic simple polygons", 33rd International Symposium on Computational Geometry (SoCG 2017), LIPIcs, vol. 77, Schloss Dagstuhl, pp. 51:1–51:15
Χ-bounded (1,522 words) [view diff] exact match in snippet view article find links to article
{\displaystyle \chi } -bounded", Proceedings of the Thirtieth Annual Symposium on Computational Geometry (SoCG'14), New York: ACM, pp. 136–143, doi:10.1145/2582112
Ken Goldberg (1,650 words) [view diff] exact match in snippet view article find links to article
Automation. Ken Goldberg. Invited Keynote: Extended Abstract. ACM Symposium on Computational Geometry (SoCG). Rio de Janeiro, Brazil. June 2013. ACM Digital Library
Topological data analysis (10,965 words) [view diff] case mismatch in snippet view article find links to article
their diagrams". Proceedings of the twenty-fifth annual symposium on Computational geometry. SCG '09. ACM. pp. 237–246. CiteSeerX 10.1.1.473.2112. doi:10
Visibility polygon (1,859 words) [view diff] case mismatch in snippet view article find links to article
algorithms for constructing visibility polygons with holes. Symposium on Computational geometry. ACM. pp. 14–23. doi:10.1145/10515.10517. Arkin, E.; Mitchell
Criss-cross algorithm (2,432 words) [view diff] exact match in snippet view article find links to article
polyhedra". Discrete and Computational Geometry. 8 (ACM Symposium on Computational Geometry (North Conway, NH, 1991) number 1): 295–313. doi:10.1007/BF02293050
Interleaving distance (997 words) [view diff] case mismatch in snippet view article find links to article
their diagrams". Proceedings of the twenty-fifth annual symposium on Computational geometry. SCG '09. New York, NY, USA: Association for Computing Machinery
Geometric set cover problem (854 words) [view diff] exact match in snippet view article find links to article
Sets and Set Covers". Proceedings of the thirtieth annual symposium on Computational Geometry. Feige, Uriel (1998), "A threshold of ln n for approximating
Vapnik–Chervonenkis dimension (2,870 words) [view diff] case mismatch in snippet view article find links to article
Vapnik-Chervonenkis dimension". Proceedings of the third annual symposium on Computational geometry – SCG '87. p. 331. doi:10.1145/41958.41994. ISBN 978-0897912310
Szemerédi–Trotter theorem (2,432 words) [view diff] case mismatch in snippet view article find links to article
transformations". Proceedings of the twenty-third annual symposium on Computational geometry - SCG '07. New York, New York, USA: ACM Press. pp. 227–231
1-planar graph (2,757 words) [view diff] exact match in snippet view article find links to article
Bibcode:2012arXiv1203.5944C. Expanded version of a paper from the 17th ACM Symposium on Computational Geometry, 2010. Bannister, Michael J.; Cabello, Sergio; Eppstein,
Polygon covering (2,229 words) [view diff] case mismatch in snippet view article find links to article
convex orthogonal polygon". Proceedings of the second annual symposium on Computational geometry - SCG '86. pp. 43–51. doi:10.1145/10515.10520. ISBN 978-0897911948
Reverse-search algorithm (2,054 words) [view diff] exact match in snippet view article find links to article
1007/BF02293050, MR 1174359; preliminary version in Seventh Annual Symposium on Computational Geometry, 1991, doi:10.1145/109648.109659 Avis, David; Fukuda, Komei
Apex graph (2,820 words) [view diff] exact match in snippet view article find links to article
planar graphs makes crossing number hard", Proc. 26th ACM Symposium on Computational Geometry (SoCG '10) (PDF), pp. 68–76, doi:10.1145/1810959.1810972
K-set (geometry) (2,348 words) [view diff] exact match in snippet view article
lines, segments, planes, and triangles". Proc. 13th Annual Symposium on Computational Geometry. pp. 30–38. Alon, N.; Győri, E. (1986). "The number of small
Kernel density estimation (4,618 words) [view diff] case mismatch in snippet view article find links to article
Landscapes and Silhouettes". Proceedings of the thirtieth annual symposium on Computational geometry. Vol. 6. New York, New York, USA: ACM Press. pp. 474–483
Voronoi diagram (5,504 words) [view diff] case mismatch in snippet view article find links to article
of the Sites". Proceedings of the twenty-seventh annual symposium on Computational geometry. pp. 254–263. arXiv:1103.4125. Bibcode:2011arXiv1103.4125R
Polygonalization (2,758 words) [view diff] exact match in snippet view article find links to article
Fekete, Sándor P.; Lubiw, Anna (eds.), 32nd International Symposium on Computational Geometry, SoCG 2016, June 14-18, 2016, Boston, MA, USA, LIPIcs, vol
Locality-sensitive hashing (4,202 words) [view diff] exact match in snippet view article find links to article
Scheme Based on p-Stable Distributions". Proceedings of the Symposium on Computational Geometry. Pauleve, L.; Jegou, H.; Amsaleg, L. (2010). "Locality sensitive
Subdivision bifiltration (1,173 words) [view diff] case mismatch in snippet view article find links to article
euclidean spaces". Proceedings of the twenty-fourth annual symposium on Computational geometry. pp. 232–241. arXiv:0712.2638. doi:10.1145/1377676.1377719
Unit distance graph (4,029 words) [view diff] exact match in snippet view article find links to article
S. B.; Rote, Günter (eds.), Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005, Association for Computing Machinery
Knot theory (6,492 words) [view diff] exact match in snippet view article find links to article
(2020). "The Next 350 Million Knots". 36th International Symposium on Computational Geometry (SoCG 2020). Leibniz Int. Proc. Inform. Vol. 164. Schloss
Doignon's theorem (655 words) [view diff] exact match in snippet view article find links to article
Erin W.; Gudmundsson, Joachim (eds.), 39th International Symposium on Computational Geometry, SoCG 2023, June 12–15, 2023, Dallas, Texas, USA, LIPIcs
Minimum spanning tree (5,460 words) [view diff] exact match in snippet view article find links to article
based on minimum and maximum spanning trees. Fourth Annual Symposium on Computational Geometry (SCG '88). Vol. 1. pp. 252–257. doi:10.1145/73393.73419.
Linkless embedding (3,484 words) [view diff] exact match in snippet view article find links to article
embeddings in 3-space and the unknot problem", Proc. ACM Symposium on Computational Geometry (SoCG '10), pp. 97–106, doi:10.1145/1810959.1810975, ISBN 978-1-4503-0016-2
Topological graph (3,579 words) [view diff] exact match in snippet view article find links to article
preliminary version of these results was announced in Proc. of Symposium on Computational Geometry (PDF), 2008, pp. 346–354, doi:10.1145/1377676.1377735, S2CID 15138458
Opaque set (4,100 words) [view diff] exact match in snippet view article find links to article
Minghui (2014), "The opaque square", Proc. 30th Annual Symposium on Computational Geometry (SoCG'14), New York: Association for Computing Machinery
Metric space (11,429 words) [view diff] case mismatch in snippet view article find links to article
snowflake metrics. SOCG '14: Proceedings of the thirtieth annual symposium on Computational geometry. pp. 387–395. arXiv:1401.5014. doi:10.1145/2582112.2582140
Euclidean minimum spanning tree (6,676 words) [view diff] exact match in snippet view article find links to article
Jean-Daniel (ed.), Proceedings of the Thirteenth Annual Symposium on Computational Geometry, Nice, France, June 4–6, 1997, Association for Computing
Book embedding (8,167 words) [view diff] exact match in snippet view article find links to article
Kn (extended abstract)", Proceedings of the 28th Annual Symposium on Computational Geometry (SCG'12), ACM, New York, pp. 397–403, doi:10.1145/2261250
Brunn–Minkowski theorem (2,993 words) [view diff] exact match in snippet view article find links to article
hard". In Erickson, Jeff (ed.). Proceedings of the 23rd ACM Symposium on Computational Geometry, Gyeongju, South Korea, June 6–8, 2007. pp. 302–305. doi:10
Fat object (geometry) (4,907 words) [view diff] case mismatch in snippet view article
obstacles (extended abstract)". Proceedings of the tenth annual symposium on Computational geometry - SCG '94. p. 31. doi:10.1145/177424.177453. ISBN 978-0897916486
Arrangement of pseudolines (1,895 words) [view diff] exact match in snippet view article find links to article
An Extension Theorem for Signotopes. 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics
Planar separator theorem (10,072 words) [view diff] exact match in snippet view article find links to article
(1996), "Disk packings and planar separators", Proc. 12th ACM Symposium on Computational Geometry (SCG '96) (PDF), pp. 349–358, doi:10.1145/237218.237404,
Parameterized approximation algorithm (3,440 words) [view diff] case mismatch in snippet view article find links to article
on weak coresets". Proceedings of the twenty-third annual symposium on Computational geometry - SCG '07. New York, NY, USA: Association for Computing Machinery