User Makogan

4 votes

2 answers

611 views

Detecting if an edge is "inside" a polygon?

asked Aug 12, 2023 at 5:40

3 votes

2 answers

124 views

Efficiently finding point triangle inclusion when doing incremental delaunay triangulation?

asked Aug 1, 2023 at 22:51

3 votes

2 answers

237 views

Constrained Delaunay triangulation algorithm?

asked Aug 9, 2023 at 22:25

3 votes

2 answers

316 views

Algorithm for farthest point Voronoi diagram?

asked Nov 4, 2022 at 20:09

2 votes

2 answers

206 views

How to handle coplanarity in convex hull?

asked Feb 19, 2023 at 21:17

2 votes

0 answers

26 views

Topologizing boundaries in 3D space

asked Feb 23, 2023 at 21:29

2 votes

1 answer

261 views

Better way to decide if a set is a pure simplicial complex

asked Oct 3, 2020 at 2:03

2 votes

1 answer

738 views

How do you prove that a solution to the 0-1 knapsack problem is optimal?

asked Jul 20, 2021 at 3:23

1 vote

1 answer

230 views

How to turn a 3D polytope into a mesh?

asked Jun 14, 2023 at 20:18

1 vote

1 answer

40 views

Fast measurement of distance from point to mid segment?

asked Oct 25, 2023 at 2:01

1 vote

0 answers

40 views

How to actually implement ruppert's algorithm?

asked Oct 27, 2023 at 2:15

1 vote

1 answer

27 views

How to avoid global delaunay check in conforming triangulation?

asked Oct 27, 2023 at 21:20

1 vote

0 answers

45 views

Algorithm for Steiner points?

asked Aug 12, 2023 at 8:44

0 votes

0 answers

58 views

Getting a V-representation from an H-Representation of a polytope

asked Aug 22, 2023 at 7:46

0 votes

1 answer

27 views

How to enforce convexity of triangulation output?

asked Sep 8, 2023 at 6:01

0 votes

0 answers

29 views

In Viterbi's algorithm what is the difference between the observation space and the sequence of observations?

asked Apr 6, 2022 at 0:13

0 votes

0 answers

50 views

Definition of an algebraic decision tree

asked Oct 9, 2022 at 23:57

0 votes

2 answers

1k views

Is there a useful algorithm with a decreasing asymptotic time?

asked Jan 4, 2019 at 20:39

Stack Exchange Network

18 Questions

Detecting if an edge is "inside" a polygon?

Efficiently finding point triangle inclusion when doing incremental delaunay triangulation?

Constrained Delaunay triangulation algorithm?

Algorithm for farthest point Voronoi diagram?

How to handle coplanarity in convex hull?

Topologizing boundaries in 3D space

Better way to decide if a set is a pure simplicial complex

How do you prove that a solution to the 0-1 knapsack problem is optimal?

How to turn a 3D polytope into a mesh?

Fast measurement of distance from point to mid segment?

How to actually implement ruppert's algorithm?

How to avoid global delaunay check in conforming triangulation?

Algorithm for Steiner points?

Getting a V-representation from an H-Representation of a polytope

How to enforce convexity of triangulation output?

In Viterbi's algorithm what is the difference between the observation space and the sequence of observations?

Definition of an algebraic decision tree

Is there a useful algorithm with a decreasing asymptotic time?