982:"This book is a collection of surveys and exploratory articles about recent developments in the field of computational Euclidean geometry." Its 11 chapters cover quantitative geometry, a history of computational geometry, mesh generation, automated generation of geometric proofs, randomized geometric algorithms, Steiner tree problems, Voronoi diagrams and Delaunay triangulations, constraint solving, spline surfaces, network design, and numerical primitives for geometric computing.
211:, which are shown to constitute a basic underlying combinatorial-geometric structure in certain areas of the field. The primary target audience are active theoretical researchers in the field, rather than application developers. Unlike most of books in computational geometry focused on 2- and 3-dimensional problems (where most applications of computational geometry are), the book aims to treat its subject in the general multi-dimensional setting.
927:
The handbook contains survey chapters in classical and new studies in geometric algorithms: hyperplane arrangements, Voronoi diagrams, geometric and spatial data structures, polygon decomposition, randomized algorithms, derandomization, parallel computational geometry (deterministic and randomized),
270:
The book consists of the following chapters (which provide both solutions for the topic of the title and its applications): "Computational
Geometry (Introduction)" "Line Segment Intersection", "Polygon Triangulation", "Linear Programming", "Orthogonal Range Searching", "Point Location", "Voronoi
106:
The book is the first comprehensive monograph on the level of a graduate textbook to systematically cover the fundamental aspects of the emerging discipline of computational geometry. It is written by founders of the field and the first edition covered all major developments in the preceding 10
262:
The textbook provides an introduction to computation geometry from the point of view of practical applications. Starting with an introduction chapter, each of the 15 remaining ones formulates a real application problem, formulates an underlying geometrical problem, and discusses techniques of
266:
The goal of the book is to provide a comprehensive introduction into methods and approached, rather than the cutting edge of the research in the field: the presented algorithms provide transparent and reasonably efficient solutions based on fundamental "building blocks" of computational
1321:, vol 33 no. 12, 1984, 1072-1101. (Errata: IEEE Tr. C. vol.34, no.6, 1985) Although not a book, this 30-page paper is of historical interest, because it was the first comprehensive coverage, the 1984 snapshot of the emerging discipline, with 354-item bibliography.
892:, as well as a broad range of their applications. The second edition expands the book by half, with 14 chapters added and old chapters brought up to date. Its 65 chapters (in over 1,500 pages) are written by a large team of active researchers in the field.
1445:
32 papers, including surveys and research articles on geometric arrangements, polytopes, packing, covering, discrete convexity, geometric algorithms and their computational complexity, and the combinatorial complexity of geometric
271:
Diagrams", "Arrangements and
Duality", "Delaunay Triangulations", "More Geometric Data Structures", "Convex Hulls", "Binary Space Partitions", "Robot Motion Planning", "Quadtrees", "Visibility Graphs", "Simplex Range Searching".
767:
1676:
1640:
1266:— This book combines graphics, vision and geometric computing and targets advanced undergraduates and professionals in game development and graphics. Includes some concise C++ code for common tasks.
30:, which deals with collections of discrete objects or defined in discrete terms: points, lines, polygons, polytopes, etc., and algorithms of discrete/combinatorial character are used
1633:
1401:
396:
This book is an interactive introduction to the fundamental algorithms of computational geometry, formatted as an interactive document viewable using software based on
1626:
1468:
110:
In the aspect of comprehensiveness it was preceded only by the 1984 survey paper, Lee, D, T., Preparata, F. P.: "Computational geometry - a survey".
1431:
119:
The initial core of the book was M.I.Shamos' doctoral dissertation, which was suggested to turn into a book by a yet another pioneer in the field,
1451:"Surveys on Discrete and Computational Geometry: Twenty Years Later" ("Contemporary Mathematics" series), American Mathematical Society, 2008,
1338:
804:
736:
641:
550:
501:
474:
387:
359:
263:
computational geometry useful for its solution, with algorithms provided in pseudocode. The book treats mostly 2- and 3-dimensional geometry.
245:
1394:
1662:
116:. Vol. 33, No. 12, pp. 1072–1101 (1984). It is focused on two-dimensional problems, but also has digressions into higher dimensions.
1700:
1358:
822:
668:
1683:
1456:
1439:
1284:
1263:
1245:
1174:
1146:
1112:
1086:
1052:
1022:
973:
918:
875:
865:
781:
706:
618:
592:
527:
430:
327:
299:
255:
198:
99:
91:
81:
1364:
1669:
1387:
910:
857:
937:
41:(CAGD), which deals with modelling of shapes of real-life objects in terms of curves and surfaces with algebraic representation.
1747:
1742:
158:
38:
1375:
849:
664:
460:
341:
309:
1613:
1074:
948:
944:
and spanners for geometric graphs, robustness and numerical issues for geometric algorithms, animation, and graph drawing.
516:
Computational
Geometry on Surfaces: Performing Computational Geometry on the Cylinder, the Sphere, the Torus, and the Cone
207:
The monograph is a rather advanced exposition of problems and approaches in computational geometry focused on the role of
1292:
464:
1032:
166:
1251:
1236:
884:
828:
796:
773:
633:
584:
519:
351:
319:
291:
902:
112:
1752:
1188:
1044:
674:
1156:
1062:
929:
889:
814:
379:
277:
208:
27:
1408:
134:
1318:
1304:
1288:
1122:
127:
126:
The introduction covers the history of the field, basic data structures, and necessary notions from the
1006:
1296:
1223:
898:
285:
178:
1036:
1126:
698:
170:
57:
1325:
George T. Heineman; Gary
Pollice & Stanley Selkow (2008). "Chapter 9:Computational Geometry".
1096:
565:
Data
Structures and Efficient Algorithms 3: Multi-dimensional Searching and Computational Geometry
373:
1300:
1160:
961:
61:
34:
1002:
369:
1452:
1435:
1334:
1280:
1259:
1241:
1170:
1142:
1108:
1082:
1048:
1018:
969:
914:
871:
861:
800:
777:
763:
732:
702:
686:
637:
614:
588:
546:
523:
497:
470:
440:
426:
383:
355:
323:
295:
251:
241:
194:
95:
87:
77:
1555:
1547:
1531:
1515:
1507:
1314:
1227:
1219:
1202:
1066:
845:
652:
225:
1496:
1489:
1559:
1551:
1535:
1519:
1511:
1493:
1486:
1166:
1138:
1130:
1078:
818:
751:
568:
542:
493:
337:
281:
237:
190:
154:
142:
73:
1618:
1588:
1269:
1231:
1104:
990:
Numerical computational geometry (geometric modelling, computer-aided geometric design)
728:
691:
602:
221:
150:
138:
66:
1011:
Computational
Geometry for Design and Manufacture (Mathematics & Its Applications)
1736:
1423:
1330:
1014:
941:
933:
721:
682:
610:
576:
560:
422:
229:
183:
162:
120:
1382:
The conferences below, of broad scope, published many seminal papers in the domain.
968:. Lectures Notes Series on Computing. Vol. 4 (2nd ed.). World Scientific.
947:
In addition, the book surveys applications of geometric algorithms in such areas as
888:, in its comprehensiveness, only restricted to discrete and computational geometry,
1310:
759:
485:
456:
444:
414:
313:
217:
957:
716:
511:
397:
146:
1345:— This book has associated code repository with full Java implementations
1287:— Chapter 9: "Algorithms for VLSI Design Tools" describes algorithms for
882:
In its organization, the book resembles the classical handbook in algorithms,
1427:
951:, geometric shortest path and network optimization and mesh generation.
1407:
Annual
Allerton Conference on Communications, Control and Computing (
607:
Computational
Geometry: An Introduction Through Randomized Algorithms
657:
Spatial
Tessellations: Concepts and Applications of Voronoi Diagrams
345:
1422:"Combinatorial and Computational Geometry", eds. Jacob E. Goodman,
1711:
Japan
Conference on Discrete and Computational Geometry and Graphs
1572:
About the book by de Berg, van Kreveld, Overmars, and Schwarzkopf
1041:
An Introduction to Computational Geometry for Curves and Surfaces
1677:
International Journal of Computational Geometry and Applications
1275:
1622:
1571:
490:
CGAL Arrangements and Their Applications, A Step-by-Step Guide
769:
Davenport–Schinzel Sequences and Their Geometric Applications
1374:
Japanese Conference on Discrete and Computational Geometry (
1135:
Splines for Use in Computer Graphics and Geometric Modeling
86:. 1st edition; 2nd printing, corrected and expanded, 1988:
1248:. — This book has a chapter on geometric algorithms.
581:
LEDA, A Platform for Combinatorial and Geometric Computing
466:
Geometric Folding Algorithms: Linkages, Origami, Polyhedra
22:. There are two major, largely nonoverlapping categories:
375:
Interactive Computational Geometry - A taxonomic approach
1071:
Effective Computational Geometry for Curves and Surfaces
1101:
Curves and Surfaces for Computer Aided Geometric Design
1368:
1718:
1693:
1654:
1240:, Second Edition. MIT Press and McGraw-Hill, 1990.
928:visibility, Art Gallery and Illumination Problems,
923:. 1st edition:, 2nd edition (2000): 1-584-88301-4.
723:The Design and Analysis of Spatial Data Structures
720:
690:
182:
65:
1402:IEEE Symposium on Foundations of Computer Science
1181:The book is out of print. Its main chapters are:
1256:Visual Computing: Graphics, Vision, and Geometry
33:Numerical computational geometry, also known as
1670:Computational Geometry: Theory and Applications
854:Handbook of Discrete and Computational Geometry
1705:Canadian Conference on Computational Geometry
1634:
1469:List of important publications in mathematics
1365:Canadian Conference on Computational Geometry
1162:Geometric and Solid Modeling: An Introduction
746:Philip J. Schneider; David H. Eberly (2002).
8:
449:Voronoi Diagrams and Delaunay Triangulations
1708:European Workshop on Computational Geometry
936:problems, similarity of geometric objects,
1641:
1627:
1619:
1193:Robust and Error-Free Geometric Operations
827:. Cambridge Texts in Applied Mathematics.
149:computation, proximity-related problems (
1196:Representation of Curved Edges and Faces
68:Computational Geometry - An Introduction
1724:List of books in computational geometry
1479:
1317:, "Computational Geometry - A Survey",
304:. Translation of a 1995 French edition.
20:list of books in computational geometry
1649:Publications in computational geometry
659:(2nd ed.). John Wiley & Sons.
628:Giri Narasimhan; Michiel Smid (2007).
153:, computation and applications of the
1663:Discrete & Computational Geometry
748:Geometric Tools for Computer Graphics
7:
1395:ACM Symposium on Theory of Computing
1075:Mathematics and Visualization Series
407:Specialized textbooks and monographs
185:Algorithms in Combinatorial Geometry
46:Combinatorial computational geometry
1701:Symposium on Computational Geometry
1584:Handbook for Computational Geometry
1530:A review of Edelsbrunner's book in
1359:Symposium on Computational Geometry
824:Geometric and Topological Inference
670:Art Gallery Theorems and Algorithms
347:Discrete and Computational Geometry
907:Handbook of Computational Geometry
793:Visibility Algorithms in the Plane
537:Fajie Li; Reinhard Klette (2011).
14:
1684:Journal of Computational Geometry
1434:Publications – Volume 52), 2005,
1388:Symposium on Discrete Algorithms
1279:, Computer Science Press, 1984,
966:Computing in Euclidean Geometry
419:Parallel Computational Geometry
167:geometric intersection problems
159:Euclidean minimum spanning tree
39:computer-aided geometric design
949:geographic information systems
514:& Alberto Márquez (1990).
469:. Cambridge University Press.
133:The subsequent sections cover
1:
1601:From the flyleaf of the book.
1258:, Charles River Media, 2005.
870:. 1st edition:, 2nd edition:
651:Atsuyuki Okabe; Barry Boots;
94:; Russian translation, 1989:
1614:Computational Geometry Pages
1293:electronic design automation
938:Davenport–Schinzel sequences
791:Ghosh, Subir Kumar (2007).
315:Computational Geometry in C
1769:
1237:Introduction to Algorithms
885:Introduction to Algorithms
829:Cambridge University Press
797:Cambridge University Press
774:Cambridge University Press
634:Cambridge University Press
630:Geometric Spanner Networks
585:Cambridge University Press
520:Kluwer Academic Publishers
352:Princeton University Press
320:Cambridge University Press
292:Cambridge University Press
1274:Computational Aspects of
417:; Kelly A. Lyons (1993).
169:, algorithms for sets of
51:General-purpose textbooks
1327:Algorithms in a Nutshell
655:; Sung Nok Chiu (2000).
539:Euclidean Shortest Paths
236:(3rd revised ed.).
113:IEEE Trans. on Computers
1189:Boundary Representation
1045:Oxford University Press
815:Boissonnat, Jean-Daniel
675:Oxford University Press
579:; Stefan Näher (1999).
209:hyperplane arrangements
1748:Computer science books
1743:Computational geometry
1187:Boolean Operations on
1063:Jean-Daniel Boissonnat
930:closest point problems
890:computational topology
693:Combinatorial Geometry
278:Jean-Daniel Boissonnat
250:. 1st edition (1997):
234:Computational Geometry
28:computational geometry
1319:IEEE Trans. Computers
1305:placement and routing
1199:Surface Intersections
1157:Christoph M. Hoffmann
128:theory of computation
1333:. pp. 251–298.
1297:design rule checking
1224:Charles E. Leiserson
817:; Chazal, Frédéric;
380:Mountain Way Limited
287:Algorithmic Geometry
179:Herbert Edelsbrunner
171:isothetic rectangles
1315:Franco P. Preparata
699:John Wiley and Sons
488:; Ron Wein (2012).
451:. World Scientific.
135:geometric searching
58:Franco P. Preparata
1301:circuit extraction
1289:polygon operations
1123:Richard H. Bartels
62:Michael Ian Shamos
35:geometric modeling
1730:
1729:
1417:Paper collections
1340:978-0-596-51624-6
899:Jörg-Rudiger Sack
806:978-0-521-87574-5
764:Pankaj K. Agarwal
738:978-0-201-50255-8
687:Pankaj K. Agarwal
643:978-0-521-81513-0
552:978-1-4471-2255-5
503:978-3-642-17283-0
476:978-0-521-85757-4
441:Franz Aurenhammer
389:978-0-9572928-2-6
361:978-0-691-14553-2
247:978-3-540-77973-5
1760:
1643:
1636:
1629:
1620:
1602:
1599:
1593:
1582:A review of the
1580:
1574:
1569:
1563:
1544:
1538:
1528:
1522:
1505:
1499:
1484:
1344:
1228:Ronald L. Rivest
1220:Thomas H. Cormen
1180:
1152:
1118:
1092:
1067:Monique Teillaud
1058:
1028:
1007:Michael J. Pratt
979:
924:
879:
852:, eds. (2004) .
846:Jacob E. Goodman
832:
819:Yvinec, Mariette
810:
787:
755:
742:
726:
712:
696:
678:
660:
653:Kokichi Sugihara
647:
624:
598:
572:
556:
533:
507:
480:
452:
436:
393:
365:
333:
318:(2nd ed.).
305:
259:
226:Marc van Kreveld
204:
188:
103:
71:
1768:
1767:
1763:
1762:
1761:
1759:
1758:
1757:
1733:
1732:
1731:
1726:
1714:
1689:
1650:
1647:
1610:
1605:
1600:
1596:
1592:, January 2005.
1581:
1577:
1570:
1566:
1545:
1541:
1529:
1525:
1506:
1502:
1485:
1481:
1477:
1465:
1419:
1414:
1353:
1348:
1341:
1324:
1215:
1210:
1177:
1167:Morgan Kaufmann
1155:
1149:
1139:Morgan Kaufmann
1131:Brian A. Barsky
1121:
1115:
1095:
1089:
1079:Springer Verlag
1061:
1055:
1031:
1025:
1001:
997:
992:
987:
976:
956:
921:
897:
868:
850:Joseph O'Rourke
844:
840:
835:
813:
807:
790:
784:
758:
752:Morgan Kaufmann
745:
739:
715:
709:
681:
665:Joseph O'Rourke
663:
650:
644:
627:
621:
601:
595:
575:
569:Springer-Verlag
559:
553:
543:Springer-Verlag
536:
530:
510:
504:
494:Springer-Verlag
483:
477:
461:Joseph O'Rourke
457:Erik D. Demaine
455:
439:
433:
413:
409:
390:
368:
362:
342:Joseph O'Rourke
338:Satyan Devadoss
336:
330:
310:Joseph O'Rourke
308:
302:
282:Mariette Yvinec
276:
248:
238:Springer-Verlag
216:
201:
191:Springer-Verlag
177:
155:Voronoi diagram
143:range searching
84:
74:Springer-Verlag
56:
53:
48:
12:
11:
5:
1766:
1764:
1756:
1755:
1753:Lists of books
1750:
1745:
1735:
1734:
1728:
1727:
1722:
1720:
1716:
1715:
1713:
1712:
1709:
1706:
1703:
1697:
1695:
1691:
1690:
1688:
1687:
1680:
1673:
1666:
1658:
1656:
1652:
1651:
1648:
1646:
1645:
1638:
1631:
1623:
1617:
1616:
1609:
1608:External links
1606:
1604:
1603:
1594:
1589:Geombinatorics
1575:
1564:
1539:
1523:
1500:
1478:
1476:
1473:
1472:
1471:
1464:
1461:
1460:
1459:
1449:
1448:
1447:
1418:
1415:
1413:
1412:
1405:
1398:
1391:
1380:
1379:
1372:
1362:
1354:
1352:
1349:
1347:
1346:
1339:
1322:
1308:
1270:Jeffrey Ullman
1267:
1249:
1232:Clifford Stein
1216:
1214:
1211:
1209:
1208:
1207:
1206:
1200:
1197:
1194:
1191:
1185:
1184:Basic Concepts
1175:
1153:
1147:
1119:
1113:
1105:Academic Press
1093:
1087:
1059:
1053:
1037:Philip Samuels
1029:
1023:
998:
996:
993:
991:
988:
986:
985:
984:
983:
974:
954:
953:
952:
945:
942:spanning trees
919:
895:
894:
893:
866:
841:
839:
836:
834:
833:
811:
805:
788:
782:
756:
743:
737:
729:Addison-Wesley
713:
707:
679:
661:
648:
642:
625:
619:
603:Ketan Mulmuley
599:
593:
573:
557:
551:
534:
528:
512:Clara I. Grima
508:
502:
481:
475:
453:
443:; Rolf Klein;
437:
431:
410:
408:
405:
404:
403:
402:
401:
392:. 1st edition.
388:
366:
360:
334:
328:
306:
300:
274:
273:
272:
268:
264:
246:
222:Otfried Cheong
214:
213:
212:
199:
175:
174:
173:
163:triangulations
151:closest points
139:point location
131:
124:
117:
108:
82:
52:
49:
47:
44:
43:
42:
31:
26:Combinatorial
13:
10:
9:
6:
4:
3:
2:
1765:
1754:
1751:
1749:
1746:
1744:
1741:
1740:
1738:
1725:
1721:
1717:
1710:
1707:
1704:
1702:
1699:
1698:
1696:
1692:
1686:
1685:
1681:
1679:
1678:
1674:
1672:
1671:
1667:
1665:
1664:
1660:
1659:
1657:
1653:
1644:
1639:
1637:
1632:
1630:
1625:
1624:
1621:
1615:
1612:
1611:
1607:
1598:
1595:
1591:
1590:
1585:
1579:
1576:
1573:
1568:
1565:
1561:
1557:
1553:
1549:
1543:
1540:
1537:
1533:
1527:
1524:
1521:
1517:
1513:
1509:
1504:
1501:
1498:
1495:
1491:
1488:
1483:
1480:
1474:
1470:
1467:
1466:
1462:
1458:
1457:0-8218-4239-0
1454:
1450:
1444:
1443:
1441:
1440:0-521-84862-8
1437:
1433:
1429:
1425:
1421:
1420:
1416:
1410:
1406:
1403:
1399:
1396:
1392:
1389:
1385:
1384:
1383:
1377:
1373:
1370:
1366:
1363:
1360:
1356:
1355:
1350:
1342:
1336:
1332:
1331:Oreilly Media
1328:
1323:
1320:
1316:
1312:
1309:
1306:
1302:
1298:
1294:
1290:
1286:
1285:0-914894-95-1
1282:
1278:
1277:
1271:
1268:
1265:
1264:1-58450-427-7
1261:
1257:
1253:
1252:Frank Nielsen
1250:
1247:
1246:0-262-03293-7
1243:
1239:
1238:
1233:
1229:
1225:
1221:
1218:
1217:
1212:
1204:
1203:Gröbner Bases
1201:
1198:
1195:
1192:
1190:
1186:
1183:
1182:
1178:
1176:1-55860-067-1
1172:
1168:
1164:
1163:
1158:
1154:
1150:
1148:0-934613-27-3
1144:
1140:
1136:
1132:
1128:
1127:John C Beatty
1124:
1120:
1116:
1114:0-12-249050-9
1110:
1106:
1102:
1098:
1094:
1090:
1088:3-540-33258-8
1084:
1080:
1076:
1072:
1068:
1064:
1060:
1056:
1054:0-19-853695-X
1050:
1046:
1042:
1038:
1034:
1030:
1026:
1024:0-470-27069-1
1020:
1016:
1015:Prentice Hall
1012:
1008:
1004:
1000:
999:
994:
989:
981:
980:
977:
975:981-02-1876-1
971:
967:
963:
959:
955:
950:
946:
943:
939:
935:
934:link distance
931:
926:
925:
922:
920:0-444-82537-1
916:
912:
911:North-Holland
908:
904:
903:Jorge Urrutia
900:
896:
891:
887:
886:
881:
880:
877:
876:1-58488-301-4
873:
869:
867:0-8493-8524-5
863:
859:
858:North-Holland
855:
851:
847:
843:
842:
837:
830:
826:
825:
820:
816:
812:
808:
802:
798:
794:
789:
785:
783:0-521-47025-0
779:
775:
771:
770:
765:
761:
757:
753:
749:
744:
740:
734:
730:
725:
724:
718:
714:
710:
708:0-471-58890-3
704:
700:
695:
694:
688:
684:
680:
676:
672:
671:
666:
662:
658:
654:
649:
645:
639:
635:
631:
626:
622:
620:0-13-336363-5
616:
612:
611:Prentice-Hall
608:
604:
600:
596:
594:0-521-56329-1
590:
586:
582:
578:
577:Kurt Mehlhorn
574:
570:
566:
562:
561:Kurt Mehlhorn
558:
554:
548:
544:
540:
535:
531:
529:1-4020-0202-5
525:
521:
517:
513:
509:
505:
499:
495:
491:
487:
482:
478:
472:
468:
467:
462:
458:
454:
450:
446:
442:
438:
434:
432:0-13-652017-0
428:
424:
423:Prentice-Hall
420:
416:
412:
411:
406:
399:
395:
394:
391:
385:
381:
377:
376:
371:
367:
363:
357:
353:
349:
348:
343:
339:
335:
331:
329:0-521-64976-5
325:
321:
317:
316:
311:
307:
303:
301:0-521-56529-4
297:
293:
289:
288:
283:
279:
275:
269:
265:
261:
260:
257:
256:3-540-61270-X
253:
249:
243:
239:
235:
231:
230:Mark Overmars
227:
223:
219:
215:
210:
206:
205:
202:
200:0-89791-517-8
196:
192:
187:
186:
180:
176:
172:
168:
164:
160:
156:
152:
148:
144:
140:
136:
132:
130:and geometry.
129:
125:
122:
121:Ronald Graham
118:
115:
114:
109:
105:
104:
101:
100:5-03-001041-6
97:
93:
92:3-540-96131-3
89:
85:
83:0-387-96131-3
79:
75:
70:
69:
63:
59:
55:
54:
50:
45:
40:
36:
32:
29:
25:
24:
23:
21:
16:
1723:
1682:
1675:
1668:
1661:
1597:
1587:
1583:
1578:
1567:
1542:
1526:
1503:
1482:
1381:
1326:
1291:involved in
1273:
1255:
1235:
1161:
1134:
1100:
1097:Gerald Farin
1077: ed.).
1070:
1040:
1010:
965:
906:
883:
853:
823:
792:
768:
760:Micha Sharir
747:
722:
692:
669:
656:
629:
606:
580:
564:
538:
515:
489:
486:Dan Halperin
465:
448:
445:Der-Tsai Lee
418:
415:Selim G. Akl
374:
346:
314:
286:
233:
218:Mark de Berg
184:
111:
67:
19:
17:
15:
1694:Conferences
1554:(1st ed.),
1546:Reviews in
1351:Conferences
1033:Alan Davies
962:Frank Hwang
958:Ding-Zhu Du
717:Hanan Samet
484:Efi Fogel;
398:Mathematica
147:convex hull
1737:Categories
1560:0939.68134
1552:0877.68001
1536:0634.52001
1520:0575.68059
1512:0575.68037
1475:References
1424:János Pach
1205:Techniques
1003:I. D. Faux
995:Monographs
838:References
683:János Pach
18:This is a
1562:(2nd ed.)
1428:Emo Welzl
1386:ACM-SIAM
370:Jim Arlow
267:geometry.
165:, etc.),
1655:Journals
1463:See also
1446:objects.
1311:D.T. Lee
1159:(1989).
1133:(1987).
1099:(1988).
1069:(2006).
1039:(1996).
1009:(1980).
964:(1995).
905:(1998).
821:(2018).
766:(1995).
719:(1990).
689:(1995).
667:(1987).
605:(1994).
563:(1984).
463:(2007).
447:(2013).
372:(2014).
344:(2011).
312:(1998).
284:(1998).
232:(2008).
181:(1987).
64:(1985).
1497:1004870
1490:0805539
1400:Annual
1393:Annual
1357:Annual
1558:
1550:
1534:
1518:
1510:
1455:
1438:
1404:(FOCS)
1397:(STOC)
1390:(SODA)
1361:(SoCG)
1337:
1283:
1262:
1244:
1230:, and
1173:
1145:
1111:
1085:
1051:
1021:
972:
917:
874:
864:
803:
780:
735:
705:
640:
617:
591:
549:
526:
500:
473:
429:
386:
358:
326:
298:
254:
244:
197:
107:years.
98:
90:
80:
1719:Books
1376:JCDCG
1213:Other
1453:ISBN
1436:ISBN
1432:MSRI
1409:ACCC
1369:CCCG
1335:ISBN
1281:ISBN
1276:VLSI
1260:ISBN
1242:ISBN
1171:ISBN
1143:ISBN
1109:ISBN
1083:ISBN
1049:ISBN
1019:ISBN
970:ISBN
915:ISBN
872:ISBN
862:ISBN
801:ISBN
778:ISBN
733:ISBN
703:ISBN
638:ISBN
615:ISBN
589:ISBN
547:ISBN
524:ISBN
498:ISBN
471:ISBN
427:ISBN
384:ISBN
356:ISBN
324:ISBN
296:ISBN
252:ISBN
242:ISBN
195:ISBN
96:ISBN
88:ISBN
78:ISBN
37:and
1586:in
1556:Zbl
1548:Zbl
1532:Zbl
1516:Zbl
1508:Zbl
145:),
1739::
1514:,
1494:MR
1492:,
1487:MR
1442:.
1426:,
1329:.
1313:,
1307:).
1303:,
1299:,
1272:,
1254:.
1234:.
1226:,
1222:,
1169:.
1165:.
1141:.
1137:.
1129:;
1125:;
1107:.
1103:.
1081:.
1065:;
1047:.
1043:.
1035:;
1017:.
1013:.
1005:;
960:;
940:,
932:,
913:.
909:.
901:;
860:.
856:.
848:;
799:.
795:.
776:.
772:.
762:;
750:.
731:.
727:.
701:.
697:.
685:;
673:.
636:.
632:.
613:.
609:.
587:.
583:.
567:.
545:.
541:.
522:.
518:.
496:.
492:.
459:;
425:.
421:.
382:.
378:.
354:.
350:.
340:;
322:.
294:.
290:.
280:;
240:.
228:;
224:;
220:;
193:.
189:.
161:,
157:,
141:,
76:.
72:.
60:;
1642:e
1635:t
1628:v
1430:(
1411:)
1378:)
1371:)
1367:(
1343:.
1295:(
1179:.
1151:.
1117:.
1091:.
1073:(
1057:.
1027:.
978:.
878:.
831:.
809:.
786:.
754:.
741:.
711:.
677:.
646:.
623:.
597:.
571:.
555:.
532:.
506:.
479:.
435:.
400:.
364:.
332:.
258:.
203:.
137:(
123:.
102:.
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.