### Table 2 Comparison of the electrostatic solvation energy computed by the piecewise linear surface and the ASMS. With fewer number of triangles used, the ASMS gives a result better than the linear surface which needs more number of triangles. The running time contains the time needed for computing the integration nodes over the surfaces, computing the Born radii, and evaluating Gpol.

"... In PAGE 10: ... Figure 4 (d), Figure 5 (b) and Figure 5 (d) show the piecewise algebraic surface generated from the decimated triangulation. Table2 compares the computed polariza- tion energy with different number of triangles for the proteins. As we see, while a coarser triangulation is used (roughly 1/3 of the original triangulation number), we still get similar results as the initial fine triangulation.... ..."

### Table 2. Initial rough inclusion for (H)

### Table 4: Dwarfed cubes: intermediate size and triangulation complexity for cdd+ random insertion, lrs, porta and qhull

1997

"... In PAGE 28: ...0.1 1 10 100 1000 10000 0 5 10 15 20 cpu time (s) d cddr+ lexmin, lexmax, minindex cddr+ maxcutoff cddr+ maxindex, random cddr+ mincutoff lrs porta memory limit Figure 4: CPU time for dwarfed cubes, rational arithmetic faster than the (untriangulated) intermediate complexity (see Table4 ). The initial con guration of halfspaces chosen by cdd+ (by lexicographic order) is exactly that speci ed by Theorem 13, so the poor performance of mincuto on these polytopes is not a surprise.... ..."

Cited by 57

### Table 4: Dwarfed cubes: intermediate size and triangulation complexity for cdd+ random insertion, lrs, porta and qhull

1997

"... In PAGE 28: ...0.1 1 10 100 1000 10000 0 5 10 15 20 cpu time (s) d cddr+ lexmin, lexmax, minindex cddr+ maxcutoff cddr+ maxindex, random cddr+ mincutoff lrs porta memory limit Figure 4: CPU time for dwarfed cubes, rational arithmetic faster than the (untriangulated) intermediate complexity (see Table4 ). The initial con guration of halfspaces chosen by cdd+ (by lexicographic order) is exactly that speci ed by Theorem 13, so the poor performance of mincuto on these polytopes is not a surprise.... ..."

Cited by 57

### Table 4: Dwarfed cubes: intermediate size and triangulation complexity for cdd+ random insertion, lrs, porta and qhull

1997

"... In PAGE 28: ...0.1 1 10 100 1000 10000 0 5 10 15 20 cpu time (s) d cddr+ lexmin, lexmax, minindex cddr+ maxcutoff cddr+ maxindex, random cddr+ mincutoff lrs porta memory limit Figure 4: CPU time for dwarfed cubes, rational arithmetic faster than the (untriangulated) intermediate complexity (see Table4 ). The initial con guration of halfspaces chosen by cdd+ (by lexicographic order) is exactly that speci ed by Theorem 13, so the poor performance of mincuto on these polytopes is not a surprise.... ..."

Cited by 57

### Table 1: Irregular triangulation

### Table 3 Triangulation with lasers.

2004

"... In PAGE 8: ... Table3 . (cont.... In PAGE 9: ... Im- also relatively equivalent between two- Accuracy and stability of a well- engineered mechanical head that uses composite and good quality lenses rather than some inexpensive mally unstable plastic material of a poor difficult to assess. Comparing systems based Table3 Continued. Company Type Description Range Accuracy Neptec (www.... ..."

### Table 4: Distances and Coordinates for Example Triangulation Scenario But even with unambiguous locations for servers and clients, triangulation cannot accurately compute the distance between two measured points. What it can do is place bounds on the minimum and maximum distances between two measured points [12]. These bounds can be used as an initial lter, with clients selecting among the resulting subset by measuring their own distances to each of the remaining replicated servers. We next explore the e ectiveness of this ltering approach.

1995

"... In PAGE 13: ... Unfortunately, the triangulation coordinate space is sensitive to beacon placement. Figure 6 provides an example, with distances and coordinates given in Table4 . The coordinates imply that S1 and S2 are at the same location, but in fact they are 8 hops apart.... ..."

Cited by 143