Examples of using Computational geometry in English and their translations into Russian
{-}
-
Official
-
Colloquial
Computational Geometry.
Nearest neighbor graphs are also a subject of computational geometry.
Spanners may be used in computational geometry for solving some proximity problems.
Polygon partitioning is an important class of problems in computational geometry.
The open-source Computational Geometry Algorithms Library(CGAL) contains an implementation of this algorithm.
Expanded version of a paper from the 17th ACM Symposium on Computational Geometry, 2010.
In computational geometry, the concept was first discussed by L.P. Chew in 1986, although the term"spanner" was not used in the original paper.
Applications of this recursion from graph theory to computational geometry rely on zero being even.
It is used in many algorithms of computational geometry to handle polygonal subdivisions of the plane, commonly called planar straight-line graphs PSLG.
It can also be used as a general-purpose library providing algorithms in computational geometry.
An interest in the study of arrangements was driven by advances in computational geometry, where the arrangements were unifying structures for many problems.
For example, it is easier to deal with triangles than general polygons,especially in computational geometry.
In computational geometry, numerous algorithms are proposed for computing the convex hull of a finite set of points, with various computational complexities.
The art gallery problem ormuseum problem is a well-studied visibility problem in computational geometry.
Computation of visibility is among the basic problems in computational geometry and has applications in computer graphics, motion planning, and other areas.
Solving collision detection problems requires extensive use of concepts from linear algebra and computational geometry.
The closest pair of points problem or closest pair problem is a problem of computational geometry: given n points in metric space, find a pair of points with the smallest distance between them.
Organization of multi-threaded data processing with the exception of anomalies in solving problems of computational geometry.
In computational geometry and robot motion planning, a visibility graph is a graph of intervisible locations, typically for a set of points and obstacles in the Euclidean plane.
The problem of performing slope selection exactly but more efficiently than the brute force quadratic time algorithm has been extensively studied in computational geometry.
In computational geometry, algorithms for problems on general polygons are often more complex than those for restricted types of polygons such as convex or star-shaped.
The course objective is to acquaint students with fundamental knowledge in the field of visualization andrelated domains of computer graphics and computational geometry.
The study is connected to many other fields in computer science, including computer vision,image processing, and computational geometry, and is heavily applied in the fields of special effects and video games.
At present, it is known a significant amount of research devoted to the new heuristic localization methods beyond the scope of classical computational geometry.
In computational geometry, the method of rotating calipers can be used to form a linear thrackle from any set of points in convex position, by connecting pairs of points that support parallel lines tangent to the convex hull of the points.
The approach based on exact penalization was successfully applied to the study ofoptimal control problems and various problems of the calculus of variations, computational geometry and mathematical diagnostics.
The study of facility location problems,also known as location analysis, is a branch of operations research and computational geometry concerned with the optimal placement of facilities to minimize transportation costs while considering factors like avoiding placing hazardous materials near housing.
Algorithmic topology, or computational topology, is a subfield of topology with an overlap with areas of computer science,in particular, computational geometry and computational complexity theory.
This chapter pays attention to the algorithms that are more accurate, requiring measurement of Euclidean distances, angles, time, signal propagation delay and other physical parameters of the environment based on optimization techniques,numerical methods and the methods of computational geometry.
Building and implementing algorithms in C applications, such as numerical algorithms, sorting and searching algorithms, combinatorial algorithms, string algorithms, compression andcoding algorithms, computational geometry algorithms and others.