Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with algorithm
Search options not deleted
user 2644
Questions about the rigorous usage of instructions used to solve a specific computer graphics problem.
8
votes
1
answer
171
views
Parametrize set of unordered points in 3d space
Let's assume that we have some set of points in 3d space sampled from some arbitrary surface, without self intersections and mostly flat. Is it possible to get any parametrization over this set of poi …
- 393
4
votes
0
answers
65
views
Making surface with common parametrization from bunch of other surfaces
Maybe some algorithm to order such surfaces in parameter space, or at least name of this problem to google it easily?
Thanks for any help. …
- 393
3
votes
1
answer
386
views
Find closest point on surface interpolated by 2d matrix of points
I have rectangular matrix of 3d points sampled from a parametric surface. In my program this matrix provides base points for bilinear interpolation of surface (In any (u,v) point it returns 3d point i …
- 393
5
votes
0
answers
137
views
Is there any open-source implementation of n*log(n) visibility graph construction algorithm?
Is there any open-source implementation of n*log(n) visibility graph construction algorithm?
I'm trying to understand S. K. GHOSH and D. M. … MOUNT sweep line algorithm, but it's known for having very hard implementation. It would be great if I saw at least some implementation, in any programming language. Or in pseudo-code. …
- 393