Sciweavers

279 search results - page 47 / 56
» Implicit Convex Polygons
Sort
View
SODA
1993
ACM
119views Algorithms» more  SODA 1993»
13 years 9 months ago
Iterated Nearest Neighbors and Finding Minimal Polytopes
We introduce a new method for nding several types of optimal k-point sets, minimizing perimeter, diameter, circumradius, and related measures, by testing sets of the O(k) nearest ...
David Eppstein, Jeff Erickson
ALGORITHMICA
2006
132views more  ALGORITHMICA 2006»
13 years 7 months ago
Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs
Hierarchical graphs and clustered graphs are useful non-classical graph models for structured relational information. Hierarchical graphs are graphs with layering structures; clus...
Peter Eades, Qing-Wen Feng, Xuemin Lin, Hiroshi Na...
JEA
2006
90views more  JEA 2006»
13 years 7 months ago
Heuristics for estimating contact area of supports in layered manufacturing
Layered Manufacturing is a technology that allows physical prototypes of three-dimensional models to be built directly from their digital representation, as a stack of two-dimensi...
Ivaylo Ilinkin, Ravi Janardan, Michiel H. M. Smid,...
PPL
2006
93views more  PPL 2006»
13 years 7 months ago
Inherently Parallel Geometric Computations
A new computational paradigm is described which o ers the possibility of superlinear and sometimes unbounded speedup, when parallel computation is used. The computations involved ...
Selim G. Akl
CAD
2000
Springer
13 years 7 months ago
Time-critical multiresolution rendering of large complex models
Very large and geometrically complex scenes, exceeding millions of polygons and hundreds of objects, arise naturally in many areas of interactive computer graphics. Time-critical ...
Enrico Gobbetti, Eric Bouvier