Titlebook: Computational Geometry on Surfaces; Performing Computati Clara I. Grima,Alberto Márquez Book 2001 Springer Science+Business Media Dordrecht

fodlder

Radii,theory and in many other applications. In this chapter we study such parameters in the cases of our surfaces. We will see that the usual planar techniques for computing those invariants are not valid in this case and that new methods must be considered.

Atmosphere

諷刺滑稽戲劇

Triangulations,n or of a set of sites. A triangulation is a partition of the domain defined by the input into triangles which meet only at shared sides. Since this kind of meshes are needed in all domains where the ambient space must be discretized, this structure must be studied on surfaces in addition to the pla

alabaster

合乎習(xí)俗

Savvas G. Loizou,Kostas J. Kyriakopouloss not clear what ‘very close to each other’ means. In this chapter we will try to clarify this concept, introducing what we call Euclidean position, in such a way that if a set is in Euclidean position then we can work in that set as if it were in the plane.

COMMA

ferment

Euclidean Position,s not clear what ‘very close to each other’ means. In this chapter we will try to clarify this concept, introducing what we call Euclidean position, in such a way that if a set is in Euclidean position then we can work in that set as if it were in the plane.

chuckle

賄賂

Book 2001 studies geometric problems from a computational point of view, and it has attracted enormous research interest. But that interest is mostly concerned with Euclidean Geometry (mainly the plane or Eu- clidean 3-dimensional space). Of course, there are some important rea- sons for this occurrence sinc

極端的正確性

https://doi.org/10.1007/978-94-011-1697-8og .) time in the worst case, but which are linear in almost all cases. This can sound as a good new but, unfortunately, when we can compute the convex hull in linear time we will have a hull which is too big and not very useful from a practical point of view.