Developer

820 reputation

216

bio	website
	location	Earth, TX
	age
visits	member for	1 year, 7 months
	seen	9 hours ago
stats	profile views	353

Developer

def Lover(Programming):
    return ['Love']*len(Programming)

print Lover(['Python','Fortran','VB','Matlab',[]])

	820 reputation	bio	website		visits	member for	1 year, 7 months
216 badges		location	Earth, TX		seen	9 hours ago

summary answers questions tags badges favorites bounties reputation activity

165 Actions

suggestions reviews revisions comments badges posts accepts all

May 18	comment	inner convex-hulls in a set of 2D points Thanks, finally we could understand your point. We added a demonstration of the problem too.
May 18	revised	inner convex-hulls in a set of 2D points added 358 characters in body
May 18	comment	inner convex-hulls in a set of 2D points @whuber We added a complete solution that we are looking for as update 2.
May 18	revised	inner convex-hulls in a set of 2D points added 771 characters in body
May 17	comment	inner convex-hulls in a set of 2D points @whuber & UffeKousgaard: The correct solution for your data is a rectangle (white) in the middle plus two triangles 3 and 4. These are largest ICHs (with no overlapping) and cover the area fully.
May 17	comment	inner convex-hulls in a set of 2D points @UffeKousgaard As in the question, after finding the largest ICH it must be removed and the procedure needs to be repeated. We guess `whuber`'s comment refers to this.
May 17	comment	inner convex-hulls in a set of 2D points Note that this is not a complete solution but just an idea. As mentioned in the question, once the first largest convex found, it must be removed from data somehow and the procedure needs to be repeated as long as required. Even if you implement the complete solution (which is not an easy task, BTW) in addition to some incorrect results (sometimes) the method is not optimum.
May 16	comment	inner convex-hulls in a set of 2D points The above illustration is the actual result of our implementation of Uffe's idea. Apparently, as we also mentioned there are some problems :(
May 16	revised	inner convex-hulls in a set of 2D points added 36 characters in body
May 16	revised	inner convex-hulls in a set of 2D points added 173 characters in body
May 16	comment	inner convex-hulls in a set of 2D points Our experiment as shown in update gives promising results, however, there are some cases that the result of algorithm is not correct. Also note that it is very slow. Nevertheless, it is a nice idea. We appreciated by an upvote so.
May 16	revised	inner convex-hulls in a set of 2D points added 381 characters in body
May 15	revised	inner convex-hulls in a set of 2D points added 316 characters in body
May 15	asked	inner convex-hulls in a set of 2D points
May 8	comment	Generate polygons from a set of intersecting lines As this method is an original solution and gives much better performance compared to the other method in which `difference` operation is being used.
May 8	accepted	Generate polygons from a set of intersecting lines
May 5	comment	Generating polygonal blocks using growing lines Note that this method is more flexible than mathematical solution. For example, you can have predefined lines as obstacles to control the growth of rays. Each ray can have different speed of growth. Or a limit can be put on the length of growing lines. etc.
May 5	revised	Generating polygonal blocks using growing lines added 217 characters in body
May 4	answered	Generate polygons from a set of intersecting lines
May 4	comment	Generating polygonal blocks using growing lines Well with some effort we could build block from touching lines. Details were put in the post. `DCEL` is solved so.