| |
 |
|
|
Thornton, Andrew
IBM UK Ltd.
Winchester, United Kingdom
|
|
 |
|
|
| |
| |
|
Date Reviewed |
|
| |
1 - 10 of 22
reviews
|
|
|
|
|
|
|
|
V-Clip: fast and robust polyhedral collision detection
Mirtich B. ACM Transactions on Graphics (TOG) 17(3): 177-208, 1998. Type: Article
V-Clip (or Voronoi Clip) is an algorithm, based on the Lin-Canny and GJK algorithms, for determining the closest pair of features between convex polyhedra modeled using boundary representations. By using the topology of the convex poly...
|
Mar 1 1999 |
|
|
|
|
|
|
An optimal algorithm for expanding the composition of polynomials
Liu W., Mann S. ACM Transactions on Graphics (TOG) 16(2): 155-178, 1997. Type: Article
While it is generally computationally more efficient for surface modeling systems to work with composed polynomials (such as F &dundot; G ), there are inevitably occasions when it is necessary to convert them to ...
|
Sep 1 1997 |
|
|
|
|
|
|
Digital control systems
Paraskevopoulos P., Prentice-Hall, Inc., Upper Saddle River, NJ, 1996. Type: Book (9780133418767)
This undergraduate textbook provides an up-to-date overview of digital control systems. The first part of the book (chapters 1 through 4) lays the groundwork. Starting with a description of the Z transform, the book goes on to describe...
|
Jul 1 1997 |
|
|
|
|
|
|
An efficient algorithm for optimal pruning of decision trees
Almuallim H. Artificial Intelligence 83(2): 347-362, 1996. Type: Article
A method for using the techniques of dynamic programming to prune decision trees is presented. This method is particularly useful in pruning overtrained systems, and in cases where a tradeoff between accuracy and efficiency must be mad...
|
Apr 1 1997 |
|
|
|
|
|
|
A subexponential algorithm for abstract optimization problems
Gärtner B. SIAM Journal on Computing 24(5): 1018-1035, 1995. Type: Article
The authors consider three related classes of geometric optimization problems: linear programming; finding the minimum distance between two convex polyhedra (a quadratic programming problem); and finding the center and radius of a mini...
|
Mar 1 1997 |
|
|
|
|
|
|
AutoCAD for success
Ethier S., Ethier C., Prentice-Hall, Inc., Upper Saddle River, NJ, 1995. Type: Book (9780023344213)
Writers on AutoCAD must realize that the potential scope to be covered is huge. Most authors deal with this by limiting themselves to an aspect of the system, for example, introductory use of AutoCAD, AutoLisp programming, or applicati...
|
Sep 1 1996 |
|
|
|
|
|
|
Algorithm 742: L2CXFT: a Fortran subroutine for least-squares data fitting with nonnegative second divided differences
Demetriou I. ACM Transactions on Mathematical Software 21(1): 98-110, 1995. Type: Article
Demetriou describes an implementation in Fortran 77 of Demetriou and Powell’s algorithm to fit data contaminated with random errors to a convex function. The technique first approximates a solution, then uses quadratic progra...
|
May 1 1996 |
|
|
|
|
|
|
Engineering graphics with AutoCAD
Bethune J., Prentice-Hall, Inc., Upper Saddle River, NJ, 1995. Type: Book (9780131001404)
Bethune introduces the student to the fundamentals of computer-aided design (CAD) within AutoCAD. Assuming no knowledge of AutoCAD or of technical drawing, he leads the student into both areas from the basics, giving clear step-by-step...
|
Mar 1 1996 |
|
|
|
|
|
|
Evaluation and approximate evaluation of the multivariate Bernstein-Bézier form on a regularly partitioned simplex
Peters J. ACM Transactions on Mathematical Software 20(4): 460-480, 1994. Type: Article
Two new algorithms have been designed for efficient and stable evaluation of a large number of points on a Bernstein-Bézier simplex. Both these algorithms are derived from de Casteljau’s algorithm...
|
Nov 1 1995 |
|
|
|
|
|
|
Algorithms for intersecting parametric and algebraic curves I: simple intersections
Manocha D., Demmel J. ACM Transactions on Graphics (TOG) 13(1): 73-100, 1994. Type: Article
The authors briefly review the strengths and weaknesses of existing approaches based on implicit techniques, interval arithmetic, and Bézier convex hull subdivision. They then go on to present their own technique, which takes ...
|
Sep 1 1995 |
|
|
|
|
|
| |
|
|
| |
|
|
