JavaScript is disabled for your browser. Some features of this site may not work without it.
Browsing by Author "Chew, L. Paul"
Now showing items 15 of 5

Generating Spectral Method Solvers for Partial Differential Equations
Berkooz, Gal; Chew, L. Paul; Cremer, James F.; Palmer, Richard S.; Zippel, Richard (Cornell University, 199210)A major cost in scientific computing is the creation of software that performs the numerical computations. This paper presents preliminary results on research to build a framework for automating the construction of ... 
GuaranteedQuality Triangular Meshes
Chew, L. Paul (Cornell University, 198904)There are a number of applications for which it is desirable to divide a given region in the plane into nicely shaped triangles. One important such application is the finite element method, a method widely used to obtain ... 
NearQuadratic Bounds for the $L_{1}$ Voronoi Diagram of Moving Points
Chew, L. Paul (Cornell University, 199305)Given a set of $n$ moving points in the plane, how many topological changes occur in the Voronoi diagram of the points? If each point has constant velocity then there is an upper bound of $O(n^{3})$ [Guibas, Mitchell and ... 
Placing the Largest Similar Copy of a Convex Polygon Among Polygonal Obstacles
Chew, L. Paul; Kedem, Klara (Cornell University, 198901)Given a convex polygon $P$ and an environment consisting of polygonal obstacles, we find the largest similar copy of $P$ that does not intersect any of the obstacles. Allowing translation, rotation, and changeofsize, ... 
Sorting Helps for Voronoi Diagrams
Chew, L. Paul; Fortune, Steven (Cornell University, 199305)It is well known that, using standard models of computation, it requires $\Omega(n$ log $n$) time to build a Voronoi diagram for $n$ data points. This follows from the fact that a Voronoi diagram algorithm can be used ...