Location:
Search - acm vol
Search list
Description: HDOJ
acm.hdu.edu.cn
第10卷的一些题目，有些提供数据，有简单的分析过程-HDOJacm.hdu.edu.cn Vol.10 some of the topics, and some provide data, has a simple analytical process
Platform: |
Size: 179200 |
Author: 黄魏 |
Hits:
Description: Usage: yi=akimai(x,y,xi)
Given vectors x and y (of the same length)
and the array xi at which to interpolate,
fits piecewise cubic polynomials and returns
the interpolated values yi at xi.
Ref. : Hiroshi Akima, Journal of the ACM, Vol. 17, No. 4, October 1970,
pages 589-602.
Programmer: N. Shamsundar, University of Houston, 6/2002
Correction to lines 32-33, 9/2004, motivated by Gilford Ward,
to make routine work correctly for linear data.
Notes: Use only for precise data, as the fitted curve passes through the
given points exactly. This routine is useful for plotting a pleasingly
smooth curve through a few given points for purposes of plotting.-Usage: yi=akimai(x,y,xi)
Given vectors x and y (of the same length)
and the array xi at which to interpolate,
fits piecewise cubic polynomials and returns
the interpolated values yi at xi.
Ref. : Hiroshi Akima, Journal of the ACM, Vol. 17, No. 4, October 1970,
pages 589-602.
Programmer: N. Shamsundar, University of Houston, 6/2002
Correction to lines 32-33, 9/2004, motivated by Gilford Ward,
to make routine work correctly for linear data.
Notes: Use only for precise data, as the fitted curve passes through the
given points exactly. This routine is useful for plotting a pleasingly
smooth curve through a few given points for purposes of plotting.
Platform: |
Size: 506880 |
Author: rz |
Hits:
Description: 使用push-relabel方法求解最大流问题，是国外的一个研究机构编写的，速度很快。-This is an efficient implementation of the push-relabel method.
See
Goldberg and Tarjan, "A New Approach to the Maximum Flow Problem,"
J. ACM Vol. 35, 921--940, 1988
and
Cherkassky and Goldberg, "On Implementing Push-Relabel Method for the
Maximum Flow Problem," Proc. IPCO-4, 157--171, 1995.
Platform: |
Size: 26624 |
Author: 顾徐鹏 |
Hits:
Description: 大数相加。杭电ACM1000-1010题
http://acm.hdu.edu.cn/listproblem.php?vol=1-Add large numbers. Hangzhou Xinhua ACM1000-1010 title http://acm.hdu.edu.cn/listproblem.php?vol=1
Platform: |
Size: 6144 |
Author: squirrel |
Hits:
Description: C ALGORITHM 750, COLLECTED ALGORITHMS FROM ACM.
C THIS WORK PUBLISHED IN TRANSACTIONS ON MATHEMATICAL SOFTWARE,
C VOL. 21, NO. 4, December, 1995, P. 410--415.-C ALGORITHM 750, COLLECTED ALGORITHMS FROM ACM.
C THIS WORK PUBLISHED IN TRANSACTIONS ON MATHEMATICAL SOFTWARE,
C VOL. 21, NO. 4, December, 1995, P. 410--415.
Platform: |
Size: 16384 |
Author: am |
Hits:
Description: 从代码仓库中下载的最新的用于二维任意复杂多边形裁剪代码，该代码使用Bala Vatti的多边形裁剪算法，并做了多种扩展和改进，提供多个版本（Delphi Pascal C++ C# ）的源码和测试程序和简明的帮组文档，方便用户使用。
sandbox
tags
trunk-The Clipper Library is based on but significantly extends Bala Vatti s polygon clipping algorithm as described in "A generic solution to polygon clipping", Communications of the ACM, Vol 35, Issue 7 (July 1992) pp 56-63.
The library can perform each of the four boolean clipping operations- intersection, union, difference and exclusive-or (xor). It can accept any number of, and any type of polygon as input (including self-intersecting polygons). Duplicate vertices and coincident edges are also accommodated.
Polygon holes are handled implicitly, based on polygon orientation. Polygon holes are implied by having their orientations opposite the orientation of their container polygons.
The Clipper package contains the core library, a help file and a number of compiled examples. The library s code was initially written in Delphi Pascal (and compiles in version 7 and up) but now contains C++ and C# translations too. The code in each language is a little over 100K, or about 3500 li
Platform: |
Size: 4333568 |
Author: highrisk |
Hits: