Algorithmic geometry / Jean-Daniel Boissonnat, Mariette Yvinec ; translated by Hervé Brönnimann.

Boissonnat, J.-D. (Jean-Daniel), 1953-

Call Number	516/.00285/51
Author	Boissonnat, J.-D. 1953- author.
Title	Algorithmic geometry / Jean-Daniel Boissonnat, Mariette Yvinec ; translated by Hervé Brönnimann.
Physical Description	1 online resource (xx, 519 pages) : digital, PDF file(s).
Notes	Title from publisher's bibliographic system (viewed on 05 Oct 2015).
Summary	The design and analysis of geometric algorithms have seen remarkable growth in recent years, due to their application in, for example, computer vision, graphics, medical imaging and CAD. The goals of this book are twofold: first to provide a coherent and systematic treatment of the foundations; secondly to present algorithmic solutions that are amenable to rigorous analysis and are efficient in practical situations. When possible, the algorithms are presented in their most general d-dimensional setting. Specific developments are given for the 2- or 3-dimensional cases when this results in significant improvements. The presentation is confined to Euclidean affine geometry, though the authors indicate whenever the treatment can be extended to curves and surfaces. The prerequisites for using the book are few, which will make it ideal for teaching advanced undergraduate or beginning graduate courses in computational geometry.
Added Author	Yvinec, Mariette, 1953- author. Brönnimann, Hervé, 1969- translator.
Subject	Geometry Data processing. ALGORITHMS.
Multimedia	https://doi.org/10.1017/CBO9781139172998

Total Ratings: 0

Copies
MARC Record
Reviews
Details


No records found to display.

02401nam a22004098i 4500

001

vtls001584571

003

VRT

005

20200921121900.0

006

m|||||o||d||||||||

007

cr||||||||||||

008

200921s1998||||enk o ||1 0|eng|d

020

$a 9781139172998 (ebook)

020

$z 9780521563222 (hardback)

020

$z 9780521565295 (paperback)

035

$a (UkCbUP)CR9781139172998

039

$y 202009211219 $z santha

040

$a UkCbUP $b eng $e rda $c UkCbUP

041

$a eng $h fre

050

$a QA448.D38 $b B6513 1998

082

$a 516/.00285/51 $2 21

100

$a Boissonnat, J.-D. $q (Jean-Daniel), $d 1953- $e author.

240

$a Géometrie algorithmique. $l English

245

$a Algorithmic geometry / $c Jean-Daniel Boissonnat, Mariette Yvinec ; translated by Hervé Brönnimann.

264

$a Cambridge : $b Cambridge University Press, $c 1998.

300

$a 1 online resource (xx, 519 pages) : $b digital, PDF file(s).

336

$a text $b txt $2 rdacontent

337

$a computer $b c $2 rdamedia

338

$a online resource $b cr $2 rdacarrier

500

$a Title from publisher's bibliographic system (viewed on 05 Oct 2015).

520

$a The design and analysis of geometric algorithms have seen remarkable growth in recent years, due to their application in, for example, computer vision, graphics, medical imaging and CAD. The goals of this book are twofold: first to provide a coherent and systematic treatment of the foundations; secondly to present algorithmic solutions that are amenable to rigorous analysis and are efficient in practical situations. When possible, the algorithms are presented in their most general d-dimensional setting. Specific developments are given for the 2- or 3-dimensional cases when this results in significant improvements. The presentation is confined to Euclidean affine geometry, though the authors indicate whenever the treatment can be extended to curves and surfaces. The prerequisites for using the book are few, which will make it ideal for teaching advanced undergraduate or beginning graduate courses in computational geometry.

650

$a Geometry $x Data processing.

650

$a ALGORITHMS.

700

$a Yvinec, Mariette, $d 1953- $e author.

700

$a Brönnimann, Hervé, $d 1969- $e translator.

776

$i Print version: $z 9780521563222

856

$u https://doi.org/10.1017/CBO9781139172998

999

$a VIRTUA

No Reviews to Display

Summary	The design and analysis of geometric algorithms have seen remarkable growth in recent years, due to their application in, for example, computer vision, graphics, medical imaging and CAD. The goals of this book are twofold: first to provide a coherent and systematic treatment of the foundations; secondly to present algorithmic solutions that are amenable to rigorous analysis and are efficient in practical situations. When possible, the algorithms are presented in their most general d-dimensional setting. Specific developments are given for the 2- or 3-dimensional cases when this results in significant improvements. The presentation is confined to Euclidean affine geometry, though the authors indicate whenever the treatment can be extended to curves and surfaces. The prerequisites for using the book are few, which will make it ideal for teaching advanced undergraduate or beginning graduate courses in computational geometry.
Notes	Title from publisher's bibliographic system (viewed on 05 Oct 2015).
Subject	Geometry Data processing. ALGORITHMS.
Multimedia	https://doi.org/10.1017/CBO9781139172998