The study of computer algorithms which admit geometric descriptions, and geometric problems arising in association with such algorithms. The two major classes of problems are (a) efficient design of algorithms and data classes using geometric concepts and (b) representation and modelling of curves and surfaces.
Questions tagged [computational-geometry]
1221 questions
0
votes
1 answer
Convex hull is convex
A set $C \in R^n$ is called convex if the line segment $L = \{ tp + (1-t)p | 0 \lt t \lt 1 \}$ between two arbitrary points $p,p' \in C$ is contained in $C$. The convex hull $CH(C)$ of a set $C \subset R^n$ is the intersection of all convex sets of…
Erik
- 165
-2
votes
2 answers
Fast way to find closest line segment for a set of planar points
This question was moved to SE Overflow. Link
Problem
Given are $n=10^4$ points and $m=10^3$ line segments in a plane. The task is to determine the closest segment to each point. A fast solution in Python is preferred.
Specifications
Line segments…
granular_bastard
- 517