songsenand
/
cgal
mirror of https://github.com/CGAL/cgal
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Changed file modes to be non-executable.

This commit is contained in:
Ron Wein 2006-04-04 12:11:18 +00:00
parent 93749c2f10
commit 6b0ceac395
8 changed files with 14 additions and 24 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

1
Arrangement_2/demo/Arrangement_2/Conic_reader.h
View File

@ -1,4 +1,3 @@
#ifndef CGAL_CONIC_READER_H
#define CGAL_CONIC_READER_H

1
Arrangement_2/demo/Arrangement_2/overlay_fucntor.h
View File

@ -1,4 +1,3 @@
#ifndef CGAL_OVERLAY_FUNCTOR_H
#define CGAL_OVERLAY_FUNCTOR_H

2
Arrangement_2/include/CGAL/Arr_point_location/Arr_batched_point_location_meta_traits.h
View File

@ -1,4 +1,4 @@
// Copyright (c) 1997 Tel-Aviv University (Israel).
// Copyright (c) 2005 Tel-Aviv University (Israel).
// All rights reserved.
//
// This file is part of CGAL (www.cgal.org); you may redistribute it under

2
Arrangement_2/include/CGAL/Arr_point_location/Arr_batched_point_location_visitor.h
View File

@ -1,4 +1,4 @@
// Copyright (c) 1997 Tel-Aviv University (Israel).
// Copyright (c) 2005 Tel-Aviv University (Israel).
// All rights reserved.
//
// This file is part of CGAL (www.cgal.org); you may redistribute it under

2
Arrangement_2/include/CGAL/Arr_polyline_traits_2.h
View File

@ -1,4 +1,4 @@
// Copyright(c) 2003 Tel-Aviv University(Israel).
// Copyright(c) 2005 Tel-Aviv University(Israel).
// All rights reserved.
//
// This file is part of CGAL(www.cgal.org); you may redistribute it under

2
Arrangement_2/include/CGAL/Sweep_line_2_empty_visitor.h
View File

@ -1,4 +1,4 @@
// Copyright (c) 1997 Tel-Aviv University (Israel).
// Copyright (c) 2005 Tel-Aviv University (Israel).
// All rights reserved.
//
// This file is part of CGAL (www.cgal.org); you may redistribute it under

25
Arrangement_2/long_description.txt
View File

@ -3,13 +3,13 @@ subdivision of the plane into zero-dimensional, one-dimensional and
two-dimensional cells, called vertices, edges and faces, respectively,
induced by the curves in C. Arrangements are ubiquitous in the
computational-geometry literature and have many applications
see, e.g., [Pank,Halp]
in fields like motion planning, computer-aided design, geographical
information systems, etc.
The curves in C can intersect each other (a single curve may also
be self-intersecting or may be comprised of several disconnected
branches) and are not necessarily $x$-monotone. We construct a
collection C'' of weakly x-monotone subcurves (continuous x-monotone
planar curves or vertical segments} that are pairwise disjoint in
collection C'' of x-monotone subcurves that are pairwise disjoint in
their interiors. We do it in two steps as follows. First, we decompose
each curve in C into maximal x-monotone subcurves (and possibly
isolated points), obtaining the collection C'. Note that an x-monotone
@ -25,7 +25,7 @@ edge list} data-structure (DCEL for short), which consists of
containers of vertices, edges, and faces and maintains the incidence
relations among these objects.
This package can be used to construct, maintain, alter, and present
This package can be used to construct, maintain, alter, and display
arrangements in the plane. Once an arrangement is constructed, the
package can be used to obtain results of various queries on the
arrangement, such as point location. The package also includes generic
@ -34,16 +34,9 @@ zone of an arrangement, and line-sweeping the plane, the arrangements
is embedded on. These frameworks are used in turn in the
implementations of other operations on arrangements. Computing the
overlay of two arrangements, for example, is based on the sweep-line
framework. Arrangements and arrangement components can be extended to
store additional data, and it is possible to obtain the originating
curve of an arrangement subcurve.
[Pank] Pankaj K. Agarwal and Micha Sharir, "Arrangements and Their
Applications", J"org-R"udiger Sack and Jorge Urrutia, Handbook of
Computational Geometry, Elsevier Science Publishers
B.V. North-Holland, 2000, 49-119.
[Halp] Dan Halperin, "Arrangements", 24, Jacob E. Goodman and Joseph
O'Rourke, Handbook of Discrete and Computational Geometry, Chapman &
Hall/CRC, 2nd edition, 2004, 529-562.
framework.
Arrangements and arrangement components can also be extended to store
additional data. An important extension stores the construction
history of the arrangement, such that it is possible to obtain the
originating curve of an arrangement subcurve.

3
Arrangement_2/maintainer
View File

@ -1,4 +1,3 @@
Baruch Zukerman <baruchzu@post.tau.ac.il>
Ron Wein<wein@post.tau.ac.il>
Efi Fogel <efif@post.tau.ac.il>
Idit Haran <haranidi@post.tau.ac.il>
Baruch Zukerman <baruchzu@post.tau.ac.il>