Search Comments and Ratings

View All Comments and Ratings by:
Most Recent
Rank

Comments and Ratings

E-mail this View
			1 - 8 of 8
Date	File	Comment by	Comment	Rating
20 Nov 2009	Supersmoother Friedman's supersmoother algorithm Author: Douglas Schwarz	Schwarz, Douglas	Yuri, Sure, it will smooth any vector of at least 5 values. You'll have to decide if you like the result. Just give it a try. Doug
28 Jul 2009	Fast and Robust Curve Intersections Computes intersection points of two curves. Author: Douglas Schwarz	Schwarz, Douglas	Yuri, no problem! I'm glad it's resolved and that you're still following this thread. -Doug
28 Jul 2009	Fast and Robust Curve Intersections Computes intersection points of two curves. Author: Douglas Schwarz	Schwarz, Douglas	It bothered me that I never resolved Yuri's issue so I just took another look at it and realized that his code has a bug. When he gets X2 and Y2 he is using the handle H1 instead of H2. After fixing that there is no problem.
25 Jun 2009	uipickfiles: uigetfile on steroids Many-featured, platform independent file and directory picker. Author: Douglas Schwarz	Schwarz, Douglas	J W, what platform are you using and what kinds of files are those? Do the hidden files somehow pair up with non-hidden versions so you have both ._abc.txt and abc.txt? It would be easy to add a feature so that hidden files are not displayed in uipickfiles as long as we can identify them. Tell me more.
08 Apr 2009	Fast and Robust Curve Intersections Computes intersection points of two curves. Author: Douglas Schwarz	Schwarz, Douglas	Yuri, Please email me a mat-file and m-file that demonstrate what you are saying and I will investigate further. Doug
08 Apr 2009	Fast and Robust Curve Intersections Computes intersection points of two curves. Author: Douglas Schwarz	Schwarz, Douglas	Yuri, If you zoom in on the supposed intersection point I think you'll find that there is no intersection at all. Remember, those circles are made up of line segments and so are actually polygons with N sides. For most values of N the two polygons won't even touch. In fact, the closest they can ever come is to touch at just one point and because of floating point round-off effects, my routine may or may not find that point. Doug
18 Feb 2009	bsxfun substitute Substitute for bsxfun for older versions of MATLAB in which it is not built-in. Author: Douglas Schwarz	Schwarz, Douglas	Hi Wolfgang, Yes, I am aware of that submission. It differs from mine in that it uses extra memory by expanding the input arrays until they are the same size. My submission will never do that (and might be slower as a result). Doug
24 Jan 2009	uipickfiles: uigetfile on steroids Many-featured, platform independent file and directory picker. Author: Douglas Schwarz	Schwarz, Douglas	Skip, you can double-click on a file and it will be added to the list immediately. That may be sufficient for your purposes, but I will look into your suggestion.
1 - 8 of 8
E-mail this View

MATLAB Central Terms of Use

NOTICE: Any content you submit to MATLAB Central, including personal information, is not subject to the protections which may be afforded information collected under other sections of The MathWorks, Inc. Web site. You are entirely responsible for all content that you upload, post, e-mail, transmit or otherwise make available via MATLAB Central. The MathWorks does not control the content posted by visitors to MATLAB Central and, does not guarantee the accuracy, integrity, or quality of such content. Under no circumstances will The MathWorks be liable in any way for any content not authored by The MathWorks, or any loss or damage of any kind incurred as a result of the use of any content posted, e-mailed, transmitted or otherwise made available via MATLAB Central. Read the complete Terms prior to use.