Rank: 205165 based on 0 downloads (last 30 days) and 0 file submitted

laurent

E-mail: Contact Author

Personal Profile:: Product Manager
Professional Interests:: Image processing,Data mining

Watch this Author's files

Files
Watch Lists

Comments and Ratings by laurent		1 - 1 of 1
Updated	File	Comments	Rating
25 May 2009	Java-based data table Spreadsheet display/editing/sorting of data with multiple features Author: Yair Altman

Top Tags Applied by laurent	1 - 3 of 3
database, example, regedit

Files Tagged by laurent					View all 1 - 3 of 3
Updated		File	Tags	Downloads (last 30 days)	Comments	Rating
13 Oct 2011		getHWnd - retrieve the underlying Windows handle for Matlab figure(s) Enable C++ GUI integration by retrieving the HWnd handle of matlab figure(s) Author: Yair Altman	window, example, java, hwnd, gui tools	5	1	5.0 5.0 \| 1 rating
14 Jul 2010		dbBulkInsert fast bulk insert data into database, hundreds of rows per second Author: Willow Yang	database, data output, sql, insert, bulk, bcp	3	1
30 Aug 2007		writereg.m write string and integer values to Windows Registry Author: Alex Nelson	regedit, string, external interface, windows registry, integer, external code interfa...	3	4	5.0 5.0 \| 1 rating

Currently Watching
Type	Description
File	Polygon_Intersection

Files Matching laurent's Watch List					1 - 1 of 1
Updated		File	Tags	Downloads (last 30 days)	Comments	Rating
19 Jun 2009		Polygon_Intersection This function computes n-times intersection region of shapes collection Author: Guillaume JACQUENOT	intersection, overlap, specialized, plotting, polygon, graphics	36	5	5.0 5.0 \| 6 ratings

Comments and Ratings Matching laurent's Watch List			1-5 of 9
Date	File	Comment by	Comments	Rating
22 Jan 2013	Polygon_Intersection This function computes n-times intersection region of shapes collection	John Mahoney	Hi all, I am interested in coloring the regions formed by a single self-intersecting polygon. I was hoping that this would do it %% clear S S(1).P.x = [0,5,5,2,2,4,4,1,1,3,3,0]; S(1).P.y = [0,0,5,5,2,2,1,1,3,3,4,4]; S(1).P.hole = 0; Display_result = 1; Accuracy = 1e-6; Polygons_intersection(S,Display_result,Accuracy); %% However, using this function the region that is double-covered is not colored. Can the author (or anyone else) recommend an algorithm to accomplish a single coloring of all regions of N-covering? Cheers, John	Comment only
15 Aug 2012	Polygon_Intersection This function computes n-times intersection region of shapes collection	jan		5
13 Mar 2012	Polygon_Intersection This function computes n-times intersection region of shapes collection	Romain W	I have to compute intersections between thousands of 2D triangles and "Polygons_intersection" takes an infinite amount of time to perform the task,I was wondering if there would be a way to improve greatly the computational time of the algorithm? Thanks a lot since I really need that function working at enhanced speed.	Comment only
06 Mar 2012	Polygon_Intersection This function computes n-times intersection region of shapes collection	Romain W	Hi everyone, As mentioned by m4 Chrennikov, I've faced similar problems when using Polygon_intersection function. It seems like in some cases, the function do not work properly, it returns structure with zeros areas (All P-s in each struct are empty []). Can you please let me know how to fix this problem? Thank you very much -------------------------------------------- I solved my problem by playing with the relative accuracy of the algorithm, thank you again for this fantastic function.	Comment only
06 Mar 2012	Polygon_Intersection This function computes n-times intersection region of shapes collection	Romain W	Hi everyone, As mentioned by m4 Chrennikov, I've faced similar problems when using Polygon_intersection function. It seems like in some cases, the function do not work properly, it returns structure with zeros areas (All P-s in each struct are empty []). Can you please let me know how to fix this problem? Thank you very much	5