Live briefing
Everything about Computational geometry
Branch of computer science
Computational geometry is a branch of computer science devoted to the study of algorithms that can be stated in terms of geometry. Some purely geometrical problems arise out of the study of computational geometric algorithms, and such problems are also considered to be part of computational geometry. While modern computational geometry is a recent development, it is one of the oldest fields of computing with a history stretching back to antiquity. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Computational geometryA 5-minute orientation
- Skim a recent paper: A Grassmann manifold handbook: basic geometry and computational aspectsInfluential work since 2022
- Pick up a classic book: Thomas' calculusThe most-reprinted book on the subject
- Read the landmark paper: Parallel computational geometryCited 131 times
- Go sideways: List of combinatorial computational geometry topicsA closely related topic
- Go sideways: Point-set triangulationA closely related topic
📖 Definitions
Noun A field of study, within computer science, devoted to algorithms that solve problems formulated in geometric terms.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Parallel computational geometry
Computational projective geometry
COMPUTATIONAL GEOMETRY COLUMN 15
Computational geometry
Computational Geometry
COMPUTATIONAL GEOMETRY COLUMN 35
Computational geometry
Computational geometry
🆕 Influential since 2022
A Grassmann manifold handbook: basic geometry and computational aspects
Landau Singularities Revisited: Computational Algebraic Geometry for Feynman Integrals
Effects of augmented reality application integration with computational thinking in geometry topics
ECKM: An improved K-means clustering based on computational geometry
Sphericity and roundness for three-dimensional high explosive particles by computational geometry
📚 Books worth reading
Thomas' calculusMaurice D. Weir · 2009
PerceptronsMarvin Minsky, Seymour Papert · 1969
Handbook of discrete and computational geometryJoseph O'Rourke, Jacob E. Goodman · 1997
Riemannian geometry and geometric analysisJürgen Jost · 1995
Tensor geometryC. T. J. Dodson, Tim Poston · 1977- 📕Geometric modeling for computer-aided designJames L. Schwing · 1987
The Geometric supposerJudah L. Schwartz, Michal Yerushalmy · 1993
Modern differential geometry of curves and surfaces with MathematicaAlfred Gray, Elsa Abbena · 1998
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- List of combinatorial computational geometry topics List of combinatorial computational geometry topics enumerates the topics of computational geometry that states problems in terms of geometric objects…
- Point-set triangulation A triangulation of a set of points 𝒫 in the Euclidean space ℝd is a simplicial complex that covers the convex hull of 𝒫, and whose vertices belong to…
- Minimum-weight triangulation In computational geometry and computer science, the minimum-weight triangulation problem is the problem of finding a triangulation of minimal total edge…
- Triangulation (geometry) In geometry, a triangulation is a subdivision of a planar object into triangles, and by extension the subdivision of a higher-dimension geometric object…
- Delaunay triangulation In computational geometry, a Delaunay triangulation or Delone triangulation of a set of points in the plane subdivides their convex hull into triangles…
- Euclidean minimum spanning tree A Euclidean minimum spanning tree of a finite set of points in the Euclidean plane or higher-dimensional Euclidean space connects the points by a system…
- Sweep line algorithm In computational geometry, a sweep line algorithm or plane sweep algorithm is an algorithmic paradigm that uses a conceptual sweep line or sweep surface…
- Dynamic convex hull The dynamic convex hull problem is a class of dynamic problems in computational geometry. The problem consists in the maintenance, i.e., keeping track…