StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

PO
primarykey
Id
3000323
data
AcceptedAnswerId
0
AnswerCount
0
ClosedDate
CommentCount
10
CommunityOwnedDate
CreationDate
2010-06-08T18:50:29.870
FavoriteCount
0
LastActivityDate
2010-06-08T19:05:38
LastEditDate
2010-06-08T19:05:38
LastEditorUserId
71131
OwnerUserId
71131
ParentId
2999842
PostTypeId
2
Score
1
ViewCount
0
LastEditorDisplayName
text
Body
<p>I think the problem is simple and easily solvable actually :)</p> <p>The basic idea is: </p> <ul> <li><p>First check if the distance between your current point (P) and the end point of the line segment you are on is >= the distance between P and the next point (Q). </p></li> <li><p>If it is, great, we use some simple trigonometry to figure it out.</p></li> <li><p>Else, we move to the adjacent line segment (in your ordering) and <strong>deduct the distance between P and the endpoint of the line segment you are on</strong> and continue the process.</p></li> </ul> <h2>Pseudocode:</h2> <h3>Defined previously</h3> <pre><code>struct LineSegment { Point start,end; int ID; double len; // len = EuclideanDistance(start,end); LineSegment *next_segment; double theta; // theta = atan2(slope_of_line_segment); } Function [LineSegment nextseg] = FindNextLineSegment(LineSegment lineseg) Input: LineSegment object of the current line segment Output: LineSegment object of the adjacent line segment in your ordering. nextseg.ID = -1 if there are no more segments </code></pre> <h3>Function: Find the next point along your path</h3> <pre><code>Function [Point Q, LineSegment Z] = FindNextPt(Point P, LineSegment lineseg, int dist): Input: The current point P, the distance between this point and the next, and the LineSegment of the line segment which contains P. Output: The next point Q, and the line segment it is on Procedure: distToEndpt = EuclideanDistance(P,lineseg->end); if( distToEndpt >= d ) { Point Q(lineseg->start.x + dist*cos(lineseg.theta), lineseg->start.y + dist*sin(lineseg.theta)); Z = lineseg; } else { nextseg = lineseg->next_segment; if( nextseg.ID !=-1 ) { [Q, Z] = FindNextPt(nextseg->start,nextseg->ID,dist-distToEndpt); } else { return [P,lineseg]; } } return [Q,Z] </code></pre> <h3>Entry point</h3> <pre><code>Function main() Output: vector of points Procedure: vector<LineSegment> line_segments; // Define it somehow giving it all the properties // .... vector<Point> equidistant_points; const int d = DIST; [Q Z] = FindNextPoint(line_segments[0].start,line_segments[0],DIST); while( Z.ID != -1 ) { equidistant_points.push_back(Q); [Q Z] = FindNextPt(Q,Z,d); } </code></pre>
Tags
Title
singulars
PostAcceptedAnswerId
1. This table or related slice is empty.
PostParentId
1. POUniform distance between points
  singulars
  PostTypePostTypeId
  PTQuestion
PostTypePostTypeId
1. PTAnswer
UserLastEditorUserId
1. USJacob
UserOwnerUserId
1. USJacob
plurals
PostLinksPostIdRelatedPostId
1. This table or related slice is empty.
PostLinksRelatedPostIdPostId
1. This table or related slice is empty.
PostsAcceptedAnswerId
1. POUniform distance between points
  singulars
  PostTypePostTypeId
  PTQuestion
PostsParentIdCreationDate
1. This table or related slice is empty.
VotesPostIdCreationDate
1. VO
  singulars
  PostPostId
  PO
  UserUserId
  This table or related slice is empty.
  VoteTypeVoteTypeId
  VTAcceptedByOriginator
2. VO
  singulars
  PostPostId
  PO
  UserUserId
  This table or related slice is empty.
  VoteTypeVoteTypeId
  VTUpMod
CommentsPostId

Querying!

Guidance

A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.