Computational Geometry in C.

Summary

The basic techniques used in computational geometry are all covered: polygon triangualtions, convex hulls, Voronoi diagrams, arrangements, geometric searching, and motion planning.

Keywords

Mathematics, Geometry, Computational geometry, Calculus (dental), Orthodontics

References

No references recorded for this paper.

Cited by

Anatomical standardization of the human brain in euclidean 3-space and on the cortical 2-manifoldSue Whitesides, Alan C. Evans, Steven Robbins — 2004
Methoden der Diskreten Mathematik bei der Rekonstruktion der Topologie eines CAD-DatenmodellsThomas Willhalm — 1998
CosMos - Communication Scenario and Mobility Scenario Generator for Mobile Ad-hoc NetworksMesut Güneş, Jan Siekermann — 2005
Grasping of Unknown Objects from a Table TopMario Richtsfeld, Markus Vincze — 2008
CALI: An Online Scribble Recognizer for Calligraphic InterfacesManuel J. Fonseca, Joaquim Jorge — 2002
Visibility problems for sensor networks and unmanned air vehiclesKarl J. Obermeyer — 2010
Minimal Enclosing Circle and Two and Three Point Partition of a PlaneFelix Friedman — 2006
The roles of the convex hull and the number of potential intersections in performance on visually presented traveling salesperson problems匡子大川 — 2003
Twelve Ways to Fool The Masses when Describing Mesh Generation PerformanceTimothy J. Tautges, D. R. White, Robert W. Leland — 2004
Surface Reconstruction from Unorganized Point Cloud Data via Progressive Local Mesh MatchingJi Ma — 2011
Turn Constrained Path Planning ProblemsVictor M. Roman — 2009
A simple probablistic algorithm for approximating two and three-dimensional objectsBinhai Zhu — 1999
A Discrete Global Minimization Algorithm for Continuous Variational ProblemsDanil Kirsanov, Steven J. Gortler — 2004
Transforming triangulations of polygons on non planar surfacesCarmen Cortés, Clara I. Grima, Ferrán Hurtado — 2003
Constraint-Based Automatic Placement for Scene CompositionKen Xu, James Stewart, Eugene Fiume — 2002
On some generalized routing problemsMichael Drexl, Hans‐Jürgen Sebastian — 2007
Improved Imprint and Merge for Conformal MeshingDavid R. White, Sunil Saigal — 2002
Tight Bounds for Point RecolouringYurai Núñez Rodríguez, David Rappaport — 2006
Surface Modeling and Analysis Using Range Images: Smoothing, Registration, Integration, and SegmentationYiyong Sun — 2002
Markov set-chains as models of plant successionCorey L. Samuels — 2001

Related papers

Primärzerlegung in Steinschen AlgebrenOtto Förster — 1964
Über unirationale Scharen auf algebraischen MannigfaltigkeitenLudwig Reich — 1966
Algebraic Set Operations, Multifunctions, and Indefinite IntegralsMilan V. Jovanović, Veselin Jungić — 1996
On Almost α(Λ, sp)-continuous MultifunctionsChawalit Boonpok, Jeeranunt Khampakdee — 2022
Computational Information Geometry: mixture modellingPaul Marriott, Frank Critchley, Radka Sabolová — 2015
Geometry synthesis by exampleAres Lagae, Olivier Dumont, Philip Dutré — 2005
A solution for a polygon containment problem using sorting X + Y.(Computational Geometry and Discrete Geometry)Antonio Hernández Barrera — 1994
Computational Geometry and Linear Programming(Computational Geometry and Discrete Geometry)Hiroshi Imai — 1994