Question

Could tertiary computation negate the need for large memory?

score 82 · Answer 1 · 2016-02-17 17:41:12

82

Views

Could tertiary computation negate the need for large memory?

Published on 17 Feb 2016 - 17:41

score 113 · Answer 2 · 2016-02-22 20:46:01

113

Views

Polyhedra from number fields

Published on 22 Feb 2016 - 20:46

score 127 · Answer 3 · 2016-02-25 02:38:24

127

Views

Tracing the faces of a convex polyhedron from edges and vertices

Published on 25 Feb 2016 - 2:38

score 221 · Answer 4 · 2026-03-26 11:05:16

221

Views

convex polygon triangulation

Published on 26 Mar 2026 - 11:05

score 2k · Answer 5 · 2016-02-29 11:36:10

2k

Views

Finding the boundary of a triangle given the area

Published on 29 Feb 2016 - 11:36

score 212 · Answer 6 · 2026-02-23 19:17:10

212

Views

Centroid and circumcenter -- how close?

Published on 23 Feb 2026 - 19:17

score 473 · Answer 7 · 2016-03-03 02:07:27

473

Views

find coordinates of point of intersection of 3 planes

Published on 03 Mar 2016 - 2:07

score 559 · Answer 8 · 2026-03-27 06:09:48

559

Views

Correctness of the sweep line algorithm for line segment intersection in the plane

Published on 27 Mar 2026 - 6:09

score 458 · Answer 9 · 2016-03-09 13:48:18

458

Views

Simplifying polygons

Published on 09 Mar 2016 - 13:48

score 105 · Answer 10 · 2016-03-12 16:16:36

105

Views

Expected number of fragments generated by a random binary space partition (should be plain combinatorics)

Published on 12 Mar 2016 - 16:16

score 144 · Answer 11 · 2016-03-13 11:14:17

144

Views

Why do at least half of all random orderings generate a binary space partition of size $n+4n\ln n$ in the random binary space partition algorithm?

Published on 13 Mar 2016 - 11:14

score 51 · Answer 12 · 2016-03-16 17:52:17

51

Views

Why is no analysis possible for the 3d version of the random binary space partioning algorithm?

Published on 16 Mar 2016 - 17:52

score 126 · Answer 13 · 2016-03-16 18:03:55

126

Views

Number of fragments into which a fixed triangle is cut in the 3d version of the binary space partitioning algorithm

Published on 16 Mar 2016 - 18:03

score 1.3k · Answer 14 · 2016-03-22 23:36:21

1.3k

Views

Minkowski sum and vectors

Published on 22 Mar 2016 - 23:36

score 621 · Answer 15 · 2026-03-14 03:52:33

621

Views

Prove that for any n > 3 there is a set of n point sites in the plane such that one of the cells of Voronoi diagram(P) has n − 1 vertices

Published on 14 Mar 2026 - 3:52

List Question

Could tertiary computation negate the need for large memory?

Polyhedra from number fields

Tracing the faces of a convex polyhedron from edges and vertices

convex polygon triangulation

Finding the boundary of a triangle given the area

Centroid and circumcenter -- how close?

find coordinates of point of intersection of 3 planes

Correctness of the sweep line algorithm for line segment intersection in the plane

Simplifying polygons

Expected number of fragments generated by a random binary space partition (should be plain combinatorics)

Why do at least half of all random orderings generate a binary space partition of size $n+4n\ln n$ in the random binary space partition algorithm?

Why is no analysis possible for the 3d version of the random binary space partioning algorithm?

Number of fragments into which a fixed triangle is cut in the 3d version of the binary space partitioning algorithm

Minkowski sum and vectors

Prove that for any n > 3 there is a set of n point sites in the plane such that one of the cells of Voronoi diagram(P) has n − 1 vertices

Trending Questions

Popular # Hahtags

Popular Questions