_id,doi,title
2419,10.1007/s00454-001-0028-9,A continuous analogue of the Upper Bound Theorem
4007,10.1007/s00454-001-0007-1,Dynamic skin triangulation
4004,10.1007/s004540010063,Edgewise subdivision of a simplex
4014,10.1007/PL00009412,Deformable smooth surface design
4022,10.1007/PL00009291,Cutting dense point sets in half
4023,10.1007/PL00009295,Inclusion-exclusion complexes for pseudodisk collections
4028,10.1007/BF02574053,The union of balls and its dual shape
4035,10.1007/BF02574025,Improved bounds on weak ε-nets for convex sets
4032,10.1007/BF02574381,Counting triangle crossings and halving planes
4040,10.1007/BF02573974,An upper bound for conforming Delaunay triangulations
4044,10.1007/BF02573962,Edge insertion for optimal triangulations
4045,10.1007/BF02573973,"Diameter, width, closest line pair, and parametric searching"
4061,10.1007/BF02574698,Euclidean minimum spanning trees and bichromatic closest pairs
4062,10.1007/BF02574700,Points and triangles in the plane and halving planes in space
4066,10.1007/BF02187785,The complexity of many cells in arrangements of planes and related problems
4068,10.1007/BF02187778,"The maximum number of ways to stabn convex nonintersecting sets in the plane is 2n−2"
4072,10.1007/BF02187784,The complexity and construction of many faces in arrangements of lines and of segments
4074,10.1007/BF02187783,Combinatorial complexity bounds for arrangements of curves and spheres
4081,10.1007/BF02187733,The upper envelope of piecewise linear functions: Algorithms and applications
4086,10.1007/BF02187734,The upper envelope of piecewise linear functions: Tight bounds on the number of faces