Computational line geometry

$149.00 In stockThe geometry of lines occurs naturally in such different areas as sculptured surface machining, computation of offsets and medial axes, surface reconstruction Table of contentsAbout this bookReviews

$149.00 In stockThis book covers line geometry from various viewpoints and aims towards computation and visualization. Besides applications, it contains a tutorial on Table of contentsAbout this bookReviews

The geometry of lines occurs naturally in such different areas as sculptured surface machining, computation of offsets and medial axes, surface reconstruction for reverse engineering, geometrical optics, kinematics and motion design, and modeling Google BooksOriginally published: 2001Author: Helmut Pottmann

In computational geometry, the multiple line segment intersection problem supplies a list of line segments in the Euclidean plane and asks whether any two of them intersect (cross).

Class of algorithms which use a moving line to solve geometrical problems

In computational geometry, a sweep line algorithm or plane sweep algorithm is an algorithmic paradigm that uses a conceptual sweep line or sweep surface to solve various problems in Euclidean space.
It is one of the critical techniques in computational geometry.

Categories