| 08:09.35 | *** join/#brlcad infobot (ibot@rikers.org) |
| 08:09.35 | *** topic/#brlcad is Welcome to BRL-CAD! || Don't ask if someone is here, ask a better question. || GSoC 2016 is under way, 9 CAx students! || Release 7.26.0 by 27th... || Logs: http://ibot.rikers.org/%23brlcad/ |
| 08:15.11 | *** join/#brlcad merzo (~merzo@92.60.189.225) |
| 08:42.48 | *** join/#brlcad bdypjrztfceqjfsw (~armin@dslb-088-065-188-131.088.065.pools.vodafone-ip.de) |
| 08:42.53 | *** join/#brlcad tandoorichick (~Thunderbi@117.199.134.157) |
| 08:57.18 | *** join/#brlcad amarjeet (~amarjeet@202.164.53.117) |
| 09:27.57 | *** join/#brlcad kintel (~kintel@unaffiliated/kintel) |
| 09:33.03 | *** join/#brlcad teepee] (bc5c2134@gateway/web/freenode/ip.188.92.33.52) |
| 09:34.48 | *** join/#brlcad amarjeet (~amarjeet@202.164.53.117) |
| 10:03.04 | *** join/#brlcad sniok (~sniok@89.252.29.238) |
| 10:16.00 | *** join/#brlcad asad_ (~asad00@host10-2.natpool.mwn.de) |
| 10:23.00 | *** join/#brlcad tandoorichick (~Thunderbi@117.216.48.165) |
| 10:50.29 | *** join/#brlcad kintel (~kintel@unaffiliated/kintel) |
| 11:06.22 | *** join/#brlcad amarjeet (~amarjeet@202.164.53.117) |
| 11:31.56 | *** join/#brlcad d_rossberg (~rossberg@104.225.5.10) |
| 11:44.12 | tandoorichick | d_rossberg: i'll get on with the work you've mentioned. do the dev logs seem okay? |
| 11:48.12 | d_rossberg | tandoorichick: together with the patches yes ;) |
| 11:52.08 | tandoorichick | for the closest edge function, i came up with an approach. i mentioned it here: https://tandoorichick.github.io/ . is that okay? |
| 11:52.23 | tandoorichick | i mean, does the method seem okay |
| 12:11.40 | *** join/#brlcad kintel (~kintel@unaffiliated/kintel) |
| 12:39.47 | d_rossberg | hmm, what do you mean with "closest edge"? the vertex is an endpoint of at least two edges, so what? |
| 12:56.47 | tandoorichick | distance to an edge is the perpendicular distance if an orthogonal projection (0<t<1) is possible, or the distance to the closer end point. closest edge is an edge which is at the least distance (excluding those that are incident on the vertex). |
| 13:04.28 | *** join/#brlcad yorik (~yorik@191.17.143.25) |
| 13:08.27 | d_rossberg | then you check if a "face contains the vertex", this is unlikely if the vertex isn't a corner of the face, or do you work in 2d? |
| 13:22.11 | tandoorichick | no, i didn't generalise to 2d |
| 13:23.59 | *** join/#brlcad kintel (~kintel@unaffiliated/kintel) |
| 13:49.05 | d_rossberg | then it's very unlikely that a face contains a vertex which isn't a corner, think of a curved surface |
| 13:59.55 | tandoorichick | by face contains a vertex, i mean just checking if the vertex is one of its corner vertices.. |
| 14:01.37 | d_rossberg | are all faces triangles? |
| 14:04.24 | tandoorichick | they are in rt_bot_internal no? |
| 14:07.22 | *** join/#brlcad kintel (~kintel@unaffiliated/kintel) |
| 14:11.54 | d_rossberg | for rt_bot_internal all faces are triangles, but do you require for a PolygonialMesh all faces to be triangles? |
| 14:12.12 | d_rossberg | it's ok if yes |
| 14:18.24 | tandoorichick | yes.. |
| 14:24.11 | d_rossberg | ok, then what is "line joining the vertex v to the edge"? the edge incident on the vertex? |
| 14:46.57 | *** join/#brlcad amarjeet (~amarjeet@101.216.1.124) |
| 14:54.45 | tandoorichick | no, we look through the complete edge list to decide on the closest edge. each edge being considered is the one i'm talking about. |
| 15:00.07 | d_rossberg | my question was: what is the LINE joining the vertex to the edge? line means the connection of two points, one is probable the vertex, the edges incident to the vertex clearly join the other edge with the vertex (we have triangles here) |
| 15:04.03 | tandoorichick | the line means possibly a new edge that might be added, so it isn't already connecting. we're checking if it crosses any face to see if it can be added |
| 15:07.20 | d_rossberg | so i ask again: what are the two end points of the line joining the vertex to the edge? |
| 15:07.36 | d_rossberg | one is the vertex, and the other one? |
| 15:08.26 | tandoorichick | is the orthogonal projection of the vertex on a candidate edge/ the closer endpoint of the candidate edge depending on whether an orthogonal projection is possible.. |
| 15:10.49 | Notify | 03BRL-CAD:ejno * 68129 brlcad/trunk/src/libgcv/plugins/rhino/rhino_read.cpp: create regions for solids that are not within regions |
| 15:11.38 | Notify | 03BRL-CAD:ejno * 68130 (brlcad/trunk/src/conv/3dm/3dm-g.c brlcad/trunk/src/libgcv/gcv.c): fix |
| 15:14.02 | d_rossberg | ok, i have to leave now |
| 15:14.33 | d_rossberg | you should think about how it could happen that this line intersect anothe one |
| 15:20.27 | Notify | 03BRL-CAD:ejno * 68131 brlcad/trunk/src/libgcv/plugins/rhino/rhino_read.cpp: remove unused variable |
| 15:24.48 | *** join/#brlcad Mathnerd314 (~quassel@supertux/Mathnerd314) |
| 16:06.06 | *** join/#brlcad LordOfBikes (~armin@dslb-088-065-188-131.088.065.pools.vodafone-ip.de) |
| 16:25.01 | *** join/#brlcad ickby (~stefan@x5d845e2c.dyn.telefonica.de) |
| 16:31.01 | *** join/#brlcad teepee_ (~teepee@unaffiliated/teepee) |
| 16:36.46 | *** join/#brlcad amarjeet (~amarjeet@101.211.164.241) |
| 16:47.16 | *** join/#brlcad Mandeep_Singh (~mandeep@59.95.82.238) |
| 17:05.00 | *** join/#brlcad Mandeep_Singh_ (~mandeep@117.199.100.152) |
| 18:27.16 | *** join/#brlcad asad_ (~asad00@host10-2.natpool.mwn.de) |
| 19:30.38 | *** join/#brlcad asad___ (~asad00@host52-2.natpool.mwn.de) |
| 19:34.23 | *** join/#brlcad asad____ (~asad00@host236-2.natpool.mwn.de) |
| 19:38.24 | Notify | 03BRL-CAD:starseeker * 68132 (brlcad/branches/RELEASE/src/conv/3dm/3dm-g.c brlcad/branches/RELEASE/src/libgcv/gcv.c and 4 others): merge of trunk to RELEASE branch, r68127 through r68131 |
| 21:02.50 | *** join/#brlcad asad_ (~asad00@host10-2.natpool.mwn.de) |