Dvipdfm 0.13.2d For Mac
Dvipdfm is a free and open source CLI utility that is able to translate DVI files to PDF files. Here are some key features of 'dvipdfm': TeX special`s that approximate the functionality of the PostScript pdfmarks used by Adobe Acrobat Distiller. Links, outlines, articles, and named destinations are supported, for example. Support for standard DVI specials such as the HyperTeX specials and the TPIC specials. Support for thumbnails (with help from GhostScript).
Dropped ppc-macos keyword, see you in prefix. 43, - 19 Mar 2007; Bryan. App-text/dvipdfm/files/dvipdfm-0.13.2d-libpng14.patch View File.
Dvipdfm 0.13.2d For Mac Os
Ability to include PDF, PNG, and JPEG files as embedded images. For PDF files, only the first page is included.
Resources will be embedded from the original file as necessary. File inclusion does not work for PDF files that store the page contents in several segments in an array. Virtual font support Support for both Type1 and PK fonts. Support for arbitrary linear graphics transformations.
Any material on the page can be scaled and rotated. A color stack accessible via special`s. Partial font embedding and stream compression for reduced output file size Balanced page and destination trees for improved reader access on very large document files.
Limitations: Contents streams consisting of multiple parts cannot be embedded. All instances of the same Type1 font must have the same encoding. What`s New in This Release: read full changelog Bug fix for problems with the date in the PDF file. The date code was simply wrong and caused a seg fault for time zones with half-hour offsets. It also includes a patch to the man page suggested by Eric Raymond.
Q = p1 + (p2 - p1) / 2.0; Note that these constructions do not involve any performance overhead for the conversion with the currently available representation classes. Kernel Objects Besides points (, ), vectors (, ), and directions (, ), CGAL provides lines, rays, segments, planes, triangles, tetrahedra, iso-rectangles, iso-cuboids, circles and spheres. Lines (, ) in CGAL are oriented. In two-dimensional space, they induce a partition of the plane into a positive side and a negative side. Any two points on a line induce an orientation of this line. A ray (, ) is semi-infinite interval on a line, and this line is oriented from the finite endpoint of this interval towards any other point in this interval. A segment (, ) is a bounded interval on a directed line, and the endpoints are ordered so that they induce the same direction as that of the line.
Planes are affine subspaces of dimension two in ( E^3 ), passing through three points, or a point and a line, ray, or segment. CGAL provides a correspondence between any plane in the ambient space ( E^3 ) and the embedding of ( E^2 ) in that space. Just like lines, planes are oriented and partition space into a positive side and a negative side. In CGAL, there are no special classes for half-spaces.
Dvipdfm 0.13.2d For Mac
Half-spaces in 2D and 3D are supposed to be represented by oriented lines and planes, respectively. Concerning polygons and polyhedra, the kernel provides triangles, iso-oriented rectangles, iso-oriented cuboids and tetrahedra. More complex polygons Any sequence of points can be seen as a (not necessary simple) polygon or polyline. This view is used frequently in the basic library as well.
And polyhedra or polyhedral surfaces can be obtained from the basic library (, ), so they are not part of the kernel. As with any Jordan curves, triangles, iso-oriented rectangles and circles separate the plane into two regions, one bounded and one unbounded.
Orientation and Relative Position Geometric objects in CGAL have member functions that test the position of a point relative to the object. Full dimensional objects and their boundaries are represented by the same type, e.g. Half-spaces and hyperplanes are not distinguished, neither are balls and spheres and discs and circles. Such objects split the ambient space into two full-dimensional parts, a bounded part and an unbounded part (e.g.
Circles), or two unbounded parts (e.g. By default these objects are oriented, i.e., one of the resulting parts is called the positive side, the other one is called the negative side. Both of these may be unbounded. These objects have a member function orientedside that determines whether a test point is on the positive side, the negative side, or on the oriented boundary.
These function returns a value of type Orientedside. Those objects that split the space in a bounded and an unbounded part, have a member function boundedside with return type Boundedside. If an object is lower dimensional, e.g. A triangle in three-dimensional space or a segment in two-dimensional space, there is only a test whether a point belongs to the object or not. This member function, which takes a point as an argument and returns a Boolean value, is called hason. Predicates and Constructions Predicates Predicates are at the heart of a geometry kernel. They are basic units for the composition of geometric algorithms and encapsulate decisions.
Hence their correctness is crucial for the control flow and hence for the correctness of an implementation of a geometric algorithm. CGAL uses the term predicate in a generalized sense. Not only components returning a Boolean value are called predicates but also components returning an enumeration type like a Comparisonresult or an Orientation. We say components, because predicates are implemented both as functions and function objects (provided by a kernel class). CGAL provides predicates for the orientation of point sets (, ), for comparing points according to some given order, especially for comparing Cartesian coordinates (e.g. ), in-circle and in-sphere tests, and predicates to compare distances.
Constructions Functions and function objects that generate objects that are neither of type bool nor enum types are called constructions. Constructions involve computation of new numerical values and may be imprecise due to rounding errors unless a kernel with an exact number type is used. Affine transformations ( Kernel::Afftransformation2, Kernel::Afftransformation3) allow to generate new object instances under arbitrary affine transformations. These transformations include translations, rotations (in 2D only) and scaling. Most of the geometric objects in a kernel have a member function transform(Afftransformation t) which applies the transformation to the object instance.
CGAL also provides a set of functions that detect or compute the intersection between objects of the 2D kernel, and many objects in the 3D kernel, and functions to calculate their squared distance. Moreover, some member functions of kernel objects are constructions. So there are routines that compute the square of the Euclidean distance, but no routines that compute the distance itself.
First of all, the two values can be derived from each other quite easily (by taking the square root or taking the square). So, supplying only the one and not the other is only a minor inconvenience for the user. Second, often either value can be used. This is for example the case when (squared) distances are compared.
Third, the library wants to stimulate the use of the squared distance instead of the distance. The squared distance can be computed in more cases and the computation is cheaper. We do this by not providing the perhaps more natural routine, The problem of a distance routine is that it needs the sqrt operation. This has two drawbacks:. The sqrt operation can be costly. Even if it is not very costly for a specific number type and platform, avoiding it is always cheaper.
There are number types on which no sqrt operation is defined, especially integer types and rationals. Intersections and Variant Return Types Some functions, for example, can return different types of objects.
To achieve this in a type-safe way CGAL uses return values of type boost::optional were T. Is a list of all possible resulting geometric objects. The exact result type of an intersection can be determined through the metafunction or, where Type1 and Type2 are the types of the objects used in the intersection computation. Example In the following example, resultof is used to query the type of the return value for the intersection computation.
Constructive Predicates For testing where a point p lies with respect to a plane defined by three points q, r and s, one may be tempted to construct the plane and use the method orientedside(p). This may pay off if many tests with respect to the plane are made. Nevertheless, unless the number type is exact, the constructed plane is only approximated, and round-off errors may lead orientedside(p) to return an orientation which is different from the real orientation of p, q, r, and s. In CGAL, we provide predicates in which such geometric decisions are made directly with a reference to the input points p, q, r, s, without an intermediary object like a plane. For the above test, the recommended way to get the result is to use orientation(p,q,r,s). For exact number types, the situation is different. If several tests are to be made with the same plane, it pays off to construct the plane and to use orientedside(p).
Extensible Kernel This manual section describe how users can plug user defined geometric classes in existing CGAL kernels. Dell xps usb drivers. This is best illustrated by an example.
Introduction CGAL defines the concept of a geometry kernel. Such a kernel provides types, construction objects and generalized predicates. Most implementations of Computational Geometry algorithms and data structures in the basic library of CGAL were done in a way that classes or functions can be parametrized with a geometric traits class. In most cases this geometric traits class must be a model of the CGAL geometry kernel concept (but there are some exceptions). An Extensive Example Assume we have the following point class, where the coordinates are stored in an array of doubles, where we have another data member color, which shows up in the constructor.