Fix typos in changes.html, after Monique's remarks

This commit is contained in:
Laurent Rineau 2013-08-16 12:53:12 +02:00
parent 4e1b46920e
commit 20c4b58b65
2 changed files with 16 additions and 9 deletions

View File

@ -13,11 +13,11 @@ Release date: September 2013
neighbor queries and primitives to build the dual Voronoi diagrams. neighbor queries and primitives to build the dual Voronoi diagrams.
* API changes * API Changes
** 2D and 3D Geometry Kernel ** 2D and 3D Geometry Kernel
- The intersection functions and functors used to returned a CGAL::Object in - The intersection functions and functors used to return a CGAL::Object in
order to deal with the different possible return types. However, depending order to deal with the different possible return types. However, depending
on the arguments it is possible to reduce the possible return types to a on the arguments it is possible to reduce the possible return types to a
small set. For this reason and to take advantage of the type safety, we small set. For this reason and to take advantage of the type safety, we
@ -33,10 +33,17 @@ Release date: September 2013
** 2D Arrangements ** 2D Arrangements
- The point location functionalities now uses a boost::variant instead of a - The point location functionalities now uses a boost::variant instead of a
CGAL::Object. For convenience, The previous behavior can be restored by CGAL::Object. For convenience, the previous behavior can be restored by
defining the macro CGAL_ARR_POINT_LOCATION_VERSION to 1. defining the macro CGAL_ARR_POINT_LOCATION_VERSION to 1.
** 3D Fast Intersection and Distance Computation
- Following the intersection API change, Object_and_primitive_id has been
replaced by a template class Intersection_and_primitive_id<Query> to
determine the type depending on the query object type.
** CGAL and Boost Property Maps ** CGAL and Boost Property Maps
- The key_type of the property maps provided by CGAL used to be an iterator. - The key_type of the property maps provided by CGAL used to be an iterator.
@ -69,7 +76,7 @@ Release date: September 2013
* Combinatorial Maps * Combinatorial Maps
- Two bug fixes: do not use the 2 least significant bits for cell attribute - Two bug fixes: do not use the 2 least significant bits for cell attribute
without dart support; add share a mark in CMap_cell_iterator. without dart support; share the mark when copying a CMap_cell_iterator.
- Add a constructor taking a given combinatorial map as argument, possibly - Add a constructor taking a given combinatorial map as argument, possibly
with different dimension and/or different attributes. This allows to with different dimension and/or different attributes. This allows to
@ -123,7 +130,7 @@ Release date: September 2013
input when possible to these functions. input when possible to these functions.
* 2D Apollonius graphs * 2D Apollonius Graphs
- Modified insertion algorithm so that the code can handle pseudo-circles as - Modified insertion algorithm so that the code can handle pseudo-circles as
well. well.
@ -160,7 +167,7 @@ Release date: September 2013
replaced by a template class Intersection_and_primitive_id<Query> to replaced by a template class Intersection_and_primitive_id<Query> to
determine the type depending on the query object type. determine the type depending on the query object type.
- Introduce the class AABB_halfedge_graph_segment_primitive which replaces - Introduce the class AABB_halfedge_graph_segment_primitive, that replaces
the class AABB_polyhedron_segment_primitive (which is now deprecated). The the class AABB_polyhedron_segment_primitive (which is now deprecated). The
new class is more general and can be used with any model of HalfedgeGraph. new class is more general and can be used with any model of HalfedgeGraph.

View File

@ -124,7 +124,7 @@ and <code>src/</code> directories).
<h3>API Changes</h3> <h3>API Changes</h3>
<h4>2D and 3D Geometry Kernel </h4> <h4>2D and 3D Geometry Kernel </h4>
<ul> <ul>
<li> The intersection functions and functors used to returned <li> The intersection functions and functors used to return
a <code>CGAL::Object</code> in order to deal with the different a <code>CGAL::Object</code> in order to deal with the different
possible return types. However, depending on the arguments it is possible return types. However, depending on the arguments it is
possible to reduce the possible return types to a small set. For possible to reduce the possible return types to a small set. For
@ -197,7 +197,7 @@ and <code>src/</code> directories).
<h3>Combinatorial Maps</h3> <h3>Combinatorial Maps</h3>
<ul> <ul>
<li>Two bug fixes: do not use the 2 least significant bits for cell <li>Two bug fixes: do not use the 2 least significant bits for cell
attribute without dart support; share the mark when copying a attribute without dart support; share the mark when copying a
CMap_cell_iterator.</li> CMap_cell_iterator.</li>
<li>Add a constructor taking a given combinatorial map as argument, <li>Add a constructor taking a given combinatorial map as argument,
possibly with different dimension and/or different attributes. This possibly with different dimension and/or different attributes. This
@ -293,7 +293,7 @@ and <code>src/</code> directories).
the type depending on the query object type. the type depending on the query object type.
</li> </li>
<li>Introduce the <li>Introduce the
class <code>AABB_halfedge_graph_segment_primitive</code> which class <code>AABB_halfedge_graph_segment_primitive</code>, that
replaces the class <code>AABB_polyhedron_segment_primitive</code> replaces the class <code>AABB_polyhedron_segment_primitive</code>
(which is now deprecated). The new class is more general and can be (which is now deprecated). The new class is more general and can be
used with any model of <code>HalfedgeGraph</code>.</li> used with any model of <code>HalfedgeGraph</code>.</li>