#### Filter Results:

- Full text PDF available (11)

#### Publication Year

1989

2011

- This year (0)
- Last 5 years (0)
- Last 10 years (7)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Jiannmin Zheng, Thomas W. Sederberg, Eng-Wee Chionh, David A. Cox
- 2003

The method of moving planes and moving quadrics can express the implicit equation of a parametric surface as the determinant of a matrix M . The rows of M correspond to moving planes or moving quadrics that follow the parametric surface. Previous papers on the method of moving surfaces have shown that a simple base point has the effect of converting one… (More)

- Eng-Wee Chionh, Ron Goldman, James R. Miller
- ACM Trans. Graph.
- 1991

Macaulay’s concise but explicit expression for nmltivariate resultants has many potential applications in computer-aided geometric design. Here we describe its use in solid modeling for finding the intersections of three implicit quadric surfaces. By B6zout’s theorem, three quadric surfaces have either at most eight or intlnitely many intersections. Our… (More)

- Eng-Wee Chionh
- J. Symb. Comput.
- 2001

Dixon 1908] introduces three distinct determinant formulations for the resultant of three bivariate polynomials of bidegree (m; n). The rst technique applies Sylvester's dialytic method to construct the resultant as the determinant of a matrix of order 6mn. The second approach uses Cayley's determinant device to form a more compact representation for the… (More)

- Eng-Wee Chionh
- Adv. Comput. Math.
- 2003

It is known that the Dixon matrix can be constructed in parallel either by entry or by diagonal. This paper presents another parallel matrix construction, this time by bracket. The parallel by bracket algorithm is the fastest among the three, but not surprisingly it requires the highest number of processors. The method also shows analytically that the Dixon… (More)

- Eng-Wee Chionh, Ron Goldman
- Computer Aided Geometric Design
- 1992

- Eng-Wee Chionh, Ming Zhang, Ron Goldman
- J. Symb. Comput.
- 2002

Efficient algorithms are derived for computing the entries of the Bezout resultant matrix for two univariate polynomials of degree n and for calculating the entries of the Dixon–Cayley resultant matrix for three bivariate polynomials of bidegree (m, n). Standard methods based on explicit formulas require O(n3) additions and multiplications to compute all… (More)

- Eng-Wee Chionh, Ron Goldman
- IEEE Computer Graphics and Applications
- 1995

- Eng-Wee Chionh, Xiao-Shan Gao, Li-Yong Shen
- Computer Aided Geometric Design
- 2006

We identify a class of monomial supports that are inherently improper because any surface rational parametrization defined on them is improper. A surface support is inherently improper if and only if the gcd of the normalized areas of the triangular sub-supports is non-unity. The constructive proof of this claim can be used to detect all and correct almost… (More)

- Eng-Wee Chionh, Ron Goldman
- The Visual Computer
- 1992

Given a parametrization of a rational surface, the absence of base points is shown to be a necessary and sufficient condition for the auxiliary resultant to be a power of the implicit polynomial. The method of resultants also reveals other important properties of rational surface representations, including the coefficients of the implicit equation, the… (More)