/usr/include/CGAL/IO/Dxf_reader.h is in libcgal-dev 4.7-4.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 | // Copyright (c) 2003-2008 INRIA Sophia-Antipolis (France).
// All rights reserved.
//
// This file is part of CGAL (www.cgal.org).
// You can redistribute it and/or modify it under the terms of the GNU
// General Public License as published by the Free Software Foundation,
// either version 3 of the License, or (at your option) any later version.
//
// Licensees holding a valid commercial license may use this file in
// accordance with the commercial license agreement provided with the software.
//
// This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
// WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
//
// $URL$
// $Id$
//
// Author(s) : Monique Teillaud, Sylvain Pion, Andreas Fabri
// Partially supported by the IST Programme of the EU as a Shared-cost
// RTD (FET Open) Project under Contract No IST-2000-26473
// (ECG - Effective Computational Geometry for Curves and Surfaces)
// and a STREP (FET Open) Project under Contract No IST-006413
// (ACS -- Algorithms for Complex Shapes)
// Descriptions of the file format can be found at
// http://www.autodesk.com/techpubs/autocad/acad2000/dxf/
// http://www.tnt.uni-hannover.de/soft/compgraph/fileformats/docs/DXF.ascii
#ifndef CGAL_IO_DXF_READER_H
#define CGAL_IO_DXF_READER_H
#include <CGAL/basic.h>
#include <iostream>
#include <string>
#include <list>
namespace CGAL {
template <typename K>
class Dxf_reader {
public:
typedef typename K::FT FT;
typedef typename K::Point_2 Point_2;
typedef typename K::Circle_2 Circle_2;
typedef std::list<std::pair<Point_2, double> > Polygon;
typedef std::list<Polygon> Polygons;
typedef std::list<Circle_2> Circles;
typedef std::list<std::pair<Point_2, FT> > Centers_and_radii;
private:
void
header(std::istream& is)
{
int n;
double xmin, ymin;
double xmax, ymax;
is >> n;
CGAL_assertion(n == 9);
char c;
is >> c;
CGAL_assertion(c == '$');
std::string str;
is >> str;
if(str == std::string("EXTMIN")){
is >> n;
CGAL_assertion(n == 10);
is >> xmin;
is >> n;
CGAL_assertion(n == 20);
is >> ymin;
}
is >> n;
CGAL_assertion(n == 9);
is >> c;
CGAL_assertion(c == '$');
is >> str;
if(str == "EXTMAX"){
is >> n;
CGAL_assertion(n == 10);
is >> xmax;
is >> n;
CGAL_assertion(n == 20);
is >> ymax;
}
}
void
skip_header(std::istream& is)
{
int n;
is >> n;
CGAL_assertion(n == 0);
std::string str;
is >> str;
CGAL_assertion(str == "SECTION");
is >> n;
CGAL_assertion(n == 2);
is >> str;
if(str == "HEADER"){
header(is);
}
is >> n;
CGAL_assertion(n == 0);
is >> str;
CGAL_assertion(str == "ENDSEC");
}
void
read_circle(std::istream& is, Circle_2& circ)
{
int n;
double cx, cy, r;
std::string str;
is >> n;
CGAL_assertion(n == 8);
is >> n;
CGAL_assertion(n == 0);
is >> n;
CGAL_assertion(n == 10);
is >> iformat(cx);
is >> n;
CGAL_assertion(n == 20);
is >> iformat(cy);
is >> n;
CGAL_assertion(n == 40);
is >> iformat(r);
FT rft(r);
circ = typename K::Construct_circle_2()(Point_2(cx,cy), rft);
}
void
read_center_and_radius(std::istream& is, Point_2& center, FT& rft)
{
int n;
double cx, cy, r;
std::string str;
is >> n;
CGAL_assertion(n == 8);
is >> n;
CGAL_assertion(n == 0);
is >> n;
CGAL_assertion(n == 10);
is >> iformat(cx);
is >> n;
CGAL_assertion(n == 20);
is >> iformat(cy);
is >> n;
CGAL_assertion(n == 40);
is >> iformat(r);
center = typename K::Construct_point_2()(cx,cy);
rft = FT(r);
}
void
read_polygon(std::istream& is, Polygon& poly)
{
int n = 0;
do {
is >> n;
if(n != 0){
int m;
is >> m;
}
} while(n != 0);
std::string str;
do {
double len;
double x, y;
is >> str;
if(str == "VERTEX"){
is >> n;
CGAL_assertion(n == 8);
is >> n;
CGAL_assertion(n == 0);
is >> n;
CGAL_assertion(n == 10);
is >> iformat(x);
is >> n;
CGAL_assertion(n == 20);
is >> iformat(y);
is >> n;
len = 0;
if(n == 42){
is >> len;
} else {
CGAL_assertion(n == 0);
}
poly.push_back(std::make_pair(typename K::Construct_point_2()(x,y), len));
}
} while (str != "SEQEND");
is >> n;
CGAL_assertion(n == 8);
is >> n;
CGAL_assertion(n == 0);
}
void
read_entities(std::istream& is, Polygons& polys, Circles& circles)
{
int n;
//double x, y;
std::string str;
is >> n;
CGAL_assertion(n == 0);
is >> str;
CGAL_assertion(str == "SECTION");
is >> n;
is >> str;
CGAL_assertion(str == "ENTITIES");
do {
is >> n;
CGAL_assertion(n == 0);
is >> str;
if(str == "POLYLINE"){
Polygon p;
polys.push_back(p);
read_polygon(is, polys.back());
} else if(str == "CIRCLE"){
Circle_2 c;
read_circle(is,c);
circles.push_back(c);
} else if(str == "ENDSEC"){
} else {
CGAL_error_msg( "unknown entity" );
}
} while(str != "ENDSEC");
is >> n;
CGAL_assertion(n == 0);
is >> str;
CGAL_assertion(str == "EOF");
}
void
read_entities(std::istream& is, Polygons& polys, Centers_and_radii& car)
{
int n;
std::string str;
is >> n;
CGAL_assertion(n == 0);
is >> str;
CGAL_assertion(str == "SECTION");
is >> n;
is >> str;
CGAL_assertion(str == "ENTITIES");
do {
is >> n;
CGAL_assertion(n == 0);
is >> str;
if(str == "POLYLINE"){
Polygon p;
polys.push_back(p);
read_polygon(is, polys.back());
} else if(str == "CIRCLE"){
Point_2 center;
FT radius;
read_center_and_radius(is,center, radius);
car.push_back(std::make_pair(center, radius));
} else if(str == "ENDSEC"){
} else {
CGAL_error_msg( "unknown entity" );
}
} while(str != "ENDSEC");
is >> n;
CGAL_assertion(n == 0);
is >> str;
CGAL_assertion(str == "EOF");
}
public:
void operator()(std::istream& is, Polygons& polygons, Circles& circles)
{
skip_header(is);
read_entities(is, polygons, circles);
}
void operator()(std::istream& is, Polygons& polygons, Centers_and_radii& car)
{
skip_header(is);
read_entities(is, polygons, car);
}
};
} //namespace CGAL
#endif // CGAL_IO_DXF_READER_H
|