## New answers tagged computational-geometry

1
vote

### Finding the point within a convex n-gon that maximizes the least angle subtended there by an edge of the n-gon

This is about existence for both the max-min angle and the min-max angle problem. Existence of the optimiser is not immediately obvious for both, since the objective functions are combinations of ...

1
vote

Accepted

### Finding the point within a convex n-gon that maximizes the least angle subtended there by an edge of the n-gon

This is about the issue of uniqueness, with a slight reformulation of the problem in view of an algorithmic approach.
Given a (closed) half-plane, a segment $e$ of its boundary, and $0<\theta<\...

Top 50 recent answers are included

#### Related Tags

computational-geometry × 488mg.metric-geometry × 163

discrete-geometry × 142

algorithms × 67

ag.algebraic-geometry × 49

convex-geometry × 45

convex-polytopes × 44

reference-request × 36

co.combinatorics × 35

graph-theory × 32

plane-geometry × 25

computational-complexity × 22

polygons × 21

dg.differential-geometry × 18

euclidean-geometry × 16

computer-algebra × 16

at.algebraic-topology × 14

polynomials × 14

oc.optimization-and-control × 14

polyhedra × 13

triangulations × 13

pr.probability × 11

linear-algebra × 11

linear-programming × 11

computational-topology × 10