Now showing items 28-37 of 37

• #### A Paradigm for Robust Geometric Algorithms ﻿

(Cornell University, 1989-10)
No abstract is available.
• #### Polynomial-Time Algorithms for Permutation Groups ﻿

(Cornell University, 1980-10)
A permutation group on n letters may always be represented by a small set of generators, even though its size may be exponential in n. We show that it is practical to use such a representation since many problems such ...
• #### The Potential Method for Blending Surfaces and Corners ﻿

(Cornell University, 1985-09)
We survey the potential method for blending implicit algebraic surfaces, summarizing and extending work previously reported. The method is capable of deriving blends for pairs of algebraic surfaces, and is guaranteed to ...
• #### Quadratic Blending Surfaces ﻿

(Cornell University, 1985-04)
ABSTRACT NOT SUPPLIED
• #### Reducing Multiple Object Motion Planning To Graph Searching ﻿

(Cornell University, 1984-06)
In this paper we study the motion planning problem for multiple objects where an object is a 2-dimensional body whose faces are line segments parallel to the axes of $R^{2}$ and translations are the only motions allowed. ...
• #### Refinement of Hierarchies of Time Bounded Computations ﻿

(Cornell University, 1968-06)
It is shown that for any "slowly growing" time function $T(n)$ and any $\epsilon > 0$ there exists a computation which can be performed by a multitape Turing machine in time $T(n)\log^{\epsilon}T(n)$ and cannot be performed ...
• #### Robust Set Operations on Polyhedral Solids ﻿

(Cornell University, 1987-10)
We describe an algorithm for performing regularized set operations on polyhedral solids. Robustness of this algorithm is achieved by adding symbolic reasoning as a supplemental step that compensates for possible numerical ...
• #### Routing in Networks ﻿

(Cornell University, 1981-11)
NO ABSTRACT SUPPLIED
• #### A Subexponential Algorithm for Trivalent Graph Isomorphism ﻿

(Cornell University, 1980-06)
NO ABSTRACT SUPPLIED
• #### Triangular Factorization and Inversion by Fast Matrix Multiplication ﻿

(Cornell University, 1972-12)
The fast matrix multiplication algorithm by Strassen is used to obtain the triangular factorization of a permutation of any non-singular matrix of order n in "greater than" C sub{1}n sup{log sub{2}7} operations, and hence ...