From: <brlcad@us...>  20090310 22:26:19

Revision: 33978 http://brlcad.svn.sourceforge.net/brlcad/?rev=33978&view=rev Author: brlcad Date: 20090310 22:26:10 +0000 (Tue, 10 Mar 2009) Log Message:  few more entities and modifiers Modified Paths:  brlcad/trunk/doc/TODO.BREP Modified: brlcad/trunk/doc/TODO.BREP ===================================================================  brlcad/trunk/doc/TODO.BREP 20090310 22:07:53 UTC (rev 33977) +++ brlcad/trunk/doc/TODO.BREP 20090310 22:26:10 UTC (rev 33978) @@ 18,7 +18,8 @@ point line (e.g., line segment, ray, bidirectionally infinite line) curve +line set (e.g., polyline, polygon) +curve (e.g., spline, arc, circle, ellipse) surface curve+surface (i.e. a trimmed surface) solid @@ 83,14 +84,31 @@ Geometry Modifiers  snapTogether (e.g.,  ) scale rotate translate shear invert +mirror +copy/clone +delete +invertRepresentation +evaluateBoolean (i.e. CSG) +snapTogether (e.g.,  ) + +sweep +extrude +revolve +extend/stretch + +trim (e.g., cutting plane) +split (i.e. copy and two trims) + +fillet +chamfer + + Ray Tracing  This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site. 
From: <brlcad@us...>  20090311 20:04:13

Revision: 33997 http://brlcad.svn.sourceforge.net/brlcad/?rev=33997&view=rev Author: brlcad Date: 20090311 20:03:46 +0000 (Wed, 11 Mar 2009) Log Message:  add a missing important plane specialization of surfaces analogous to lines vs curves Modified Paths:  brlcad/trunk/doc/TODO.BREP Modified: brlcad/trunk/doc/TODO.BREP ===================================================================  brlcad/trunk/doc/TODO.BREP 20090311 20:01:16 UTC (rev 33996) +++ brlcad/trunk/doc/TODO.BREP 20090311 20:03:46 UTC (rev 33997) @@ 31,24 +31,36 @@ point > point point > line point > curve +point > plane point > surface point > curve+surface +point > surface+curve point > solid line > line line > curve +line > plane line > surface line > curve+surface +line > surface+curve line > solid curve > curve +curve > plane curve > surface curve > curve+surface +curve > surface+curve curve > solid +plane > plane +plane > surface +plane > surface+curve +plane > solid + surface > surface +surface > surface+curve surface > solid +surface+curve > surface+curve +surface+curve > solid + solid > solid This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site. 
From: <brlcad@us...>  20090311 21:30:25

Revision: 33998 http://brlcad.svn.sourceforge.net/brlcad/?rev=33998&view=rev Author: brlcad Date: 20090311 21:30:21 +0000 (Wed, 11 Mar 2009) Log Message:  Added few more queries. Modified Paths:  brlcad/trunk/doc/TODO.BREP Modified: brlcad/trunk/doc/TODO.BREP ===================================================================  brlcad/trunk/doc/TODO.BREP 20090311 20:03:46 UTC (rev 33997) +++ brlcad/trunk/doc/TODO.BREP 20090311 21:30:21 UTC (rev 33998) @@ 69,15 +69,20 @@ [ geometric properties ] intersects +inside +outside +on intersectionSet firstIntersectionSet closestDistance closestSet (e.g., closestPoint) booleanEvaluation insideSet (e.g., insideSolid, insideLoop (trimmed)) +outsideSet +onSet [ parametric properties ] uvMapping +uvSpace <> ImageSpace Mapping (for ALL primitive types) curvatures normalSet (e.g., normalVector, normalPlane) tangentSet (e.g., tangentVectors, tangentPlanes) This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site. 
From: <brlcad@us...>  20090311 22:25:49

Revision: 33999 http://brlcad.svn.sourceforge.net/brlcad/?rev=33999&view=rev Author: brlcad Date: 20090311 22:02:37 +0000 (Wed, 11 Mar 2009) Log Message:  Breakout of raytracing dependencies Modified Paths:  brlcad/trunk/doc/TODO.BREP Modified: brlcad/trunk/doc/TODO.BREP ===================================================================  brlcad/trunk/doc/TODO.BREP 20090311 21:30:21 UTC (rev 33998) +++ brlcad/trunk/doc/TODO.BREP 20090311 22:02:37 UTC (rev 33999) @@ 20,8 +20,9 @@ line (e.g., line segment, ray, bidirectionally infinite line) line set (e.g., polyline, polygon) curve (e.g., spline, arc, circle, ellipse) surface curve+surface (i.e. a trimmed surface) +plane +surface (e.g., spline, polygonal) +surface+curve (i.e. a trimmed surface) solid @@ 129,11 +130,36 @@ Ray Tracing  line > solid evaluation  intersectionSet query  normalSet query +intersectionSet query + boundingBox + line > solid evaluation +normalSet query + line > solid evaluation +line>solid evaluation + line>surface  line>plane +line>plane + line>line + +line>surface + line>curve  line>line + closestDistance + +closestDistance + point>plane + point>point + +line>curve + line>point + +line>line + line>point + +line>point + point>point + + Interactive Visualization  This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site. 
From: <starseeker@us...>  20090327 16:14:56

Revision: 34098 http://brlcad.svn.sourceforge.net/brlcad/?rev=34098&view=rev Author: starseeker Date: 20090327 16:14:51 +0000 (Fri, 27 Mar 2009) Log Message:  Add some notes/brainstorming related to the question of deciding if two points are the same point when they have error bounds. Modified Paths:  brlcad/trunk/doc/TODO.BREP Modified: brlcad/trunk/doc/TODO.BREP ===================================================================  brlcad/trunk/doc/TODO.BREP 20090327 14:54:55 UTC (rev 34097) +++ brlcad/trunk/doc/TODO.BREP 20090327 16:14:51 UTC (rev 34098) @@ 177,3 +177,107 @@ IGES to BRLCAD BRLCAD to STEP BRLCAD to IGES + + + + + +******************************************************************************** + Below are some thoughts and notes about specific issues related to the above + topics  may be useful as comments at some point, or at least food for thought. +******************************************************************************** + +/* + * PointPoint Evaluation + * + * Answer Evaluation Questions involving two points: + * + * 1. Intersection  for a point, there are three possible categories of of intersection: + * * Identical  point values identical and all bound values identical + * + * * * * * * * * * + * * * + * * 1 2 * + * * * * + * * * + * * * + * * * * * * * * * + * + * * Contained  values not all identical but bounds of the point of interest all smaller than bounds of + * point it is being compared to + * + * + * * * * * * * * * * * * * * * * * * * * * + * * 1 * * * + * * * * * * * * * * * * * * * + * * * * * * * 1 * * + * * * 2 * * * * * * + * * * * * * * 2 * * + * * * * * * * * * * * * * * * + * * * * * * * * * * * * * * * * * * * * * + * + * + * * Overlapping  values not all identical but bounds of the point of interest all overlap bounds of + * the point it is being compared to. (Note: a corner case is when the value of the upper + * bound of one point is equal to the lower bound of the other  this is defined to be + * overlapping.) + * + * + * * * * * * * * * * * * * * * * * * * * * * * * * + * * * * * * * + * * 1 * * * * * * * * * * * * * * * * * * * * * + * * * * * * * * * * * * 1 * * * * 1 * * + * * * * * * * * * * * * * + * * * * * * * * * * * * * * * * * * * * * 2 * * + * * 2 * * 2 * * * * * * * * * * + * * * * * * * + * * * * * * * * * * * * * * * * * * * * * * * * * * * + * + * + * 2. Outside  "If the points are not identical in value and/or error bounds, is the point of interest and its error + * bounds contained or overlapping with the comparison point, or vice versa? If not, the point of interest is + * outside the comparison point. + * + * Contained and Overlapping points present a problem. Take the case where two points have an overlapping bound + * and a third point must decide its relationship with each of them: + * + * * * * * * * * * + * * * + * * 1 * + * * * + * * * * * * * * * * * * * * * * * + * * * * * * * + * * * * * * * * * * * + * * 2 * * 3 * + * * * * * + * * * * * + * * * * * * * * * * * * * * * * * + * + * Point 1 and Point 2 overlap and may intersect. When Point 3 evaluates its relationships with Point 1 and + * Point 2, it finds that it overlaps and may intersect Point 1, but it does NOT overlap Point 3. This means + * tht Point 1 may intersect Point 2 OR Point 3, but NOT both at the same time. Any assumption of equality + * involving any of these three points must decide how to handle this situation, and the decision must be both + * consistent and reproducable. The possible decisions are: + * + * 1 = 2, 1 != 3 + * 1 != 2, 1 = 3 + * + * In order to have a concrete method for deciding this question, point evaluation cannot be a local, two point + * only test. It is necessary to search out all points which overlap the two points in question (i.e. the only + * points which might impact the decisions of which points are identical in this particular case) and resolve the + * question amongst all of them. One possibility would be to assemble all the guaranteed nonequalities among + * the set, search for the shortest distance between values among the remaining possible relationships, and assign + * intersection status based on those results. (This may not be sufficient  bounding box size may also be + * important.) For the original two points supplied, the question of intersection or nonintersection is now + * resolved as long as no geometry changes are made to any element that has bounds overlapping their individual + * bound. + * + * Once this near space evaluation is done, each point's list of intersecting and nonintersecting points is updated. + * A query routine with two points can first check the points' own intersection/nonintersection lists to see if + * the answer is already predetermined. If it is not, determining via the bounds inside/outside is straightforward + * and deterministic and it cannot be intersecting. + * + * One question is what to do when the geometry DOES change. New geometry may potentially change the decisions + * on what is and is not intersecting  perhaps it should? Potential trouble there with overlaping vs. non + * overlapping regions. + */ \ No newline at end of file This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site. 
From: <carlmoore@us...>  20120808 15:14:00

Revision: 51812 http://brlcad.svn.sourceforge.net/brlcad/?rev=51812&view=rev Author: carlmoore Date: 20120808 15:13:54 +0000 (Wed, 08 Aug 2012) Log Message:  remove trailing blanks/tabs, added ending newline, fixe spelling Modified Paths:  brlcad/trunk/doc/TODO.BREP Modified: brlcad/trunk/doc/TODO.BREP ===================================================================  brlcad/trunk/doc/TODO.BREP 20120808 15:09:37 UTC (rev 51811) +++ brlcad/trunk/doc/TODO.BREP 20120808 15:13:54 UTC (rev 51812) @@ 195,7 +195,7 @@ * 1. Intersection  for a point, there are three possible categories of of intersection: * * Identical  point values identical and all bound values identical *  * * * * * * * * * + * * * * * * * * * * * * * * 1 2 * * * * * @@ 206,8 +206,8 @@ * * Contained  values not all identical but bounds of the point of interest all smaller than bounds of * point it is being compared to *  *  * * * * * * * * * * * * * * * * * * * * * + * + * * * * * * * * * * * * * * * * * * * * * * * 1 * * * * * * * * * * * * * * * * * * * * * * * * * 1 * * @@ 222,26 +222,26 @@ * bound of one point is equal to the lower bound of the other  this is defined to be * overlapping.) *  *  * * * * * * * * * * * * * * * * * * * * * * * * *  * * * * * * *  * * 1 * * * * * * * * * * * * * * * * * * * * *  * * * * * * * * * * * * 1 * * * * 1 * *  * * * * * * * * * * * * *  * * * * * * * * * * * * * * * * * * * * * 2 * *  * * 2 * * 2 * * * * * * * * * *  * * * * * * * + * + * * * * * * * * * * * * * * * * * * * * * * * * * + * * * * * * * + * * 1 * * * * * * * * * * * * * * * * * * * * * + * * * * * * * * * * * * 1 * * * * 1 * * + * * * * * * * * * * * * * + * * * * * * * * * * * * * * * * * * * * * 2 * * + * * 2 * * 2 * * * * * * * * * * + * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *  * * + * * 2. Outside  "If the points are not identical in value and/or error bounds, is the point of interest and its error  * bounds contained or overlapping with the comparison point, or vice versa? If not, the point of interest is + * bounds contained or overlapping with the comparison point, or vice versa? If not, the point of interest is * outside the comparison point. * * Contained and Overlapping points present a problem. Take the case where two points have an overlapping bound * and a third point must decide its relationship with each of them: *  * * * * * * * * * + * * * * * * * * * * * * * * 1 * * * * @@ 252,12 +252,12 @@ * * * * * * * * * * * * * * * * * * * * * * * * * * *  * + * * Point 1 and Point 2 overlap and may intersect. When Point 3 evaluates its relationships with Point 1 and * Point 2, it finds that it overlaps and may intersect Point 1, but it does NOT overlap Point 3. This means * tht Point 1 may intersect Point 2 OR Point 3, but NOT both at the same time. Any assumption of equality * involving any of these three points must decide how to handle this situation, and the decision must be both  * consistent and reproducable. The possible decisions are: + * consistent and reproduceable. The possible decisions are: * * 1 = 2, 1 != 3 * 1 != 2, 1 = 3 @@ 267,17 +267,17 @@ * points which might impact the decisions of which points are identical in this particular case) and resolve the * question amongst all of them. One possibility would be to assemble all the guaranteed nonequalities among * the set, search for the shortest distance between values among the remaining possible relationships, and assign  * intersection status based on those results. (This may not be sufficient  bounding box size may also be  * important.) For the original two points supplied, the question of intersection or nonintersection is now + * intersection status based on those results. (This may not be sufficient  bounding box size may also be + * important.) For the original two points supplied, the question of intersection or nonintersection is now * resolved as long as no geometry changes are made to any element that has bounds overlapping their individual * bound.  * + * * Once this near space evaluation is done, each point's list of intersecting and nonintersecting points is updated. * A query routine with two points can first check the points' own intersection/nonintersection lists to see if * the answer is already predetermined. If it is not, determining via the bounds inside/outside is straightforward * and deterministic and it cannot be intersecting. * * One question is what to do when the geometry DOES change. New geometry may potentially change the decisions  * on what is and is not intersecting  perhaps it should? Potential trouble there with overlaping vs. non + * on what is and is not intersecting  perhaps it should? Potential trouble there with overlapping vs. non * overlapping regions.  */ \ No newline at end of file + */ This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site. 
From: <carlmoore@us...>  20120926 16:16:58

Revision: 52552 http://brlcad.svn.sourceforge.net/brlcad/?rev=52552&view=rev Author: carlmoore Date: 20120926 16:16:48 +0000 (Wed, 26 Sep 2012) Log Message:  fix spelling Modified Paths:  brlcad/trunk/doc/TODO.BREP Modified: brlcad/trunk/doc/TODO.BREP ===================================================================  brlcad/trunk/doc/TODO.BREP 20120926 16:14:30 UTC (rev 52551) +++ brlcad/trunk/doc/TODO.BREP 20120926 16:16:48 UTC (rev 52552) @@ 252,7 +252,7 @@ * * Point 1 and Point 2 overlap and may intersect. When Point 3 evaluates its relationships with Point 1 and * Point 2, it finds that it overlaps and may intersect Point 1, but it does NOT overlap Point 3. This means  * tht Point 1 may intersect Point 2 OR Point 3, but NOT both at the same time. Any assumption of equality + * that Point 1 may intersect Point 2 OR Point 3, but NOT both at the same time. Any assumption of equality * involving any of these three points must decide how to handle this situation, and the decision must be both * consistent and reproduceable. The possible decisions are: * This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site. 