Cargando…
Computational geometry /
Machine Intelligence and Pattern Recognition, Volume 2: Computational Geometry focuses on the operations, processes, methodologies, and approaches involved in computational geometry, including algorithms, polygons, convex hulls, and bucketing techniques. The selection first ponders on optimal parall...
| Clasificación: | Libro Electrónico |
|---|---|
| Otros Autores: | |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
Amsterdam ; New York : New York, N.Y. :
North-Holland ; Sole distributors for the U.S.A. and Canada, Elsevier Science Pub. Co.,
1985.
|
| Colección: | Machine intelligence and pattern recognition ;
v. 2. |
| Temas: | |
| Acceso en línea: | Texto completo |
MARC
| LEADER | 00000cam a2200000 a 4500 | ||
|---|---|---|---|
| 001 | SCIDIR_ocn680274662 | ||
| 003 | OCoLC | ||
| 005 | 20231117044504.0 | ||
| 006 | m o d | ||
| 007 | cr bn||||||abp | ||
| 007 | cr bn||||||ada | ||
| 008 | 101110s1985 ne a ob 000 0 eng d | ||
| 040 | |a OCLCE |b eng |e pn |c OCLCE |d OCLCQ |d OCLCF |d OCLCO |d OPELS |d EBLCP |d IDEBK |d N$T |d E7B |d DEBSZ |d OCLCO |d YDXCP |d OCLCQ |d OCLCO |d UAB |d OCLCQ |d MERUC |d OCLCQ |d UKAHL |d AU@ |d CUS |d OCLCO |d OCLCQ |d VLY |d LUN |d S2H |d OCLCO |d OCLCQ |d OCLCA |d OCLCQ |d OCLCO |d COM |d OCLCQ |d OCLCO | ||
| 019 | |a 625113894 |a 897646793 |a 974615372 |a 974670505 |a 1059031304 |a 1100944977 |a 1162368088 |a 1268408848 | ||
| 020 | |a 9780444878069 |q (electronic bk.) | ||
| 020 | |a 0444878068 |q (electronic bk.) | ||
| 020 | |a 9781483257112 | ||
| 020 | |a 1483257118 | ||
| 035 | |a (OCoLC)680274662 |z (OCoLC)625113894 |z (OCoLC)897646793 |z (OCoLC)974615372 |z (OCoLC)974670505 |z (OCoLC)1059031304 |z (OCoLC)1100944977 |z (OCoLC)1162368088 |z (OCoLC)1268408848 | ||
| 042 | |a dlr | ||
| 050 | 4 | |a QA447 |b .C57 1985 | |
| 082 | 0 | 4 | |a 516/.028/54 |2 19 |
| 084 | |a ST 282 |2 rvk | ||
| 084 | |a ST 315 |2 rvk | ||
| 084 | |a ST 600 |2 rvk | ||
| 084 | |a DAT 772f |2 stub | ||
| 084 | |a DAT 759f |2 stub | ||
| 084 | |a MAT 520f |2 stub | ||
| 245 | 0 | 0 | |a Computational geometry / |c edited by Godfried T. Toussaint. |
| 260 | |a Amsterdam ; |a New York : |b North-Holland ; |a New York, N.Y. : |b Sole distributors for the U.S.A. and Canada, Elsevier Science Pub. Co., |c 1985. | ||
| 300 | |a 1 online resource (xii, 459 pages) : |b illustrations | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 490 | 1 | |a Machine intelligence and pattern recognition ; |v v. 2 | |
| 504 | |a Includes bibliographical references. | ||
| 506 | |3 Use copy |f Restrictions unspecified |2 star |5 MiAaHDL | ||
| 533 | |a Electronic reproduction. |b [Place of publication not identified] : |c HathiTrust Digital Library, |d 2010. |5 MiAaHDL | ||
| 538 | |a Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002. |u http://purl.oclc.org/DLF/benchrepro0212 |5 MiAaHDL | ||
| 583 | 1 | |a digitized |c 2010 |h HathiTrust Digital Library |l committed to preserve |2 pda |5 MiAaHDL | |
| 588 | 0 | |a Print version record. | |
| 520 | |a Machine Intelligence and Pattern Recognition, Volume 2: Computational Geometry focuses on the operations, processes, methodologies, and approaches involved in computational geometry, including algorithms, polygons, convex hulls, and bucketing techniques. The selection first ponders on optimal parallel algorithms for selection, sorting, and computing convex hulls, simple on-line algorithms for convex polygons, and geometric algorithms that use the furthest-point Voronoi diagram. Discussions focus on algorithms that use the furthest-point Voronoi diagram, intersection of a convex polygon. | ||
| 505 | 0 | |a Front Cover; Computational Geometry; Copyright Page; Dedication; PREFACE; Table of Contents; CHAPTER 1. OPTIMAL PARALLEL ALGORITHMS FOR SELECTION, SORTING AND COMPUTING CONVEX HULLS; 1. INTRODUCTION; 2. COMPUTATIONAL MODEL; 3. A PARALLEL ALGORITHM FOR SELECTION; 4. A PARALLEL ALGORITHM FOR SORTING; 5. A PARALLEL ALGORITHM FOR COMPUTING CONVEX HULLS; 6. CONCLUSION; 7. FOOTNOTES; 8. REFERENCES; CHAPTER 2. SIMPLE ON-LINE ALGORITHMS FOR CONVEX POLYGONS; Abstract; I. Introduction; II. Convex Hulls, Convex Polygons, and their Representations; III. Point Insertion | |
| 505 | 8 | |a IV. Intersection of a Convex Polygon and a HalfplaneV. Conclusions; References; Appendix A; Appendix B; CHAPTER 3. ON GEOMETRIC ALGORITHMS THAT USE THE FURTHEST-POINT VORONOI DIAGRAM; I. INTRODUCTION; II. THE ALGORITHMS THAT USE THE FURTHEST-POINT VORONOI DIAGRAM; III. MAIN RESULTS; IV. CONCLUDING REMARKS; ACKNOWLEDGEMENT; REFERENCES; CHAPTER 4. OPTIMAL CONVEX DECOMPOSITIONS; Abstract; 1. Introduction; 2. The Geometric Ingredients; 3. The Polynomial Time Algorithm; 4. Towards an Efficient Implementation; 5. Concluding Remarks; REFERENCES | |
| 505 | 8 | |a CHAPTER 5. EXPECTED TIME ANALYSIS OF ALGORITHMS IN COMPUTATIONAL GEOMETRY1. INTRODUCTION; 2. THE BUCKETING PRINCIPLE; 3. THE DIVIDE-AND-CONQUER PRINCIPLE; 4. THE QUICK ELIMINATION (THROW-AWAY) PRINCIPLE; 5. REFERENCES; Chapter 6. Practical Use of Bucketing Techniques in Computational Geometry; 1. Introduction; 2. Minimum-Weight Perfect Matching in the Plane; 3. Voronoi Diagrams; 4. Point-Location Problem; 5. Range-Search Problems; 6. The Shortest-Path Problem; 7. Possibility of the Use of Nonrectangular Buckets; References; Chapter 7. Minimum Decompositions of Polygonal Objects | |
| 505 | 8 | |a CHAPTER 10. AN IMPLEMENTATION STUDY OF TWO ALGORITHMS FOR THE MINIMUM SPANNING CIRCLE PROBLEM1. INTRODUCTION AND PROBLEM STATEMENT; 2. THE SHRINKING ALGORITHM; 3. The Rolling Algorithm; 4. Comments on the two programs; 5. References; Chapter 11. Curve Similarity via Signatures; ABSTRACT; 1. Introduction; 2. Properties of the Signature; 3. Distance Measures; 4. Similar /Dissimilar Separation; 5. Robustness under Distortion; 6. Conclusion; Acknowledgments; REFERENCES; CHAPTER 12. A METHOD FOR PROVING LOWER BOUNDS FOR CERTAIN GEOMETRIC PROBLEMS; Abstract; I. Introduction | |
| 546 | |a English. | ||
| 650 | 0 | |a Geometry |x Data processing. | |
| 650 | 6 | |a G�eom�etrie |x Informatique. |0 (CaQQLa)201-0254783 | |
| 650 | 7 | |a Geometry |x Data processing |2 fast |0 (OCoLC)fst00940870 | |
| 650 | 7 | |a Algorithmische Geometrie |2 gnd |0 (DE-588)4130267-9 | |
| 653 | |a Pattern recognition |a Applications of geometry | ||
| 655 | 7 | |a Saint Jovite (1983) |2 swd | |
| 700 | 1 | |a Toussaint, Godfried T., |d 1944-2019, |e editor. | |
| 776 | 0 | 8 | |i Print version: |t Computational geometry. |d Amsterdam ; New York : North-Holland ; New York, N.Y. : Sole distributors for the U.S.A. and Canada, Elsevier Science Pub. Co., 1985 |w (DLC) 85013639 |w (OCoLC)12162881 |
| 830 | 0 | |a Machine intelligence and pattern recognition ; |v v. 2. | |
| 856 | 4 | 0 | |u https://sciencedirect.uam.elogim.com/science/book/9780444878069 |z Texto completo |