Computing the intersection-depth of polyhedra David DobkinJohn HershbergerSubhash Suri OriginalPaper Pages: 518 - 533
Constructing strongly convex approximate hulls with inaccurate primitives Leonidas GuibasDavid SalesinJorge Stolfi OriginalPaper Pages: 534 - 560
Weaving patterns of lines and line segments in space Jànos PachRichard PollackEmo Welzl OriginalPaper Pages: 561 - 571
Algorithms for projecting points to give the most uniform distribution with applications to hashing Tetsuo AsanoTakeshi Tokuyama OriginalPaper Pages: 572 - 590
Finding extrema with unary predicates Feng GaoLeonidas J. GuibasJames Sake OriginalPaper Pages: 591 - 600
Fast algorithms for the dominating set problem on permutation graphs Kuo-Hui TsaiWen-Lian Hsu OriginalPaper Pages: 601 - 614
Finding least-weight subsequences with fewer processors Tak Wah LamKwong-fai Chan OriginalPaper Pages: 615 - 628
Sublinear merging and natural mergesort Svante CarlssonChristos LevcopoulosOla Petersson OriginalPaper Pages: 629 - 648
Splitting a configuration in a simplex Kazumiti NumataTakeshi Tokuyama OriginalPaper Pages: 649 - 668