Abstract
Computational Geometry is the field of computer science that is concerned with algorithmic techniques for solving geometric problems. Geometric problems arise in innumerable applications, particularly in the fields of Computer Graphics, Computer-Aided Design and Manufacturing (CAD/CAM), Robotics and Geographic Information Systems (GIS). A typical example of a fundamental problem in computational geometry is the computation of the convex hull of a set of points in d-dimensional space. The convex hull of a set of points is the smallest convex set containing those points. (Informally stated, a convex set is such that for any two points in the set, the line connecting those two points is also contained in the set.)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
