Sciweavers

2255 search results - page 364 / 451
» Computing a Center-Transversal Line
Sort
View
SGP
2007
15 years 1 months ago
Triangulations with locally optimal Steiner points
We present two new Delaunay refinement algorithms, second an extension of the first. For a given input domain (a set of points or a planar straight line graph), and a threshold an...
Hale Erten, Alper Üngör
SIGMOD
2007
ACM
224views Database» more  SIGMOD 2007»
15 years 11 months ago
Design of flash-based DBMS: an in-page logging approach
The popularity of high-density flash memory as data storage media has increased steadily for a wide spectrum of computing devices such as PDA's, MP3 players, mobile phones an...
Sang-Won Lee, Bongki Moon
WSCG
2003
151views more  WSCG 2003»
15 years 12 days ago
Large Model Visualization: Techniques and Applications
The visual representation of complex data has always been a major motivation for computer graphics. However, there have always been computer graphics scenes which were too complex...
Dirk Bartz
78
Voted
TOG
2008
127views more  TOG 2008»
14 years 11 months ago
Freeform surfaces from single curved panels
Motivated by applications in architecture and manufacturing, we discuss the problem of covering a freeform surface by single curved panels. This leads to the new concept of semi-d...
Helmut Pottmann, Alexander Schiftner, Pengbo Bo, H...
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
15 years 4 months ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen