The following pages link to Marshall W. Bern (Q1105494):
Displaying 49 items.
- (Q627523) (redirect page) (← links)
- Origami embedding of piecewise-linear two-manifolds (Q627524) (← links)
- Hidden surface removal for rectangles (Q918209) (← links)
- SecLEACH-on the security of clustered sensor networks (Q971108) (← links)
- Bounds on the convex label number of trees (Q1103629) (← links)
- Two probabilistic results on rectilinear Steiner trees (Q1105495) (← links)
- The Steiner problem with edge lengths 1 and 2 (Q1123630) (← links)
- Polynomially solvable special cases of the Steiner problem in planar networks (Q1179749) (← links)
- Drawing the planar dual (Q1198002) (← links)
- Fast geometric approximation techniques and geometric embedding problems (Q1202926) (← links)
- Approximate closest-point queries in high dimensions (Q1209329) (← links)
- (Q1275672) (redirect page) (← links)
- Pushing disks together -- The continuous-motion case (Q1275674) (← links)
- On-line algorithms for locating checkpoints (Q1312186) (← links)
- Visibility with a moving point of view (Q1322569) (← links)
- Provably good mesh generation (Q1329150) (← links)
- On the number of minimal 1-Steiner trees (Q1330879) (← links)
- Multivariate regression depth (Q1611068) (← links)
- Surface reconstruction by Voronoi filtering (Q1809505) (← links)
- Regression depth and center points. (Q1972305) (← links)
- (Q2768367) (← links)
- (Q3138884) (← links)
- THE EXPECTED EXTREMES IN A DELAUNAY TRIANGULATION (Q3212323) (← links)
- (Q3359791) (← links)
- POLYNOMIAL-SIZE NONOBTUSE TRIANGULATION OF POLYGONS (Q4030350) (← links)
- (Q4036603) (← links)
- Faster exact algorithms for steiner trees in planar networks (Q4206584) (← links)
- (Q4228461) (← links)
- Optimal Point Placement for Mesh Smoothing (Q4238531) (← links)
- (Q4327374) (← links)
- (Q4401012) (← links)
- (Q4416718) (← links)
- (Q4471285) (← links)
- QUADRILATERAL MESHING BY CIRCLE PACKING (Q4682180) (← links)
- PARALLEL CONSTRUCTION OF QUADTREES AND QUALITY TRIANGULATIONS (Q4682197) (← links)
- TRIANGULATING POLYGONS WITHOUT LARGE ANGLES (Q4698357) (← links)
- Linear-time computation of optimal subgraphs of decomposable graphs (Q4728259) (← links)
- (Q4778539) (← links)
- (Q4778547) (← links)
- (Q4875182) (← links)
- (Q4886048) (← links)
- (Q4945506) (← links)
- Parallel construction of quadtrees and quality triangulations (Q5060112) (← links)
- On-line algorithms for cache sharing (Q5248511) (← links)
- Multivariate regression depth (Q5361543) (← links)
- Optimized color gamuts for tiled displays (Q5361633) (← links)
- Origami Embedding of Piecewise-Linear Two-Manifolds (Q5458564) (← links)
- (Q5501831) (← links)
- Research in Computational Molecular Biology (Q5706854) (← links)
