Algorithms in Combinatorial Geometry [electronic resource] /

Algorithms in Combinatorial Geometry [electronic resource] /

Show other versions (1)

Computational geometry as an area of research in its own right emerged in the early seventies of this century. Right from the beginning, it was obvious that strong connections of various kinds exist to questions studied in the considerably older field of combinatorial geometry. For example, the combinatorial structure of a geometric problem usually decides which algorithmic method solves the problem most efficiently. Furthermore, the analysis of an algorithm often requires a great deal of combinatorial knowledge. As it turns out, however, the connection between the two research areas commonly referred to as computa­ tional geometry and combinatorial geometry is not as lop-sided as it appears. Indeed, the interest in computational issues in geometry gives a new and con­ structive direction to the combinatorial study of geometry. It is the intention of this book to demonstrate that computational and com­ binatorial investigations in geometry are doomed to profit from each other. To reach this goal, I designed this book to consist of three parts, acorn binatorial part, a computational part, and one that presents applications of the results of the first two parts. The choice of the topics covered in this book was guided by my attempt to describe the most fundamental algorithms in computational geometry that have an interesting combinatorial structure. In this early stage geometric transforms played an important role as they reveal connections between seemingly unrelated problems and thus help to structure the field.

Saved in:
Bibliographic Details
Main Authors: Edelsbrunner, Herbert. author., SpringerLink (Online service)
Format: Texto biblioteca
Language:eng
Published: Berlin, Heidelberg : Springer Berlin Heidelberg, 1987
Subjects:Computer science., Algorithms., Computer graphics., Combinatorics., Computer Science., Algorithm Analysis and Problem Complexity., Computer Graphics.,
Online Access:http://dx.doi.org/10.1007/978-3-642-61568-9
Tags: Add Tag
No Tags, Be the first to tag this record!
id KOHA-OAI-TEST:223897
record_format koha
institution COLPOS
collection Koha
country México
countrycode MX
component Bibliográfico
access En linea
En linea
databasecode cat-colpos
tag biblioteca
region America del Norte
libraryname Departamento de documentación y biblioteca de COLPOS
language eng
topic Computer science.
Algorithms.
Computer graphics.
Combinatorics.
Computer Science.
Algorithm Analysis and Problem Complexity.
Computer Graphics.
Combinatorics.
Computer science.
Algorithms.
Computer graphics.
Combinatorics.
Computer Science.
Algorithm Analysis and Problem Complexity.
Computer Graphics.
Combinatorics.
spellingShingle Computer science.
Algorithms.
Computer graphics.
Combinatorics.
Computer Science.
Algorithm Analysis and Problem Complexity.
Computer Graphics.
Combinatorics.
Computer science.
Algorithms.
Computer graphics.
Combinatorics.
Computer Science.
Algorithm Analysis and Problem Complexity.
Computer Graphics.
Combinatorics.
Edelsbrunner, Herbert. author.
SpringerLink (Online service)
Algorithms in Combinatorial Geometry [electronic resource] /
description Computational geometry as an area of research in its own right emerged in the early seventies of this century. Right from the beginning, it was obvious that strong connections of various kinds exist to questions studied in the considerably older field of combinatorial geometry. For example, the combinatorial structure of a geometric problem usually decides which algorithmic method solves the problem most efficiently. Furthermore, the analysis of an algorithm often requires a great deal of combinatorial knowledge. As it turns out, however, the connection between the two research areas commonly referred to as computa­ tional geometry and combinatorial geometry is not as lop-sided as it appears. Indeed, the interest in computational issues in geometry gives a new and con­ structive direction to the combinatorial study of geometry. It is the intention of this book to demonstrate that computational and com­ binatorial investigations in geometry are doomed to profit from each other. To reach this goal, I designed this book to consist of three parts, acorn binatorial part, a computational part, and one that presents applications of the results of the first two parts. The choice of the topics covered in this book was guided by my attempt to describe the most fundamental algorithms in computational geometry that have an interesting combinatorial structure. In this early stage geometric transforms played an important role as they reveal connections between seemingly unrelated problems and thus help to structure the field.
format Texto
topic_facet Computer science.
Algorithms.
Computer graphics.
Combinatorics.
Computer Science.
Algorithm Analysis and Problem Complexity.
Computer Graphics.
Combinatorics.
author Edelsbrunner, Herbert. author.
SpringerLink (Online service)
author_facet Edelsbrunner, Herbert. author.
SpringerLink (Online service)
author_sort Edelsbrunner, Herbert. author.
title Algorithms in Combinatorial Geometry [electronic resource] /
title_short Algorithms in Combinatorial Geometry [electronic resource] /
title_full Algorithms in Combinatorial Geometry [electronic resource] /
title_fullStr Algorithms in Combinatorial Geometry [electronic resource] /
title_full_unstemmed Algorithms in Combinatorial Geometry [electronic resource] /
title_sort algorithms in combinatorial geometry [electronic resource] /
publisher Berlin, Heidelberg : Springer Berlin Heidelberg,
publishDate 1987
url http://dx.doi.org/10.1007/978-3-642-61568-9
work_keys_str_mv AT edelsbrunnerherbertauthor algorithmsincombinatorialgeometryelectronicresource
AT springerlinkonlineservice algorithmsincombinatorialgeometryelectronicresource
_version_ 1756270636829769728
spelling KOHA-OAI-TEST:2238972018-07-31T00:03:12ZAlgorithms in Combinatorial Geometry [electronic resource] / Edelsbrunner, Herbert. author. SpringerLink (Online service) textBerlin, Heidelberg : Springer Berlin Heidelberg,1987.engComputational geometry as an area of research in its own right emerged in the early seventies of this century. Right from the beginning, it was obvious that strong connections of various kinds exist to questions studied in the considerably older field of combinatorial geometry. For example, the combinatorial structure of a geometric problem usually decides which algorithmic method solves the problem most efficiently. Furthermore, the analysis of an algorithm often requires a great deal of combinatorial knowledge. As it turns out, however, the connection between the two research areas commonly referred to as computa­ tional geometry and combinatorial geometry is not as lop-sided as it appears. Indeed, the interest in computational issues in geometry gives a new and con­ structive direction to the combinatorial study of geometry. It is the intention of this book to demonstrate that computational and com­ binatorial investigations in geometry are doomed to profit from each other. To reach this goal, I designed this book to consist of three parts, acorn binatorial part, a computational part, and one that presents applications of the results of the first two parts. The choice of the topics covered in this book was guided by my attempt to describe the most fundamental algorithms in computational geometry that have an interesting combinatorial structure. In this early stage geometric transforms played an important role as they reveal connections between seemingly unrelated problems and thus help to structure the field.I Combinatorial Geometry -- 1 Fundamental Concepts in Combinatorial Geometry -- 2 Permutation Tables -- 3 Semispaces of Configurations -- 4 Dissections of Point Sets -- 5 Zones in Arrangements -- 6 The Complexity of Families of Cells -- II Fundamental Geometric Algorithms -- 7 Constructing Arrangements -- 8 Constructing Convex Hulls -- 9 Skeletons in Arrangements -- 10 Linear Programming. -- 11 Planar Point Location Search -- III Geometric and Algorithmic Applications -- 12 Problems for Configurations and Arrangements -- 13 Voronoi Diagrams -- 14 Separation and Intersection in the Plane -- 15 Paradigmatic Design of Algorithms -- References -- Appendix A Definitions -- Appendix B Notational Conventions.Computational geometry as an area of research in its own right emerged in the early seventies of this century. Right from the beginning, it was obvious that strong connections of various kinds exist to questions studied in the considerably older field of combinatorial geometry. For example, the combinatorial structure of a geometric problem usually decides which algorithmic method solves the problem most efficiently. Furthermore, the analysis of an algorithm often requires a great deal of combinatorial knowledge. As it turns out, however, the connection between the two research areas commonly referred to as computa­ tional geometry and combinatorial geometry is not as lop-sided as it appears. Indeed, the interest in computational issues in geometry gives a new and con­ structive direction to the combinatorial study of geometry. It is the intention of this book to demonstrate that computational and com­ binatorial investigations in geometry are doomed to profit from each other. To reach this goal, I designed this book to consist of three parts, acorn binatorial part, a computational part, and one that presents applications of the results of the first two parts. The choice of the topics covered in this book was guided by my attempt to describe the most fundamental algorithms in computational geometry that have an interesting combinatorial structure. In this early stage geometric transforms played an important role as they reveal connections between seemingly unrelated problems and thus help to structure the field.Computer science.Algorithms.Computer graphics.Combinatorics.Computer Science.Algorithm Analysis and Problem Complexity.Computer Graphics.Combinatorics.Springer eBookshttp://dx.doi.org/10.1007/978-3-642-61568-9URN:ISBN:9783642615689

Similar Items