Closed Object Boundaries from Scattered Points [electronic resource] / by Remco C. Veltkamp.

By: Veltkamp, Remco C [author.]Contributor(s): SpringerLink (Online service)Material type: TextTextSeries: Lecture Notes in Computer Science ; 885Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 1994Description: VIII, 152 p. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783540491088Subject(s): Computer science | Computer graphics | Computer vision | Optical pattern recognition | Combinatorics | Computer Science | Computer Graphics | Image Processing and Computer Vision | Pattern Recognition | CombinatoricsAdditional physical formats: Printed edition:: No titleDDC classification: 006.6 LOC classification: T385Online resources: Click here to access online
Contents:
Geometric graphs -- The ?-Neighborhood Graph -- Boundary construction -- Boundary from the ?-Graph -- Approximation and localization -- The flintstones -- Smooth curves and surfaces -- G 1 boundary construction -- Conclusions.
In: Springer eBooksSummary: This monograph is devoted to computational morphology, particularly to the construction of a two-dimensional or a three-dimensional closed object boundary through a set of points in arbitrary position. By applying techniques from computational geometry and CAGD, new results are developed in four stages of the construction process: (a) the gamma-neighborhood graph for describing the structure of a set of points; (b) an algorithm for constructing a polygonal or polyhedral boundary (based on (a)); (c) the flintstone scheme as a hierarchy for polygonal and polyhedral approximation and localization; (d) and a Bezier-triangle based scheme for the construction of a smooth piecewise cubic boundary.
Item type: E-BOOKS
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Current library Home library Call number Materials specified URL Status Date due Barcode
IMSc Library
IMSc Library
Link to resource Available EBK6662

Geometric graphs -- The ?-Neighborhood Graph -- Boundary construction -- Boundary from the ?-Graph -- Approximation and localization -- The flintstones -- Smooth curves and surfaces -- G 1 boundary construction -- Conclusions.

This monograph is devoted to computational morphology, particularly to the construction of a two-dimensional or a three-dimensional closed object boundary through a set of points in arbitrary position. By applying techniques from computational geometry and CAGD, new results are developed in four stages of the construction process: (a) the gamma-neighborhood graph for describing the structure of a set of points; (b) an algorithm for constructing a polygonal or polyhedral boundary (based on (a)); (c) the flintstone scheme as a hierarchy for polygonal and polyhedral approximation and localization; (d) and a Bezier-triangle based scheme for the construction of a smooth piecewise cubic boundary.

There are no comments on this title.

to post a comment.
The Institute of Mathematical Sciences, Chennai, India

Powered by Koha