Skip to search formSkip to main contentSkip to account menu

Computational geometry

Known as: CG, Geometric computation 
Computational geometry is a branch of computer science devoted to the study of algorithms which can be stated in terms of geometry. Some purely… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
ACM Computing SurveysActa InformaticaAlgorithmicaAlpha shape

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2014
Review
2014
Computational Geometry
We overview the basics of computational geometry, discuss its relation to GIS, and analyze in which directions research can… 
2005
2005
Parallel Delaunay triangulation in E2 and E3 for computers with shared memory
2004
2004
Georouting and Delta-Gathering: Efficient Data Propagation Techniques for GeoSensor Networks
We consider the issue of query and data propagation i the context of geosensor networks over geo-aware sensors. In such networks… 
2003
2003
Efficient Modeling of An Anatomy‐Based Face and Fast 3D Facial Expression Synthesis
This paper presents new methods for efficient modeling and animation of an hierarchical facial model that conforms to the human… 
2002
2002
SIGGRAPH 2002 Course Notes "Sounds Good to Me!" Computational Sound for Graphics, Virtual Reality, and Interactive Systems
This course covers concepts, models, techniques, and systems for simulation and rendering of sound in virtual environments. It… 
Highly Cited
1995
Highly Cited
1995
Computational Kinematic Analysis of Higher Pairs with Multiple Contacts
We present a computational kinematic theory of higher pairs with multiple contacts, including simultaneous contacts, intermittent… 
1995
1995
Eecient Randomized Algorithms for Some Geometric Optimization Problems
In this paper we rst prove the following combinatorial bound, concerning the complexity of the vertical decomposition of the… 
Highly Cited
1994
Highly Cited
1994
Incremental Delaunay Triangulation
1992
1992
An optimal algorithm for the maximum two-chain problem
Given a point set p, a chain is a subset C C p of points in which for any two points one is dominated by the other. A two-chain… 
Highly Cited
1984
Highly Cited
1984
CAD-Directed Inspection
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)