Question

filling an occluded plane with the smallest number of rectangles

score 521 · Answer 1 · 2014-07-07 12:05:39

521

Views

filling an occluded plane with the smallest number of rectangles

Published on 07 Jul 2014 - 12:05

score 133 · Answer 2 · 2014-07-08 13:59:10

133

Views

Where is the interior of the polygon?

Published on 08 Jul 2014 - 13:59

score 10.2k · Answer 3 · 2014-07-08 20:01:44

10.2k

Views

How can I define a measure of similarity between two line segments in $\mathbb{R}^2$?

Published on 08 Jul 2014 - 20:01

score 341 · Answer 4 · 2026-03-25 16:05:10

341

Views

Data structure issues with incremental Delaunay triangulation

Published on 25 Mar 2026 - 16:05

score 189 · Answer 5 · 2014-07-12 11:33:49

189

Views

What is and what are the use for an " AINV preconditioner " or " SAINV "?

Published on 12 Jul 2014 - 11:33

score 104 · Answer 6 · 2014-07-13 21:10:02

104

Views

At what extent I can use trigonometric functions and properties with parametric curves?

Published on 13 Jul 2014 - 21:10

score 167 · Answer 7 · 2014-07-18 15:17:03

167

Views

Finding triangulations on 2D space by projecting lower hull of 3D

Published on 18 Jul 2014 - 15:17

score 5k · Answer 8 · 2014-07-28 02:48:14

5k

Views

How to get the third point coordinates in isosceles triangle?

Published on 28 Jul 2014 - 2:48

score 144 · Answer 9 · 2014-08-05 22:56:45

144

Views

What's wrong with this pseudocode for Forster-Overfelt's version of the Greiner-Horman polygon clipping algorithm?

Published on 05 Aug 2014 - 22:56

score 630 · Answer 10 · 2014-08-08 02:27:40

630

Views

Term For Rotating 3d Vectors About a Pivot Point

Published on 08 Aug 2014 - 2:27

score 199 · Answer 11 · 2014-08-12 18:41:42

199

Views

Cut the Cake into 4 parts

Published on 12 Aug 2014 - 18:41

score 146 · Answer 12 · 2014-08-13 21:32:26

146

Views

Divide set of points by a plane so sum of distances of points on either side of plane is equal

Published on 13 Aug 2014 - 21:32

score 48 · Answer 13 · 2026-03-25 07:42:07

48

Views

Optimized collision check for all pairs using bounding volume hierarchy

Published on 25 Mar 2026 - 7:42

score 662 · Answer 14 · 2014-08-20 00:07:13

662

Views

Simplest graph that is not a segment intersection graph

Published on 20 Aug 2014 - 0:07

score 120 · Answer 15 · 2014-08-22 14:05:03

120

Views

What series of 'hyperpolyhedrons' do exist? Is there an effective way to derive their cross-sections by 3-d subspace?

Published on 22 Aug 2014 - 14:05

List Question

filling an occluded plane with the smallest number of rectangles

Where is the interior of the polygon?

How can I define a measure of similarity between two line segments in $\mathbb{R}^2$?

Data structure issues with incremental Delaunay triangulation

What is and what are the use for an " AINV preconditioner " or " SAINV "?

At what extent I can use trigonometric functions and properties with parametric curves?

Finding triangulations on 2D space by projecting lower hull of 3D

How to get the third point coordinates in isosceles triangle?

What's wrong with this pseudocode for Forster-Overfelt's version of the Greiner-Horman polygon clipping algorithm?

Term For Rotating 3d Vectors About a Pivot Point

Cut the Cake into 4 parts

Divide set of points by a plane so sum of distances of points on either side of plane is equal

Optimized collision check for all pairs using bounding volume hierarchy

Simplest graph that is not a segment intersection graph

What series of 'hyperpolyhedrons' do exist? Is there an effective way to derive their cross-sections by 3-d subspace?

Trending Questions

Popular # Hahtags

Popular Questions