diff --git a/.gitignore b/.gitignore
index 9859608..f97538c 100644
--- a/.gitignore
+++ b/.gitignore
@@ -1,4 +1,2 @@
 /vxl-1.17.0.tar.gz
 /vxl-1.17.0-clean.tar.gz
-/vxl-2.0.2-clean.tar.gz
-/vxl-3.5.0-clean.tar.gz
diff --git a/0001-Added-include-path-for-geotiff.patch b/0001-Added-include-path-for-geotiff.patch
new file mode 100644
index 0000000..20ea0f4
--- /dev/null
+++ b/0001-Added-include-path-for-geotiff.patch
@@ -0,0 +1,26 @@
+From ac852c19102585381f1762251716e62ebc86c0f7 Mon Sep 17 00:00:00 2001
+From: Mario Ceresa <mrceresa@gmail.com>
+Date: Wed, 10 Oct 2012 17:09:48 +0200
+Subject: [PATCH 01/23] Added include path for geotiff
+
+Signed-off-by: Mario Ceresa <mrceresa@gmail.com>
+---
+ config/cmake/Modules/NewCMake/FindGEOTIFF.cmake | 2 ++
+ 1 file changed, 2 insertions(+)
+
+diff --git a/config/cmake/Modules/NewCMake/FindGEOTIFF.cmake b/config/cmake/Modules/NewCMake/FindGEOTIFF.cmake
+index 9e5013f..624e331 100644
+--- a/config/cmake/Modules/NewCMake/FindGEOTIFF.cmake
++++ b/config/cmake/Modules/NewCMake/FindGEOTIFF.cmake
+@@ -8,6 +8,8 @@
+ #  GEOTIFF_LIBRARY, where to find the GEOTIFF library.
+ 
+ FIND_PATH(GEOTIFF_INCLUDE_DIR geotiff.h
++  /usr/local/include/libgeotiff
++  /usr/include/libgeotiff
+   /usr/local/include
+   /usr/include
+ )
+-- 
+1.7.11.7
+
diff --git a/0001-v3.5.0-unbundle-rply.patch b/0001-v3.5.0-unbundle-rply.patch
deleted file mode 100644
index de56a11..0000000
--- a/0001-v3.5.0-unbundle-rply.patch
+++ /dev/null
@@ -1,3612 +0,0 @@
-From b7944a8898b3a1aef606cf6f4047dcf11aca11a6 Mon Sep 17 00:00:00 2001
-From: "Ankur Sinha (Ankur Sinha Gmail)" <sanjay.ankur@gmail.com>
-Date: Thu, 15 Nov 2018 14:15:02 +0000
-Subject: [PATCH 01/18] v3.5.0: unbundle rply
-
----
- contrib/brl/bbas/bmsh3d/algo/CMakeLists.txt   |    5 +-
- contrib/brl/bseg/boxm2/cpp/CMakeLists.txt     |    6 +-
- .../brl/bseg/boxm2/cpp/algo/CMakeLists.txt    |    6 +-
- v3p/CMakeLists.txt                            |    1 -
- v3p/rply/CMakeLists.txt                       |    9 -
- v3p/rply/LICENSE                              |   20 -
- v3p/rply/etc/convert.c                        |  136 --
- v3p/rply/etc/dump.c                           |   44 -
- v3p/rply/etc/input.ply                        |   16 -
- v3p/rply/etc/sconvert.c                       |   66 -
- v3p/rply/manual/manual.html                   |  993 -----------
- v3p/rply/manual/reference.css                 |   54 -
- v3p/rply/manual/rply.png                      |  Bin 6232 -> 0 bytes
- v3p/rply/readme.txt                           |   24 -
- v3p/rply/rply.c                               | 1570 -----------------
- v3p/rply/rply.h                               |  367 ----
- 16 files changed, 11 insertions(+), 3306 deletions(-)
- delete mode 100644 v3p/rply/CMakeLists.txt
- delete mode 100644 v3p/rply/LICENSE
- delete mode 100644 v3p/rply/etc/convert.c
- delete mode 100644 v3p/rply/etc/dump.c
- delete mode 100644 v3p/rply/etc/input.ply
- delete mode 100644 v3p/rply/etc/sconvert.c
- delete mode 100644 v3p/rply/manual/manual.html
- delete mode 100644 v3p/rply/manual/reference.css
- delete mode 100644 v3p/rply/manual/rply.png
- delete mode 100644 v3p/rply/readme.txt
- delete mode 100644 v3p/rply/rply.c
- delete mode 100644 v3p/rply/rply.h
-
-diff --git a/contrib/brl/bbas/bmsh3d/algo/CMakeLists.txt b/contrib/brl/bbas/bmsh3d/algo/CMakeLists.txt
-index 5cf355e3fe..662ec284e9 100644
---- a/contrib/brl/bbas/bmsh3d/algo/CMakeLists.txt
-+++ b/contrib/brl/bbas/bmsh3d/algo/CMakeLists.txt
-@@ -1,8 +1,9 @@
- # This is bbas/bmsh3d/algo/CMakeLists.txt
- # Brown 3D Mesh Algorithm Library
-+FIND_PACKAGE(rply REQUIRED)
- 
- include_directories( ${BRL_INCLUDE_DIR} )
--include_directories( ${VTHREEP_INCLUDE_DIR}/rply )
-+include_directories( ${RPLY_INCLUDE_DIR} )
- 
- set( bmsh3d_algo_sources
-   bmsh3d_fileio.cxx           bmsh3d_fileio.h
-@@ -13,7 +14,7 @@ set( bmsh3d_algo_sources
- )
- 
- vxl_add_library(LIBRARY_NAME bmsh3d_algo LIBRARY_SOURCES  ${bmsh3d_algo_sources})
--target_link_libraries( bmsh3d_algo bmsh3d rply ${VXL_LIB_PREFIX}vgl ${VXL_LIB_PREFIX}vnl ${VXL_LIB_PREFIX}vul)
-+target_link_libraries( bmsh3d_algo bmsh3d ${RPLY_LIBRARY} ${VXL_LIB_PREFIX}vgl ${VXL_LIB_PREFIX}vnl ${VXL_LIB_PREFIX}vul)
- 
- if( BUILD_TESTING )
-   add_subdirectory(tests)
-diff --git a/contrib/brl/bseg/boxm2/cpp/CMakeLists.txt b/contrib/brl/bseg/boxm2/cpp/CMakeLists.txt
-index 92b959f740..fff9ae2d84 100644
---- a/contrib/brl/bseg/boxm2/cpp/CMakeLists.txt
-+++ b/contrib/brl/bseg/boxm2/cpp/CMakeLists.txt
-@@ -1,12 +1,14 @@
-+FIND_PACKAGE(rply REQUIRED)
-+
- include_directories( ${BRL_INCLUDE_DIR}/bseg )
--include_directories( ${VTHREEP_INCLUDE_DIR}/rply )
-+include_directories( ${RPLY_INCLUDE_DIR} )
- set(boxm2_cpp_sources
- 
-    )
- aux_source_directory(Templates boxm2_cpp_sources)
- vxl_add_library(LIBRARY_NAME boxm2_cpp LIBRARY_SOURCES  ${boxm2_cpp_sources})
- 
--target_link_libraries(boxm2_cpp boxm2 boxm2_basic boxm2_io boct brdb ${VXL_LIB_PREFIX}vbl_io expatpp ${VXL_LIB_PREFIX}vpgl ${VXL_LIB_PREFIX}vil_io ${VXL_LIB_PREFIX}vil ${VXL_LIB_PREFIX}vgl ${VXL_LIB_PREFIX}vgl_xio ${VXL_LIB_PREFIX}vbl ${VXL_LIB_PREFIX}vsl ${VXL_LIB_PREFIX}vcl rply)
-+target_link_libraries(boxm2_cpp boxm2 boxm2_basic boxm2_io boct brdb ${VXL_LIB_PREFIX}vbl_io expatpp ${VXL_LIB_PREFIX}vpgl ${VXL_LIB_PREFIX}vil_io ${VXL_LIB_PREFIX}vil ${VXL_LIB_PREFIX}vgl ${VXL_LIB_PREFIX}vgl_xio ${VXL_LIB_PREFIX}vbl ${VXL_LIB_PREFIX}vsl ${VXL_LIB_PREFIX}vcl ${RPLY_LIBRARY} )
- 
- # cpp process APIs.
- add_subdirectory(pro)
-diff --git a/contrib/brl/bseg/boxm2/cpp/algo/CMakeLists.txt b/contrib/brl/bseg/boxm2/cpp/algo/CMakeLists.txt
-index 1407ed9d31..c3ed4ed27d 100644
---- a/contrib/brl/bseg/boxm2/cpp/algo/CMakeLists.txt
-+++ b/contrib/brl/bseg/boxm2/cpp/algo/CMakeLists.txt
-@@ -1,6 +1,8 @@
-+FIND_PACKAGE(rply REQUIRED)
-+
- include_directories( ${BRL_INCLUDE_DIR}/bseg )
- include_directories( ${MUL_INCLUDE_DIR} )
--include_directories( ${VTHREEP_INCLUDE_DIR}/rply)
-+include_directories( ${RPLY_INCLUDE_DIR} )
- 
- set(boxm2_cpp_algo_sources
-     boxm2_cast_ray_function.h
-@@ -57,7 +59,7 @@ set(boxm2_cpp_algo_sources
- aux_source_directory(Templates boxm2_cpp_algo_sources)
- 
- vxl_add_library(LIBRARY_NAME boxm2_cpp_algo LIBRARY_SOURCES  ${boxm2_cpp_algo_sources})
--target_link_libraries(boxm2_cpp_algo boxm2_cpp brad boct brdb expatpp ${VXL_LIB_PREFIX}vpgl bvgl imesh imesh_algo bsta_algo bsta ${VXL_LIB_PREFIX}vil_algo ${VXL_LIB_PREFIX}vil ${VXL_LIB_PREFIX}vgl_xio ${VXL_LIB_PREFIX}vgl ${VXL_LIB_PREFIX}vnl_algo ${VXL_LIB_PREFIX}vnl ${VXL_LIB_PREFIX}vul ${VXL_LIB_PREFIX}vbl_io ${VXL_LIB_PREFIX}vbl ${VXL_LIB_PREFIX}vsl ${VXL_LIB_PREFIX}vcl bvpl rply)
-+target_link_libraries(boxm2_cpp_algo boxm2_cpp brad boct brdb expatpp ${VXL_LIB_PREFIX}vpgl bvgl imesh imesh_algo bsta_algo bsta ${VXL_LIB_PREFIX}vil_algo ${VXL_LIB_PREFIX}vil ${VXL_LIB_PREFIX}vgl_xio ${VXL_LIB_PREFIX}vgl ${VXL_LIB_PREFIX}vnl_algo ${VXL_LIB_PREFIX}vnl ${VXL_LIB_PREFIX}vul ${VXL_LIB_PREFIX}vbl_io ${VXL_LIB_PREFIX}vbl ${VXL_LIB_PREFIX}vsl ${VXL_LIB_PREFIX}vcl bvpl ${RPLY_LIBRARY} )
- 
- if(BUILD_TESTING)
-   add_subdirectory(tests)
-diff --git a/v3p/CMakeLists.txt b/v3p/CMakeLists.txt
-index 251ef9a979..ae9baedaa4 100644
---- a/v3p/CMakeLists.txt
-+++ b/v3p/CMakeLists.txt
-@@ -60,5 +60,4 @@ if(VXL_BUILD_CORE_IMAGING)
-   add_subdirectory(png)
-   add_subdirectory(dcmtk)
-   add_subdirectory(openjpeg2)
--  add_subdirectory(rply)
- endif()
-diff --git a/v3p/rply/CMakeLists.txt b/v3p/rply/CMakeLists.txt
-deleted file mode 100644
-index 9085a628a1..0000000000
---- a/v3p/rply/CMakeLists.txt
-+++ /dev/null
-@@ -1,9 +0,0 @@
--# This is /v3p/rply/CMakeLists.txt
--# library for reading and writing .PLY file
--
--set(rply_sources
--  rply.h
--  rply.c
--  )
--
--vxl_add_library(LIBRARY_NAME rply LIBRARY_SOURCES ${rply_sources})
-diff --git a/v3p/rply/LICENSE b/v3p/rply/LICENSE
-deleted file mode 100644
-index 02e7c5f385..0000000000
---- a/v3p/rply/LICENSE
-+++ /dev/null
-@@ -1,20 +0,0 @@
--RPly 1.01 license
--Copyright © 2003-2005 Diego Nehab.
--
--Permission is hereby granted, free of charge, to any person obtaining a
--copy of this software and associated documentation files (the "Software"),
--to deal in the Software without restriction, including without limitation
--the rights to use, copy, modify, merge, publish, distribute, sublicense,
--and/or sell copies of the Software, and to permit persons to whom the
--Software is furnished to do so, subject to the following conditions:
--
--The above copyright notice and this permission notice shall be included in
--all copies or substantial portions of the Software.
--
--THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
--IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
--FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
--AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
--LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
--FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
--DEALINGS IN THE SOFTWARE.
-diff --git a/v3p/rply/etc/convert.c b/v3p/rply/etc/convert.c
-deleted file mode 100644
-index e90d4cd576..0000000000
---- a/v3p/rply/etc/convert.c
-+++ /dev/null
-@@ -1,136 +0,0 @@
--#include <stdio.h>
--#include <stdlib.h>
--#include <string.h>
--#include <stdarg.h>
--#include "rply.h"
--
--/* internal function prototypes */
--static void error(const char *fmt, ...);
--static void help(void);
--static void parse_arguments(int argc, char **argv,
--        e_ply_storage_mode *storage_mode,
--        const char **iname, const char **oname);
--static void setup_callbacks(p_ply iply, p_ply oply);
--
--/* given a format mode, an input file name and an output file name,
-- * convert input file to output in given format mode */
--int main(int argc, char **argv)
--{
--    const char *value = NULL;
--    e_ply_storage_mode storage_mode = PLY_LITTLE_ENDIAN;
--    const char *iname = NULL, *oname = NULL;
--    p_ply iply = NULL, oply = NULL;
--    /* parse command line arguments */
--    parse_arguments(argc, argv, &storage_mode, &iname, &oname);
--    /* open input file and make sure we parsed its header */
--    iply = ply_open(iname, NULL);
--    if (!iply) error("Unable to open file '%s'", iname);
--    if (!ply_read_header(iply)) error("Failed reading '%s' header", iname);
--    /* create output file */
--    oply = ply_create(oname, storage_mode, NULL);
--    if (!oply) error("Unable to create file '%s'", oname);
--    /* create elements and properties in output file and
--     * setup callbacks for them in input file */
--    setup_callbacks(iply, oply);
--    /* pass comments and obj_infos from input to output */
--    value = NULL;
--    while ((value = ply_get_next_comment(iply, value)))
--        if (!ply_add_comment(oply, value))
--            error("Failed adding comments");
--    value = NULL;
--    while ((value = ply_get_next_obj_info(iply, value)))
--        if (!ply_add_obj_info(oply, value))
--            error("Failed adding comments");
--    /* write output header */
--    if (!ply_write_header(oply)) error("Failed writing '%s' header", oname);
--    /* read input file generating callbacks that pass data to output file */
--    if (!ply_read(iply)) error("Conversion failed");
--    /* close up, we are done */
--    if (!ply_close(iply)) error("Error closing file '%s'", iname);
--    if (!ply_close(oply)) error("Error closing file '%s'", oname);
--    return 0;
--}
--
--/* prints an error message and exits */
--static void error(const char *fmt, ...)
--{
--    va_list ap;
--    va_start(ap, fmt);
--    vfprintf(stderr, fmt, ap);
--    va_end(ap);
--    fprintf(stderr, "\n");
--    exit(1);
--}
--
--/* prints the help message and exits */
--static void help(void)
--{
--    error("Usage:\n"
--            "    convert <option> <input> <output>\n"
--            "Options:\n"
--            "    -a, --ascii: convert to ascii format\n"
--            "    -b, --big-endian: convert to big-endian format\n"
--            "    -l, --little-endian: convert to little-endian format\n");
--}
--
--/* parse command line parameters */
--static void parse_arguments(int argc, char **argv,
--        e_ply_storage_mode *storage_mode,
--        const char **iname, const char **oname)
--{
--    if (argc < 4) help();
--    if (strcmp(argv[1], "--ascii") == 0 ||
--            strcmp(argv[1], "-a") == 0)
--        *storage_mode = PLY_ASCII;
--    else if (strcmp(argv[1], "--little-endian") == 0 ||
--            strcmp(argv[1], "-l") == 0)
--        *storage_mode = PLY_LITTLE_ENDIAN;
--    else if (strcmp(argv[1], "--big-endian") == 0 ||
--            strcmp(argv[1], "-b") == 0)
--        *storage_mode = PLY_BIG_ENDIAN;
--    else help();
--    *iname = argv[2];
--    *oname = argv[3];
--}
--
--/* read callback */
--static int callback(p_ply_argument argument)
--{
--    void *pdata;
--    /* just pass the value from the input file to the output file */
--    ply_get_argument_user_data(argument, &pdata, NULL);
--    ply_write((p_ply) pdata, ply_get_argument_value(argument));
--    return 1;
--}
--
--/* prepares the conversion */
--static void setup_callbacks(p_ply iply, p_ply oply)
--{
--    p_ply_element element = NULL;
--    /* iterate over all elements in input file */
--    while ((element = ply_get_next_element(iply, element))) {
--        p_ply_property property = NULL;
--        long ninstances = 0;
--        const char *element_name;
--        ply_get_element_info(element, &element_name, &ninstances);
--        /* add this element to output file */
--        if (!ply_add_element(oply, element_name, ninstances))
--            error("Unable to add output element '%s'", element_name);
--        /* iterate over all properties of current element */
--        while ((property = ply_get_next_property(element, property))) {
--            const char *property_name;
--            e_ply_type type, length_type, value_type;
--            ply_get_property_info(property, &property_name, &type,
--                    &length_type, &value_type);
--            /* setup input callback for this property */
--            if (!ply_set_read_cb(iply, element_name, property_name, callback,
--                    oply, 0))
--                error("Unable to setup input callback for property '%s'",
--                        property_name);
--            /* add this property to output file */
--            if (!ply_add_property(oply, property_name, type, length_type,
--                    value_type))
--                error("Unable to add output property '%s'", property_name);
--        }
--    }
--}
-diff --git a/v3p/rply/etc/dump.c b/v3p/rply/etc/dump.c
-deleted file mode 100644
-index 7ae2341cf1..0000000000
---- a/v3p/rply/etc/dump.c
-+++ /dev/null
-@@ -1,44 +0,0 @@
--#include <stdio.h>
--#include "rply.h"
--
--static int vertex_cb(p_ply_argument argument) {
--    long eol;
--    ply_get_argument_user_data(argument, NULL, &eol);
--    printf("%g", ply_get_argument_value(argument));
--    if (eol) printf("\n");
--    else printf(" ");
--    return 1;
--}
--
--static int face_cb(p_ply_argument argument) {
--    long length, value_index;
--    ply_get_argument_property(argument, NULL, &length, &value_index);
--    switch (value_index) {
--        case 0:
--        case 1:
--            printf("%g ", ply_get_argument_value(argument));
--            break;
--        case 2:
--            printf("%g\n", ply_get_argument_value(argument));
--            break;
--        default:
--            break;
--    }
--    return 1;
--}
--
--int main(void) {
--    long nvertices, ntriangles;
--    p_ply ply = ply_open("input.ply", NULL);
--    if (!ply) return 1;
--    if (!ply_read_header(ply)) return 1;
--    nvertices = ply_set_read_cb(ply, "vertex", "x", vertex_cb, NULL, 0);
--    ply_set_read_cb(ply, "vertex", "y", vertex_cb, NULL, 0);
--    ply_set_read_cb(ply, "vertex", "z", vertex_cb, NULL, 1);
--    ntriangles = ply_set_read_cb(ply, "face", "vertex_indices", face_cb, NULL, 0);
--    printf("%ld\n%ld\n", nvertices, ntriangles);
--    if (!ply_read(ply)) return 1;
--    ply_close(ply);
--    return 0;
--}
--
-diff --git a/v3p/rply/etc/input.ply b/v3p/rply/etc/input.ply
-deleted file mode 100644
-index 87ba8546d0..0000000000
---- a/v3p/rply/etc/input.ply
-+++ /dev/null
-@@ -1,16 +0,0 @@
--ply
--format ascii 1.0
--comment this is our first comment
--element vertex 3
--property float x
--property float y
--property float z
--element face 1
--property list uchar int vertex_indices
--comment this is our last comment
--end_header
---1 0 0 
--000 1 0 
--1 0000 0
--3 1 00000 2
--3 1 0 2
-diff --git a/v3p/rply/etc/sconvert.c b/v3p/rply/etc/sconvert.c
-deleted file mode 100644
-index 97209e9b49..0000000000
---- a/v3p/rply/etc/sconvert.c
-+++ /dev/null
-@@ -1,66 +0,0 @@
--#include <stdio.h>
--#include "rply.h"
--
--static int callback(p_ply_argument argument)
--{
--    void *pdata;
--    /* just pass the value from the input file to the output file */
--    ply_get_argument_user_data(argument, &pdata, NULL);
--    ply_write((p_ply) pdata, ply_get_argument_value(argument));
--    return 1;
--}
--
--static int setup_callbacks(p_ply iply, p_ply oply)
--{
--    p_ply_element element = NULL;
--    /* iterate over all elements in input file */
--    while ((element = ply_get_next_element(iply, element))) {
--        p_ply_property property = NULL;
--        long nelems = 0;
--        const char *element_name;
--        ply_get_element_info(element, &element_name, &nelems);
--        /* add this element to output file */
--        if (!ply_add_element(oply, element_name, nelems)) return 0;
--        /* iterate over all properties of current element */
--        while ((property = ply_get_next_property(element, property))) {
--            const char *property_name;
--            e_ply_type type, length_type, value_type;
--            ply_get_property_info(property, &property_name, &type,
--                    &length_type, &value_type);
--            /* setup input callback for this property */
--            if (!ply_set_read_cb(iply, element_name, property_name, callback,
--                    oply, 0)) return 0;
--            /* add this property to output file */
--            if (!ply_add_property(oply, property_name, type, length_type,
--                    value_type)) return 0;
--        }
--    }
--    return 1;
--}
--
--int main(int argc, char **argv)
--{
--    const char *value;
--    p_ply iply, oply;
--    iply = ply_open("input.ply", NULL);
--    if (!iply) return 1;
--    if (!ply_read_header(iply)) return 1;
--    oply = ply_create("output.ply", PLY_LITTLE_ENDIAN, NULL);
--    if (!oply) return 1;
--    if (!setup_callbacks(iply, oply)) return 1;
--    /* pass comments and obj_infos from input to output */
--    value = NULL;
--    while ((value = ply_get_next_comment(iply, value)))
--        if (!ply_add_comment(oply, value)) return 1;
--    value = NULL;
--    while ((value = ply_get_next_obj_info(iply, value)))
--        if (!ply_add_obj_info(oply, value)) return 1;;
--    /* write output header */
--    if (!ply_write_header(oply)) return 1;
--    /* read input file generating callbacks that pass data to output file */
--    if (!ply_read(iply)) return 1;
--    /* close up, we are done */
--    if (!ply_close(iply)) return 1;
--    if (!ply_close(oply)) return 1;
--    return 0;
--}
-diff --git a/v3p/rply/manual/manual.html b/v3p/rply/manual/manual.html
-deleted file mode 100644
-index 60b415341f..0000000000
---- a/v3p/rply/manual/manual.html
-+++ /dev/null
-@@ -1,993 +0,0 @@
--<html>
--
--<head>
--<meta name="description" content="The RPly Homepage">
--<meta name="keywords" content="open source, C, Library, PLY, file format,
--input, output, tools">
--<title>
--RPly: ANSI C library for PLY file format input and output
--</title>
--<link rel="stylesheet" href="reference.css" type="text/css">
--</head>
--
--<body>
--
--<!-- header +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ -->
--
--<div class=header>
--<hr>
--<center>
--<table summary="RPly logo">
--<tr><td align=center>
--<img border=0 alt="RPly" src="rply.png">
--</td></tr>
--<tr><td align=center valign=top>ANSI C Library for PLY file format input and output
--</td></tr>
--</table>
--</center>
--<hr>
--</div>
--
--
--<!-- Introduction +++++++++++++++++++++++++++++++++++++++++++++++++++++ -->
--
--<h1>Introduction</h1>
--
--<p>RPly is a library that lets applications read and write PLY files.  The
--PLY file format is widely used to store geometric information, such as 3D
--models, but is general enough to be useful for other purposes.
--</p>
--
--<p>There are other libraries out there, of course. I tried using them and
--finally decided to write my own. I tried to write it in such a way that
--others won't have to do it again and again. Everything that made me unhappy
--about the existing libraries was eliminated from RPly.</p>
--
--<p>RPly is easy to use, well documented, small, free,
--open-source, ANSI C, efficient, and well tested. I will keep supporting it
--for a while because all my tools use the library for input/output. The highlights are: </p>
--<ul>
--<li> A callback mechanism that makes PLY file input straightforward;
--<li> Support for the full range of numeric formats though the user only
--deals with doubles;
--<li> Binary (big and little endian) and text modes are fully supported;
--<li> Input and output are buffered for efficiency;
--<li> Available under the
--<a href=http://www.opensource.org/licenses/mit-license.html>MIT license</a>
--for added freedom.
--</ul>
--
--<p>
--The format was developed at <a
--href=http://graphics.stanford.edu/data/3Dscanrep/>Stanford University</a>
--for use with their 3D scanning projects. Greg Turk's PLY library, available
--from <a href=http://www.cc.gatech.edu/projects/large_models>
--Georgia Institute of Technology</a>, seems to be the standard reference
--to the PLY file format, although there are some variations out there.
--</p>
--
--<p> Whatever documentation and examples were found, were taken into
--consideration to create RPly. In theory, since RPly doesn't try to interpret
--the meaning of the data in a PLY file, it should be able to read any PLY file.
--In practice, the library works with all PLY files that I could find.  </p>
--
--<h2>Download</h2>
--
--<p>
--Version 1.01 of RPly is available for download in source
--code from <a href=rply-1.01.tar.gz>this link</a>. Examples and documentation
--are packed inside the tar ball. Have fun!
--</p>
--
--<p>
--Copyright &copy; 2003-2005 Diego Nehab. All rights reserved. <br>
--Author: <A href="http://www.cs.princeton.edu/~diego">Diego Nehab</a>
--</p>
--
--<h2>What's new?</h2>
--
--<p>
--The change for version 1.01 is the use of our own buffering code when
--reading ASCII files. Speedup factor of 5 in Linux, almost no change in
--Windows.
--</p>
--
--<h2> RPly's idea of what a PLY file is </h2>
--
--<p> A PLY file contains the description of one object. This object is
--composed by <em>elements</em>, each element type
--being composed by a group of <em>properties</em>.  The PLY file
--format specifies a syntax for the description of element types and the
--properties that compose them, as well as comments and meta-information.
--</p>
--
--<p> The element type descriptions come in a header, which is followed by
--element instances. Element instances come grouped by their type, in the
--order of declaration. Each element instance is defined by the value
--of its properties. Properties values also appear in the order of their
--declaration. Here is a sample PLY file describing a triangle: </p>
--
--<pre class=example>
--ply
--format ascii 1.0
--comment this is a simple file
--obj_info any data, in one line of free form text
--element vertex 3
--property float x
--property float y
--property float z
--element face 1
--property list uchar int vertex_indices
--end_header
---1 0 0
-- 0 1 0
-- 1 0 0
--3 0 1 2
--</pre>
--
--<p> The header goes from the first line to the line marked by
--<tt>end_header</tt>.  The first line contains only <tt>ply\n</tt> and is
--used to detect whether a file is in PLY format or not.  The second line
--specifies the <tt>format</tt> number (which is always <tt>1.0</tt>) and the
--storage mode (<tt>ascii</tt>, <tt>binary_big_endian</tt> or
--<tt>binary_little_endian</tt>).  </p>
--
--<p> Lines that start with <tt>comment</tt> are just comments, of course.
--Lines that start with <tt>obj_info</tt> contain meta-information about the
--object.  <tt>Comment</tt>s and <tt>obj_info</tt>s are optional and their
--relative order in the header is irrelevant. </p>
--
--<p> In the sample PLY file, the first element type is declared with name
--<tt>vertex</tt>, and on the same line we learn that there will be 3
--instances of this element type.  The properties following describe what a
--<tt>vertex</tt> element looks like.  Each <tt>vertex</tt> is declared to
--consist of 3 scalar properties, named <tt>x</tt>, <tt>y</tt> and
--<tt>z</tt>.  Each scalar property is declared to be of type <tt>float</tt>.
--</p>
--
--<p> Scalar types can be any of the following: <tt>int8</tt>,
--<tt>uint8</tt>, <tt>int16</tt>, <tt>uint16</tt>, <tt>int32</tt>,
--<tt>uint32</tt>, <tt>float32</tt>, <tt>float64</tt>, <tt>char</tt>,
--<tt>uchar</tt>, <tt>short</tt>, <tt>ushort</tt>, <tt>int</tt>,
--<tt>uint</tt>, <tt>float</tt>, <tt>double</tt>. They consist of signed
--and unsigned integer types of sizes 8, 16 and 32 bits, as well as floating
--point types of 32 and 64bits.
--
--<p> Next, the <tt>face</tt> element type is declared, of which only 1
--instance will be given. This element consists of a <tt>list</tt> property,
--named <tt>vertex_indices</tt>. Lists are sequences on which the
--first value, the <em>length</em>, gives the number of remaining values. List properties are described by the scalar
--type of their length field and the scalar type of the remaining fields.
--In the case of <tt>vertex_indices</tt>, the length field
--is of type <tt>uchar</tt> and the remaining values are of type
--<tt>int</tt>. </p>
--
--<p> Following the header, come the elements, in the order they were
--declared in the header.  First come the 3 elements of type <tt>vertex</tt>,
--each represented by the value of their properties <tt>x</tt>, <tt>y</tt>
--and <tt>z</tt>. Then comes the single <tt>face</tt> element, composed by a
--single list of type <tt>vertex_indices</tt> containing 3 values
--(0 1 2).</p>
--
--<h2> How to read a file with RPly </h2>
--
--<p> Most users that want to read a PLY file already know which elements and
--properties they are interested at. In the following example, we will
--implement a simple program that dumps the contents of a PLY file to the
--terminal, in a different, simpler format that only works for triangles.
--</p>
--
--<p> This simple format has a header that gives the number of vertices in the
--first line and the number of triangles in the second line. Following the
--header come the vertices, and finally the triangles. Here is the sample
--code for the program:</p>
--
--<pre class=example>
--#include &lt;stdio.h&gt;
--#include "rply.h"
--
--static int vertex_cb(p_ply_argument argument) {
--    long eol;
--    ply_get_argument_user_data(argument, NULL, &amp;eol);
--    printf("%g", ply_get_argument_value(argument));
--    if (eol) printf("\n");
--    else printf(" ");
--    return 1;
--}
--
--static int face_cb(p_ply_argument argument) {
--    long length, value_index;
--    ply_get_argument_property(argument, NULL, &amp;length, &amp;value_index);
--    switch (value_index) {
--        case 0:
--        case 1:
--            printf("%g ", ply_get_argument_value(argument));
--            break;
--        case 2:
--            printf("%g\n", ply_get_argument_value(argument));
--            break;
--        default:
--            break;
--    }
--    return 1;
--}
--
--int main(void) {
--    long nvertices, ntriangles;
--    p_ply ply = ply_open("input.ply", NULL);
--    if (!ply) return 1;
--    if (!ply_read_header(ply)) return 1;
--    nvertices = ply_set_read_cb(ply, "vertex", "x", vertex_cb, NULL, 0);
--    ply_set_read_cb(ply, "vertex", "y", vertex_cb, NULL, 0);
--    ply_set_read_cb(ply, "vertex", "z", vertex_cb, NULL, 1);
--    ntriangles = ply_set_read_cb(ply, "face", "vertex_indices", face_cb, NULL, 0);
--    printf("%ld\n%ld\n", nvertices, ntriangles);
--    if (!ply_read(ply)) return 1;
--    ply_close(ply);
--    return 0;
--}
--</pre>
--
--<p> RPly uses callbacks to pass data to an application. Independent callbacks
--can be  associated with each property of each element. For scalar
--properties, the callback is invoked once for each instance. For list
--properties, the callback is invoked first with the number of
--entries in the instance, and then once for each of the data entries.
--<em>This is exactly the order in which the data items appear in the
--file.</em></p>
--
--<p> To keep things simple, values are always passed as <tt>double</tt>,
--regardless of how they are stored in the file. From its parameters,
--callbacks can find out exactly which part of the file is being processed
--(including the real type of the value), plus access custom information
--provided by the user in the form of a pointer and an integer constant. </p>
--
--<p> In our example, we start with a call to <tt>ply_open</tt> to open a
--file for reading. Then we get RPly to parse it's header, with a call to
--<tt>ply_read_header</tt>.  After the header is parsed, RPly knows which
--element types and properties are available. We then set callbacks for each
--of the <tt>vertex</tt> element properties and the <tt>face</tt> property
--(using <tt>ply_set_read_cb</tt>). Finally, we invoke the main RPly reading
--function, <tt>ply_read</tt>. This function reads all data in the file,
--passing the data to the appropriate callbacks.  After all reading is done,
--we call <tt>ply_close</tt> to release any resources used by RPly.</p>
--
--<p>There are some details, of course. <tt>Ply_set_read_cb</tt> returns the
--number of instances of the target property (which is the same as the number
--of element instances).  This is how the program obtains the number of
--vertices and faces in the file. </p>
--
--<p>RPly lets us associate one pointer <em>and</em> one integer to each
--callback.  We are free to use either or both to link some context to our
--callbacks. Our example uses the integer placeholder to tell
--<tt>vertex_cb</tt> that it has to break the line after the <tt>z</tt>
--property (notice the last argument of <tt>ply_set_read_cb</tt>).</p>
--
--<p><tt>Vertex_cb</tt> gets the user data and the property value from it's
--argument and prints accordingly.  The <tt>face_cb</tt> callback is a bit
--more complicated because lists are more complicated.  Since the
--simple file format only supports triangles, it only prints the first
--3 list values, after which it breaks the line. </p>
--
--<p> The output of the program, as expected, is: </p>
--
--<pre class=example>
--3
--1
---1 0 0
--0 1 0
--1 0 0
--0 1 2
--</pre>
--
--<h2> Writing files with RPly </h2>
--
--<p> The next example is somewhat more involved. We will create a program
--that converts our simple PLY file to binary mode. Besides showing how to
--write a PLY file, this example also illustrates the query functions. We
--do not know a priori which elements and properties, comments and obj_infos
--will be in the input file, so we need a way to find out. Although our simple
--program would work on any PLY file, a better version of this program is
--available from the RPly distribution. For simplicity, the simple version
--omits error messages and command line parameter processing. </p>
--
--<p> In practice, writing a file is even easier than reading one. First we
--create a file in binary mode, with a call to <tt>ply_create</tt> (notice
--the argument <tt>PLY_LITTLE_ENDIAN</tt> that gives the storage mode).  Then,
--we define the elements using <tt>ply_add_element</tt>. After each element, we
--define its properties using <tt>ply_add_scalar_property</tt> or
--<tt>ply_add_list_property</tt>. When we are done with elements and
--properties, we add comments and obj_infos. We then write the header with
--<tt>ply_write_header</tt> and send all data items. The data items are sent
--one by one, with calls to <tt>ply_write</tt>, <em>in the same order they
--are to appear in the file</em>.  Again, to simplify things, this function
--receives data as <tt>double</tt> and performs the needed conversion. Here
--is the code for the example: </p>
--
--<pre class=example>
--#include &lt;stdio.h&gt;
--#include "rply.h"
--
--static int callback(p_ply_argument argument) {
--    void *pdata;
--    /* just pass the value from the input file to the output file */
--    ply_get_argument_user_data(argument, &amp;pdata, NULL);
--    ply_write((p_ply) pdata, ply_get_argument_value(argument));
--    return 1;
--}
--
--static int setup_callbacks(p_ply iply, p_ply oply) {
--    p_ply_element element = NULL;
--    /* iterate over all elements in input file */
--    while ((element = ply_get_next_element(iply, element))) {
--        p_ply_property property = NULL;
--        long ninstances = 0;
--        const char *element_name;
--        ply_get_element_info(element, &amp;element_name, &amp;ninstances);
--        /* add this element to output file */
--        if (!ply_add_element(oply, element_name, ninstances)) return 0;
--        /* iterate over all properties of current element */
--        while ((property = ply_get_next_property(element, property))) {
--            const char *property_name;
--            e_ply_type type, length_type, value_type;
--            ply_get_property_info(property, &amp;property_name, &amp;type,
--                    &amp;length_type, &amp;value_type);
--            /* setup input callback for this property */
--            if (!ply_set_read_cb(iply, element_name, property_name, callback,
--                    oply, 0)) return 0;
--            /* add this property to output file */
--            if (!ply_add_property(oply, property_name, type, length_type,
--                    value_type)) return 0;
--        }
--    }
--    return 1;
--}
--
--int main(void) {
--    const char *value;
--    p_ply iply, oply;
--    iply = ply_open("input.ply", NULL);
--    if (!iply) return 1;
--    if (!ply_read_header(iply)) return 1;
--    oply = ply_create("output.ply", PLY_LITTLE_ENDIAN, NULL);
--    if (!oply) return 1;
--    if (!setup_callbacks(iply, oply)) return 1;
--    /* pass comments and obj_infos from input to output */
--    value = NULL;
--    while ((value = ply_get_next_comment(iply, value)))
--        if (!ply_add_comment(oply, value)) return 1;
--    value = NULL;
--    while ((value = ply_get_next_obj_info(iply, value)))
--        if (!ply_add_obj_info(oply, value)) return 1;;
--    /* write output header */
--    if (!ply_write_header(oply)) return 1;
--    /* read input file generating callbacks that pass data to output file */
--    if (!ply_read(iply)) return 1;
--    /* close up, we are done */
--    if (!ply_close(iply)) return 1;
--    if (!ply_close(oply)) return 1;
--    return 0;
--}
--</pre>
--
--<p> RPly uses iterators to let the user loop over a PLY file header. A
--function is used to  get the first item of a given class (element, property
--etc). Passing the last returned item to the same function produces the next
--item, until there are no more items. Examples of iterator use can be seen
--in the <tt>main</tt> function, which uses them to loop over comments and
--obj_infos, and in the <tt>setup_callbacks</tt> function, which loops over
--elements and properties. </p>
--
--<p> In the <tt>setup_callbacks</tt> function, for each element in the
--input, an equivalent element is defined in the output. For each property in
--each element, an equivalent property is defined in the output. Notice that
--the same callback is specified for all properties. It is given the output
--PLY handle as the context pointer. Each time it is called, it  passes the
--received value to <tt>ply_write</tt> on the output handle. It is as simple
--as that. </p>
--
--<h1>Reference Manual</h1>
--
--<!-- ply_open ++++++++++++++++++++++++++++++++++++++++++++++++++++++++ -->
--
--<p class=name id=ply_open>
--p_ply <b>ply_open</b>(const char *name, p_ply_error_cb error_cb)
--</p>
--
--<p class=description>
--Opens a PLY file for reading, checks if it is a valid PLY file
--and returns a handle to it.
--</p>
--
--<p class=arguments>
--<tt>Name</tt> is the file name, and <tt>error_cb</tt> is a function to
--be called when an error is found.
--If <tt>error_cb</tt> is NULL, the default
--error callback is used. It prints a message to the standard error stream.
--</p>
--
--<p class=return>
--Returns a handle to the file or NULL on error.
--</p>
--
--<p class=note>
--Note: <tt>Error_cb</tt> is of type <tt>void
--    (*p_ply_error_cb)(const char *message)</tt>
--</p>
--
--<!-- ply_read_header +++++++++++++++++++++++++++++++++++++++++++++++++ -->
--
--<p class=name id=ply_read_header>
--int <b>ply_read_header</b>(p_ply ply)
--</p>
--
--<p class=description>
--Reads and parses the header of a PLY file.
--After a call to this function, the query functions
--<a href=#ply_get_next_element><tt>ply_get_next_element</tt></a>,
--<a href=#ply_get_next_property><tt>ply_get_next_property</tt></a>,
--<a href=#ply_get_next_comment><tt>ply_get_next_comment</tt></a>, and
--<a href=#ply_get_next_obj_info><tt>ply_get_next_obj_info</tt></a> can be
--called. Callbacks can also be set with the
--<a href=#ply_set_read_cb><tt>ply_set_read_cb</tt></a> function.
--</p>
--
--<p class=arguments>
--<tt>Ply</tt> is a handle returned by <a href=#ply_open><tt>ply_open</tt></a>.
--</p>
--
--<p class=return>
--Returns 1 in case of success, 0 otherwise.
--</p>
--
--<!-- ply_set_read_cb +++++++++++++++++++++++++++++++++++++++++++++++++ -->
--
--<p class=name id=ply_set_read_cb>
--long <b>ply_set_read_cb</b>(<br>
--&nbsp;&nbsp; p_ply ply,<br>
--&nbsp;&nbsp; const char *element_name,<br>
--&nbsp;&nbsp; const char *property_name,<br>
--&nbsp;&nbsp; p_ply_read_cb read_cb,<br>
--&nbsp;&nbsp; void *pdata,<br>
--&nbsp;&nbsp; long idata<br>
--)
--</p>
--
--<p class=description>
--Sets up the callback to be invoked when the value of a property is read.
--</p>
--
--<p class=arguments>
--<tt>Ply</tt> is a handle returned by <a href=#ply_open><tt>ply_open</tt></a>.
--<tt>Element_name</tt> and <tt>property_name</tt> are the names of the
--element and property of interest. <tt>Read_cb</tt> is the callback
--function.  <tt>Pdata</tt> and <tt>idata</tt> are user data to be passed to
--the callback function.
--</p>
--
--<p class=return>
--Returns the number of instances of the element of interest.
--</p>
--
--<p class=note>
--Note: <tt>Read_cb</tt> is of type
--<tt>int (*p_ply_read_cb)(p_ply_argument argument)</tt>.
--The callback should return 1 to continue the reading process,
--or return 0 to abort.
--
--<!-- ply_get_argument_element ++++++++++++++++++++++++++++++++++++++++ -->
--
--<p class=name id=ply_get_argument_element>
--int <b>ply_get_argument_element</b>(<br>
--&nbsp;&nbsp; p_ply_argument argument,<br>
--&nbsp;&nbsp; p_ply_element *element,<br>
--&nbsp;&nbsp; long *instance_index<br>
--)
--</p>
--
--<p class=description>
--Retrieves element information from the callback argument.
--</p>
--
--<p class=arguments>
--<tt>Argument</tt> is the handle passed to the callback.
--<tt>Element</tt> receives a handle to the element
--originating the callback. <tt>Instance_index</tt> receives
--the index of the instance of the element
--being read. <tt>Element</tt> and <tt>instance_index</tt> can be NULL.
--</p>
--
--<p class=return>
--Returns 1 in case of success, 0 otherwise.
--</p>
--
--<p class=note>
--Note: further information can be obtained from <tt>element</tt> with a
--call to <a href=#ply_get_element_info>ply_get_element_info</a>.
--</p>
--
--<!-- ply_get_argument_property +++++++++++++++++++++++++++++++++++++++ -->
--
--<p class=name id=ply_get_argument_property>
--int <b>ply_get_argument_property</b>(<br>
--&nbsp;&nbsp; p_ply_argument argument,<br>
--&nbsp;&nbsp; p_ply_property *property,<br>
--&nbsp;&nbsp; long *length,<br>
--&nbsp;&nbsp; long *value_index<br>
--)
--</p>
--
--<p class=description>
--Retrieves property information from the callback argument.
--</p>
--
--<p class=arguments>
--<tt>Argument</tt> is the handle passed to the callback.
--<tt>Property</tt> receives a handle to the property
--originating the callback. <tt>Length</tt> receives the number
--of values in the list property (1 for scalar properties).
--<tt>Value_index</tt> receives the index of the current property entry (0 for
--scalar properties, -1 for the first value of a list property, the one that
--gives the number of entries). <tt>Property</tt>, <tt>length</tt> and
--<tt>value_index</tt> can be NULL.
--</p>
--
--<p class=return>
--Returns 1 in case of success, 0 otherwise.
--</p>
--
--<p class=note>
--Note: further information can be obtained from <tt>property</tt> with a
--call to <a href=#ply_get_property_info>ply_get_property_info</a>.
--</p>
--
--<!-- ply_get_argument_user_data +++++++++++++++++++++++++++++++++++++++ -->
--
--<p class=name id=ply_get_argument_user_data>
--int <b>ply_get_argument_user_data</b>(p_ply_argument argument, void *pdata,
--        long *idata)
--</p>
--
--<p class=description>
--Retrieves the user data from the callback argument.
--</p>
--
--<p class=arguments>
--<tt>Argument</tt> is the handle passed to the callback.
--<tt>Pdata</tt> receives the user data pointer.
--<tt>Idata</tt> receives the user data integer.
--<tt>Pdata</tt> and <tt>idata</tt> can be NULL.
--</p>
--
--<p class=return>
--Returns 1 in case of success, 0 otherwise.
--</p>
--
--<!-- ply_get_argument_value +++++++++++++++++++++++++++++++++++++++++++ -->
--
--<p class=name id=ply_get_argument_value>
--double <b>ply_get_argument_value</b>(p_ply_argument argument)
--</p>
--
--<p class=description>
--Retrieves the property value from the callback argument.
--</p>
--
--<p class=arguments>
--<tt>Argument</tt> is the handle passed to the callback.
--</p>
--
--<p class=return>
--Returns the property value.
--</p>
--
--<!-- ply_read +++++++++++++++++++++++++++++++++++++++++++++++++++++++++ -->
--
--<p class=name id=ply_read>
--int <b>ply_read</b>(p_ply ply)
--</p>
--
--<p class=description>
--Reads all data in file, calling appropriate callbacks.
--</p>
--
--<p class=arguments>
--<tt>Ply</tt> is a handle returned by <a href=#ply_open><tt>ply_open</tt></a>.
--</p>
--
--<p class=return>
--Returns 1 in case of success, 0 otherwise.
--</p>
--
--<!-- ply_get_next_element ++++++++++++++++++++++++++++++++++++++++++++ -->
--
--<p class=name id=ply_get_next_element>
--p_ply_element <b>ply_get_next_element</b>(p_ply ply, p_ply_element last)
--</p>
--
--<p class=description>
--Iterates over all elements on the header of a PLY file.
--</p>
--
--<p class=arguments>
--<tt>Ply</tt> is a handle returned by <a href=#ply_open><tt>ply_open</tt></a>.
--<a href=#ply_read_header><tt>Ply_read_header</tt></a> must have been called
--on the handle otherwise no elements will be found.
--<tt>Last</tt> is NULL to retrieve the first element, and an element to
--retrieve the next element.
--</p>
--
--<p class=return>
--Returns the next element, or NULL if no more elements.
--</p>
--
--<p class=note>
--Note: further information can be obtained from an element with a
--call to <a href=#ply_get_element_info>ply_get_element_info</a>.
--</p>
--
--<!-- ply_get_next_property +++++++++++++++++++++++++++++++++++++++++++ -->
--
--<p class=name id=ply_get_next_property>
--p_ply_property <b>ply_get_next_property</b>(p_ply_element element, p_ply_property last)
--</p>
--
--<p class=description>
--Iterates over all properties of an element.
--</p>
--
--<p class=arguments>
--<tt>Element</tt> is an element handle.
--<tt>Last</tt> is NULL to retrieve the first property, and a property to
--retrieve the next property.
--</p>
--
--<p class=return>
--Returns the next property, or NULL if no more properties.
--</p>
--
--<p class=note>
--Note: further information can be obtained from a property with a
--call to <a href=#ply_get_property_info>ply_get_property_info</a>.
--</p>
--
--<!-- ply_get_next_comment ++++++++++++++++++++++++++++++++++++++++++++ -->
--
--<p class=name id=ply_get_next_comment>
--const char *<b>ply_get_next_comment</b>(p_ply ply, const char *last)
--</p>
--
--<p class=description>
--Iterates over all comments on the header of a PLY file.
--</p>
--
--<p class=arguments>
--<tt>Ply</tt> is a handle returned by <a href=#ply_open><tt>ply_open</tt></a>.
--<a href=#ply_read_header><tt>Ply_read_header</tt></a> must have been called
--on the handle otherwise no comments will be found.
--<tt>Last</tt> is NULL to retrieve the first comment, and a comment to
--retrieve the next comment.
--</p>
--
--<p class=return>
--Returns the next comment, or NULL if no more comments.
--</p>
--
--<!-- ply_get_next_obj_info +++++++++++++++++++++++++++++++++++++++++++ -->
--
--<p class=name id=ply_get_next_obj_info>
--const char *<b>ply_get_next_obj_info</b>(p_ply ply, const char *last)
--</p>
--
--<p class=description>
--Iterates over all obj_infos on the header of a PLY file.
--</p>
--
--<p class=arguments>
--<tt>Ply</tt> is a handle returned by <a href=#ply_open><tt>ply_open</tt></a>.
--<a href=#ply_read_header><tt>Ply_read_header</tt></a> must have been called
--on the handle otherwise no obj_infos will be found.
--<tt>Last</tt> is NULL to retrieve the first obj_info, and a obj_info to
--retrieve the next obj_info.
--</p>
--
--<p class=return>
--Returns the next obj_info, or NULL if no more obj_infos.
--</p>
--
--<!-- ply_get_element_info ++++++++++++++++++++++++++++++++++++++++++++ -->
--
--<p class=name id=ply_get_element_info>
--int <b>ply_get_element_info</b>(p_ply_element element, const char** name,
--        long *ninstances)
--</p>
--
--<p class=description>
--Retrieves information from an element handle.
--</p>
--
--<p class=arguments>
--<tt>Element</tt> is the handle of the element of interest.
--<tt>Name</tt> receives the internal copy of the element name.
--<tt>Ninstances</tt> receives the number of instances of this element
--in the file. Both <tt>name</tt> and <tt>ninstances</tt> can be NULL.
--</p>
--
--<p class=return>
--Returns 1 in case of success, 0 otherwise.
--</p>
--
--<!-- ply_get_property_info +++++++++++++++++++++++++++++++++++++++++++ -->
--
--<p class=name id=ply_get_property_info>
--int <b>ply_get_property_info</b>(<br>
--&nbsp;&nbsp; p_ply_property property,<br>
--&nbsp;&nbsp; const char** name,<br>
--&nbsp;&nbsp; e_ply_type *type,<br>
--&nbsp;&nbsp; e_ply_type *length_type,<br>
--&nbsp;&nbsp; e_ply_type *value_type<br>
--)
--</p>
--
--<p class=description>
--Retrieves information from a property handle.
--</p>
--
--<p class=arguments>
--<tt>Property</tt> is the handle of the property of interest.
--<tt>Name</tt> receives the internal copy of the property name.
--<tt>Type</tt> receives the property type.
--<tt>Length_type</tt> receives the scalar type of the first entry
--in a list property (the one that gives the number of entries).
--<tt>Value_type</tt> receives the scalar type of the remaining list entries.
--<tt>Name</tt>, <tt>type</tt>, <tt>length_type</tt>, and
--<tt>value_type</tt> can be NULL.
--</p>
--
--<p class=return>
--Returns 1 in case of success, 0 otherwise.
--</p>
--
--<p class=note>
--Note: <tt>Length_type</tt> and <tt>value_type</tt> can
--receive any of the constants for scalar types defined in
--<tt>e_ply_type</tt>. <tt>Type</tt> can, in addition, be <tt>PLY_LIST</tt>,
--in which case the property is a list property and the fields
--<tt>length_type</tt> and <tt>value_type</tt> become meaningful.
--</p>
--
--<!-- ply_create ++++++++++++++++++++++++++++++++++++++++++++++++++++++ -->
--
--<p class=name id=ply_create>
--p_ply <b>ply_create</b>(const char *name, e_ply_storage_mode storage_mode,
--        p_ply_error_cb error_cb)
--</p>
--
--<p class=description>
--Creates a PLY file for writing.
--</p>
--
--<p class=arguments>
--<tt>Name</tt> is the file name, <tt>storage_mode</tt> is the file storage mode
--(<tt>PLY_ASCII</tt>, <tt>PLY_LITTLE_ENDIAN</tt> or <tt>PLY_BIG_ENDIAN</tt>). <tt>Error_cb</tt> is a function to be called when an error is found.
--If <tt>error_cb</tt> is NULL, the default
--error callback is used. It prints a message to the standard error stream.
--</p>
--
--<p class=return>
--Returns a handle to the file or NULL on error.
--</p>
--
--<p class=note>
--Note: <tt>Error_cb</tt> is of type <tt>void
--    (*p_ply_error_cb)(const char *message)</tt>
--</p>
--
--<!-- ply_add_element +++++++++++++++++++++++++++++++++++++++++++++++++ -->
--
--<p class=name id=ply_add_element>
--int <b>ply_add_element</b>(p_ply ply, const char *name, long ninstances)
--</p>
--
--<p class=description>
--Adds a new element to the ply file.
--</p>
--
--<p class=arguments>
--<tt>Ply</tt> is a handle returned by
--<a href=#ply_create><tt>ply_create</tt></a>, <tt>name</tt> is the element
--name and <tt>ninstances</tt> is the number of instances of this element that
--will be written to the file.
--</p>
--
--<p class=return>
--Returns 1 in case of success, 0 otherwise.
--</p>
--
--<!-- ply_add_property ++++++++++++++++++++++++++++++++++++++++++++++++ -->
--
--<p class=name id=ply_add_property>
--int <b>ply_add_property</b>(<br>
--&nbsp;&nbsp; p_ply ply,<br>
--&nbsp;&nbsp; const char *name,<br>
--&nbsp;&nbsp; e_ply_type type,<br>
--&nbsp;&nbsp; e_ply_type length_type,<br>
--&nbsp;&nbsp; e_ply_type value_type<br>
--)
--</p>
--
--<p class=description>
--Adds a new property to the last element added to the ply file.
--</p>
--
--<p class=arguments>
--<tt>Ply</tt> is a handle returned by
--<a href=#ply_create><tt>ply_create</tt></a> and <tt>name</tt> is the
--property name.
--<tt>Type</tt> is the property type.
--<tt>Length_type</tt> is the scalar type of the first entry
--in a list property (the one that gives the number of entries).
--<tt>Value_type</tt> is the scalar type of the remaining list entries.
--If <tt>type</tt> is not <tt>PLY_LIST</tt>, <tt>length_type</tt> and
--<tt>value_type</tt> are ignored.
--</p>
--
--<p class=return>
--Returns 1 in case of success, 0 otherwise.
--</p>
--
--<p class=note>
--Note: <tt>Length_type</tt> and <tt>value_type</tt> can
--be any of the constants for scalar types defined in
--<tt>e_ply_type</tt>. <tt>Type</tt> can, in addition, be <tt>PLY_LIST</tt>,
--in which case the property is a list property and the fields
--<tt>length_type</tt> and <tt>value_type</tt> become meaningful.
--</p>
--
--<!-- ply_add_list_property ++++++++++++++++++++++++++++++++++++++++++ -->
--
--<p class=name id=ply_add_list_property>
--int <b>ply_add_list_property</b>(<br>
--&nbsp;&nbsp; p_ply ply,<br>
--&nbsp;&nbsp; const char *name,<br>
--&nbsp;&nbsp; e_ply_type length_type,<br>
--&nbsp;&nbsp; e_ply_type value_type<br>
--)
--</p>
--
--<p class=description>
--Same as <a href=#ply_add_property><tt>ply_add_property</tt></a> if
--<tt>type</tt> is <tt>PLY_LIST</tt>.
--</p>
--
--<!-- ply_add_scalar_property +++++++++++++++++++++++++++++++++++++++++ -->
--
--<p class=name id=ply_add_scalar_property>
--int <b>ply_add_scalar_property</b>(p_ply ply, const char *name, e_ply_type type)
--</p>
--
--<p class=description>
--Same as <a href=#ply_add_property><tt>ply_add_property</tt></a> if
--<tt>type</tt> is <em>not</em> <tt>PLY_LIST</tt>.
--</p>
--
--<!-- ply_add_comment +++++++++++++++++++++++++++++++++++++++++++++++++ -->
--
--<p class=name id=ply_add_comment>
--int <b>ply_add_comment</b>(p_ply ply, const char *comment);
--</p>
--
--<p class=description>
--Adds a comment to a PLY file.
--</p>
--
--<p class=arguments>
--<tt>Ply</tt> is a handle returned by
--<a href=#ply_create><tt>ply_create</tt></a> and <tt>comment</tt> is the
--comment text.
--</p>
--
--<p class=return>
--Returns 1 in case of success, 0 otherwise.
--</p>
--
--<!-- ply_add_obj_info ++++++++++++++++++++++++++++++++++++++++++++++++ -->
--
--<p class=name id=ply_add_obj_info>
--int <b>ply_add_obj_info</b>(p_ply ply, const char *obj_info);
--</p>
--
--<p class=description>
--Adds a obj_info to a PLY file.
--</p>
--
--<p class=arguments>
--<tt>Ply</tt> is a handle returned by
--<a href=#ply_create><tt>ply_create</tt></a> and <tt>obj_info</tt> is the
--obj_info text.
--</p>
--
--<p class=return>
--Returns 1 in case of success, 0 otherwise.
--</p>
--
--<!-- ply_write_header ++++++++++++++++++++++++++++++++++++++++++++++++ -->
--
--<p class=name id=ply_write_header>
--int <b>ply_write_header</b>(p_ply ply);
--</p>
--
--<p class=description>
--Writes the PLY file header to disk, after all elements, properties,
--comments and obj_infos have been added to the handle.
--</p>
--
--<p class=arguments>
--<tt>Ply</tt> is a handle returned by
--<a href=#ply_create><tt>ply_create</tt></a> and <tt>comment</tt> is the
--comment text.
--</p>
--
--<p class=return>
--Returns 1 in case of success, 0 otherwise.
--</p>
--
--<!-- ply_write +++++++++++++++++++++++++++++++++++++++++++++++++++++++ -->
--
--<p class=name id=ply_write>
--int <b>ply_write</b>(p_ply ply, double value);
--</p>
--
--<p class=description>
--Passes a value to be stored in the PLY file.
--Values must be passed in the order they will appear in the file.
--</p>
--
--<p class=arguments>
--<tt>Ply</tt> is a handle returned by
--<a href=#ply_create><tt>ply_create</tt></a> and <tt>value</tt> is the
--value to be stored.  For simplicity, values are always passed as
--<tt>double</tt> and conversion is performed as needed.
--</p>
--
--<p class=return>
--Returns 1 in case of success, 0 otherwise.
--</p>
--
--<!-- ply_close +++++++++++++++++++++++++++++++++++++++++++++++++++++++ -->
--
--<p class=name id=ply_close>
--int <b>ply_close</b>(p_ply ply);
--</p>
--
--<p class=description>
--Closes the handle and ensures that all resources have been freed and data
--have been written.
--</p>
--
--<p class=arguments>
--<tt>Ply</tt> is a handle returned by
--<a href=#ply_create><tt>ply_create</tt></a> or by
--<a href=#ply_open><tt>ply_open</tt></a>.
--</p>
--
--<p class=return>
--Returns 1 in case of success, 0 otherwise.
--</p>
--
--<!-- footer ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ -->
--
--<div class=footer>
--<hr>
--<center>
--<p>
--<small>
--Last modified by Diego Nehab on <br>
--Fri Jul 16 15:23:01 EDT 2004
--</small>
--</p>
--</center>
--</div>
--
--</body>
--</html>
-diff --git a/v3p/rply/manual/reference.css b/v3p/rply/manual/reference.css
-deleted file mode 100644
-index 821215dc82..0000000000
---- a/v3p/rply/manual/reference.css
-+++ /dev/null
-@@ -1,54 +0,0 @@
--body {
--    margin-left: 1em;
--    margin-right: 1em;
--    font-family: "Verdana", sans-serif;
--}
--
--tt {
--    font-family: "Andale Mono", monospace;
--}
--
--h1, h2, h3, h4 { margin-left: 0em; }
--
--
--h3 { padding-top: 1em; }
--
--p { margin-left: 1em; }
--
--p.name {
--    font-family: "Andale Mono", monospace;
--    padding-top: 1em;
--    margin-left: 0em;
--}
--
--a[href] { color: #7f0000; }
--
--blockquote { margin-left: 3em; }
--
--pre.example {
--    background: #cbb;
--    padding: 1em;
--    margin-left: 1em;
--    font-family: "Andale Mono", monospace;
--    font-size: small;
--}
--
--hr {
--    margin-left: 0em;
--	background: #7f0000;
--	border: 0px;
--	height: 1px;
--}
--
--ul { list-style-type: disc; }
--
--table.index { border: 1px #7f0000; }
--table.index td { text-align: left; vertical-align: top; }
--table.index ul { padding-top: 0em; margin-top: 0em; }
--
--h1:first-letter,
--h2:first-letter,
--h2:first-letter,
--h3:first-letter { color: #7f0000; }
--
--div.header, div.footer { margin-left: 0em; }
-diff --git a/v3p/rply/manual/rply.png b/v3p/rply/manual/rply.png
-deleted file mode 100644
-index e27e44f677da48c3e923fb98a7ac478127e14984..0000000000000000000000000000000000000000
-GIT binary patch
-literal 0
-HcmV?d00001
-
-literal 6232
-zcmV-e7^mlnP)<h;3K|Lk000e1NJLTq003kF004Uk0ssI24FIxD00009a7bBm0017r
-z0017r0mErjQvd(}2XskIMF-Oi5flvzOn9}k000;FNkl<Zc%0pRcU%-#_x>|mD1wb*
-z6iGxBHA<|2L^MqWDZVHIV#AUcHKw7UMnPhXC>qq*6HP=xFp7W$#ey|?Z3$HbrAZa(
-z2)is>=6?TJ;b(p?0(S<)56_2xMrWQm`|P=A?>%Sk8HNy2Czam*^UvDq>XBo|zVpsI
-z-~^UslM)iL)6)kG9Xfo(2!TMrjVCuZH~#i*JwrpQapSbLwYibB7mA-g^|7$H4kQCx
-zyLUeu8A<4&P$)JnS@MTam<EIjh1*uFP%4!icp^eVc695O0$c&sj2~Z8Qo@0x{eXbw
-z%S!<Q5P$`KFfyvBsGw!Jc<$T<h9M0+=Y+z`moCwgl$VulGB98pND6^%D_7Ezv?~O4
-zw{IIXco_qXDlX1@@`TnsAKblbO-SS6Sd}X4@4snD9%p2XEGuIg4vm2NyLV|x+7$x9
-zfC2KCj`MVM3=9ovS^Aoq=Du`T2=wgNkCw!^Z{H`HnvI8b0HG&oUnIuI|EQ-|21tR+
-zz(PkymSt)Ev!<rT$J#mrr~@7WE(QjrrKPkaEX)4n<8xIYkOF1E3WkX}caD~%T_N0m
-z;J{nX&W8!v9Uq@d2%bDC(bF4kX~{55%StyuLqo&T)%8NJUK{V-yC;(wOQmtSxgR+?
-zipApAlQ0Zp_3_84=H^=q3oqp7cLQ$z{r4z)dp$ipdLL*Xs5N`^=+P2Q%^koF;4`uK
-zm)*NL_!l8${-8l>lC{7WZf<pTbsR_n0s_<|fq?74fmvBu97x&&P0WUdDHQj;ybkW&
-z%jY{V1bUu4`OTa;a=E<avtI!Xz$!D-+txNGCx?$QZH1<%j>DA7dtZP3>z+O2rQbMO
-z7y!K@Bfp+CODdIeCJ_VUva-A<PtMH9;7rn1c;!6XoRIroUcc_%%||bNz#uZxXa0PN
-zM8cUw1dPqfTI=YT@%S-kk~Tqei;`hV<v-ruzwpz`0O%1Bv1-8rKK`WvSY%|Zb9C%j
-z|7u|cH&mgBU%8T}UWP!=h=>()=hoNPb0*OMEHg7#+1Yhq{Azi*J5;Is$II)$u3dcN
-zS5(wj9v*ddb(~4WfK5)$%83&@%D-Bb8yLp2@hevF)JqR|D>{0`+_`+>mk@YAC+9nR
-z`^S$SaVFu6)+SPhv23EZ_ko{(W?7c=&GZ5N$VeYgPf2YpXA&`BnU&?|<n;RWqR2YE
-zt5hbgTE%}n>P1Gb^z`I29yNe5nVD-H9A5Kyq)XAgt576*d+*=5vkl_c%$fBv8D|m=
-zz&bm7m91@NW+rD6T2SXRhpJSGD_8Q=OAqLK_Uu<49z5q?<DNWOZEO1|J)JWN6}TjS
-zhZ2(H<Fjwa4nFa#C-Bzk)82FE*7As7BEUK)$IsC*JuQthN$bHeQ~s_>m9l#E{vA8`
-z&hMk6edf*M<6mOHB0GD%lhdR2kM|tK0x(3WOj)yLA8)-3qoco_HA}`XepzN`e`jZx
-z)z0yYyI25*D3!_H-g|<Ac*ZZIvuBsPy7F9a+vMhYPn_7U@r##O0Ny3!!Rpm}gMwI=
-zt*)w)C=?t#q$kifCdO;lteTn{nM_t)RaFbn$}a?L^74Eg9MT>>RH;-&g@pzA`3i-C
-z-kev0Q9H%s$B(xUA3lWZ+AUoqV%*$JZr$ozSonaDa$p!eNjZ@H$tMG<tId*<N|egK
-zfiZxHl0*UA?caaEd+!a5ixabKrj5<#zx~F!82bOAZNw@B%z(uJ0}x;z@C4{fNg@Yw
-zfS&;k0Kh-M&%kJUW9|Sy0mcA;D&Qx3`|r=35s7GJZvrnU<Z^i`A<wn6xUoD{DpxC&
-z>ZCmbxB|09qC!gho)faTzFwo@a0~#3NueZRfwz@P<Axa812DRA<N5RFZIZ|r0Z=Fu
-zg@uLry1G8U|2}@g1P&}=2M<cttZA%2N&(lcTW8LnPeqcQm6dL7jfT0K3NW5Hanb($
-zR3s{uD$LoLJbKhvZjotf3WY){l2@Xtvhq7e$8dol7VzrcJ@)*04w?Ld{CxjDeWU;Z
-zB!Hi>aZynbEs0z%U+3hM4-h~FgowqlXU=di=FrZaR|NufSvwi<UAT~2@#TLZ?8Pwi
-z4<EK6WFRo9zW(R)=ev#@*N?Kg*{xeQ{mGMmD=E1x7GJlq@i=tIbie@GuT3Zvj<mB2
-zk;`w$WY-1{HVF*0cXp<#$f+^h!s4$!eU9hlMV6Gr0mYS-!|m)0=_|)gVBMH8jn60$
-zAPV?UU;oz4n;e8^SyrJ?@c#l83I%^(xO(Z*x4;fy8!+A2I6W<mzhMHAv9anU?VbW3
-zl$Y;vcD{A<Cavxa!?ewhj!4A8q5jtxHH8QmUr_Mf<jD_HQ+aX<CV6@7)z((m_L6|>
-zfFAIEW##T^)Be15izoXV0s%0tpupe3;Xz6YFCLo@KCrrcdBgPS^8|t*z!Ct!0Pj~;
-z?wLOQ=8YR|Vs3{+1X$(e{V;VZAH4(&!&uwc%-^y_M=T!w(u|n_tjf#x&6vSqJieI_
-z16H}Y-#a>{J$%TGp}Do802o_dzQ@`5=Jo5`*xxjWfcNwB*G`)Bkdt05ETkF0x~gjL
-z^y!^OFCj4g>C^Rgb}7lpwAZ$rb$Fqdi_48pq?dI;!N#dmlPUFTRf>iI##UDDpE0A;
-z=%tSL8=ah};(crLSpvYSqGG>`%Z+Q-IGOjxK?GRm=dZW3OKtW1iz4|a0LE5U?sIXu
-ze)TFR^WHe9<CmYUZ7bs!U8YnWzxKPhT<<LYB>-%SiZ(hrCM71e=43iBfOU2Cff+Nd
-zbt3<=Dk#`Ab!t*lQuAkW$-y&#Rb}O`uCAR%FA-o>Q1C-b>miN>3jttNS^0~L%hfAa
-zxG}tG5CJwtMShbeH50$MS9cg-Y<2aouCAR%F99&2q-2A=ePTkwt4`pK|EE`693P%H
-z2Liyls3>6S)P$z=VpJ;C$z#WogM#Xklk*7~1JD*N2ym}Qj}LzQ@o7wqW@@U`+<aDG
-zpt-p@2V2WZOMh9vo{f!F_Ubi!#R?a9cMgdyg+dX$cW=(VebS7Kr+@`Ov2y_cpakw3
-z8QHF1pMUI_W?r7m+WND=z<&MuF{i@Anc1_a5yAk^fUkkE^!`=>)Byp27?1-2Mn<3A
-zy=!c2OhqD>%l#Z3y{}v`1PBlz7Hj|Uhtu@wl(t}hVBm=Fz8gmffJcBoFczSdJQwH-
-ztN;W+EwFLeFyGs^g+r>Vmt|+GxpaX#K>a+5jOH&L@CSMV0E9sQnwqO-W+N>vsqD+l
-z%w$)tv<3h$z`HDaLL&Ka_G~H=g+g&<>C!o+rRqZiAQQ+3YJul8e>uRWhC!wQbSW);
-zGGT&<{QC(OU6JVRfPg+mMpP!2oIkG_7S?#E3CQUmT#!m6+AlpbApk)Cbd6G}6#TnX
-ztOb<Nk3{*ui{Uyzg+wBHd&Z2U+qXvm02ILe_uljW>MJeEYU_JLhek$5E@^lYCR#^l
-zyqz7Tc^Euo$Vqc^rw0$zAM9`7Z5J0>5^Zg5fum#o?%i(#0IGq104w^y@))=TI0FD!
-zAjZ(}vk4P~5ogba)YjfgN=jBL_W~w8dya8+)#%oZin>?t-npixVgLPahD34%xFr^k
-zaBvtfa3B?lSS)^P!h{|7?`ISjpC=>)=s9ZC_>VqfD7RY=A2)7KK|y?a`aPBE05AyP
-zu+utEORHqTg4<bHk5#Ha`uCq09BlsHdoP}KD9g@1JYs~nwibZCx%sr1n6C5>Q>av`
-zxq}B=Wn}@l*R|`y6DMq^Orf_E-z{IRzi*!i$YL0ywQE;x*ubHreDB`917pVyr@uP^
-zl67>Z9zN{i=B7|6s;a6C3=Gsi$}he&Ee#Ewh9Bwj2M<m=Io0Il(cVTV6lw~EjCws(
-zQ*+qe{Zec!y|vKN&``&V0fZC<1O)o~b9f$8Q&W>$RW3<K$LaUqUEJINh{a+<L&L`D
-zOVb`+mXZ?f;80sw$mw=Kqh4-qmo8r9Oafp4A;p_FZ&|;d&-1ITN4%Dnb8zqsclRd$
-z_m$zGJT*1S&W^8MwYB{9GG*D~&6_v3zh3cLTGK;9rn|bn>V)QEXL)LBl&vj?@z{tL
-z{^ja=@%(wtBmhiV_E|u{W?x^GO4ah&^dLZjj*d%cXfsNo#h=vjhYzD29G>UqHh)?(
-zQ2W;r50BWG7|tXBObL0mWy@w?-}dmYBwgKU!NJpJ%xM0!mVcGYQ&UenI`Z@{%bJ=a
-z9v-n5E^sCRU`j|yU|>L7`&UAjF4Ka8oA)U-S~Z0!Pfd-QGNrblfU`kr|2pdK&R?(6
-zz`!;fkN;?CxrBzc=u>L6cD`4UmKMo7ep%Mm9(8xWz;8VEXW7!NTLadu<F8kImo9E$
-zVa}~yt5ZylE7H=Urc8NG-+ZMJYP~`{JkFmz%b5f~f0ixVx;0?!TF!bAAW>I$Mri1N
-zXtEk~D~XD<w9}4`{PhZ*J^TE*bDT*4^e3cj+cwU6CF<%<KXRn?KBWeArnLOw!)SZ^
-zn*4m)3mfr5FAt9k{N@w=2`S&UZ4<p-|7dHwhK4%RuhO}sl`GQIqik*Y>LrncxVxX{
-z7r#shsrcz9D!u;J)^-mMpX%();dUHz@D=Ilk&`Ds=dlr9tyieKd(4?LoJjzfux!P)
-zZ9lGAqf{!JKa&9Qy1E|6k8@KBd<qtoj~+!kI#y?Ab7o)wOQ|$$_Uv<~Pje=L+P{K=
-zHmzCHjDHazv1?bikPxT;{D<?6cvW}WB;H#{B;j-B@bs_#gj8<dzVX$1#p~#}g@jC<
-zHjU3+`0fg;NKcQlv*S7cvXDr^X3dJ>H=i&er1}+l-PhLk2oHDSI{F$R0+5!PdUDsU
-zjJi4vz?{AiQu+9C<mAa8|M5rk`STUU#kYY`l=U<Qu#if_JUo;kA@aJq^td<`Fc9cP
-zX-Pkp%?%3L$g+0Rr=Qxpw+IjcHM+WU!owY$oG8hfvh)6(JC`R-@~W-X0&V~YfU)!}
-zG9aB{0thhz@_}{0FhH~A>;456h+&wGgp32~fX#pmpevjJ0R93#Vwk0bFhC>_zkGSX
-zo;~z5O+eVEvT{vQlKO+000lrbeVz3oumVu0+`9w)fir*}prZM!1grq{B25ff1EGKc
-zC5aM{0p9~cfB}XAcZ-TffBw0KhDI~?w-O>YC+Fod(Ex^d=IUyyuTRC29UuSpy?c#^
-zeE~9YA~S9r6^Z2O)BcAJH6CgMJ^J-yJUyvMlnTXL2M!3Usv7^LXGuw&Os1o&OU2VP
-z0>Am@*-L#&H}>sYRaHg3QRd>sn1A;vy&4xsOHxr$v8h)t@=~ADpjE4ANeChS)27un
-zkSGAZ(WC3@>pAfJFHlxi=51qhNg#*^z6abs{#YWB(6T6%%0Mr#Pz{X~AXr0V>&lhf
-zb}F5Yh}f#Hp8&)HQyJ#iks};<GBYz*nVa8an0vr_W8*u2{l&qOCILc-tgbF9D#}({
-zdjqf*_;Th<No_4H5zDeENlDSs(J9Hvd<-fqD46Tw@-?s(nA4?8bVLLPlA7nwug1k)
-zxNw0(2he8lqHb7FP~bOo=!lvc042b4clT|<!5!5HdV`l&_nkWd5a6FKUED%KI4pYG
-z15HdydjZ`~obZ}AuWk4Fa{vR3kxEa_oqIYux??R-qv;vEA<*m8sW168Qfm`1fJI&1
-z$yu|aBO*H15;U{i(E|)4BfUL6`80}YD~yrJPR*Ymb@C+P(VB!mnp+#H8$qsKu%N^B
-zVt~<7Y2<<h9qV5$ETj#A9uX1Vo}PRf>$C~fdY$t0jE;=#C>vVNIv4;3k&$2XYedv0
-zU;qo5EMm@_s1EY4R;6h4f!@*4-_D-h;o}j2g-jOd>3QnJiPs;$TAR<(0}P^~eCE&R
-z(@3qYFuJbp^umRaCr-TP`%)zT3;?}Tr+ntm=hNt_O~3%7q|)dG3r@XWz34Kf>iG4|
-ztXX^-|F#JjV2n%_?dci$8sisrT3H`3I&<brclQqWF92ie>!aq*jW~Y%^~5hOIryGH
-z?=xps%$f5>#IO4LGm93z9=$jgEYyt+edf*UaJ?8{R9)S<Pd|+~e!RW!#l5<tZk)Md
-z&YU-4{W!9&?(D*a5$zoBd6mNSfj(!>eCg)aR(cUa?%%nSn2-<;P|fHVV03-`>3Q=`
-zhKIM`coYG6UR`}PHnvzU??YdG>Ionw=9`%_w;ny3l9-sAo^CR9==(M{9G+Y!g#5Z~
-zTi12#4l9)<z;@uRhW$XT#2C5!+@eK<Wj~rc`PP*ytU_V=;fE$BCbX8k3QT@p-fnw)
-z_texLz**n{z+vxODUkTiJIf0ShOum-K=5$!VxK*GXxl?QD=rQ*GxKT)f|bA*^mRD`
-z+|trA>(OIgaj_UUZD?o}7WUDkNt85AL#QW_tcZ;@1@wTiz<mJp+ky&!Pphl#2<ZU~
-zAw-stkY#N>(9DdABqb$9cmMvzYqWuD09};{V1RO^GN`t;FJJ&zOQpf_@$WBM)HaR1
-z<oEA4x;g_`0|y5T=s~&BDX*l&qG8t>fKe=aDj@;(_EaRMrluiXyV}>(s1K`vd{a{u
-z<*pc|N@aZSo_52WSqK<Ceq38yOS^TeX?#C>w)CYocDuTFFDfjg&E!XfhTeaP<UYfw
-z7rL}Kw0(Q1re-OS0eoj>mYbVP%b-%J){h^rc&WJeqlpQJ`b(2Q>VpUVy?Yk|)j%{b
-z-@!qpQqi(VB$72Bf1Cu=0tvvXNt3v}_=;uOyLay%+`2X7x8KUR7G|!;#cl82y#%NP
-z4go&PmbFzkNf1Jw<mCLccI^}mjpe`+k!a_ZEgbZ!si_G&cyNcecj&=`94e1(i`0~q
-zHH#KG1K$FkT3TU8kG2Wzix;cq=jSiz+Ex8Jv!z1e&cML7`ZhWW*Dhc70@R<#Q$r*C
-z*fIW`O-xD$t5oT0*8IF>3+d46KpSF|Tz+A}g7A<Ko}Z}c8T?>E9<5vVb70`>*|_!^
-zFiN4gxOj2+(W89ydgXFwFd>h9eLIt0BkJofFI~z<ujbZ<gH);vKfg|+7Xu8J$u52V
-zd3Z<&H-;7#(t}j03}4@!Tefr>y++FA7eD<p?C4Prm$#gC7{sy}zP>v*Z|)p=0T`uJ
-zURu03G&q=cJhm!DGnkOf_3Jy6UL)o5xTQ;vQR>y&eAXbA&GPr((TVgLUSA)#Y}v8k
-z;MQM4k^D1Lsj@qfUJNjzzW&ORC80--wDJ<VOsSblmF4HRebc7Sp%;LW3dNPrJ`4H%
-z_tuO@>a_A8LbCn+w+94t9=(*xYs;3kMlUWo_(6o^eE)rC@~`1?`Ss<?Lw@_MdA&Fm
-zEX-7@CmS{dbtb*)>#u+DMabd9&78x%x-(FvdgAXNv~gqS(MzGY_W9>WUp*dqmBP#j
-zd9q={Pn}4w5h~U7rAv<<I@F|I0st(_78MlKs8k%@Qg22`UV~nxrKKs!$>n8bylv(S
-zl}c6o^l3HF!sgbdFkGRy`Q?{K4jv?g6crXeNJ*(~*xbU@*473tSz;0u)lDkB0(7N+
-z#}|N1p|Hl@e#D(S11l=h^!590+BA3ZVtSgkK}ku;&V>ty#>I*1>tlhp=}SZak~K6$
-z_Vy#MUF$26BpDf5?%r+h?9A-+_jlN^L0y1S0$&0B8(wYJdgK8k0ri$70vy%S8hZ1l
-zC1r!ew!#k!7A!k*MEy=839t+pNgr-f0S{mz0Du77di0o;oGhw{jcqK|i2z$5R9m|n
-zWj#4xF87tc7{m-<FO!|Vaic@Tl1inTH*Yq+y-5eK1pe&VQ%u?Kv{E9mX{e_$z?7=0
-zggbXc(9>gI68^cCmiOh$#+22%$dHh#b?X}6^Hu|BcJEHb&{hzO#r3+n<fZ+%a((^n
-ziHTh)yBO~C^Q+sntFhKt0qAz`j!Q8yzl+5xfB;#*x|uUMly-`rK3)6HJL-*VHNYAZ
-zlago8_!kJc;pl+_F#-XrZp{k>ty;yQ_>%hIK|qfla)1COfRBZRR3c$mmc4S}!hiSe
-z6INB}e)7rU)vI-MbU1vanHd?!H*G?Cx@yP}Pd~r@^e<LxE3hmZ86KW?<Ou5P`%IfQ
-z?~5-qHEFjX13+SYeDvnc;(`Lfm@$idec$Tc`~Luki^=?0^$uzP0000<MNUMnLSTYd
-CHXH8%
-
-diff --git a/v3p/rply/readme.txt b/v3p/rply/readme.txt
-deleted file mode 100644
-index 638124bc3f..0000000000
---- a/v3p/rply/readme.txt
-+++ /dev/null
-@@ -1,24 +0,0 @@
--June 22, 2006
--Nhon Trinh
--
--This library is downloaded from http://www.cs.princeton.edu/~diego/professional/rply on June 13, 2006
--
--Below is the description of the library on the website:
--
-----------------------------------------------------------------
--RPly is a library that lets applications read and write PLY files. The PLY file format is widely used to store geometric information, such as 3D models, but is general enough to be useful for other purposes.
--
--There are other libraries out there, of course. I tried using them and finally decided to write my own. I tried to write it in such a way that others won't have to do it again and again. Everything that made me unhappy about the existing libraries was eliminated from RPly.
--
--RPly is easy to use, well documented, small, free, open-source, ANSI C, efficient, and well tested. I will keep supporting it for a while because all my tools use the library for input/output. The highlights are:
--
--A callback mechanism that makes PLY file input straightforward;
--Support for the full range of numeric formats though the user only deals with doubles;
--Binary (big and little endian) and text modes are fully supported;
--Input and output are buffered for efficiency;
--Available under the MIT license for added freedom.
--The format was developed at Stanford University for use with their 3D scanning projects. Greg Turk's PLY library, available from Georgia Institute of Technology, seems to be the standard reference to the PLY file format, although there are some variations out there.
--
--Whatever documentation and examples were found, were taken into consideration to create RPly. In theory, since RPly doesn't try to interpret the meaning of the data in a PLY file, it should be able to read any PLY file. In practice, the library works with all PLY files that I could find.
--------------------------------------------------------------------
--
-diff --git a/v3p/rply/rply.c b/v3p/rply/rply.c
-deleted file mode 100644
-index bc99b135d2..0000000000
---- a/v3p/rply/rply.c
-+++ /dev/null
-@@ -1,1570 +0,0 @@
--/* ----------------------------------------------------------------------
-- * RPly library, read/write PLY files
-- * Diego Nehab, Princeton University
-- * http://www.cs.princeton.edu/~diego/professional/rply
-- *
-- * This library is distributed under the MIT License. See notice
-- * at the end of this file.
-- * ---------------------------------------------------------------------- */
--#include <stdio.h>
--#include <ctype.h>
--#include <assert.h>
--#include <string.h>
--#include <limits.h>
--#include <float.h>
--#include <stdarg.h>
--#include <stdlib.h>
--#include <stddef.h>
--
--#include "rply.h"
--
--/* ----------------------------------------------------------------------
-- * Make sure we get our integer types right
-- * ---------------------------------------------------------------------- */
--#if defined(_MSC_VER)
--/* We are in 2006, and some compilers still fail to define C99 types! */
--typedef __int8 t_ply_int8;
--typedef __int16 t_ply_int16;
--typedef __int32 t_ply_int32;
--typedef unsigned __int8 t_ply_uint8;
--typedef unsigned __int16 t_ply_uint16;
--typedef unsigned __int32 t_ply_uint32;
--#define PLY_INT8_MAX (127)
--#define PLY_INT8_MIN (-PLY_INT8_MAX-1)
--#define PLY_INT16_MAX (32767)
--#define PLY_INT16_MIN (-PLY_INT16_MAX-1)
--#define PLY_INT32_MAX (2147483647)
--#define PLY_INT32_MIN (-PLY_INT32_MAX-1)
--#define PLY_UINT8_MAX (255)
--#define PLY_UINT16_MAX (65535)
--#define PLY_UINT32_MAX (4294967295)
--#else
--#include <stdint.h>
--typedef int8_t t_ply_int8;
--typedef int16_t t_ply_int16;
--typedef int32_t t_ply_int32;
--typedef uint8_t t_ply_uint8;
--typedef uint16_t t_ply_uint16;
--typedef uint32_t t_ply_uint32;
--#define PLY_INT8_MIN INT8_MIN
--#define PLY_INT8_MAX INT8_MAX
--#define PLY_INT16_MIN INT16_MIN
--#define PLY_INT16_MAX INT16_MAX
--#define PLY_INT32_MIN INT32_MIN
--#define PLY_INT32_MAX INT32_MAX
--#define PLY_UINT8_MAX UINT8_MAX
--#define PLY_UINT16_MAX UINT16_MAX
--#define PLY_UINT32_MAX UINT32_MAX
--#endif
--
--/* ----------------------------------------------------------------------
-- * Constants
-- * ---------------------------------------------------------------------- */
--#define WORDSIZE 256
--#define LINESIZE 1024
--#define BUFFERSIZE (8*1024)
--
--typedef enum e_ply_io_mode_ {
--    PLY_READ,
--    PLY_WRITE
--} e_ply_io_mode;
--
--static const char *const ply_storage_mode_list[] = {
--    "binary_big_endian", "binary_little_endian", "ascii", NULL
--};     /* order matches e_ply_storage_mode enum */
--
--static const char *const ply_type_list[] = {
--    "int8", "uint8", "int16", "uint16",
--    "int32", "uint32", "float32", "float64",
--    "char", "uchar", "short", "ushort",
--    "int", "uint", "float", "double",
--    "list", NULL
--};     /* order matches e_ply_type enum */
--
--/* ----------------------------------------------------------------------
-- * Property reading callback argument
-- *
-- * element: name of element being processed
-- * property: name of property being processed
-- * nelements: number of elements of this kind in file
-- * instance_index: index current element of this kind being processed
-- * length: number of values in current list (or 1 for scalars)
-- * value_index: index of current value int this list (or 0 for scalars)
-- * value: value of property
-- * pdata/idata: user data defined with ply_set_cb
-- *
-- * Returns handle to ply file if successful, NULL otherwise.
-- * ---------------------------------------------------------------------- */
--typedef struct t_ply_argument_ {
--    p_ply_element element;
--    long instance_index;
--    p_ply_property property;
--    long length, value_index;
--    double value;
--    void *pdata;
--    long idata;
--} t_ply_argument;
--
--/* ----------------------------------------------------------------------
-- * Property information
-- *
-- * name: name of this property
-- * type: type of this property (list or type of scalar value)
-- * length_type, value_type: type of list property count and values
-- * read_cb: function to be called when this property is called
-- *
-- * Returns 1 if should continue processing file, 0 if should abort.
-- * ---------------------------------------------------------------------- */
--typedef struct t_ply_property_ {
--    char name[WORDSIZE];
--    e_ply_type type, value_type, length_type;
--    p_ply_read_cb read_cb;
--    void *pdata;
--    long idata;
--} t_ply_property;
--
--/* ----------------------------------------------------------------------
-- * Element information
-- *
-- * name: name of this property
-- * ninstances: number of elements of this type in file
-- * property: property descriptions for this element
-- * nproperty: number of properties in this element
-- *
-- * Returns 1 if should continue processing file, 0 if should abort.
-- * ---------------------------------------------------------------------- */
--typedef struct t_ply_element_ {
--    char name[WORDSIZE];
--    long ninstances;
--    p_ply_property property;
--    long nproperties;
--} t_ply_element;
--
--/* ----------------------------------------------------------------------
-- * Input/output driver
-- *
-- * Depending on file mode, different functions are used to read/write
-- * property fields. The drivers make it transparent to read/write in ascii,
-- * big endian or little endian cases.
-- * ---------------------------------------------------------------------- */
--typedef int (*p_ply_ihandler)(p_ply ply, double *value);
--typedef int (*p_ply_ichunk)(p_ply ply, void *anydata, size_t size);
--typedef struct t_ply_idriver_ {
--    p_ply_ihandler ihandler[16];
--    p_ply_ichunk ichunk;
--    const char *name;
--} t_ply_idriver;
--typedef t_ply_idriver *p_ply_idriver;
--
--typedef int (*p_ply_ohandler)(p_ply ply, double value);
--typedef int (*p_ply_ochunk)(p_ply ply, void *anydata, size_t size);
--typedef struct t_ply_odriver_ {
--    p_ply_ohandler ohandler[16];
--    p_ply_ochunk ochunk;
--    const char *name;
--} t_ply_odriver;
--typedef t_ply_odriver *p_ply_odriver;
--
--/* ----------------------------------------------------------------------
-- * Ply file handle.
-- *
-- * io_mode: read or write (from e_ply_io_mode)
-- * storage_mode: mode of file associated with handle (from e_ply_storage_mode)
-- * element: elements description for this file
-- * nelement: number of different elements in file
-- * comment: comments for this file
-- * ncomments: number of comments in file
-- * obj_info: obj_info items for this file
-- * nobj_infos: number of obj_info items in file
-- * fp: file pointer associated with ply file
-- * rn: skip extra char after end_header?
-- * buffer: last word/chunck of data read from ply file
-- * buffer_first, buffer_last: interval of untouched good data in buffer
-- * buffer_token: start of parsed token (line or word) in buffer
-- * idriver, odriver: input driver used to get property fields from file
-- * argument: storage space for callback arguments
-- * welement, wproperty: element/property type being written
-- * winstance_index: index of instance of current element being written
-- * wvalue_index: index of list property value being written
-- * wlength: number of values in list property being written
-- * error_cb: error callback
-- * pdata/idata: user data defined with ply_open/ply_create
-- * ---------------------------------------------------------------------- */
--typedef struct t_ply_ {
--    e_ply_io_mode io_mode;
--    e_ply_storage_mode storage_mode;
--    p_ply_element element;
--    long nelements;
--    char *comment;
--    long ncomments;
--    char *obj_info;
--    long nobj_infos;
--    FILE *fp;
--    int rn;
--    char buffer[BUFFERSIZE];
--    size_t buffer_first, buffer_token, buffer_last;
--    p_ply_idriver idriver;
--    p_ply_odriver odriver;
--    t_ply_argument argument;
--    long welement, wproperty;
--    long winstance_index, wvalue_index, wlength;
--    p_ply_error_cb error_cb;
--    void *pdata;
--    long idata;
--} t_ply;
--
--/* ----------------------------------------------------------------------
-- * I/O functions and drivers
-- * ---------------------------------------------------------------------- */
--static t_ply_idriver ply_idriver_ascii;
--static t_ply_idriver ply_idriver_binary;
--static t_ply_idriver ply_idriver_binary_reverse;
--static t_ply_odriver ply_odriver_ascii;
--static t_ply_odriver ply_odriver_binary;
--static t_ply_odriver ply_odriver_binary_reverse;
--
--static int ply_read_word(p_ply ply);
--static int ply_check_word(p_ply ply);
--static int ply_read_line(p_ply ply);
--static int ply_check_line(p_ply ply);
--static int ply_read_chunk(p_ply ply, void *anybuffer, size_t size);
--static int ply_read_chunk_reverse(p_ply ply, void *anybuffer, size_t size);
--static int ply_write_chunk(p_ply ply, void *anybuffer, size_t size);
--static int ply_write_chunk_reverse(p_ply ply, void *anybuffer, size_t size);
--static void ply_reverse(void *anydata, size_t size);
--
--/* ----------------------------------------------------------------------
-- * String functions
-- * ---------------------------------------------------------------------- */
--static int ply_find_string(const char *item, const char* const list[]);
--static p_ply_element ply_find_element(p_ply ply, const char *name);
--static p_ply_property ply_find_property(p_ply_element element,
--                                        const char *name);
--
--/* ----------------------------------------------------------------------
-- * Header parsing
-- * ---------------------------------------------------------------------- */
--static int ply_read_header_magic(p_ply ply);
--static int ply_read_header_format(p_ply ply);
--static int ply_read_header_comment(p_ply ply);
--static int ply_read_header_obj_info(p_ply ply);
--static int ply_read_header_property(p_ply ply);
--static int ply_read_header_element(p_ply ply);
--
--/* ----------------------------------------------------------------------
-- * Error handling
-- * ---------------------------------------------------------------------- */
--static void ply_error_cb(p_ply ply, const char *message);
--static void ply_ferror(p_ply ply, const char *fmt, ...);
--
--/* ----------------------------------------------------------------------
-- * Memory allocation and initialization
-- * ---------------------------------------------------------------------- */
--static void ply_init(p_ply ply);
--static void ply_element_init(p_ply_element element);
--static void ply_property_init(p_ply_property property);
--static p_ply ply_alloc(void);
--static p_ply_element ply_grow_element(p_ply ply);
--static p_ply_property ply_grow_property(p_ply ply, p_ply_element element);
--static void *ply_grow_array(p_ply ply, void **pointer, long *nmemb, long size);
--
--/* ----------------------------------------------------------------------
-- * Special functions
-- * ---------------------------------------------------------------------- */
--static e_ply_storage_mode ply_arch_endian(void);
--static int ply_type_check(void);
--
--/* ----------------------------------------------------------------------
-- * Auxiliary read functions
-- * ---------------------------------------------------------------------- */
--static int ply_read_element(p_ply ply, p_ply_element element,
--                            p_ply_argument argument);
--static int ply_read_property(p_ply ply, p_ply_element element,
--                             p_ply_property property, p_ply_argument argument);
--static int ply_read_list_property(p_ply ply, p_ply_element element,
--                                  p_ply_property property, p_ply_argument argument);
--static int ply_read_scalar_property(p_ply ply, p_ply_element element,
--                                    p_ply_property property, p_ply_argument argument);
--
--/* ----------------------------------------------------------------------
-- * Buffer support functions
-- * ---------------------------------------------------------------------- */
--/* pointers to tokenized word and line in buffer */
--#define BWORD(p) (p->buffer + p->buffer_token)
--#define BLINE(p) (p->buffer + p->buffer_token)
--
--/* pointer to start of untouched bytes in buffer */
--#define BFIRST(p) (p->buffer + p->buffer_first)
--
--/* number of bytes untouched in buffer */
--#define BSIZE(p) (p->buffer_last - p->buffer_first)
--
--/* consumes data from buffer */
--#define BSKIP(p, s) (p->buffer_first += s)
--
--/* refills the buffer */
--static int BREFILL(p_ply ply) {
--    /* move untouched data to beginning of buffer */
--    size_t size = BSIZE(ply);
--    memmove(ply->buffer, BFIRST(ply), size);
--    ply->buffer_last = size;
--    ply->buffer_first = ply->buffer_token = 0;
--    /* fill remaining with new data */
--    size = fread(ply->buffer+size, 1, BUFFERSIZE-size-1, ply->fp);
--    /* place sentinel so we can use str* functions with buffer */
--    ply->buffer[BUFFERSIZE-1] = '\0';
--    /* check if read failed */
--    if (size <= 0) return 0;
--    /* increase size to account for new data */
--    ply->buffer_last += size;
--    return 1;
--}
--
--/* ----------------------------------------------------------------------
-- * Exported functions
-- * ---------------------------------------------------------------------- */
--/* ----------------------------------------------------------------------
-- * Read support functions
-- * ---------------------------------------------------------------------- */
--/* We don't care about end-of-line, generally, because we
-- * separate words by any white-space character.
-- * Unfortunately, in binary mode, right after 'end_header',
-- * we have to know *exactly* how many characters to skip */
--/* We use the end-of-line marker after the 'ply' magic
-- * number to figure out what to do */
--static int ply_read_header_magic(p_ply ply) {
--    char *magic = ply->buffer;
--    if (!BREFILL(ply)) {
--      ply->error_cb(ply, "Unable to read magic number from file");
--      return 0;
--    }
--    /* check if it is ply */
--    if (magic[0] != 'p' || magic[1] != 'l' || magic[2] != 'y'
--        || !isspace(magic[3])) {
--      ply->error_cb(ply, "Wrong magic number. Expected 'ply'");
--      return 0;
--    }
--    /* figure out if we have to skip the extra character */
--    ply->rn = magic[3] == '\r' && magic[4] == '\n';
--    BSKIP(ply, 3);
--    return 1;
--}
--
--p_ply ply_open(const char *name, p_ply_error_cb error_cb,
--               long idata, void *pdata) {
--    FILE *fp = NULL;
--    p_ply ply = ply_alloc();
--    if (error_cb == NULL) error_cb = ply_error_cb;
--    if (!ply) {
--        error_cb(NULL, "Out of memory");
--        return NULL;
--    }
--    ply->idata = idata;
--    ply->pdata = pdata;
--    ply->io_mode = PLY_READ;
--    ply->error_cb = error_cb;
--    if (!ply_type_check()) {
--        error_cb(ply, "Incompatible type system");
--        free(ply);
--        return NULL;
--    }
--    assert(name);
--    fp = fopen(name, "rb");
--    if (!fp) {
--        error_cb(ply, "Unable to open file");
--        free(ply);
--        return NULL;
--    }
--    ply->fp = fp;
--    return ply;
--}
--
--int ply_read_header(p_ply ply) {
--    assert(ply && ply->fp && ply->io_mode == PLY_READ);
--    if (!ply_read_header_magic(ply)) return 0;
--    if (!ply_read_word(ply)) return 0;
--    /* parse file format */
--    if (!ply_read_header_format(ply)) {
--      ply_ferror(ply, "Invalid file format");
--      return 0;
--    }
--    /* parse elements, comments or obj_infos until the end of header */
--    while (strcmp(BWORD(ply), "end_header")) {
--        if (!ply_read_header_comment(ply) &&
--            !ply_read_header_element(ply) &&
--            !ply_read_header_obj_info(ply)) {
--          ply_ferror(ply, "Unexpected token '%s'", BWORD(ply));
--          return 0;
--        }
--    }
--    /* skip extra character? */
--    if (ply->rn) {
--        if (BSIZE(ply) < 1 && !BREFILL(ply)) {
--          ply_ferror(ply, "Unexpected end of file");
--          return 0;
--        }
--        BSKIP(ply, 1);
--    }
--    return 1;
--}
--
--long ply_set_read_cb(p_ply ply, const char *element_name,
--                     const char* property_name, p_ply_read_cb read_cb,
--                     void *pdata, long idata) {
--    p_ply_element element = NULL;
--    p_ply_property property = NULL;
--    assert(ply && element_name && property_name);
--    element = ply_find_element(ply, element_name);
--    if (!element) return 0;
--    property = ply_find_property(element, property_name);
--    if (!property) return 0;
--    property->read_cb = read_cb;
--    property->pdata = pdata;
--    property->idata = idata;
--    return (int) element->ninstances;
--}
--
--int ply_read(p_ply ply) {
--    long i;
--    p_ply_argument argument;
--    assert(ply && ply->fp && ply->io_mode == PLY_READ);
--    argument = &ply->argument;
--    /* for each element type */
--    for (i = 0; i < ply->nelements; i++) {
--        p_ply_element element = &ply->element[i];
--        argument->element = element;
--        if (!ply_read_element(ply, element, argument))
--            return 0;
--    }
--    return 1;
--}
--
--/* ----------------------------------------------------------------------
-- * Write support functions
-- * ---------------------------------------------------------------------- */
--p_ply ply_create(const char *name, e_ply_storage_mode storage_mode,
--                 p_ply_error_cb error_cb, long idata, void *pdata) {
--    FILE *fp = NULL;
--    p_ply ply = ply_alloc();
--    if (error_cb == NULL) error_cb = ply_error_cb;
--    if (!ply) {
--        error_cb(NULL, "Out of memory");
--        return NULL;
--    }
--    if (!ply_type_check()) {
--        error_cb(ply, "Incompatible type system");
--        free(ply);
--        return NULL;
--    }
--    assert(name && storage_mode <= PLY_DEFAULT);
--    fp = fopen(name, "wb");
--    if (!fp) {
--        error_cb(ply, "Unable to create file");
--        free(ply);
--        return NULL;
--    }
--    ply->idata = idata;
--    ply->pdata = pdata;
--    ply->io_mode = PLY_WRITE;
--    if (storage_mode == PLY_DEFAULT) storage_mode = ply_arch_endian();
--    if (storage_mode == PLY_ASCII) ply->odriver = &ply_odriver_ascii;
--    else if (storage_mode == ply_arch_endian())
--        ply->odriver = &ply_odriver_binary;
--    else ply->odriver = &ply_odriver_binary_reverse;
--    ply->storage_mode = storage_mode;
--    ply->fp = fp;
--    ply->error_cb = error_cb;
--    return ply;
--}
--
--int ply_add_element(p_ply ply, const char *name, long ninstances) {
--    p_ply_element element = NULL;
--    assert(ply && ply->fp && ply->io_mode == PLY_WRITE);
--    assert(name && strlen(name) < WORDSIZE && ninstances >= 0);
--    if (strlen(name) >= WORDSIZE || ninstances < 0) {
--        ply_ferror(ply, "Invalid arguments");
--        return 0;
--    }
--    element = ply_grow_element(ply);
--    if (!element) return 0;
--    strcpy(element->name, name);
--    element->ninstances = ninstances;
--    return 1;
--}
--
--int ply_add_scalar_property(p_ply ply, const char *name, e_ply_type type) {
--    p_ply_element element = NULL;
--    p_ply_property property = NULL;
--    assert(ply && ply->fp && ply->io_mode == PLY_WRITE);
--    assert(name && strlen(name) < WORDSIZE);
--    assert(type < PLY_LIST);
--    if (strlen(name) >= WORDSIZE || type >= PLY_LIST) {
--        ply_ferror(ply, "Invalid arguments");
--        return 0;
--    }
--    element = &ply->element[ply->nelements-1];
--    property = ply_grow_property(ply, element);
--    if (!property) return 0;
--    strcpy(property->name, name);
--    property->type = type;
--    return 1;
--}
--
--int ply_add_list_property(p_ply ply, const char *name,
--                          e_ply_type length_type, e_ply_type value_type) {
--    p_ply_element element = NULL;
--    p_ply_property property = NULL;
--    assert(ply && ply->fp && ply->io_mode == PLY_WRITE);
--    assert(name && strlen(name) < WORDSIZE);
--    if (strlen(name) >= WORDSIZE) {
--        ply_ferror(ply, "Invalid arguments");
--        return 0;
--    }
--    assert(length_type < PLY_LIST);
--    assert(value_type < PLY_LIST);
--    if (length_type >= PLY_LIST || value_type >= PLY_LIST) {
--        ply_ferror(ply, "Invalid arguments");
--        return 0;
--    }
--    element = &ply->element[ply->nelements-1];
--    property = ply_grow_property(ply, element);
--    if (!property) return 0;
--    strcpy(property->name, name);
--    property->type = PLY_LIST;
--    property->length_type = length_type;
--    property->value_type = value_type;
--    return 1;
--}
--
--int ply_add_property(p_ply ply, const char *name, e_ply_type type,
--                     e_ply_type length_type, e_ply_type value_type) {
--    if (type == PLY_LIST)
--        return ply_add_list_property(ply, name, length_type, value_type);
--    else
--        return ply_add_scalar_property(ply, name, type);
--}
--
--int ply_add_comment(p_ply ply, const char *comment) {
--    char *new_comment = NULL;
--    assert(ply && comment && strlen(comment) < LINESIZE);
--    if (!comment || strlen(comment) >= LINESIZE) {
--        ply_ferror(ply, "Invalid arguments");
--        return 0;
--    }
--    new_comment = (char *) ply_grow_array(ply, (void **) &ply->comment,
--            &ply->ncomments, LINESIZE);
--    if (!new_comment) return 0;
--    strcpy(new_comment, comment);
--    return 1;
--}
--
--int ply_add_obj_info(p_ply ply, const char *obj_info) {
--    char *new_obj_info = NULL;
--    assert(ply && obj_info && strlen(obj_info) < LINESIZE);
--    if (!obj_info || strlen(obj_info) >= LINESIZE) {
--        ply_ferror(ply, "Invalid arguments");
--        return 0;
--    }
--    new_obj_info = (char *) ply_grow_array(ply, (void **) &ply->obj_info,
--            &ply->nobj_infos, LINESIZE);
--    if (!new_obj_info) return 0;
--    strcpy(new_obj_info, obj_info);
--    return 1;
--}
--
--int ply_write_header(p_ply ply) {
--    long i, j;
--    assert(ply && ply->fp && ply->io_mode == PLY_WRITE);
--    assert(ply->element || ply->nelements == 0);
--    assert(!ply->element || ply->nelements > 0);
--    if (fprintf(ply->fp, "ply\nformat %s 1.0\n",
--                ply_storage_mode_list[ply->storage_mode]) <= 0) goto error;
--    for (i = 0; i < ply->ncomments; i++)
--        if (fprintf(ply->fp, "comment %s\n", ply->comment + LINESIZE*i) <= 0)
--            goto error;
--    for (i = 0; i < ply->nobj_infos; i++)
--        if (fprintf(ply->fp, "obj_info %s\n", ply->obj_info + LINESIZE*i) <= 0)
--            goto error;
--    for (i = 0; i < ply->nelements; i++) {
--        p_ply_element element = &ply->element[i];
--        assert(element->property || element->nproperties == 0);
--        assert(!element->property || element->nproperties > 0);
--        if (fprintf(ply->fp, "element %s %ld\n", element->name,
--                    element->ninstances) <= 0) goto error;
--        for (j = 0; j < element->nproperties; j++) {
--            p_ply_property property = &element->property[j];
--            if (property->type == PLY_LIST) {
--                if (fprintf(ply->fp, "property list %s %s %s\n",
--                            ply_type_list[property->length_type],
--                            ply_type_list[property->value_type],
--                            property->name) <= 0) goto error;
--            } else {
--                if (fprintf(ply->fp, "property %s %s\n",
--                            ply_type_list[property->type],
--                            property->name) <= 0) goto error;
--            }
--        }
--    }
--    return fprintf(ply->fp, "end_header\n") > 0;
--error:
--    ply_ferror(ply, "Error writing to file");
--    return 0;
--}
--
--int ply_write(p_ply ply, double value) {
--    p_ply_element element = NULL;
--    p_ply_property property = NULL;
--    int type = -1;
--    int breakafter = 0;
--    if (ply->welement > ply->nelements) return 0;
--    element = &ply->element[ply->welement];
--    if (ply->wproperty > element->nproperties) return 0;
--    property = &element->property[ply->wproperty];
--    if (property->type == PLY_LIST) {
--        if (ply->wvalue_index == 0) {
--            type = property->length_type;
--            ply->wlength = (long) value;
--        } else type = property->value_type;
--    } else {
--        type = property->type;
--        ply->wlength = 0;
--    }
--    if (!ply->odriver->ohandler[type](ply, value)) {
--        ply_ferror(ply, "Failed writing %s of %s %d (%s: %s)",
--                   property->name, element->name,
--                   ply->winstance_index,
--                   ply->odriver->name, ply_type_list[type]);
--        return 0;
--    }
--    ply->wvalue_index++;
--    if (ply->wvalue_index > ply->wlength) {
--        ply->wvalue_index = 0;
--        ply->wproperty++;
--    }
--    if (ply->wproperty >= element->nproperties) {
--        ply->wproperty = 0;
--        ply->winstance_index++;
--        if (ply->storage_mode == PLY_ASCII) breakafter = 1;
--    }
--    if (ply->winstance_index >= element->ninstances) {
--        ply->winstance_index = 0;
--        ply->welement++;
--    }
--    return !breakafter || putc('\n', ply->fp) > 0;
--}
--
--int ply_close(p_ply ply) {
--    long i;
--    assert(ply && ply->fp);
--    assert(ply->element || ply->nelements == 0);
--    assert(!ply->element || ply->nelements > 0);
--    /* write last chunk to file */
--    if (ply->io_mode == PLY_WRITE &&
--        fwrite(ply->buffer, 1, ply->buffer_last, ply->fp) < ply->buffer_last) {
--      ply_ferror(ply, "Error closing up");
--      return 0;
--    }
--    fclose(ply->fp);
--    /* free all memory used by handle */
--    if (ply->element) {
--        for (i = 0; i < ply->nelements; i++) {
--            p_ply_element element = &ply->element[i];
--            if (element->property) free(element->property);
--        }
--        free(ply->element);
--    }
--    if (ply->obj_info) free(ply->obj_info);
--    if (ply->comment) free(ply->comment);
--    free(ply);
--    return 1;
--}
--
--/* ----------------------------------------------------------------------
-- * Query support functions
-- * ---------------------------------------------------------------------- */
--p_ply_element ply_get_next_element(p_ply ply,
--                                   p_ply_element last) {
--    assert(ply);
--    if (!last) return ply->element;
--    last++;
--    if (last < ply->element + ply->nelements) return last;
--    else return NULL;
--}
--
--int ply_get_element_info(p_ply_element element, const char** name,
--                         long *ninstances) {
--    assert(element);
--    if (name) *name = element->name;
--    if (ninstances) *ninstances = (long) element->ninstances;
--    return 1;
--}
--
--p_ply_property ply_get_next_property(p_ply_element element,
--                                     p_ply_property last) {
--    assert(element);
--    if (!last) return element->property;
--    last++;
--    if (last < element->property + element->nproperties) return last;
--    else return NULL;
--}
--
--int ply_get_property_info(p_ply_property property, const char** name,
--                          e_ply_type *type, e_ply_type *length_type, e_ply_type *value_type) {
--    assert(property);
--    if (name) *name = property->name;
--    if (type) *type = property->type;
--    if (length_type) *length_type = property->length_type;
--    if (value_type) *value_type = property->value_type;
--    return 1;
--}
--
--const char *ply_get_next_comment(p_ply ply, const char *last) {
--    assert(ply);
--    if (!last) return ply->comment;
--    last += LINESIZE;
--    if (last < ply->comment + LINESIZE*ply->ncomments) return last;
--    else return NULL;
--}
--
--const char *ply_get_next_obj_info(p_ply ply, const char *last) {
--    assert(ply);
--    if (!last) return ply->obj_info;
--    last += LINESIZE;
--    if (last < ply->obj_info + LINESIZE*ply->nobj_infos) return last;
--    else return NULL;
--}
--
--/* ----------------------------------------------------------------------
-- * Callback argument support functions
-- * ---------------------------------------------------------------------- */
--int ply_get_argument_element(p_ply_argument argument,
--                             p_ply_element *element, long *instance_index) {
--    assert(argument);
--    if (!argument) return 0;
--    if (element) *element = argument->element;
--    if (instance_index) *instance_index = argument->instance_index;
--    return 1;
--}
--
--int ply_get_argument_property(p_ply_argument argument,
--                              p_ply_property *property, long *length, long *value_index) {
--    assert(argument);
--    if (!argument) return 0;
--    if (property) *property = argument->property;
--    if (length) *length = argument->length;
--    if (value_index) *value_index = argument->value_index;
--    return 1;
--}
--
--int ply_get_argument_user_data(p_ply_argument argument, void **pdata,
--                               long *idata) {
--    assert(argument);
--    if (!argument) return 0;
--    if (pdata) *pdata = argument->pdata;
--    if (idata) *idata = argument->idata;
--    return 1;
--}
--
--double ply_get_argument_value(p_ply_argument argument) {
--    assert(argument);
--    if (!argument) return 0.0;
--    return argument->value;
--}
--
--/* ----------------------------------------------------------------------
-- * Internal functions
-- * ---------------------------------------------------------------------- */
--static int ply_read_list_property(p_ply ply, p_ply_element element,
--                                  p_ply_property property, p_ply_argument argument) {
--    int l;
--    p_ply_read_cb read_cb = property->read_cb;
--    p_ply_ihandler *driver = ply->idriver->ihandler;
--    /* get list length */
--    p_ply_ihandler handler = driver[property->length_type];
--    double length;
--    if (!handler(ply, &length)) {
--        ply_ferror(ply, "Error reading '%s' of '%s' number %d",
--                   property->name, element->name, argument->instance_index);
--        return 0;
--    }
--    /* invoke callback to pass length in value field */
--    argument->length = (long) length;
--    argument->value_index = -1;
--    argument->value = length;
--    if (read_cb && !read_cb(argument)) {
--        ply_ferror(ply, "Aborted by user");
--        return 0;
--    }
--    /* read list values */
--    handler = driver[property->value_type];
--    /* for each value in list */
--    for (l = 0; l < (long) length; l++) {
--        /* read value from file */
--        argument->value_index = l;
--        if (!handler(ply, &argument->value)) {
--            ply_ferror(ply, "Error reading value number %d of '%s' of "
--                       "'%s' number %d", l+1, property->name,
--                       element->name, argument->instance_index);
--            return 0;
--        }
--        /* invoke callback to pass value */
--        if (read_cb && !read_cb(argument)) {
--            ply_ferror(ply, "Aborted by user");
--            return 0;
--        }
--    }
--    return 1;
--}
--
--static int ply_read_scalar_property(p_ply ply, p_ply_element element,
--                                    p_ply_property property, p_ply_argument argument) {
--    p_ply_read_cb read_cb = property->read_cb;
--    p_ply_ihandler *driver = ply->idriver->ihandler;
--    p_ply_ihandler handler = driver[property->type];
--    argument->length = 1;
--    argument->value_index = 0;
--    if (!handler(ply, &argument->value)) {
--        ply_ferror(ply, "Error reading '%s' of '%s' number %d",
--                   property->name, element->name, argument->instance_index);
--        return 0;
--    }
--    if (read_cb && !read_cb(argument)) {
--        ply_ferror(ply, "Aborted by user");
--        return 0;
--    }
--    return 1;
--}
--
--static int ply_read_property(p_ply ply, p_ply_element element,
--                             p_ply_property property, p_ply_argument argument) {
--    if (property->type == PLY_LIST)
--        return ply_read_list_property(ply, element, property, argument);
--    else
--        return ply_read_scalar_property(ply, element, property, argument);
--}
--
--static int ply_read_element(p_ply ply, p_ply_element element,
--                            p_ply_argument argument) {
--    long j, k;
--    /* for each element of this type */
--    for (j = 0; j < element->ninstances; j++) {
--        argument->instance_index = j;
--        /* for each property */
--        for (k = 0; k < element->nproperties; k++) {
--            p_ply_property property = &element->property[k];
--            argument->property = property;
--            argument->pdata = property->pdata;
--            argument->idata = property->idata;
--            if (!ply_read_property(ply, element, property, argument))
--                return 0;
--        }
--    }
--    return 1;
--}
--
--static int ply_find_string(const char *item, const char* const list[]) {
--    int i;
--    assert(item && list);
--    for (i = 0; list[i]; i++)
--        if (!strcmp(list[i], item)) return i;
--    return -1;
--}
--
--static p_ply_element ply_find_element(p_ply ply, const char *name) {
--    p_ply_element element;
--    int i, nelements;
--    assert(ply && name);
--    element = ply->element;
--    nelements = ply->nelements;
--    assert(element || nelements == 0);
--    assert(!element || nelements > 0);
--    for (i = 0; i < nelements; i++)
--        if (!strcmp(element[i].name, name)) return &element[i];
--    return NULL;
--}
--
--static p_ply_property ply_find_property(p_ply_element element,
--                                        const char *name) {
--    p_ply_property property;
--    int i, nproperties;
--    assert(element && name);
--    property = element->property;
--    nproperties = element->nproperties;
--    assert(property || nproperties == 0);
--    assert(!property || nproperties > 0);
--    for (i = 0; i < nproperties; i++)
--        if (!strcmp(property[i].name, name)) return &property[i];
--    return NULL;
--}
--
--static int ply_check_word(p_ply ply) {
--    if (strlen(BLINE(ply)) >= WORDSIZE) {
--        ply_ferror(ply, "Word too long");
--        return 0;
--    }
--    return 1;
--}
--
--static int ply_read_word(p_ply ply) {
--    size_t t = 0;
--    assert(ply && ply->fp && ply->io_mode == PLY_READ);
--    /* skip leading blanks */
--    while (1) {
--        t = strspn(BFIRST(ply), " \n\r\t");
--        /* check if all buffer was made of blanks */
--        if (t >= BSIZE(ply)) {
--            if (!BREFILL(ply)) {
--                ply_ferror(ply, "Unexpected end of file");
--                return 0;
--            }
--        } else break;
--    }
--    BSKIP(ply, t);
--    /* look for a space after the current word */
--    t = strcspn(BFIRST(ply), " \n\r\t");
--    /* if we didn't reach the end of the buffer, we are done */
--    if (t < BSIZE(ply)) {
--        ply->buffer_token = ply->buffer_first;
--        BSKIP(ply, t);
--        *BFIRST(ply) = '\0';
--        BSKIP(ply, 1);
--        return ply_check_word(ply);
--    }
--    /* otherwise, try to refill buffer */
--    if (!BREFILL(ply)) {
--        ply_ferror(ply, "Unexpected end of file");
--        return 0;
--    }
--    /* keep looking from where we left */
--    t += strcspn(BFIRST(ply) + t, " \n\r\t");
--    /* check if the token is too large for our buffer */
--    if (t >= BSIZE(ply)) {
--        ply_ferror(ply, "Token too large");
--        return 0;
--    }
--    /* we are done */
--    ply->buffer_token = ply->buffer_first;
--    BSKIP(ply, t);
--    *BFIRST(ply) = '\0';
--    BSKIP(ply, 1);
--    return ply_check_word(ply);
--}
--
--static int ply_check_line(p_ply ply) {
--    if (strlen(BLINE(ply)) >= LINESIZE) {
--        ply_ferror(ply, "Line too long");
--        return 0;
--    }
--    return 1;
--}
--
--static int ply_read_line(p_ply ply) {
--    const char *end = NULL;
--    assert(ply && ply->fp && ply->io_mode == PLY_READ);
--    /* look for a end of line */
--    end = strchr(BFIRST(ply), '\n');
--    /* if we didn't reach the end of the buffer, we are done */
--    if (end) {
--        ply->buffer_token = ply->buffer_first;
--        BSKIP(ply, end - BFIRST(ply));
--        *BFIRST(ply) = '\0';
--        BSKIP(ply, 1);
--        return ply_check_line(ply);
--    } else {
--        end = ply->buffer + BSIZE(ply);
--        /* otherwise, try to refill buffer */
--        if (!BREFILL(ply)) {
--            ply_ferror(ply, "Unexpected end of file");
--            return 0;
--        }
--    }
--    /* keep looking from where we left */
--    end = strchr(end, '\n');
--    /* check if the token is too large for our buffer */
--    if (!end) {
--        ply_ferror(ply, "Token too large");
--        return 0;
--    }
--    /* we are done */
--    ply->buffer_token = ply->buffer_first;
--    BSKIP(ply, end - BFIRST(ply));
--    *BFIRST(ply) = '\0';
--    BSKIP(ply, 1);
--    return ply_check_line(ply);
--}
--
--static int ply_read_chunk(p_ply ply, void *anybuffer, size_t size) {
--    char *buffer = (char *) anybuffer;
--    size_t i = 0;
--    assert(ply && ply->fp && ply->io_mode == PLY_READ);
--    assert(ply->buffer_first <= ply->buffer_last);
--    while (i < size) {
--        if (ply->buffer_first < ply->buffer_last) {
--            buffer[i] = ply->buffer[ply->buffer_first];
--            ply->buffer_first++;
--            i++;
--        } else {
--            ply->buffer_first = 0;
--            ply->buffer_last = fread(ply->buffer, 1, BUFFERSIZE, ply->fp);
--            if (ply->buffer_last <= 0) return 0;
--        }
--    }
--    return 1;
--}
--
--static int ply_write_chunk(p_ply ply, void *anybuffer, size_t size) {
--    char *buffer = (char *) anybuffer;
--    size_t i = 0;
--    assert(ply && ply->fp && ply->io_mode == PLY_WRITE);
--    assert(ply->buffer_last <= BUFFERSIZE);
--    while (i < size) {
--        if (ply->buffer_last < BUFFERSIZE) {
--            ply->buffer[ply->buffer_last] = buffer[i];
--            ply->buffer_last++;
--            i++;
--        } else {
--            ply->buffer_last = 0;
--            if (fwrite(ply->buffer, 1, BUFFERSIZE, ply->fp) < BUFFERSIZE)
--                return 0;
--        }
--    }
--    return 1;
--}
--
--static int ply_write_chunk_reverse(p_ply ply, void *anybuffer, size_t size) {
--    int ret = 0;
--    ply_reverse(anybuffer, size);
--    ret = ply_write_chunk(ply, anybuffer, size);
--    ply_reverse(anybuffer, size);
--    return ret;
--}
--
--static int ply_read_chunk_reverse(p_ply ply, void *anybuffer, size_t size) {
--    if (!ply_read_chunk(ply, anybuffer, size)) return 0;
--    ply_reverse(anybuffer, size);
--    return 1;
--}
--
--static void ply_reverse(void *anydata, size_t size) {
--    char *data = (char *) anydata;
--    char temp;
--    size_t i;
--    for (i = 0; i < size/2; i++) {
--        temp = data[i];
--        data[i] = data[size-i-1];
--        data[size-i-1] = temp;
--    }
--}
--
--static void ply_init(p_ply ply) {
--    ply->element = NULL;
--    ply->nelements = 0;
--    ply->comment = NULL;
--    ply->ncomments = 0;
--    ply->obj_info = NULL;
--    ply->nobj_infos = 0;
--    ply->idriver = NULL;
--    ply->odriver = NULL;
--    ply->buffer[0] = '\0';
--    ply->buffer_first = ply->buffer_last = ply->buffer_token = 0;
--    ply->welement = 0;
--    ply->wproperty = 0;
--    ply->winstance_index = 0;
--    ply->wlength = 0;
--    ply->wvalue_index = 0;
--}
--
--static void ply_element_init(p_ply_element element) {
--    element->name[0] = '\0';
--    element->ninstances = 0;
--    element->property = NULL;
--    element->nproperties = 0;
--}
--
--static void ply_property_init(p_ply_property property) {
--    property->name[0] = '\0';
--    property->type = -1;
--    property->length_type = -1;
--    property->value_type = -1;
--    property->read_cb = (p_ply_read_cb) NULL;
--    property->pdata = NULL;
--    property->idata = 0;
--}
--
--static p_ply ply_alloc(void) {
--    p_ply ply = (p_ply) malloc(sizeof(t_ply));
--    if (!ply) return NULL;
--    ply_init(ply);
--    return ply;
--}
--
--static void *ply_grow_array(p_ply ply, void **pointer,
--                            long *nmemb, long size) {
--    void *temp = *pointer;
--    long count = *nmemb + 1;
--    if (!temp) temp = malloc(count*size);
--    else {
--      void * newtmp= realloc(temp, count*size);
--      if (newtmp == NULL ) {
--        ply_ferror(ply, "Out of memory");
--        return NULL;
--      }
--      else {
--        temp = newtmp;
--      }
--    }
--    *pointer = temp;
--    *nmemb = count;
--    return (char *) temp + (count-1) * size;
--}
--
--static p_ply_element ply_grow_element(p_ply ply) {
--    p_ply_element element = NULL;
--    assert(ply);
--    assert(ply->element || ply->nelements == 0);
--    assert(!ply->element || ply->nelements > 0);
--    element = (p_ply_element) ply_grow_array(ply, (void **) &ply->element,
--            &ply->nelements, sizeof(t_ply_element));
--    if (!element) return NULL;
--    ply_element_init(element);
--    return element;
--}
--
--static p_ply_property ply_grow_property(p_ply ply, p_ply_element element) {
--    p_ply_property property = NULL;
--    assert(ply);
--    assert(element);
--    assert(element->property || element->nproperties == 0);
--    assert(!element->property || element->nproperties > 0);
--    property = (p_ply_property) ply_grow_array(ply,
--            (void **) &element->property,
--            &element->nproperties, sizeof(t_ply_property));
--    if (!property) return NULL;
--    ply_property_init(property);
--    return property;
--}
--
--static int ply_read_header_format(p_ply ply) {
--    assert(ply && ply->fp && ply->io_mode == PLY_READ);
--    if (strcmp(BWORD(ply), "format")) return 0;
--    if (!ply_read_word(ply)) return 0;
--    ply->storage_mode = ply_find_string(BWORD(ply), ply_storage_mode_list);
--    if (ply->storage_mode == (e_ply_storage_mode) (-1)) return 0;
--    if (ply->storage_mode == PLY_ASCII) ply->idriver = &ply_idriver_ascii;
--    else if (ply->storage_mode == ply_arch_endian())
--        ply->idriver = &ply_idriver_binary;
--    else ply->idriver = &ply_idriver_binary_reverse;
--    if (!ply_read_word(ply)) return 0;
--    if (strcmp(BWORD(ply), "1.0")) return 0;
--    if (!ply_read_word(ply)) return 0;
--    return 1;
--}
--
--static int ply_read_header_comment(p_ply ply) {
--    assert(ply && ply->fp && ply->io_mode == PLY_READ);
--    if (strcmp(BWORD(ply), "comment")) return 0;
--    if (!ply_read_line(ply)) return 0;
--    if (!ply_add_comment(ply, BLINE(ply))) return 0;
--    if (!ply_read_word(ply)) return 0;
--    return 1;
--}
--
--static int ply_read_header_obj_info(p_ply ply) {
--    assert(ply && ply->fp && ply->io_mode == PLY_READ);
--    if (strcmp(BWORD(ply), "obj_info")) return 0;
--    if (!ply_read_line(ply)) return 0;
--    if (!ply_add_obj_info(ply, BLINE(ply))) return 0;
--    if (!ply_read_word(ply)) return 0;
--    return 1;
--}
--
--static int ply_read_header_property(p_ply ply) {
--    p_ply_element element = NULL;
--    p_ply_property property = NULL;
--    /* make sure it is a property */
--    if (strcmp(BWORD(ply), "property")) return 0;
--    element = &ply->element[ply->nelements-1];
--    property = ply_grow_property(ply, element);
--    if (!property) return 0;
--    /* get property type */
--    if (!ply_read_word(ply)) return 0;
--    property->type = ply_find_string(BWORD(ply), ply_type_list);
--    if (property->type == (e_ply_type) (-1)) return 0;
--    if (property->type == PLY_LIST) {
--        /* if it's a list, we need the base types */
--        if (!ply_read_word(ply)) return 0;
--        property->length_type = ply_find_string(BWORD(ply), ply_type_list);
--        if (property->length_type == (e_ply_type) (-1)) return 0;
--        if (!ply_read_word(ply)) return 0;
--        property->value_type = ply_find_string(BWORD(ply), ply_type_list);
--        if (property->value_type == (e_ply_type) (-1)) return 0;
--    }
--    /* get property name */
--    if (!ply_read_word(ply)) return 0;
--    strcpy(property->name, BWORD(ply));
--    if (!ply_read_word(ply)) return 0;
--    return 1;
--}
--
--static int ply_read_header_element(p_ply ply) {
--    p_ply_element element = NULL;
--    long dummy;
--    assert(ply && ply->fp && ply->io_mode == PLY_READ);
--    if (strcmp(BWORD(ply), "element")) return 0;
--    /* allocate room for new element */
--    element = ply_grow_element(ply);
--    if (!element) return 0;
--    /* get element name */
--    if (!ply_read_word(ply)) return 0;
--    strcpy(element->name, BWORD(ply));
--    /* get number of elements of this type */
--    if (!ply_read_word(ply)) return 0;
--    if (sscanf(BWORD(ply), "%ld", &dummy) != 1) {
--        ply_ferror(ply, "Expected number got '%s'", BWORD(ply));
--        return 0;
--    }
--    element->ninstances = dummy;
--    /* get all properties for this element */
--    if (!ply_read_word(ply)) return 0;
--    while (ply_read_header_property(ply) ||
--           ply_read_header_comment(ply) || ply_read_header_obj_info(ply))
--        /* do nothing */;
--    return 1;
--}
--
--static void ply_error_cb(p_ply ply, const char *message) {
--    (void) ply;
--    fprintf(stderr, "RPly: %s\n", message);
--}
--
--static void ply_ferror(p_ply ply, const char *fmt, ...) {
--    char buffer[1024];
--    va_list ap;
--    va_start(ap, fmt);
--    vsprintf(buffer, fmt, ap);
--    va_end(ap);
--    ply->error_cb(ply, buffer);
--}
--
--static e_ply_storage_mode ply_arch_endian(void) {
--    unsigned long i = 1;
--    unsigned char *s = (unsigned char *) &i;
--    if (*s == 1) return PLY_LITTLE_ENDIAN;
--    else return PLY_BIG_ENDIAN;
--}
--
--static int ply_type_check(void) {
--    assert(sizeof(t_ply_int8) == 1);
--    assert(sizeof(t_ply_uint8) == 1);
--    assert(sizeof(t_ply_int16) == 2);
--    assert(sizeof(t_ply_uint16) == 2);
--    assert(sizeof(t_ply_int32) == 4);
--    assert(sizeof(t_ply_uint32) == 4);
--    assert(sizeof(float) == 4);
--    assert(sizeof(double) == 8);
--    if (sizeof(t_ply_int8) != 1) return 0;
--    if (sizeof(t_ply_uint8) != 1) return 0;
--    if (sizeof(t_ply_int16) != 2) return 0;
--    if (sizeof(t_ply_uint16) != 2) return 0;
--    if (sizeof(t_ply_int32) != 4) return 0;
--    if (sizeof(t_ply_uint32) != 4) return 0;
--    if (sizeof(float) != 4) return 0;
--    if (sizeof(double) != 8) return 0;
--    return 1;
--}
--
--/* ----------------------------------------------------------------------
-- * Output handlers
-- * ---------------------------------------------------------------------- */
--static int oascii_int8(p_ply ply, double value) {
--    if (value > PLY_INT8_MAX || value < PLY_INT8_MIN) return 0;
--    return fprintf(ply->fp, "%d ", (t_ply_int8) value) > 0;
--}
--
--static int oascii_uint8(p_ply ply, double value) {
--    if (value > PLY_UINT8_MAX || value < 0) return 0;
--    return fprintf(ply->fp, "%d ", (t_ply_uint8) value) > 0;
--}
--
--static int oascii_int16(p_ply ply, double value) {
--    if (value > PLY_INT16_MAX || value < PLY_INT16_MIN) return 0;
--    return fprintf(ply->fp, "%d ", (t_ply_int16) value) > 0;
--}
--
--static int oascii_uint16(p_ply ply, double value) {
--    if (value > PLY_UINT16_MAX || value < 0) return 0;
--    return fprintf(ply->fp, "%d ", (t_ply_uint16) value) > 0;
--}
--
--static int oascii_int32(p_ply ply, double value) {
--    if (value > PLY_INT32_MAX || value < PLY_INT32_MIN) return 0;
--    return fprintf(ply->fp, "%d ", (t_ply_int32) value) > 0;
--}
--
--static int oascii_uint32(p_ply ply, double value) {
--    if (value > PLY_UINT32_MAX || value < 0) return 0;
--    return fprintf(ply->fp, "%d ", (t_ply_uint32) value) > 0;
--}
--
--static int oascii_float32(p_ply ply, double value) {
--    if (value < -FLT_MAX || value > FLT_MAX) return 0;
--    return fprintf(ply->fp, "%g ", (float) value) > 0;
--}
--
--static int oascii_float64(p_ply ply, double value) {
--    if (value < -DBL_MAX || value > DBL_MAX) return 0;
--    //return fprintf(ply->fp, "%g ", value) > 0; //Ming the original %g does not work
--    return fprintf(ply->fp, "%.16f ", value) > 0;
--}
--
--static int obinary_int8(p_ply ply, double value) {
--    t_ply_int8 int8 = (t_ply_int8) value;
--    if (value > PLY_INT8_MAX || value < PLY_INT8_MIN) return 0;
--    return ply->odriver->ochunk(ply, &int8, sizeof(int8));
--}
--
--static int obinary_uint8(p_ply ply, double value) {
--    t_ply_uint8 uint8 = (t_ply_uint8) value;
--    if (value > PLY_UINT8_MAX || value < 0) return 0;
--    return ply->odriver->ochunk(ply, &uint8, sizeof(uint8));
--}
--
--static int obinary_int16(p_ply ply, double value) {
--    t_ply_int16 int16 = (t_ply_int16) value;
--    if (value > PLY_INT16_MAX || value < PLY_INT16_MIN) return 0;
--    return ply->odriver->ochunk(ply, &int16, sizeof(int16));
--}
--
--static int obinary_uint16(p_ply ply, double value) {
--    t_ply_uint16 uint16 = (t_ply_uint16) value;
--    if (value > PLY_UINT16_MAX || value < 0) return 0;
--    return ply->odriver->ochunk(ply, &uint16, sizeof(uint16));
--}
--
--static int obinary_int32(p_ply ply, double value) {
--    t_ply_int32 int32 = (t_ply_int32) value;
--    if (value > PLY_INT32_MAX || value < PLY_INT32_MIN) return 0;
--    return ply->odriver->ochunk(ply, &int32, sizeof(int32));
--}
--
--static int obinary_uint32(p_ply ply, double value) {
--    t_ply_uint32 uint32 = (t_ply_uint32) value;
--    if (value > PLY_UINT32_MAX || value < 0) return 0;
--    return ply->odriver->ochunk(ply, &uint32, sizeof(uint32));
--}
--
--static int obinary_float32(p_ply ply, double value) {
--    float float32 = (float) value;
--    if (value > FLT_MAX || value < -FLT_MAX) return 0;
--    return ply->odriver->ochunk(ply, &float32, sizeof(float32));
--}
--
--static int obinary_float64(p_ply ply, double value) {
--    return ply->odriver->ochunk(ply, &value, sizeof(value));
--}
--
--/* ----------------------------------------------------------------------
-- * Input  handlers
-- * ---------------------------------------------------------------------- */
--static int iascii_int8(p_ply ply, double *value) {
--    char *end;
--    if (!ply_read_word(ply)) return 0;
--    *value = strtol(BWORD(ply), &end, 10);
--    if (*end || *value > PLY_INT8_MAX || *value < PLY_INT8_MIN) return 0;
--    return 1;
--}
--
--static int iascii_uint8(p_ply ply, double *value) {
--    char *end;
--    if (!ply_read_word(ply)) return 0;
--    *value = strtol(BWORD(ply), &end, 10);
--    if (*end || *value > PLY_UINT8_MAX || *value < 0) return 0;
--    return 1;
--}
--
--static int iascii_int16(p_ply ply, double *value) {
--    char *end;
--    if (!ply_read_word(ply)) return 0;
--    *value = strtol(BWORD(ply), &end, 10);
--    if (*end || *value > PLY_INT16_MAX || *value < PLY_INT16_MIN) return 0;
--    return 1;
--}
--
--static int iascii_uint16(p_ply ply, double *value) {
--    char *end;
--    if (!ply_read_word(ply)) return 0;
--    *value = strtol(BWORD(ply), &end, 10);
--    if (*end || *value > PLY_UINT16_MAX || *value < 0) return 0;
--    return 1;
--}
--
--static int iascii_int32(p_ply ply, double *value) {
--    char *end;
--    if (!ply_read_word(ply)) return 0;
--    *value = strtol(BWORD(ply), &end, 10);
--    if (*end || *value > PLY_INT32_MAX || *value < PLY_INT32_MIN) return 0;
--    return 1;
--}
--
--static int iascii_uint32(p_ply ply, double *value) {
--    char *end;
--    if (!ply_read_word(ply)) return 0;
--    *value = strtol(BWORD(ply), &end, 10);
--    if (*end || *value > PLY_UINT32_MAX || *value < 0) return 0;
--    return 1;
--}
--
--static int iascii_float32(p_ply ply, double *value) {
--    char *end;
--    if (!ply_read_word(ply)) return 0;
--    *value = strtod(BWORD(ply), &end);
--    if (*end || *value < -FLT_MAX || *value > FLT_MAX) return 0;
--    return 1;
--}
--
--static int iascii_float64(p_ply ply, double *value) {
--    char *end;
--    if (!ply_read_word(ply)) return 0;
--    *value = strtod(BWORD(ply), &end);
--    if (*end || *value < -DBL_MAX || *value > DBL_MAX) return 0;
--    return 1;
--}
--
--static int ibinary_int8(p_ply ply, double *value) {
--    t_ply_int8 int8;
--    if (!ply->idriver->ichunk(ply, &int8, 1)) return 0;
--    *value = int8;
--    return 1;
--}
--
--static int ibinary_uint8(p_ply ply, double *value) {
--    t_ply_uint8 uint8;
--    if (!ply->idriver->ichunk(ply, &uint8, 1)) return 0;
--    *value = uint8;
--    return 1;
--}
--
--static int ibinary_int16(p_ply ply, double *value) {
--    t_ply_int16 int16;
--    if (!ply->idriver->ichunk(ply, &int16, sizeof(int16))) return 0;
--    *value = int16;
--    return 1;
--}
--
--static int ibinary_uint16(p_ply ply, double *value) {
--    t_ply_uint16 uint16;
--    if (!ply->idriver->ichunk(ply, &uint16, sizeof(uint16))) return 0;
--    *value = uint16;
--    return 1;
--}
--
--static int ibinary_int32(p_ply ply, double *value) {
--    t_ply_int32 int32;
--    if (!ply->idriver->ichunk(ply, &int32, sizeof(int32))) return 0;
--    *value = int32;
--    return 1;
--}
--
--static int ibinary_uint32(p_ply ply, double *value) {
--    t_ply_uint32 uint32;
--    if (!ply->idriver->ichunk(ply, &uint32, sizeof(uint32))) return 0;
--    *value = uint32;
--    return 1;
--}
--
--static int ibinary_float32(p_ply ply, double *value) {
--    float float32;
--    if (!ply->idriver->ichunk(ply, &float32, sizeof(float32))) return 0;
--    *value = float32;
--    return 1;
--}
--
--static int ibinary_float64(p_ply ply, double *value) {
--    return ply->idriver->ichunk(ply, value, sizeof(double));
--}
--
--/* ----------------------------------------------------------------------
-- * Constants
-- * ---------------------------------------------------------------------- */
--static t_ply_idriver ply_idriver_ascii = {
--    {   iascii_int8, iascii_uint8, iascii_int16, iascii_uint16,
--        iascii_int32, iascii_uint32, iascii_float32, iascii_float64,
--        iascii_int8, iascii_uint8, iascii_int16, iascii_uint16,
--        iascii_int32, iascii_uint32, iascii_float32, iascii_float64
--    }, /* order matches e_ply_type enum */
--    NULL,
--    "ascii input"
--};
--
--static t_ply_idriver ply_idriver_binary = {
--    {   ibinary_int8, ibinary_uint8, ibinary_int16, ibinary_uint16,
--        ibinary_int32, ibinary_uint32, ibinary_float32, ibinary_float64,
--        ibinary_int8, ibinary_uint8, ibinary_int16, ibinary_uint16,
--        ibinary_int32, ibinary_uint32, ibinary_float32, ibinary_float64
--    }, /* order matches e_ply_type enum */
--    ply_read_chunk,
--    "binary input"
--};
--
--static t_ply_idriver ply_idriver_binary_reverse = {
--    {   ibinary_int8, ibinary_uint8, ibinary_int16, ibinary_uint16,
--        ibinary_int32, ibinary_uint32, ibinary_float32, ibinary_float64,
--        ibinary_int8, ibinary_uint8, ibinary_int16, ibinary_uint16,
--        ibinary_int32, ibinary_uint32, ibinary_float32, ibinary_float64
--    }, /* order matches e_ply_type enum */
--    ply_read_chunk_reverse,
--    "reverse binary input"
--};
--
--static t_ply_odriver ply_odriver_ascii = {
--    {   oascii_int8, oascii_uint8, oascii_int16, oascii_uint16,
--        oascii_int32, oascii_uint32, oascii_float32, oascii_float64,
--        oascii_int8, oascii_uint8, oascii_int16, oascii_uint16,
--        oascii_int32, oascii_uint32, oascii_float32, oascii_float64
--    }, /* order matches e_ply_type enum */
--    NULL,
--    "ascii output"
--};
--
--static t_ply_odriver ply_odriver_binary = {
--    {   obinary_int8, obinary_uint8, obinary_int16, obinary_uint16,
--        obinary_int32, obinary_uint32, obinary_float32, obinary_float64,
--        obinary_int8, obinary_uint8, obinary_int16, obinary_uint16,
--        obinary_int32, obinary_uint32, obinary_float32, obinary_float64
--    }, /* order matches e_ply_type enum */
--    ply_write_chunk,
--    "binary output"
--};
--
--static t_ply_odriver ply_odriver_binary_reverse = {
--    {   obinary_int8, obinary_uint8, obinary_int16, obinary_uint16,
--        obinary_int32, obinary_uint32, obinary_float32, obinary_float64,
--        obinary_int8, obinary_uint8, obinary_int16, obinary_uint16,
--        obinary_int32, obinary_uint32, obinary_float32, obinary_float64
--    }, /* order matches e_ply_type enum */
--    ply_write_chunk_reverse,
--    "reverse binary output"
--};
--
--/* ----------------------------------------------------------------------
-- * Copyright (C) 2003 Diego Nehab.  All rights reserved.
-- *
-- * Permission is hereby granted, free of charge, to any person obtaining
-- * a copy of this software and associated documentation files (the
-- * "Software"), to deal in the Software without restriction, including
-- * without limitation the rights to use, copy, modify, merge, publish,
-- * distribute, sublicense, and/or sell copies of the Software, and to
-- * permit persons to whom the Software is furnished to do so, subject to
-- * the following conditions:
-- *
-- * The above copyright notice and this permission notice shall be
-- * included in all copies or substantial portions of the Software.
-- *
-- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
-- * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
-- * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
-- * IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
-- * CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
-- * TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
-- * SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
-- * ---------------------------------------------------------------------- */
-diff --git a/v3p/rply/rply.h b/v3p/rply/rply.h
-deleted file mode 100644
-index 3c604fd88e..0000000000
---- a/v3p/rply/rply.h
-+++ /dev/null
-@@ -1,367 +0,0 @@
--#ifndef PLY_H
--#define PLY_H
--/* ----------------------------------------------------------------------
-- * RPly library, read/write PLY files
-- * Diego Nehab, Princeton University
-- * http://www.cs.princeton.edu/~diego/professional/rply
-- *
-- * This library is distributed under the MIT License. See notice
-- * at the end of this file.
-- * ---------------------------------------------------------------------- */
--
--#ifdef __cplusplus
--extern "C" {
--#endif
--
--#define RPLY_VERSION   "RPly 1.1"
--#define RPLY_COPYRIGHT "Copyright (C) 2003-2006 Diego Nehab"
--#define RPLY_AUTHORS   "Diego Nehab"
--
--/* ----------------------------------------------------------------------
-- * Types
-- * ---------------------------------------------------------------------- */
--/* structures are opaque */
--typedef struct t_ply_ *p_ply;
--typedef struct t_ply_element_ *p_ply_element;
--typedef struct t_ply_property_ *p_ply_property;
--typedef struct t_ply_argument_ *p_ply_argument;
--
--/* ply format mode type */
--typedef enum e_ply_storage_mode_ {
--    PLY_BIG_ENDIAN,
--    PLY_LITTLE_ENDIAN,
--    PLY_ASCII,
--    PLY_DEFAULT      /* has to be the last in enum */
--} e_ply_storage_mode; /* order matches ply_storage_mode_list */
--
--/* ply data type */
--typedef enum e_ply_type {
--    PLY_INT8, PLY_UINT8, PLY_INT16, PLY_UINT16,
--    PLY_INT32, PLY_UIN32, PLY_FLOAT32, PLY_FLOAT64,
--    PLY_CHAR, PLY_UCHAR, PLY_SHORT, PLY_USHORT,
--    PLY_INT, PLY_UINT, PLY_FLOAT, PLY_DOUBLE,
--    PLY_LIST    /* has to be the last in enum */
--} e_ply_type;   /* order matches ply_type_list */
--
--/* ----------------------------------------------------------------------
-- * Property reading callback prototype
-- *
-- * message: error message
-- * ---------------------------------------------------------------------- */
--typedef void (*p_ply_error_cb)(p_ply ply, const char *message);
--
--/* ----------------------------------------------------------------------
-- * Opens a ply file for reading (fails if file is not a ply file)
-- *
-- * error_cb: error callback function
-- * name: file name
-- * idata,pdata: contextual information available to users
-- *
-- * Returns 1 if successful, 0 otherwise
-- * ---------------------------------------------------------------------- */
--p_ply ply_open(const char *name, p_ply_error_cb error_cb, long idata,
--        void *pdata);
--
--/* ----------------------------------------------------------------------
-- * Reads and parses the header of a ply file returned by ply_open
-- *
-- * ply: handle returned by ply_open
-- *
-- * Returns 1 if successfull, 0 otherwise
-- * ---------------------------------------------------------------------- */
--int ply_read_header(p_ply ply);
--
--/* ----------------------------------------------------------------------
-- * Property reading callback prototype
-- *
-- * argument: parameters for property being processed when callback is called
-- *
-- * Returns 1 if should continue processing file, 0 if should abort.
-- * ---------------------------------------------------------------------- */
--typedef int (*p_ply_read_cb)(p_ply_argument argument);
--
--/* ----------------------------------------------------------------------
-- * Sets up callbacks for property reading after header was parsed
-- *
-- * ply: handle returned by ply_open
-- * element_name: element where property is
-- * property_name: property to associate element with
-- * read_cb: function to be called for each property value
-- * pdata/idata: user data that will be passed to callback
-- *
-- * Returns 0 if no element or no property in element, returns the
-- * number of element instances otherwise.
-- * ---------------------------------------------------------------------- */
--long ply_set_read_cb(p_ply ply, const char *element_name,
--        const char *property_name, p_ply_read_cb read_cb,
--        void *pdata, long idata);
--
--/* ----------------------------------------------------------------------
-- * Returns information about the element originating a callback
-- *
-- * argument: handle to argument
-- * element: receives a the element handle (if non-null)
-- * instance_index: receives the index of the current element instance
-- *     (if non-null)
-- *
-- * Returns 1 if successfull, 0 otherwise
-- * ---------------------------------------------------------------------- */
--int ply_get_argument_element(p_ply_argument argument,
--        p_ply_element *element, long *instance_index);
--
--/* ----------------------------------------------------------------------
-- * Returns information about the property originating a callback
-- *
-- * argument: handle to argument
-- * property: receives the property handle (if non-null)
-- * length: receives the number of values in this property (if non-null)
-- * value_index: receives the index of current property value (if non-null)
-- *
-- * Returns 1 if successfull, 0 otherwise
-- * ---------------------------------------------------------------------- */
--int ply_get_argument_property(p_ply_argument argument,
--        p_ply_property *property, long *length, long *value_index);
--
--/* ----------------------------------------------------------------------
-- * Returns user data associated with callback
-- *
-- * pdata: receives a copy of user custom data pointer (if non-null)
-- * idata: receives a copy of user custom data integer (if non-null)
-- *
-- * Returns 1 if successfull, 0 otherwise
-- * ---------------------------------------------------------------------- */
--int ply_get_argument_user_data(p_ply_argument argument, void **pdata,
--        long *idata);
--
--/* ----------------------------------------------------------------------
-- * Returns the value associated with a callback
-- *
-- * argument: handle to argument
-- *
-- * Returns the current data item
-- * ---------------------------------------------------------------------- */
--double ply_get_argument_value(p_ply_argument argument);
--
--/* ----------------------------------------------------------------------
-- * Reads all elements and properties calling the callbacks defined with
-- * calls to ply_set_read_cb
-- *
-- * ply: handle returned by ply_open
-- *
-- * Returns 1 if successfull, 0 otherwise
-- * ---------------------------------------------------------------------- */
--int ply_read(p_ply ply);
--
--/* ----------------------------------------------------------------------
-- * Iterates over all elements by returning the next element.
-- * Call with NULL to return handle to first element.
-- *
-- * ply: handle returned by ply_open
-- * last: handle of last element returned (NULL for first element)
-- *
-- * Returns element if successfull or NULL if no more elements
-- * ---------------------------------------------------------------------- */
--p_ply_element ply_get_next_element(p_ply ply, p_ply_element last);
--
--/* ----------------------------------------------------------------------
-- * Iterates over all comments by returning the next comment.
-- * Call with NULL to return pointer to first comment.
-- *
-- * ply: handle returned by ply_open
-- * last: pointer to last comment returned (NULL for first comment)
-- *
-- * Returns comment if successfull or NULL if no more comments
-- * ---------------------------------------------------------------------- */
--const char *ply_get_next_comment(p_ply ply, const char *last);
--
--/* ----------------------------------------------------------------------
-- * Iterates over all obj_infos by returning the next obj_info.
-- * Call with NULL to return pointer to first obj_info.
-- *
-- * ply: handle returned by ply_open
-- * last: pointer to last obj_info returned (NULL for first obj_info)
-- *
-- * Returns obj_info if successfull or NULL if no more obj_infos
-- * ---------------------------------------------------------------------- */
--const char *ply_get_next_obj_info(p_ply ply, const char *last);
--
--/* ----------------------------------------------------------------------
-- * Returns information about an element
-- *
-- * element: element of interest
-- * name: receives a pointer to internal copy of element name (if non-null)
-- * ninstances: receives the number of instances of this element (if non-null)
-- *
-- * Returns 1 if successfull or 0 otherwise
-- * ---------------------------------------------------------------------- */
--int ply_get_element_info(p_ply_element element, const char** name,
--        long *ninstances);
--
--/* ----------------------------------------------------------------------
-- * Iterates over all properties by returning the next property.
-- * Call with NULL to return handle to first property.
-- *
-- * element: handle of element with the properties of interest
-- * last: handle of last property returned (NULL for first property)
-- *
-- * Returns element if successfull or NULL if no more properties
-- * ---------------------------------------------------------------------- */
--p_ply_property ply_get_next_property(p_ply_element element,
--        p_ply_property last);
--
--/* ----------------------------------------------------------------------
-- * Returns information about a property
-- *
-- * property: handle to property of interest
-- * name: receives a pointer to internal copy of property name (if non-null)
-- * type: receives the property type (if non-null)
-- * length_type: for list properties, receives the scalar type of
-- *     the length field (if non-null)
-- * value_type: for list properties, receives the scalar type of the value
-- *     fields  (if non-null)
-- *
-- * Returns 1 if successfull or 0 otherwise
-- * ---------------------------------------------------------------------- */
--int ply_get_property_info(p_ply_property property, const char** name,
--        e_ply_type *type, e_ply_type *length_type, e_ply_type *value_type);
--
--/* ----------------------------------------------------------------------
-- * Creates new ply file
-- *
-- * name: file name
-- * storage_mode: file format mode
-- *
-- * Returns handle to ply file if successfull, NULL otherwise
-- * ---------------------------------------------------------------------- */
--p_ply ply_create(const char *name, e_ply_storage_mode storage_mode,
--        p_ply_error_cb error_cb, long idata, void *pdata);
--
--/* ----------------------------------------------------------------------
-- * Adds a new element to the ply file created by ply_create
-- *
-- * ply: handle returned by ply_create
-- * name: name of new element
-- * ninstances: number of element of this time in file
-- *
-- * Returns 1 if successfull, 0 otherwise
-- * ---------------------------------------------------------------------- */
--int ply_add_element(p_ply ply, const char *name, long ninstances);
--
--/* ----------------------------------------------------------------------
-- * Adds a new property to the last element added by ply_add_element
-- *
-- * ply: handle returned by ply_create
-- * name: name of new property
-- * type: property type
-- * length_type: scalar type of length field of a list property
-- * value_type: scalar type of value fields of a list property
-- *
-- * Returns 1 if successfull, 0 otherwise
-- * ---------------------------------------------------------------------- */
--int ply_add_property(p_ply ply, const char *name, e_ply_type type,
--        e_ply_type length_type, e_ply_type value_type);
--
--/* ----------------------------------------------------------------------
-- * Adds a new list property to the last element added by ply_add_element
-- *
-- * ply: handle returned by ply_create
-- * name: name of new property
-- * length_type: scalar type of length field of a list property
-- * value_type: scalar type of value fields of a list property
-- *
-- * Returns 1 if successfull, 0 otherwise
-- * ---------------------------------------------------------------------- */
--int ply_add_list_property(p_ply ply, const char *name,
--        e_ply_type length_type, e_ply_type value_type);
--
--/* ----------------------------------------------------------------------
-- * Adds a new property to the last element added by ply_add_element
-- *
-- * ply: handle returned by ply_create
-- * name: name of new property
-- * type: property type
-- *
-- * Returns 1 if successfull, 0 otherwise
-- * ---------------------------------------------------------------------- */
--int ply_add_scalar_property(p_ply ply, const char *name, e_ply_type type);
--
--/* ----------------------------------------------------------------------
-- * Adds a new comment item
-- *
-- * ply: handle returned by ply_create
-- * comment: pointer to string with comment text
-- *
-- * Returns 1 if successfull, 0 otherwise
-- * ---------------------------------------------------------------------- */
--int ply_add_comment(p_ply ply, const char *comment);
--
--/* ----------------------------------------------------------------------
-- * Adds a new obj_info item
-- *
-- * ply: handle returned by ply_create
-- * comment: pointer to string with obj_info data
-- *
-- * Returns 1 if successfull, 0 otherwise
-- * ---------------------------------------------------------------------- */
--int ply_add_obj_info(p_ply ply, const char *obj_info);
--
--/* ----------------------------------------------------------------------
-- * Writes the ply file header after all element and properties have been
-- * defined by calls to ply_add_element and ply_add_property
-- *
-- * ply: handle returned by ply_create
-- *
-- * Returns 1 if successfull, 0 otherwise
-- * ---------------------------------------------------------------------- */
--int ply_write_header(p_ply ply);
--
--/* ----------------------------------------------------------------------
-- * Writes one property value, in the order they should be written to the
-- * file. For each element type, write all elements of that type in order.
-- * For each element, write all its properties in order. For scalar
-- * properties, just write the value. For list properties, write the length
-- * and then each of the values.
-- *
-- * ply: handle returned by ply_create
-- *
-- * Returns 1 if successfull, 0 otherwise
-- * ---------------------------------------------------------------------- */
--int ply_write(p_ply ply, double value);
--
--/* ----------------------------------------------------------------------
-- * Closes a ply file handle. Releases all memory used by handle
-- *
-- * ply: handle to be closed.
-- *
-- * Returns 1 if successfull, 0 otherwise
-- * ---------------------------------------------------------------------- */
--int ply_close(p_ply ply);
--
--#ifdef __cplusplus
--}
--#endif
--
--#endif /* RPLY_H */
--
--/* ----------------------------------------------------------------------
-- * Copyright (C) 2003-2005 Diego Nehab. All rights reserved.
-- *
-- * Permission is hereby granted, free of charge, to any person obtaining
-- * a copy of this software and associated documentation files (the
-- * "Software"), to deal in the Software without restriction, including
-- * without limitation the rights to use, copy, modify, merge, publish,
-- * distribute, sublicense, and/or sell copies of the Software, and to
-- * permit persons to whom the Software is furnished to do so, subject to
-- * the following conditions:
-- *
-- * The above copyright notice and this permission notice shall be
-- * included in all copies or substantial portions of the Software.
-- *
-- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
-- * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
-- * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
-- * IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
-- * CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
-- * TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
-- * SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
-- * ---------------------------------------------------------------------- */
--- 
-2.46.1
-
diff --git a/0002-Added-soname-info-for-core-libraries.patch b/0002-Added-soname-info-for-core-libraries.patch
new file mode 100644
index 0000000..b153475
--- /dev/null
+++ b/0002-Added-soname-info-for-core-libraries.patch
@@ -0,0 +1,117 @@
+From 620fd77b0773f8cc9b57ff96b90d770eb5055b5d Mon Sep 17 00:00:00 2001
+From: Mario Ceresa <mrceresa@gmail.com>
+Date: Wed, 10 Oct 2012 17:10:50 +0200
+Subject: [PATCH 02/23] Added soname info for core libraries
+
+Signed-off-by: Mario Ceresa <mrceresa@gmail.com>
+---
+ CMakeLists.txt               | 20 ++++++++++++++++++++
+ core/testlib/CMakeLists.txt  |  1 +
+ core/vnl/CMakeLists.txt      |  1 +
+ core/vnl/algo/CMakeLists.txt |  1 +
+ v3p/netlib/CMakeLists.txt    |  2 ++
+ vcl/CMakeLists.txt           |  1 +
+ 6 files changed, 26 insertions(+)
+
+diff --git a/CMakeLists.txt b/CMakeLists.txt
+index 217f93a..67b2ea4 100644
+--- a/CMakeLists.txt
++++ b/CMakeLists.txt
+@@ -12,6 +12,26 @@ ENDIF( COMMAND CMAKE_POLICY )
+ 
+ PROJECT(vxl)
+ 
++SET(VXL_MAJOR_VERSION 1)
++SET(VXL_MINOR_VERSION 13)
++SET(VXL_BUILD_VERSION 0)
++SET(VXL_VERSION
++  "${VXL_MAJOR_VERSION}.${VXL_MINOR_VERSION}.${VXL_BUILD_VERSION}")
++SET(VXL_API_VERSION
++  "${VXL_MAJOR_VERSION}.${VXL_MINOR_VERSION}")
++SET(VXL_LIBRARY_PROPERTIES ${VXL_LIBRARY_PROPERTIES}
++  VERSION "${VXL_VERSION}"
++  SOVERSION "${VXL_API_VERSION}"
++)
++SET(NETLIB_LIBRARY_PROPERTIES ${VXL_LIBRARY_PROPERTIES})
++SET(V3P_NETLIB_LIBRARY_PROPERTIES ${VXL_LIBRARY_PROPERTIES})
++SET(VCL_LIBRARY_PROPERTIES ${VXL_LIBRARY_PROPERTIES})
++SET(VNL_ALGO_LIBRARY_PROPERTIES ${VXL_LIBRARY_PROPERTIES})
++SET(VNL_LIBRARY_PROPERTIES ${VXL_LIBRARY_PROPERTIES})
++SET(TESTLIB_LIBRARY_PROPERTIES ${VXL_LIBRARY_PROPERTIES})
++
++
++
+ SET( LIBRARY_OUTPUT_PATH ${vxl_BINARY_DIR}/lib CACHE PATH
+      "Output directory for the vxl libraries" )
+ 
+diff --git a/core/testlib/CMakeLists.txt b/core/testlib/CMakeLists.txt
+index da85662..4d105e9 100644
+--- a/core/testlib/CMakeLists.txt
++++ b/core/testlib/CMakeLists.txt
+@@ -29,6 +29,7 @@ SET( testlib_sources
+ )
+ 
+ ADD_LIBRARY( testlib ${testlib_sources} )
++SET_TARGET_PROPERTIES(testlib PROPERTIES ${TESTLIB_LIBRARY_PROPERTIES})
+ TARGET_LINK_LIBRARIES( testlib vcl )
+ INSTALL_TARGETS( /lib testlib)
+ INSTALL_NOBASE_HEADER_FILES(/include/vxl/core/testlib ${testlib_sources})
+diff --git a/core/vnl/CMakeLists.txt b/core/vnl/CMakeLists.txt
+index 490022a..053cdab 100644
+--- a/core/vnl/CMakeLists.txt
++++ b/core/vnl/CMakeLists.txt
+@@ -264,6 +264,7 @@ IF(CMAKE_COMPILER_IS_GNUCXX)
+ ENDIF(CMAKE_COMPILER_IS_GNUCXX)
+ 
+ ADD_LIBRARY(vnl ${vnl_sources})
++SET_TARGET_PROPERTIES(vnl PROPERTIES ${VNL_LIBRARY_PROPERTIES})
+ TARGET_LINK_LIBRARIES( vnl vcl )
+ 
+ INSTALL_TARGETS(/lib vnl)
+diff --git a/core/vnl/algo/CMakeLists.txt b/core/vnl/algo/CMakeLists.txt
+index cefe140..2f99996 100644
+--- a/core/vnl/algo/CMakeLists.txt
++++ b/core/vnl/algo/CMakeLists.txt
+@@ -102,6 +102,7 @@ IF(NETLIB_FOUND)
+   AUX_SOURCE_DIRECTORY(Templates vnl_algo_sources)
+ 
+   ADD_LIBRARY( vnl_algo ${vnl_algo_sources})
++  SET_TARGET_PROPERTIES(vnl_algo PROPERTIES ${VNL_ALGO_LIBRARY_PROPERTIES})
+   TARGET_LINK_LIBRARIES( vnl_algo ${NETLIB_LIBRARIES} vnl )
+ 
+   INSTALL_TARGETS(/lib vnl_algo)
+diff --git a/v3p/netlib/CMakeLists.txt b/v3p/netlib/CMakeLists.txt
+index 9e78799..0ad28f6 100644
+--- a/v3p/netlib/CMakeLists.txt
++++ b/v3p/netlib/CMakeLists.txt
+@@ -8,6 +8,7 @@ SET(netlib_sources
+    )
+ 
+ ADD_LIBRARY( netlib ${netlib_sources} )
++SET_TARGET_PROPERTIES(netlib PROPERTIES ${NETLIB_LIBRARY_PROPERTIES})
+ INSTALL_TARGETS( /lib netlib )
+ INSTALL_FILES( /include/vxl/v3p/netlib .h triangle )
+ 
+@@ -462,6 +463,7 @@ ENDIF(CMAKE_COMPILER_IS_GNUCC)
+ 
+ # Create a netlib library with mangled symbols.
+ ADD_LIBRARY(v3p_netlib ${v3p_netlib_sources})
++SET_TARGET_PROPERTIES(v3p_netlib PROPERTIES ${V3P_NETLIB_LIBRARY_PROPERTIES})
+ INSTALL_TARGETS( /lib v3p_netlib )
+ INSTALL_NOBASE_HEADER_FILES(/include/vxl/v3p/netlib ${v3p_netlib_sources})
+ IF(UNIX)
+diff --git a/vcl/CMakeLists.txt b/vcl/CMakeLists.txt
+index 11f1887..7f1e9d9 100644
+--- a/vcl/CMakeLists.txt
++++ b/vcl/CMakeLists.txt
+@@ -360,6 +360,7 @@ SET( vcl_sources
+ #AUX_SOURCE_DIRECTORY(Templates vcl_sources)
+ 
+ ADD_LIBRARY(vcl ${vcl_sources})
++SET_TARGET_PROPERTIES(vcl PROPERTIES ${VCL_LIBRARY_PROPERTIES})
+ 
+ # CMake can automatically figure out the compiler characteristics on
+ # Windows too.  No need to do manual config.
+-- 
+1.7.11.7
+
diff --git a/0002-v3.5.0-Use-Fedora-expat-and-expatpp.patch b/0002-v3.5.0-Use-Fedora-expat-and-expatpp.patch
deleted file mode 100644
index 37c28aa..0000000
--- a/0002-v3.5.0-Use-Fedora-expat-and-expatpp.patch
+++ /dev/null
@@ -1,923 +0,0 @@
-From 26d548e302e9fa1bcc2986ba91f12313ccb00829 Mon Sep 17 00:00:00 2001
-From: "Ankur Sinha (Ankur Sinha Gmail)" <sanjay.ankur@gmail.com>
-Date: Thu, 15 Nov 2018 15:20:08 +0000
-Subject: [PATCH 02/18] v3.5.0 Use Fedora expat and expatpp
-
----
- CMakeLists.txt                                |  2 +
- config/cmake/fedora-modules/FindEXPATPP.cmake | 37 +++++++++++++++++
- contrib/brl/b3p/expat/CMakeLists.txt          |  3 +-
- contrib/brl/b3p/expatpp/CMakeLists.txt        | 22 +---------
- contrib/brl/bbas/bhdfs/pro/CMakeLists.txt     |  3 +-
- contrib/brl/bbas/bkml/CMakeLists.txt          |  2 +-
- contrib/brl/bbas/bocl/pro/CMakeLists.txt      |  3 +-
- contrib/brl/bbas/bvgl/CMakeLists.txt          |  3 +-
- contrib/brl/bbas/bvgl/bvgl_labelme_parser.h   |  2 +-
- contrib/brl/bbas/bvgl/tests/CMakeLists.txt    |  3 +-
- contrib/brl/bbas/bwm/CMakeLists.txt           |  3 +-
- contrib/brl/bbas/bwm/io/CMakeLists.txt        |  3 +-
- contrib/brl/bbas/bwm/pro/CMakeLists.txt       |  3 +-
- contrib/brl/bbas/bwm/video/CMakeLists.txt     |  3 +-
- contrib/brl/bbas/bwm/video/exe/CMakeLists.txt |  3 +-
- contrib/brl/bbas/bxml/CMakeLists.txt          |  9 ++--
- contrib/brl/bbas/volm/CMakeLists.txt          |  3 +-
- contrib/brl/bbas/volm/volm_osm_parser.h       |  2 +-
- contrib/brl/bmods/FindEXPAT.cmake             | 41 ++-----------------
- contrib/brl/bpro/CMakeLists.txt               |  3 +-
- contrib/brl/bpro/bprb/tests/CMakeLists.txt    |  6 ++-
- contrib/brl/bseg/bbgm/pro/CMakeLists.txt      |  3 +-
- contrib/brl/bseg/bbgm_batch/CMakeLists.txt    |  3 +-
- contrib/brl/bseg/betr_batch/CMakeLists.txt    |  3 +-
- contrib/brl/bseg/bmdl/pro/CMakeLists.txt      |  3 +-
- contrib/brl/bseg/bmdl_batch/CMakeLists.txt    |  3 +-
- contrib/brl/bseg/boxm2/CMakeLists.txt         |  3 +-
- .../bseg/boxm2/boxm2_bounding_box_parser.h    |  2 +-
- contrib/brl/bseg/boxm2/boxm2_scene_parser.h   |  2 +-
- contrib/brl/bseg/boxm2/pro/CMakeLists.txt     |  3 +-
- .../boxm2_ingest_convex_mesh_process.cxx      |  4 +-
- contrib/brl/bseg/boxm2/volm/CMakeLists.txt    |  3 +-
- .../brl/bseg/boxm2/volm/pro/CMakeLists.txt    |  3 +-
- contrib/brl/bseg/boxm2_batch/CMakeLists.txt   |  3 +-
- .../brl/bseg/boxm2_multi/pro/CMakeLists.txt   |  3 +-
- contrib/brl/bseg/brec_batch/CMakeLists.txt    |  3 +-
- contrib/brl/bseg/bstm/CMakeLists.txt          |  3 +-
- contrib/brl/bseg/bstm/bstm_scene_parser.h     |  2 +-
- contrib/brl/bseg/bstm_batch/CMakeLists.txt    |  3 +-
- contrib/brl/bseg/bstm_multi/CMakeLists.txt    |  3 +-
- .../bseg/bstm_multi/space_time_scene_parser.h |  2 +-
- contrib/brl/bseg/bvpl/functors/CMakeLists.txt |  3 +-
- contrib/brl/bseg/bvpl/kernels/CMakeLists.txt  |  3 +-
- .../brl/bseg/bvpl/kernels/pro/CMakeLists.txt  |  3 +-
- contrib/brl/bseg/bvpl/pro/CMakeLists.txt      |  3 +-
- contrib/brl/bseg/bvpl_batch/CMakeLists.txt    |  3 +-
- contrib/brl/bseg/bvxm/CMakeLists.txt          |  3 +-
- contrib/brl/bseg/bvxm/algo/pro/CMakeLists.txt |  3 +-
- .../brl/bseg/bvxm/bvxm_world_params_parser.h  |  2 +-
- contrib/brl/bseg/bvxm/grid/pro/CMakeLists.txt |  3 +-
- contrib/brl/bseg/bvxm/pro/CMakeLists.txt      |  3 +-
- contrib/brl/bseg/bvxm_batch/CMakeLists.txt    |  2 +
- contrib/brl/bseg/bvxm_bridge/CMakeLists.txt   |  3 +-
- contrib/brl/bseg/vcon/CMakeLists.txt          |  3 +-
- 54 files changed, 144 insertions(+), 109 deletions(-)
- create mode 100644 config/cmake/fedora-modules/FindEXPATPP.cmake
-
-diff --git a/CMakeLists.txt b/CMakeLists.txt
-index e5de354156..e52a8c0abb 100644
---- a/CMakeLists.txt
-+++ b/CMakeLists.txt
-@@ -75,6 +75,8 @@ SET(VXL_API_VERSION "${VXL_VERSION_MAJOR}.${VXL_VERSION_MINOR}")
- SET(VXL_LIBRARY_PROPERTIES ${VXL_LIBRARY_PROPERTIES} VERSION "${VXL_VERSION}"
-     SOVERSION "${VXL_API_VERSION}")
- 
-+set( CMAKE_MODULE_PATH ${CMAKE_MODULE_PATH} "${CMAKE_SOURCE_DIR}/config/cmake/fedora-modules")
-+
- include(CMakeDependentOption)
- include(${CMAKE_CURRENT_SOURCE_DIR}/config/cmake/VXLInitializeBuildType.cmake)
- 
-diff --git a/config/cmake/fedora-modules/FindEXPATPP.cmake b/config/cmake/fedora-modules/FindEXPATPP.cmake
-new file mode 100644
-index 0000000000..88a29681aa
---- /dev/null
-+++ b/config/cmake/fedora-modules/FindEXPATPP.cmake
-@@ -0,0 +1,37 @@
-+# Adapted from https://github.com/jirihnidek/verse-ply-uploader/blob/master/build_files/cmake/modules/FindEXPATPP.cmake
-+# This module tries to find EXPATPP library and include files
-+#
-+# EXPATPP_INCLUDE_DIR, where to find verse.h
-+# EXPATPP_LIBRARY_DIR, where to find libverse.so
-+# EXPATPP_LIBRARIES, the library to link against
-+# EXPATPP_FOUND, IF false, do not try to use Verse
-+#
-+
-+FIND_PATH ( EXPATPP_INCLUDE_DIR expatpp.h
-+    /usr/include
-+    /usr/include/expatpp
-+    /usr/local/include
-+    /usr/local/include/expatpp
-+)
-+
-+FIND_LIBRARY ( EXPATPP_LIBRARIES
-+    NAMES expatpp libexpatpp
-+    PATHS /usr/local/lib /usr/local/lib64 /usr/lib /usr/lib64
-+)
-+
-+GET_FILENAME_COMPONENT( EXPATPP_LIBRARY_DIR ${EXPATPP_LIBRARIES} PATH )
-+
-+SET ( EXPATPP_FOUND "NO" )
-+IF ( EXPATPP_INCLUDE_DIR )
-+    IF ( EXPATPP_LIBRARIES )
-+        SET ( EXPATPP_LIBRARY ${EXPATPP_LIBRARIES} )
-+        SET ( EXPATPP_FOUND "YES" )
-+    ENDIF ( EXPATPP_LIBRARIES )
-+ENDIF ( EXPATPP_INCLUDE_DIR )
-+
-+MARK_AS_ADVANCED (
-+    EXPATPP_LIBRARY_DIR
-+    EXPATPP_INCLUDE_DIR
-+    EXPATPP_LIBRARIES
-+    EXPATPP_LIBRARY
-+)
-diff --git a/contrib/brl/b3p/expat/CMakeLists.txt b/contrib/brl/b3p/expat/CMakeLists.txt
-index dad475e211..d64a8f3832 100644
---- a/contrib/brl/b3p/expat/CMakeLists.txt
-+++ b/contrib/brl/b3p/expat/CMakeLists.txt
-@@ -1,7 +1,8 @@
- project(expat C)
- #include_regular_expression("^.*$")
- 
--include( ${BRL_MODULE_PATH}/FindEXPAT.cmake )
-+FIND_PACKAGE(EXPAT REQUIRED)
-+FIND_PACKAGE(EXPATPP REQUIRED)
- if(NOT VXL_USING_NATIVE_EXPAT)
- 
-   if(WIN32)
-diff --git a/contrib/brl/b3p/expatpp/CMakeLists.txt b/contrib/brl/b3p/expatpp/CMakeLists.txt
-index 4959c123c3..f25323d0de 100644
---- a/contrib/brl/b3p/expatpp/CMakeLists.txt
-+++ b/contrib/brl/b3p/expatpp/CMakeLists.txt
-@@ -1,22 +1,4 @@
- #This is brl/b3p/expatpp
- 
--include( ${BRL_MODULE_PATH}/FindEXPAT.cmake )
--if( EXPAT_FOUND )
--
--  if( VXL_USING_NATIVE_EXPAT )
--    include_directories( ${EXPAT_INCLUDE_DIR} )
--  else()
--    include_directories( ${BRL_BINARY_DIR}/b3p/expat )
--  endif()
--
--  set( expatpp_sources expatpp.h expatpp.cpp expatpplib.h )
--
--  vxl_add_library(LIBRARY_NAME expatpp LIBRARY_SOURCES ${expatpp_sources} )
--  target_link_libraries( expatpp ${EXPAT_LIBRARIES} )
--
--  if( BUILD_TESTING )
--    add_subdirectory(tests)
--  endif()
--
--
--endif()
-+FIND_PACKAGE(EXPAT REQUIRED)
-+FIND_PACKAGE(EXPATPP REQUIRED)
-diff --git a/contrib/brl/bbas/bhdfs/pro/CMakeLists.txt b/contrib/brl/bbas/bhdfs/pro/CMakeLists.txt
-index 11e9d815c3..5797910273 100644
---- a/contrib/brl/bbas/bhdfs/pro/CMakeLists.txt
-+++ b/contrib/brl/bbas/bhdfs/pro/CMakeLists.txt
-@@ -1,7 +1,8 @@
- # bhdfs's Process Library
- 
- # bprb depends on expat and bhdfs_pro depends on bprb primarily
--include( ${BRL_MODULE_PATH}/FindEXPAT.cmake )
-+FIND_PACKAGE(EXPAT REQUIRED)
-+FIND_PACKAGE(EXPATPP REQUIRED)
- if(EXPAT_FOUND)
-   include_directories( ${BRL_INCLUDE_DIR}/bpro )
-   include_directories( ${BRL_INCLUDE_DIR}/bpro/bprb )
-diff --git a/contrib/brl/bbas/bkml/CMakeLists.txt b/contrib/brl/bbas/bkml/CMakeLists.txt
-index 6328cfd419..bb6a65f96d 100644
---- a/contrib/brl/bbas/bkml/CMakeLists.txt
-+++ b/contrib/brl/bbas/bkml/CMakeLists.txt
-@@ -5,7 +5,7 @@ set(bkml_sources
-   bkml_write.h bkml_write.cxx
- )
- 
--include( ${BRL_MODULE_PATH}/FindEXPAT.cmake )
-+FIND_PACKAGE(EXPAT REQUIRED)
- 
- if(EXPAT_FOUND)
-  if(EXPATPP_FOUND)
-diff --git a/contrib/brl/bbas/bocl/pro/CMakeLists.txt b/contrib/brl/bbas/bocl/pro/CMakeLists.txt
-index 96e947876d..ba6ba1deb8 100644
---- a/contrib/brl/bbas/bocl/pro/CMakeLists.txt
-+++ b/contrib/brl/bbas/bocl/pro/CMakeLists.txt
-@@ -1,5 +1,6 @@
- # bprb depends on expat and boxm_ocl_pro depends on bprb primarily
--include( ${BRL_MODULE_PATH}/FindEXPAT.cmake )
-+FIND_PACKAGE(EXPAT REQUIRED)
-+FIND_PACKAGE(EXPATPP REQUIRED)
- if(EXPAT_FOUND)
-   include_directories( ${BRL_INCLUDE_DIR}/bpro )
-   include_directories( ${BRL_INCLUDE_DIR}/bpro/bprb )
-diff --git a/contrib/brl/bbas/bvgl/CMakeLists.txt b/contrib/brl/bbas/bvgl/CMakeLists.txt
-index c4da5b9d28..260bcf1d88 100644
---- a/contrib/brl/bbas/bvgl/CMakeLists.txt
-+++ b/contrib/brl/bbas/bvgl/CMakeLists.txt
-@@ -37,7 +37,8 @@ aux_source_directory(Templates bvgl_sources)
- 
- 
- #find expatpp library for
--include( ${BRL_MODULE_PATH}/FindEXPAT.cmake )
-+FIND_PACKAGE(EXPAT REQUIRED)
-+FIND_PACKAGE(EXPATPP REQUIRED)
- if(EXPAT_FOUND)
-   include_directories( ${EXPAT_INCLUDE_DIR} )
-   include_directories( ${BRL_INCLUDE_DIR}/b3p/expatpp )
-diff --git a/contrib/brl/bbas/bvgl/bvgl_labelme_parser.h b/contrib/brl/bbas/bvgl/bvgl_labelme_parser.h
-index afa5d22968..40327fb9ea 100644
---- a/contrib/brl/bbas/bvgl/bvgl_labelme_parser.h
-+++ b/contrib/brl/bbas/bvgl/bvgl_labelme_parser.h
-@@ -14,7 +14,7 @@
- #include <string>
- #include <iostream>
- #include <sstream>
--#include <expatpplib.h>
-+#include <expatpp.h>
- #ifdef _MSC_VER
- #  include <vcl_msvc_warnings.h>
- #endif
-diff --git a/contrib/brl/bbas/bvgl/tests/CMakeLists.txt b/contrib/brl/bbas/bvgl/tests/CMakeLists.txt
-index 76995137ed..1cb0736454 100644
---- a/contrib/brl/bbas/bvgl/tests/CMakeLists.txt
-+++ b/contrib/brl/bbas/bvgl/tests/CMakeLists.txt
-@@ -16,7 +16,8 @@ set(bvgl_test_sources
- )
- 
- #Make sure expat library is found
--include( ${BRL_MODULE_PATH}/FindEXPAT.cmake )
-+FIND_PACKAGE(EXPAT REQUIRED)
-+FIND_PACKAGE(EXPATPP REQUIRED)
- 
- if(EXPAT_FOUND)
-   set(bvgl_test_sources ${bvgl_test_sources} test_bvgl_labelme_parser.cxx)
-diff --git a/contrib/brl/bbas/bwm/CMakeLists.txt b/contrib/brl/bbas/bwm/CMakeLists.txt
-index 4a16a57d9e..72ea30dc37 100644
---- a/contrib/brl/bbas/bwm/CMakeLists.txt
-+++ b/contrib/brl/bbas/bwm/CMakeLists.txt
-@@ -26,7 +26,8 @@ endif()
- 
- include( ${BRL_MODULE_PATH}/FindSHAPELIB.cmake )
- 
--include( ${BRL_MODULE_PATH}/FindEXPAT.cmake )
-+FIND_PACKAGE(EXPAT REQUIRED)
-+FIND_PACKAGE(EXPATPP REQUIRED)
- 
- # Set CMake options for using vgui
- include( ${VXL_CMAKE_DIR}/UseVGUI.cmake )
-diff --git a/contrib/brl/bbas/bwm/io/CMakeLists.txt b/contrib/brl/bbas/bwm/io/CMakeLists.txt
-index 918c196161..f0ea9a69c9 100644
---- a/contrib/brl/bbas/bwm/io/CMakeLists.txt
-+++ b/contrib/brl/bbas/bwm/io/CMakeLists.txt
-@@ -8,7 +8,8 @@ set(bwm_io_sources
- )
- aux_source_directory(Templates bwm_io_sources)
- 
--include( ${BRL_MODULE_PATH}/FindEXPAT.cmake )
-+FIND_PACKAGE(EXPAT REQUIRED)
-+FIND_PACKAGE(EXPATPP REQUIRED)
- 
- if(EXPAT_FOUND)
-  if(EXPATPP_FOUND)
-diff --git a/contrib/brl/bbas/bwm/pro/CMakeLists.txt b/contrib/brl/bbas/bwm/pro/CMakeLists.txt
-index 920f31413c..21949a782c 100644
---- a/contrib/brl/bbas/bwm/pro/CMakeLists.txt
-+++ b/contrib/brl/bbas/bwm/pro/CMakeLists.txt
-@@ -9,7 +9,8 @@ set(bwm_pro_sources
-     bwm_register.h    bwm_register.cxx
- )
- 
--include( ${BRL_MODULE_PATH}/FindEXPAT.cmake )
-+FIND_PACKAGE(EXPAT REQUIRED)
-+FIND_PACKAGE(EXPATPP REQUIRED)
- 
- if(EXPAT_FOUND)
-  if(EXPATPP_FOUND)
-diff --git a/contrib/brl/bbas/bwm/video/CMakeLists.txt b/contrib/brl/bbas/bwm/video/CMakeLists.txt
-index 5408fe77a7..0787b9a74e 100644
---- a/contrib/brl/bbas/bwm/video/CMakeLists.txt
-+++ b/contrib/brl/bbas/bwm/video/CMakeLists.txt
-@@ -11,7 +11,8 @@ set(bwm_video_sources
-                                  bwm_video_site_io_defs.h
- )
- 
--include( ${BRL_MODULE_PATH}/FindEXPAT.cmake )
-+FIND_PACKAGE(EXPAT REQUIRED)
-+FIND_PACKAGE(EXPATPP REQUIRED)
- 
- if(EXPAT_FOUND)
-  if(EXPATPP_FOUND)
-diff --git a/contrib/brl/bbas/bwm/video/exe/CMakeLists.txt b/contrib/brl/bbas/bwm/video/exe/CMakeLists.txt
-index ca3c490d5e..d232649ccb 100644
---- a/contrib/brl/bbas/bwm/video/exe/CMakeLists.txt
-+++ b/contrib/brl/bbas/bwm/video/exe/CMakeLists.txt
-@@ -1,7 +1,8 @@
- # This is contrib/bwm/exe/CMakeLists.txt
- # World Modeling GUI executables
- 
--include( ${BRL_MODULE_PATH}/FindEXPAT.cmake )
-+FIND_PACKAGE(EXPAT REQUIRED)
-+FIND_PACKAGE(EXPATPP REQUIRED)
- 
- if(EXPAT_FOUND)
-   if(EXPATPP_FOUND)
-diff --git a/contrib/brl/bbas/bxml/CMakeLists.txt b/contrib/brl/bbas/bxml/CMakeLists.txt
-index c027dfaa28..72fed69f82 100644
---- a/contrib/brl/bbas/bxml/CMakeLists.txt
-+++ b/contrib/brl/bbas/bxml/CMakeLists.txt
-@@ -12,7 +12,8 @@ set( bxml_sources
-     bxml_find.cxx                bxml_find.h
- )
- 
--include( ${BRL_MODULE_PATH}/FindEXPAT.cmake )
-+FIND_PACKAGE(EXPAT REQUIRED)
-+FIND_PACKAGE(EXPATPP REQUIRED)
- 
- if(EXPAT_FOUND)
-  if(EXPATPP_FOUND)
-@@ -28,13 +29,15 @@ aux_source_directory(Templates bxml_sources)
- 
- vxl_add_library(LIBRARY_NAME bxml LIBRARY_SOURCES ${bxml_sources})
- 
--target_link_libraries( bxml ${VXL_LIB_PREFIX}vbl_io ${VXL_LIB_PREFIX}vul ${VXL_LIB_PREFIX}vbl )
- if(EXPAT_FOUND)
-  if(EXPATPP_FOUND)
--  target_link_libraries( bxml ${EXPATPP_LIBRARIES})
-+  target_link_libraries( bxml ${EXPATPP_LIBRARIES} ${VXL_LIB_PREFIX}vbl_io ${VXL_LIB_PREFIX}vul ${VXL_LIB_PREFIX}vbl )
-  endif()
-+else()
-+  target_link_libraries( bxml ${VXL_LIB_PREFIX}vbl_io ${VXL_LIB_PREFIX}vul ${VXL_LIB_PREFIX}vbl )
- endif()
- 
-+
- add_subdirectory(bsvg)
- 
- if( BUILD_TESTING )
-diff --git a/contrib/brl/bbas/volm/CMakeLists.txt b/contrib/brl/bbas/volm/CMakeLists.txt
-index 72b3b217ea..fe8cf45b75 100644
---- a/contrib/brl/bbas/volm/CMakeLists.txt
-+++ b/contrib/brl/bbas/volm/CMakeLists.txt
-@@ -6,7 +6,8 @@
- include( ${VXL_CMAKE_DIR}/FindGEOTIFF.cmake)
- if(HAS_GEOTIFF)
- 
--include( ${BRL_MODULE_PATH}/FindEXPAT.cmake )
-+FIND_PACKAGE(EXPAT REQUIRED)
-+FIND_PACKAGE(EXPATPP REQUIRED)
- if(EXPAT_FOUND)
-   if(EXPATPP_FOUND)
- 
-diff --git a/contrib/brl/bbas/volm/volm_osm_parser.h b/contrib/brl/bbas/volm/volm_osm_parser.h
-index 82283250dd..289d5d5265 100644
---- a/contrib/brl/bbas/volm/volm_osm_parser.h
-+++ b/contrib/brl/bbas/volm/volm_osm_parser.h
-@@ -20,7 +20,7 @@
- #include <map>
- #include <vector>
- #include <utility>
--#include <expatpplib.h>
-+#include <expatpp.h>
- #ifdef _MSC_VER
- #  include <vcl_msvc_warnings.h>
- #endif
-diff --git a/contrib/brl/bmods/FindEXPAT.cmake b/contrib/brl/bmods/FindEXPAT.cmake
-index 2be7c9a963..cefa9c0a0e 100644
---- a/contrib/brl/bmods/FindEXPAT.cmake
-+++ b/contrib/brl/bmods/FindEXPAT.cmake
-@@ -27,6 +27,10 @@ if(NOT EXPAT_FOUND)
-     if(EXPAT_FOUND)
-       set(VXL_USING_NATIVE_EXPAT "YES")
-     endif()
-+    find_package(EXPATPP)
-+    if(EXPATPP_FOUND)
-+      set(VXL_USING_NATIVE_EXPATPP "YES")
-+    endif()
-   endif()
- 
- 
-@@ -48,40 +52,3 @@ if(NOT EXPAT_FOUND)
- 
- endif()
- #mark_as_advanced(EXPAT_INCLUDE_DIR EXPAT_LIBRARY)
--
--if(EXPAT_FOUND) # EXPATPP requires EXPAT
--  find_path(EXPATPP_SYSTEM_INCLUDE_DIR NAMES expatpp.h )
--  find_library(EXPATPP_SYSTEM_LIBRARY NAMES expatpp libexpatpp )
--
--  if( EXPATPP_SYSTEM_INCLUDE_DIR AND EXPATPP_SYSTEM_LIBRARY )
--    set(VXL_USING_NATIVE_EXPATPP "YES")
--    set(EXPATPP_LIBRARIES ${EXPATPP_SYSTEM_LIBRARY})
--    set(EXPATPP_INCLUDE_DIRS ${EXPATPP_SYSTEM_INCLUDE_DIR})
--  else()
--    set(VXL_USING_NATIVE_EXPATPP NO)
--    if(EXISTS ${VXL_ROOT_SOURCE_DIR}/contrib/brl/b3p/expatpp/expatpp.h)
--      set( EXPATPP_FOUND YES )
--      set( EXPATPP_LIBRARIES expatpp )
--      set( EXPATPP_LIBRARY expatpp )
--      set( EXPATPP_INCLUDE_DIRS ${VXL_ROOT_SOURCE_DIR}/contrib/brl/b3p/expatpp ${BRL_BINARY_DIR}/b3p/expatpp )
--      set( EXPATPP_INCLUDE_DIR ${VXL_ROOT_SOURCE_DIR}/contrib/brl/b3p/expatpp ${BRL_BINARY_DIR}/b3p/expatpp )
--      set( EXPATPP_INSTALL_INCLUDE_DIR ${CMAKE_INSTALL_PREFIX}/include/vxl/contrib/brl/b3p/expatpp)
--    else()
--      unset(EXPATPP_SYSTEM_INCLUDE_DIR) #If not found, keep out of cmake window
--      unset(EXPATPP_SYSTEM_LIBRARY)  # If not found, keep out of cmake window
--      unset(EXPATPP_LIBRARIES)
--      unset(EXPATPP_INCLUDE_DIRS)
--      unset(EXPAT_FOUND)
--      unset(EXPATPP_FOUND)
--    endif()
--  endif()
--
--  include(FindPackageHandleStandardArgs)
--  # FOUND_VAR EXPATPP_FOUND  not supported in cmake 2.8.9
--  FIND_PACKAGE_HANDLE_STANDARD_ARGS( EXPATPP
--             REQUIRED_VARS EXPATPP_LIBRARY EXPATPP_INCLUDE_DIR
--             FAIL_MESSAGE "MISSING: "
--     )
--endif()
--mark_as_advanced(EXPATPP_SYSTEM_INCLUDE_DIR EXPATPP_SYSTEM_LIBRARY)
--mark_as_advanced(EXPATPP_INCLUDE_DIR EXPATPP_LIBRARY)
-diff --git a/contrib/brl/bpro/CMakeLists.txt b/contrib/brl/bpro/CMakeLists.txt
-index 637c1ecfa8..bb3562f59d 100644
---- a/contrib/brl/bpro/CMakeLists.txt
-+++ b/contrib/brl/bpro/CMakeLists.txt
-@@ -1,7 +1,8 @@
- # brl/bpro/CMakeLists.txt
- # main package for processing operations
- 
--include( ${BRL_MODULE_PATH}/FindEXPAT.cmake )
-+FIND_PACKAGE(EXPAT REQUIRED)
-+FIND_PACKAGE(EXPATPP REQUIRED)
- if(EXPAT_FOUND)
- 
- # Basic process classes
-diff --git a/contrib/brl/bpro/bprb/tests/CMakeLists.txt b/contrib/brl/bpro/bprb/tests/CMakeLists.txt
-index cfb865611a..954315f1bd 100644
---- a/contrib/brl/bpro/bprb/tests/CMakeLists.txt
-+++ b/contrib/brl/bpro/bprb/tests/CMakeLists.txt
-@@ -1,6 +1,10 @@
- # brl/bpro/bprb/tests/CMakeLists.txt
- configure_file( ${CMAKE_CURRENT_SOURCE_DIR}/params.xml
-                 ${CMAKE_CURRENT_BINARY_DIR}/params.xml)
-+
-+FIND_PACKAGE(EXPAT REQUIRED)
-+FIND_PACKAGE(EXPATPP REQUIRED)
-+
- if(EXPAT_FOUND)
-  if(EXPATPP_FOUND)
- 
-@@ -10,7 +14,7 @@ if(EXPAT_FOUND)
-    test_process_params.cxx
-    bprb_test_process.h bprb_test_process.cxx
-   )
--  target_link_libraries( bprb_test_all bprb ${VXL_LIB_PREFIX}testlib expat expatpp)
-+  target_link_libraries( bprb_test_all bprb ${VXL_LIB_PREFIX}testlib ${EXPAT_LIBRARIES} ${EXPATPP_LIBRARIES})
- 
-   add_test( NAME bprb_test_process COMMAND $<TARGET_FILE:bprb_test_all> test_process )
-   add_test( NAME bprb_test_process_params COMMAND $<TARGET_FILE:bprb_test_all> test_process_params )
-diff --git a/contrib/brl/bseg/bbgm/pro/CMakeLists.txt b/contrib/brl/bseg/bbgm/pro/CMakeLists.txt
-index 013afc8146..365ef65b67 100644
---- a/contrib/brl/bseg/bbgm/pro/CMakeLists.txt
-+++ b/contrib/brl/bseg/bbgm/pro/CMakeLists.txt
-@@ -1,6 +1,7 @@
- # brl/bseg/bbgm/pro/CMakeLists.txt
- 
--include( ${BRL_MODULE_PATH}/FindEXPAT.cmake )
-+FIND_PACKAGE(EXPAT REQUIRED)
-+FIND_PACKAGE(EXPATPP REQUIRED)
- if(EXPAT_FOUND)
- 
- include_directories( ${BRL_INCLUDE_DIR} )
-diff --git a/contrib/brl/bseg/bbgm_batch/CMakeLists.txt b/contrib/brl/bseg/bbgm_batch/CMakeLists.txt
-index fb0836b415..0dfcfc9795 100644
---- a/contrib/brl/bseg/bbgm_batch/CMakeLists.txt
-+++ b/contrib/brl/bseg/bbgm_batch/CMakeLists.txt
-@@ -1,7 +1,8 @@
- # contrib/brl/bseg/bbgm_batch/CMakeLists.txt
- 
- if( PYTHONLIBS_FOUND )
--  include( ${BRL_MODULE_PATH}/FindEXPAT.cmake )
-+  FIND_PACKAGE(EXPAT REQUIRED)
-+  FIND_PACKAGE(EXPATPP REQUIRED)
-   if( EXPAT_FOUND )
-     if(EXPATPP_FOUND)
-     include(${VXL_CMAKE_DIR}/FindTIFF.cmake)
-diff --git a/contrib/brl/bseg/betr_batch/CMakeLists.txt b/contrib/brl/bseg/betr_batch/CMakeLists.txt
-index 20df829930..5321bd017e 100644
---- a/contrib/brl/bseg/betr_batch/CMakeLists.txt
-+++ b/contrib/brl/bseg/betr_batch/CMakeLists.txt
-@@ -2,7 +2,8 @@
- project( betr_batch )
- 
- if( PYTHONLIBS_FOUND )
--  include( ${BRL_MODULE_PATH}/FindEXPAT.cmake )
-+  FIND_PACKAGE(EXPAT REQUIRED)
-+  FIND_PACKAGE(EXPATPP REQUIRED)
-   if( EXPAT_FOUND )
-     include_directories( ${PYTHON_INCLUDE_DIRS} )
-     include_directories( ${BRL_INCLUDE_DIR} )
-diff --git a/contrib/brl/bseg/bmdl/pro/CMakeLists.txt b/contrib/brl/bseg/bmdl/pro/CMakeLists.txt
-index 76fe0891b7..7c73fe1bb0 100644
---- a/contrib/brl/bseg/bmdl/pro/CMakeLists.txt
-+++ b/contrib/brl/bseg/bmdl/pro/CMakeLists.txt
-@@ -9,7 +9,8 @@ if(ZLIB_FOUND)
- endif()
- 
- # bprb depends on expat and bmdl_prodepends on bprb primarily
--include( ${BRL_MODULE_PATH}/FindEXPAT.cmake )
-+FIND_PACKAGE(EXPAT REQUIRED)
-+FIND_PACKAGE(EXPATPP REQUIRED)
- if(EXPAT_FOUND)
-   include(${VXL_CMAKE_DIR}/FindTIFF.cmake)
-   if(TIFF_FOUND)
-diff --git a/contrib/brl/bseg/bmdl_batch/CMakeLists.txt b/contrib/brl/bseg/bmdl_batch/CMakeLists.txt
-index fb7fcb176d..52aa721a3f 100644
---- a/contrib/brl/bseg/bmdl_batch/CMakeLists.txt
-+++ b/contrib/brl/bseg/bmdl_batch/CMakeLists.txt
-@@ -1,7 +1,8 @@
- # contrib/brl/bseg/bmdl_batch/CMakeLists.txt
- 
- if( PYTHONLIBS_FOUND )
--  include( ${BRL_MODULE_PATH}/FindEXPAT.cmake )
-+  FIND_PACKAGE(EXPAT REQUIRED)
-+  FIND_PACKAGE(EXPATPP REQUIRED)
-   if( EXPAT_FOUND )
-    if(EXPATPP_FOUND)
-     include(${VXL_CMAKE_DIR}/FindTIFF.cmake)
-diff --git a/contrib/brl/bseg/boxm2/CMakeLists.txt b/contrib/brl/bseg/boxm2/CMakeLists.txt
-index 4475e418be..476d43b151 100644
---- a/contrib/brl/bseg/boxm2/CMakeLists.txt
-+++ b/contrib/brl/bseg/boxm2/CMakeLists.txt
-@@ -21,7 +21,8 @@ set(boxm2_sources
-     boxm2_blocks_vis_graph.h          boxm2_blocks_vis_graph.cxx
-    )
- 
--include( ${BRL_MODULE_PATH}/FindEXPAT.cmake )
-+FIND_PACKAGE(EXPAT REQUIRED)
-+FIND_PACKAGE(EXPATPP REQUIRED)
- if(EXPAT_FOUND)
- 
-   include_directories( ${EXPAT_INCLUDE_DIR} )
-diff --git a/contrib/brl/bseg/boxm2/boxm2_bounding_box_parser.h b/contrib/brl/bseg/boxm2/boxm2_bounding_box_parser.h
-index d87dc359fe..94f764c61d 100644
---- a/contrib/brl/bseg/boxm2/boxm2_bounding_box_parser.h
-+++ b/contrib/brl/bseg/boxm2/boxm2_bounding_box_parser.h
-@@ -4,7 +4,7 @@
- #include <string>
- #include <iostream>
- #include <map>
--#include <expatpplib.h>
-+#include <expatpp.h>
- 
- #include <boxm2/basic/boxm2_block_id.h>
- #include <boxm2/boxm2_block_metadata.h>
-diff --git a/contrib/brl/bseg/boxm2/boxm2_scene_parser.h b/contrib/brl/bseg/boxm2/boxm2_scene_parser.h
-index 963a8a803d..b697652f36 100644
---- a/contrib/brl/bseg/boxm2/boxm2_scene_parser.h
-+++ b/contrib/brl/bseg/boxm2/boxm2_scene_parser.h
-@@ -4,7 +4,7 @@
- #include <string>
- #include <iostream>
- #include <map>
--#include <expatpplib.h>
-+#include <expatpp.h>
- 
- #include <boxm2/basic/boxm2_block_id.h>
- #include <boxm2/boxm2_block_metadata.h>
-diff --git a/contrib/brl/bseg/boxm2/pro/CMakeLists.txt b/contrib/brl/bseg/boxm2/pro/CMakeLists.txt
-index ca91150930..7c2ec1d9c3 100644
---- a/contrib/brl/bseg/boxm2/pro/CMakeLists.txt
-+++ b/contrib/brl/bseg/boxm2/pro/CMakeLists.txt
-@@ -1,7 +1,8 @@
- # boxm2's Process Library
- 
- # bprb depends on expat and boxm2_pro depends on bprb primarily
--include( ${BRL_MODULE_PATH}/FindEXPAT.cmake )
-+FIND_PACKAGE(EXPAT REQUIRED)
-+FIND_PACKAGE(EXPATPP REQUIRED)
- if(EXPAT_FOUND)
-   include_directories( ${BRL_INCLUDE_DIR}/bpro/core )
-   include_directories( ${BRL_INCLUDE_DIR}/bpro )
-diff --git a/contrib/brl/bseg/boxm2/pro/processes/boxm2_ingest_convex_mesh_process.cxx b/contrib/brl/bseg/boxm2/pro/processes/boxm2_ingest_convex_mesh_process.cxx
-index 082696b982..605e90bb61 100644
---- a/contrib/brl/bseg/boxm2/pro/processes/boxm2_ingest_convex_mesh_process.cxx
-+++ b/contrib/brl/bseg/boxm2/pro/processes/boxm2_ingest_convex_mesh_process.cxx
-@@ -31,8 +31,8 @@
- #include <bmsh3d/bmsh3d_mesh.h>
- #include <bmsh3d/algo/bmsh3d_fileio.h>
- #include <bmsh3d/bmsh3d_mesh_mc.h>
--#include "vgl/vgl_intersection.h"
--#include <expatpplib.h>
-+#include <vgl/vgl_intersection.h>
-+#include <expatpp.h>
- #include <boxm2/boxm2_bounding_box_parser.h>
- 
- namespace boxm2_ingest_convex_mesh_process_globals
-diff --git a/contrib/brl/bseg/boxm2/volm/CMakeLists.txt b/contrib/brl/bseg/boxm2/volm/CMakeLists.txt
-index 923e37f35f..064003f994 100644
---- a/contrib/brl/bseg/boxm2/volm/CMakeLists.txt
-+++ b/contrib/brl/bseg/boxm2/volm/CMakeLists.txt
-@@ -1,6 +1,7 @@
- # This is contrib/brl/bseg/boxm2/volm/CMakeLists
- # volm depends on bkml and expat
--include( ${BRL_MODULE_PATH}/FindEXPAT.cmake )
-+FIND_PACKAGE(EXPAT REQUIRED)
-+FIND_PACKAGE(EXPATPP REQUIRED)
- if(EXPAT_FOUND)
-   if(EXPATPP_FOUND)
- 
-diff --git a/contrib/brl/bseg/boxm2/volm/pro/CMakeLists.txt b/contrib/brl/bseg/boxm2/volm/pro/CMakeLists.txt
-index 6ad0bdde83..265cd5d066 100644
---- a/contrib/brl/bseg/boxm2/volm/pro/CMakeLists.txt
-+++ b/contrib/brl/bseg/boxm2/volm/pro/CMakeLists.txt
-@@ -1,7 +1,8 @@
- # boxm2's Process Library
- 
- # bprb depends on expat and boxm2_pro depends on bprb primarily
--include( ${BRL_MODULE_PATH}/FindEXPAT.cmake )
-+FIND_PACKAGE(EXPAT REQUIRED)
-+FIND_PACKAGE(EXPATPP REQUIRED)
- if(EXPAT_FOUND)
-   include_directories( ${BRL_INCLUDE_DIR}/bpro/core )
-   include_directories( ${BRL_INCLUDE_DIR}/bpro )
-diff --git a/contrib/brl/bseg/boxm2_batch/CMakeLists.txt b/contrib/brl/bseg/boxm2_batch/CMakeLists.txt
-index 9e1c59a967..c7eb640d55 100644
---- a/contrib/brl/bseg/boxm2_batch/CMakeLists.txt
-+++ b/contrib/brl/bseg/boxm2_batch/CMakeLists.txt
-@@ -7,7 +7,8 @@ include( ${BRL_CMAKE_DIR}/FindHadoop.cmake )
- include( ${VXL_CMAKE_DIR}/UseVGUI.cmake )
- 
- if( PYTHONLIBS_FOUND )
--  include( ${BRL_MODULE_PATH}/FindEXPAT.cmake )
-+  FIND_PACKAGE(EXPAT REQUIRED)
-+  FIND_PACKAGE(EXPATPP REQUIRED)
-   if( EXPAT_FOUND )
-     include_directories( ${PYTHON_INCLUDE_DIRS} )
-     include_directories( ${BRL_INCLUDE_DIR} )
-diff --git a/contrib/brl/bseg/boxm2_multi/pro/CMakeLists.txt b/contrib/brl/bseg/boxm2_multi/pro/CMakeLists.txt
-index c0330db1e2..68ab30dffc 100644
---- a/contrib/brl/bseg/boxm2_multi/pro/CMakeLists.txt
-+++ b/contrib/brl/bseg/boxm2_multi/pro/CMakeLists.txt
-@@ -1,7 +1,8 @@
- # boxm2 multi gpu or cpu Process Library
- 
- # bprb depends on expat and boxm2_multi_pro depends on bprb primarily
--include( ${BRL_MODULE_PATH}/FindEXPAT.cmake )
-+FIND_PACKAGE(EXPAT REQUIRED)
-+FIND_PACKAGE(EXPATPP REQUIRED)
- if(EXPAT_FOUND)
-   include_directories( ${BRL_INCLUDE_DIR}/bseg )
-   set(boxm2_multi_pro_sources
-diff --git a/contrib/brl/bseg/brec_batch/CMakeLists.txt b/contrib/brl/bseg/brec_batch/CMakeLists.txt
-index a3ab77b316..e228152f4b 100644
---- a/contrib/brl/bseg/brec_batch/CMakeLists.txt
-+++ b/contrib/brl/bseg/brec_batch/CMakeLists.txt
-@@ -1,7 +1,8 @@
- # contrib/brl/bseg/brec_batch/CMakeLists.txt
- 
- if( PYTHONLIBS_FOUND )
--  include( ${BRL_MODULE_PATH}/FindEXPAT.cmake )
-+  FIND_PACKAGE(EXPAT REQUIRED)
-+  FIND_PACKAGE(EXPATPP REQUIRED)
-   if( EXPAT_FOUND )
-     include_directories( ${PYTHON_INCLUDE_DIRS} )
-     include_directories( ${BRL_INCLUDE_DIR} )
-diff --git a/contrib/brl/bseg/bstm/CMakeLists.txt b/contrib/brl/bseg/bstm/CMakeLists.txt
-index 977d68fdab..77205c2e6b 100644
---- a/contrib/brl/bseg/bstm/CMakeLists.txt
-+++ b/contrib/brl/bseg/bstm/CMakeLists.txt
-@@ -15,7 +15,8 @@ set(bstm_sources bstm_block_metadata.h bstm_block_metadata.cxx
-                  bstm_time_block.h bstm_time_block.cxx
-                  bstm_util.cxx bstm_util.h)
- 
--include( ${BRL_MODULE_PATH}/FindEXPAT.cmake )
-+FIND_PACKAGE(EXPAT REQUIRED)
-+FIND_PACKAGE(EXPATPP REQUIRED)
- if(EXPAT_FOUND)
-   include_directories( ${EXPAT_INCLUDE_DIR} )
-   include_directories( ${BRL_INCLUDE_DIR}/b3p/expatpp )
-diff --git a/contrib/brl/bseg/bstm/bstm_scene_parser.h b/contrib/brl/bseg/bstm/bstm_scene_parser.h
-index 325aee9239..f1b519d12f 100644
---- a/contrib/brl/bseg/bstm/bstm_scene_parser.h
-+++ b/contrib/brl/bseg/bstm/bstm_scene_parser.h
-@@ -4,7 +4,7 @@
- #include <string>
- #include <iostream>
- #include <map>
--#include <expatpplib.h>
-+#include <expatpp.h>
- 
- #include <bstm/basic/bstm_block_id.h>
- #include <bstm/bstm_block_metadata.h>
-diff --git a/contrib/brl/bseg/bstm_batch/CMakeLists.txt b/contrib/brl/bseg/bstm_batch/CMakeLists.txt
-index e548807de5..b2b047f3b6 100644
---- a/contrib/brl/bseg/bstm_batch/CMakeLists.txt
-+++ b/contrib/brl/bseg/bstm_batch/CMakeLists.txt
-@@ -10,7 +10,8 @@ if(DIRECTSHOW_FOUND)
- endif()
- 
- if( PYTHONLIBS_FOUND )
--  include( ${BRL_MODULE_PATH}/FindEXPAT.cmake )
-+  FIND_PACKAGE(EXPAT REQUIRED)
-+  FIND_PACKAGE(EXPATPP REQUIRED)
-   if( EXPAT_FOUND )
-     include_directories( ${PYTHON_INCLUDE_DIRS} )
-     include_directories( ${BRL_INCLUDE_DIR} )
-diff --git a/contrib/brl/bseg/bstm_multi/CMakeLists.txt b/contrib/brl/bseg/bstm_multi/CMakeLists.txt
-index ba8815fe6b..1f57d0d958 100644
---- a/contrib/brl/bseg/bstm_multi/CMakeLists.txt
-+++ b/contrib/brl/bseg/bstm_multi/CMakeLists.txt
-@@ -15,7 +15,8 @@ set(bstm_multi_sources
-   space_time_scene_parser.h space_time_scene_parser.hxx
-   )
- 
--include( ${BRL_MODULE_PATH}/FindEXPAT.cmake )
-+FIND_PACKAGE(EXPAT REQUIRED)
-+FIND_PACKAGE(EXPATPP REQUIRED)
- if (EXPAT_FOUND)
-   include_directories( ${EXPAT_INCLUDE_DIR} )
-   include_directories( ${BRL_INCLUDE_DIR}/b3p/expatpp )
-diff --git a/contrib/brl/bseg/bstm_multi/space_time_scene_parser.h b/contrib/brl/bseg/bstm_multi/space_time_scene_parser.h
-index 062a2eda8f..c5108c1018 100644
---- a/contrib/brl/bseg/bstm_multi/space_time_scene_parser.h
-+++ b/contrib/brl/bseg/bstm_multi/space_time_scene_parser.h
-@@ -20,7 +20,7 @@
- #include <map>
- #include <string>
- #include <vector>
--#include <expatpplib.h>
-+#include <expatpp.h>
- 
- #ifdef _MSC_VER
- #  include <vcl_msvc_warnings.h>
-diff --git a/contrib/brl/bseg/bvpl/functors/CMakeLists.txt b/contrib/brl/bseg/bvpl/functors/CMakeLists.txt
-index 25433e56f2..f3659d5390 100644
---- a/contrib/brl/bseg/bvpl/functors/CMakeLists.txt
-+++ b/contrib/brl/bseg/bvpl/functors/CMakeLists.txt
-@@ -1,7 +1,8 @@
- # This is contrib/brl/bseg/bvpl/kernels/CMakeLists.txt
- # The kernel-related files for Brown Voxel Processing Library (BVPL)
- 
--include( ${BRL_MODULE_PATH}/FindEXPAT.cmake )
-+FIND_PACKAGE(EXPAT REQUIRED)
-+FIND_PACKAGE(EXPATPP REQUIRED)
- if(EXPAT_FOUND)
- 
- include_directories( ${EXPAT_INCLUDE_DIR} )
-diff --git a/contrib/brl/bseg/bvpl/kernels/CMakeLists.txt b/contrib/brl/bseg/bvpl/kernels/CMakeLists.txt
-index 0672b5d3d8..615f02e3fa 100644
---- a/contrib/brl/bseg/bvpl/kernels/CMakeLists.txt
-+++ b/contrib/brl/bseg/bvpl/kernels/CMakeLists.txt
-@@ -1,7 +1,8 @@
- # This is contrib/brl/bseg/bvpl/kernels/CMakeLists.txt
- # The kernel-related files for Brown Voxel Processing Library (BVPL)
- 
--include( ${BRL_MODULE_PATH}/FindEXPAT.cmake )
-+FIND_PACKAGE(EXPAT REQUIRED)
-+FIND_PACKAGE(EXPATPP REQUIRED)
- if(EXPAT_FOUND)
- 
- include_directories( ${EXPAT_INCLUDE_DIR} )
-diff --git a/contrib/brl/bseg/bvpl/kernels/pro/CMakeLists.txt b/contrib/brl/bseg/bvpl/kernels/pro/CMakeLists.txt
-index 82ce0655e0..3e7108103d 100644
---- a/contrib/brl/bseg/bvpl/kernels/pro/CMakeLists.txt
-+++ b/contrib/brl/bseg/bvpl/kernels/pro/CMakeLists.txt
-@@ -2,7 +2,8 @@
- # BVPL kenel's related processes
- 
- # bprb depends on expat and bvxm_pro depends on bprb primarily
--include( ${BRL_MODULE_PATH}/FindEXPAT.cmake )
-+FIND_PACKAGE(EXPAT REQUIRED)
-+FIND_PACKAGE(EXPATPP REQUIRED)
- if(EXPAT_FOUND)
-   include_directories( ${BRL_INCLUDE_DIR}/bpro )
-   include_directories( ${BRL_INCLUDE_DIR}/bpro/bprb )
-diff --git a/contrib/brl/bseg/bvpl/pro/CMakeLists.txt b/contrib/brl/bseg/bvpl/pro/CMakeLists.txt
-index 3f4b2b26bc..03b7df907e 100644
---- a/contrib/brl/bseg/bvpl/pro/CMakeLists.txt
-+++ b/contrib/brl/bseg/bvpl/pro/CMakeLists.txt
-@@ -2,7 +2,8 @@
- # bvpl's Process Library
- 
- # bprb depends on expat and bvpl_pro depends on bprb primarily
--include( ${BRL_MODULE_PATH}/FindEXPAT.cmake )
-+FIND_PACKAGE(EXPAT REQUIRED)
-+FIND_PACKAGE(EXPATPP REQUIRED)
- if(EXPAT_FOUND)
-   include_directories( ${BRL_INCLUDE_DIR}/bpro )
-   include_directories( ${BRL_INCLUDE_DIR}/bpro/bprb )
-diff --git a/contrib/brl/bseg/bvpl_batch/CMakeLists.txt b/contrib/brl/bseg/bvpl_batch/CMakeLists.txt
-index 754741a408..9c629d4e5e 100644
---- a/contrib/brl/bseg/bvpl_batch/CMakeLists.txt
-+++ b/contrib/brl/bseg/bvpl_batch/CMakeLists.txt
-@@ -1,7 +1,8 @@
- # contrib/brl/bseg/bvpl_batch/CMakeLists.txt
- 
- if( PYTHONLIBS_FOUND )
--  include( ${BRL_MODULE_PATH}/FindEXPAT.cmake )
-+  FIND_PACKAGE(EXPAT REQUIRED)
-+  FIND_PACKAGE(EXPATPP REQUIRED)
-   if( EXPAT_FOUND )
-     include_directories( ${PYTHON_INCLUDE_DIRS} )
-     include_directories( ${BRL_INCLUDE_DIR} )
-diff --git a/contrib/brl/bseg/bvxm/CMakeLists.txt b/contrib/brl/bseg/bvxm/CMakeLists.txt
-index d637fead62..caa2ff3f35 100644
---- a/contrib/brl/bseg/bvxm/CMakeLists.txt
-+++ b/contrib/brl/bseg/bvxm/CMakeLists.txt
-@@ -38,7 +38,8 @@ set(bvxm_sources
- aux_source_directory(Templates bvxm_sources)
- 
- #find expatpp library for bvxm_world_params parser
--include( ${BRL_MODULE_PATH}/FindEXPAT.cmake )
-+FIND_PACKAGE(EXPAT REQUIRED)
-+FIND_PACKAGE(EXPATPP REQUIRED)
- if(EXPAT_FOUND)
-   include_directories( ${EXPAT_INCLUDE_DIR} )
-   include_directories( ${BRL_INCLUDE_DIR}/b3p/expatpp )
-diff --git a/contrib/brl/bseg/bvxm/algo/pro/CMakeLists.txt b/contrib/brl/bseg/bvxm/algo/pro/CMakeLists.txt
-index e07b20ebb7..3a0824d257 100644
---- a/contrib/brl/bseg/bvxm/algo/pro/CMakeLists.txt
-+++ b/contrib/brl/bseg/bvxm/algo/pro/CMakeLists.txt
-@@ -1,7 +1,8 @@
- # bvxm_algo Process Library
- 
- # bprb depends on expat and this process library depends on bprb
--include( ${BRL_MODULE_PATH}/FindEXPAT.cmake )
-+FIND_PACKAGE(EXPAT REQUIRED)
-+FIND_PACKAGE(EXPATPP REQUIRED)
-  if(EXPAT_FOUND)
-  if(EXPATPP_FOUND)
-   include_directories( ${BRL_INCLUDE_DIR}/bpro )
-diff --git a/contrib/brl/bseg/bvxm/bvxm_world_params_parser.h b/contrib/brl/bseg/bvxm/bvxm_world_params_parser.h
-index e58cf620f5..d707da04db 100644
---- a/contrib/brl/bseg/bvxm/bvxm_world_params_parser.h
-+++ b/contrib/brl/bseg/bvxm/bvxm_world_params_parser.h
-@@ -6,7 +6,7 @@
- #include <string>
- #include <iostream>
- #include <sstream>
--#include <expatpplib.h>
-+#include <expatpp.h>
- #ifdef _MSC_VER
- #  include <vcl_msvc_warnings.h>
- #endif
-diff --git a/contrib/brl/bseg/bvxm/grid/pro/CMakeLists.txt b/contrib/brl/bseg/bvxm/grid/pro/CMakeLists.txt
-index c2901f9c90..a41c67e514 100644
---- a/contrib/brl/bseg/bvxm/grid/pro/CMakeLists.txt
-+++ b/contrib/brl/bseg/bvxm/grid/pro/CMakeLists.txt
-@@ -2,7 +2,8 @@
- # bvxm's Process Library
- 
- # bprb depends on expat and bvxm_pro depends on bprb primarily
--include( ${BRL_MODULE_PATH}/FindEXPAT.cmake )
-+FIND_PACKAGE(EXPAT REQUIRED)
-+FIND_PACKAGE(EXPATPP REQUIRED)
- if(EXPAT_FOUND)
-   include_directories( ${BRL_INCLUDE_DIR}/bpro )
-   include_directories( ${BRL_INCLUDE_DIR}/bpro/bprb )
-diff --git a/contrib/brl/bseg/bvxm/pro/CMakeLists.txt b/contrib/brl/bseg/bvxm/pro/CMakeLists.txt
-index 6c98f11cc3..e5b88b5aff 100644
---- a/contrib/brl/bseg/bvxm/pro/CMakeLists.txt
-+++ b/contrib/brl/bseg/bvxm/pro/CMakeLists.txt
-@@ -2,7 +2,8 @@
- # bvxm's Process Library
- 
- # bprb depends on expat and bvxm_pro depends on bprb primarily
--include( ${BRL_MODULE_PATH}/FindEXPAT.cmake )
-+FIND_PACKAGE(EXPAT REQUIRED)
-+FIND_PACKAGE(EXPATPP REQUIRED)
- if(EXPAT_FOUND)
-   include_directories( ${EXPAT_INCLUDE_DIR} )
-   include_directories( ${BRL_INCLUDE_DIR}/bpro )
-diff --git a/contrib/brl/bseg/bvxm_batch/CMakeLists.txt b/contrib/brl/bseg/bvxm_batch/CMakeLists.txt
-index fee846b6d0..2044353da0 100644
---- a/contrib/brl/bseg/bvxm_batch/CMakeLists.txt
-+++ b/contrib/brl/bseg/bvxm_batch/CMakeLists.txt
-@@ -3,6 +3,8 @@ if(HAS_GEOTIFF)
- 
- if( PYTHONLIBS_FOUND )
-   include( ${BRL_MODULE_PATH}/FindEXPAT.cmake )
-+  FIND_PACKAGE(EXPAT REQUIRED)
-+  FIND_PACKAGE(EXPATPP REQUIRED)
-   if( EXPAT_FOUND )
-     include_directories( ${PYTHON_INCLUDE_DIRS} )
-     include_directories( ${BRL_INCLUDE_DIR} )
-diff --git a/contrib/brl/bseg/bvxm_bridge/CMakeLists.txt b/contrib/brl/bseg/bvxm_bridge/CMakeLists.txt
-index 76defad7a7..1cfd293103 100644
---- a/contrib/brl/bseg/bvxm_bridge/CMakeLists.txt
-+++ b/contrib/brl/bseg/bvxm_bridge/CMakeLists.txt
-@@ -5,7 +5,8 @@ if(OpenCL_FOUND)
-   include_directories( ${MUL_INCLUDE_DIR} )
- 
-   #find expatpp library
--  include( ${BRL_MODULE_PATH}/FindEXPAT.cmake )
-+  FIND_PACKAGE(EXPAT REQUIRED)
-+FIND_PACKAGE(EXPATPP REQUIRED)
-   if(EXPAT_FOUND)
-     include_directories( ${EXPAT_INCLUDE_DIR} )
-     include_directories( ${BRL_INCLUDE_DIR}/b3p/expatpp )
-diff --git a/contrib/brl/bseg/vcon/CMakeLists.txt b/contrib/brl/bseg/vcon/CMakeLists.txt
-index 26504576be..ed189bccd7 100644
---- a/contrib/brl/bseg/vcon/CMakeLists.txt
-+++ b/contrib/brl/bseg/vcon/CMakeLists.txt
-@@ -4,7 +4,8 @@
- include( ${VXL_CMAKE_DIR}/FindGEOTIFF.cmake)
- if(HAS_GEOTIFF)
- 
--include( ${BRL_MODULE_PATH}/FindEXPAT.cmake )
-+FIND_PACKAGE(EXPAT REQUIRED)
-+FIND_PACKAGE(EXPATPP REQUIRED)
- if(EXPAT_FOUND)
-   if(EXPATPP_FOUND)
-     include_directories( ${BRL_INCLUDE_DIR} )
--- 
-2.46.1
-
diff --git a/0003-Use-system-rply.patch b/0003-Use-system-rply.patch
new file mode 100644
index 0000000..604a916
--- /dev/null
+++ b/0003-Use-system-rply.patch
@@ -0,0 +1,71 @@
+From 2a338e6b27483b775d6ab0a6ba2661eb6231ac50 Mon Sep 17 00:00:00 2001
+From: Mario Ceresa <mrceresa@gmail.com>
+Date: Wed, 10 Oct 2012 17:15:37 +0200
+Subject: [PATCH 03/23] Use system rply
+
+Signed-off-by: Mario Ceresa <mrceresa@gmail.com>
+---
+ contrib/brl/bbas/bmsh3d/algo/CMakeLists.txt |  6 ++++--
+ v3p/CMakeLists.txt                          |  1 -
+ v3p/rply/CMakeLists.txt                     | 13 -------------
+ 3 files changed, 4 insertions(+), 16 deletions(-)
+ delete mode 100644 v3p/rply/CMakeLists.txt
+
+diff --git a/contrib/brl/bbas/bmsh3d/algo/CMakeLists.txt b/contrib/brl/bbas/bmsh3d/algo/CMakeLists.txt
+index d96bf35..c8be547 100644
+--- a/contrib/brl/bbas/bmsh3d/algo/CMakeLists.txt
++++ b/contrib/brl/bbas/bmsh3d/algo/CMakeLists.txt
+@@ -1,8 +1,10 @@
+ # This is bbas/bmsh3d/algo/CMakeLists.txt
+ # Brown 3D Mesh Algorithm Library
+ 
++FIND_PACKAGE(rply REQUIRED)
++
+ INCLUDE_DIRECTORIES( ${BRL_INCLUDE_DIR} )
+-INCLUDE_DIRECTORIES( ${VTHREEP_INCLUDE_DIR}/rply )
++INCLUDE_DIRECTORIES( ${RPLY_INCLUDE_DIR} )
+ 
+ SET( bmsh3d_algo_sources
+   bmsh3d_fileio.cxx           bmsh3d_fileio.h
+@@ -13,7 +15,7 @@ SET( bmsh3d_algo_sources
+ )
+ 
+ ADD_LIBRARY( bmsh3d_algo  ${bmsh3d_algo_sources})
+-TARGET_LINK_LIBRARIES( bmsh3d_algo bmsh3d rply vgl vnl vul)
++TARGET_LINK_LIBRARIES( bmsh3d_algo bmsh3d ${RPLY_LIBRARY} vgl vnl vul)
+ 
+ IF( BUILD_TESTING )
+   SUBDIRS(tests)
+diff --git a/v3p/CMakeLists.txt b/v3p/CMakeLists.txt
+index dbdb30a..2e300d4 100644
+--- a/v3p/CMakeLists.txt
++++ b/v3p/CMakeLists.txt
+@@ -60,6 +60,5 @@ IF (BUILD_CORE_IMAGING)
+   MARK_AS_ADVANCED( VXL_FORCE_V3P_OPENJPEG2 )
+   SUBDIRS(openjpeg2)
+ 
+-  SUBDIRS(rply)
+ 
+ ENDIF (BUILD_CORE_IMAGING)
+diff --git a/v3p/rply/CMakeLists.txt b/v3p/rply/CMakeLists.txt
+deleted file mode 100644
+index 87e7524..0000000
+--- a/v3p/rply/CMakeLists.txt
++++ /dev/null
+@@ -1,13 +0,0 @@
+-# This is /v3p/rply/CMakeLists.txt
+-# library for reading and writing .PLY file
+-
+-SET(rply_sources
+-  rply.h
+-  rply.c
+-  )
+- 
+-ADD_LIBRARY(rply ${rply_sources})
+-
+-#install the .h .txx and libs
+-INSTALL_TARGETS(/lib rply)
+-INSTALL_NOBASE_HEADER_FILES(/include/vxl/rply/brl/ ${rply_sources})
+-- 
+1.7.11.7
+
diff --git a/0003-v3.5.0-Use-Fedora-minizip.patch b/0003-v3.5.0-Use-Fedora-minizip.patch
deleted file mode 100644
index 6b155e9..0000000
--- a/0003-v3.5.0-Use-Fedora-minizip.patch
+++ /dev/null
@@ -1,37 +0,0 @@
-From c0cc5459f8ee3dfc40cefb26487a1449d5100d8e Mon Sep 17 00:00:00 2001
-From: "Ankur Sinha (Ankur Sinha Gmail)" <sanjay.ankur@gmail.com>
-Date: Thu, 15 Nov 2018 15:31:18 +0000
-Subject: [PATCH 03/18] v3.5.0 Use Fedora minizip
-
----
- contrib/brl/b3p/CMakeLists.txt                                | 4 ----
- .../bseg/bmdl/pro/processes/bmdl_generate_mesh_process.cxx    | 1 +
- 2 files changed, 1 insertion(+), 4 deletions(-)
-
-diff --git a/contrib/brl/b3p/CMakeLists.txt b/contrib/brl/b3p/CMakeLists.txt
-index 7fefd89f41..b2f4b5f6bd 100644
---- a/contrib/brl/b3p/CMakeLists.txt
-+++ b/contrib/brl/b3p/CMakeLists.txt
-@@ -19,7 +19,3 @@ add_subdirectory(expatpp)
- option( VXL_FORCE_B3P_SHAPELIB "Use B3P instead of any native SHAPELIB library?" YES)
- mark_as_advanced( VXL_FORCE_B3P_SHAPELIB )
- add_subdirectory(shapelib)
--
--add_subdirectory(minizip)
--
--
-diff --git a/contrib/brl/bseg/bmdl/pro/processes/bmdl_generate_mesh_process.cxx b/contrib/brl/bseg/bmdl/pro/processes/bmdl_generate_mesh_process.cxx
-index daf78da93f..1a2241adbf 100644
---- a/contrib/brl/bseg/bmdl/pro/processes/bmdl_generate_mesh_process.cxx
-+++ b/contrib/brl/bseg/bmdl/pro/processes/bmdl_generate_mesh_process.cxx
-@@ -38,6 +38,7 @@
- 
- #if HAS_ZLIB
- #include <minizip/zip.h>
-+#include <zlib.h>
- #endif
- 
- #define WRITEBUFFERSIZE (16384)
--- 
-2.46.1
-
diff --git a/0004-Added-more-soname.patch b/0004-Added-more-soname.patch
new file mode 100644
index 0000000..f0f37f3
--- /dev/null
+++ b/0004-Added-more-soname.patch
@@ -0,0 +1,53 @@
+From 4c5770c15c0ba12e4d11ec3e00b0d5852636aa76 Mon Sep 17 00:00:00 2001
+From: Mario Ceresa <mrceresa@gmail.com>
+Date: Wed, 10 Oct 2012 17:16:38 +0200
+Subject: [PATCH 04/23] Added more soname
+
+Signed-off-by: Mario Ceresa <mrceresa@gmail.com>
+---
+ CMakeLists.txt               | 3 ++-
+ core/vil/CMakeLists.txt      | 1 +
+ core/vil/algo/CMakeLists.txt | 1 +
+ 3 files changed, 4 insertions(+), 1 deletion(-)
+
+diff --git a/CMakeLists.txt b/CMakeLists.txt
+index 67b2ea4..71f48bc 100644
+--- a/CMakeLists.txt
++++ b/CMakeLists.txt
+@@ -29,7 +29,8 @@ SET(VCL_LIBRARY_PROPERTIES ${VXL_LIBRARY_PROPERTIES})
+ SET(VNL_ALGO_LIBRARY_PROPERTIES ${VXL_LIBRARY_PROPERTIES})
+ SET(VNL_LIBRARY_PROPERTIES ${VXL_LIBRARY_PROPERTIES})
+ SET(TESTLIB_LIBRARY_PROPERTIES ${VXL_LIBRARY_PROPERTIES})
+-
++SET(VIL_ALGO_LIBRARY_PROPERTIES ${VXL_LIBRARY_PROPERTIES})
++SET(VIL_LIBRARY_PROPERTIES ${VXL_LIBRARY_PROPERTIES})
+ 
+ 
+ SET( LIBRARY_OUTPUT_PATH ${vxl_BINARY_DIR}/lib CACHE PATH
+diff --git a/core/vil/CMakeLists.txt b/core/vil/CMakeLists.txt
+index 75b660a..d297412 100644
+--- a/core/vil/CMakeLists.txt
++++ b/core/vil/CMakeLists.txt
+@@ -330,6 +330,7 @@ IF(OPENJPEG2_FOUND)
+   TARGET_LINK_LIBRARIES( vil ${OPENJPEG2_LIBRARIES} )
+ ENDIF(OPENJPEG2_FOUND)
+ 
++SET_TARGET_PROPERTIES(vil PROPERTIES ${VIL_LIBRARY_PROPERTIES})
+ TARGET_LINK_LIBRARIES( vil vcl )
+ 
+ IF (NOT UNIX)
+diff --git a/core/vil/algo/CMakeLists.txt b/core/vil/algo/CMakeLists.txt
+index e9f2119..a7ab0d7 100644
+--- a/core/vil/algo/CMakeLists.txt
++++ b/core/vil/algo/CMakeLists.txt
+@@ -58,6 +58,7 @@ AUX_SOURCE_DIRECTORY(Templates vil_algo_sources)
+ 
+ ADD_LIBRARY(vil_algo ${vil_algo_sources})
+ 
++SET_TARGET_PROPERTIES(vil_algo PROPERTIES ${VIL_ALGO_LIBRARY_PROPERTIES})
+ TARGET_LINK_LIBRARIES( vil_algo vil vnl_algo vnl vcl )
+ 
+ INSTALL_TARGETS(/lib vil_algo)
+-- 
+1.7.11.7
+
diff --git a/0004-v3.5.0-Add-cmake-module-to-find-RPLY.patch b/0004-v3.5.0-Add-cmake-module-to-find-RPLY.patch
deleted file mode 100644
index b28b11e..0000000
--- a/0004-v3.5.0-Add-cmake-module-to-find-RPLY.patch
+++ /dev/null
@@ -1,108 +0,0 @@
-From 04c541d97aeb5ccc75615dd537e8a64c1e1f3814 Mon Sep 17 00:00:00 2001
-From: "Ankur Sinha (Ankur Sinha Gmail)" <sanjay.ankur@gmail.com>
-Date: Thu, 25 Apr 2019 14:11:31 +0100
-Subject: [PATCH 04/18] v3.5.0 Add cmake module to find RPLY
-
----
- CMakeLists.txt                                |  3 +-
- config/cmake/fedora-modules/FindRPLY.cmake    | 39 +++++++++++++++++++
- contrib/brl/bbas/bmsh3d/algo/CMakeLists.txt   |  2 +-
- contrib/brl/bseg/boxm2/cpp/CMakeLists.txt     |  2 +-
- .../brl/bseg/boxm2/cpp/algo/CMakeLists.txt    |  2 +-
- 5 files changed, 44 insertions(+), 4 deletions(-)
- create mode 100644 config/cmake/fedora-modules/FindRPLY.cmake
-
-diff --git a/CMakeLists.txt b/CMakeLists.txt
-index e52a8c0abb..e1aa0390d4 100644
---- a/CMakeLists.txt
-+++ b/CMakeLists.txt
-@@ -142,7 +142,8 @@ include(${CMAKE_CURRENT_LIST_DIR}/config/cmake/doxygen/doxygen.cmake)
- 
- # Location of VXL's FindXXX.cmake CMake modules.
- # This is identical to VXL_CMAKE_DIR.  Perhaps we should eliminate MODULE_PATH?
--set( MODULE_PATH ${CMAKE_CURRENT_LIST_DIR}/config/cmake/Modules CACHE STATIC "VXL module path" )
-+set( MODULE_PATH "${CMAKE_SOURCE_DIR}/config/cmake/Modules" CACHE PATH "VXL module path" )
-+set( CMAKE_MODULE_PATH ${CMAKE_MODULE_PATH} "${CMAKE_SOURCE_DIR}/config/cmake/fedora-modules")
- 
- # Options to add extra compiler and linker flags
- #
-diff --git a/config/cmake/fedora-modules/FindRPLY.cmake b/config/cmake/fedora-modules/FindRPLY.cmake
-new file mode 100644
-index 0000000000..abe415bd9e
---- /dev/null
-+++ b/config/cmake/fedora-modules/FindRPLY.cmake
-@@ -0,0 +1,39 @@
-+# Adapted from https://github.com/jirihnidek/verse-ply-uploader/blob/master/build_files/cmake/modules/FindRPLY.cmake
-+# This module tries to find RPLY library and include files
-+#
-+# RPLY_INCLUDE_DIR, where to find verse.h
-+# RPLY_LIBRARY_DIR, where to find libverse.so
-+# RPLY_LIBRARIES, the library to link against
-+# RPLY_FOUND, IF false, do not try to use Verse
-+#
-+
-+FIND_PATH ( RPLY_INCLUDE_DIR rply.h
-+    /usr/include
-+    /usr/include/rply
-+    /usr/local/include
-+    /usr/local/include/rply
-+)
-+
-+FIND_LIBRARY ( RPLY_LIBRARIES rply
-+    /usr/local/lib
-+    /usr/local/lib64
-+    /usr/lib
-+    /usr/lib64
-+)
-+
-+GET_FILENAME_COMPONENT( RPLY_LIBRARY_DIR ${RPLY_LIBRARIES} PATH )
-+
-+SET ( RPLY_FOUND "NO" )
-+IF ( RPLY_INCLUDE_DIR )
-+    IF ( RPLY_LIBRARIES )
-+        SET ( RPLY_LIBRARY ${RPLY_LIBRARIES} )
-+        SET ( RPLY_FOUND "YES" )
-+    ENDIF ( RPLY_LIBRARIES )
-+ENDIF ( RPLY_INCLUDE_DIR )
-+
-+MARK_AS_ADVANCED (
-+    RPLY_LIBRARY_DIR
-+    RPLY_INCLUDE_DIR
-+    RPLY_LIBRARIES
-+    RPLY_LIBRARY
-+)
-diff --git a/contrib/brl/bbas/bmsh3d/algo/CMakeLists.txt b/contrib/brl/bbas/bmsh3d/algo/CMakeLists.txt
-index 662ec284e9..1c2e6a7089 100644
---- a/contrib/brl/bbas/bmsh3d/algo/CMakeLists.txt
-+++ b/contrib/brl/bbas/bmsh3d/algo/CMakeLists.txt
-@@ -1,6 +1,6 @@
- # This is bbas/bmsh3d/algo/CMakeLists.txt
- # Brown 3D Mesh Algorithm Library
--FIND_PACKAGE(rply REQUIRED)
-+FIND_PACKAGE(RPLY REQUIRED)
- 
- include_directories( ${BRL_INCLUDE_DIR} )
- include_directories( ${RPLY_INCLUDE_DIR} )
-diff --git a/contrib/brl/bseg/boxm2/cpp/CMakeLists.txt b/contrib/brl/bseg/boxm2/cpp/CMakeLists.txt
-index fff9ae2d84..d7ef6ed5fa 100644
---- a/contrib/brl/bseg/boxm2/cpp/CMakeLists.txt
-+++ b/contrib/brl/bseg/boxm2/cpp/CMakeLists.txt
-@@ -1,4 +1,4 @@
--FIND_PACKAGE(rply REQUIRED)
-+FIND_PACKAGE(RPLY REQUIRED)
- 
- include_directories( ${BRL_INCLUDE_DIR}/bseg )
- include_directories( ${RPLY_INCLUDE_DIR} )
-diff --git a/contrib/brl/bseg/boxm2/cpp/algo/CMakeLists.txt b/contrib/brl/bseg/boxm2/cpp/algo/CMakeLists.txt
-index c3ed4ed27d..19763fbd71 100644
---- a/contrib/brl/bseg/boxm2/cpp/algo/CMakeLists.txt
-+++ b/contrib/brl/bseg/boxm2/cpp/algo/CMakeLists.txt
-@@ -1,4 +1,4 @@
--FIND_PACKAGE(rply REQUIRED)
-+FIND_PACKAGE(RPLY REQUIRED)
- 
- include_directories( ${BRL_INCLUDE_DIR}/bseg )
- include_directories( ${MUL_INCLUDE_DIR} )
--- 
-2.46.1
-
diff --git a/0005-Do-not-build-OUL.patch b/0005-Do-not-build-OUL.patch
new file mode 100644
index 0000000..14e50b5
--- /dev/null
+++ b/0005-Do-not-build-OUL.patch
@@ -0,0 +1,26 @@
+From dd4f9c285bba2b49eadfa4cbf4759ca00e731235 Mon Sep 17 00:00:00 2001
+From: Mario Ceresa <mrceresa@gmail.com>
+Date: Wed, 10 Oct 2012 17:18:42 +0200
+Subject: [PATCH 05/23] Do not build OUL
+
+Signed-off-by: Mario Ceresa <mrceresa@gmail.com>
+---
+ contrib/CMakeLists.txt | 2 +-
+ 1 file changed, 1 insertion(+), 1 deletion(-)
+
+diff --git a/contrib/CMakeLists.txt b/contrib/CMakeLists.txt
+index 03ee1b5..b228422 100644
+--- a/contrib/CMakeLists.txt
++++ b/contrib/CMakeLists.txt
+@@ -18,7 +18,7 @@ IF( EXISTS ${vxl_SOURCE_DIR}/contrib/mul/CMakeLists.txt )
+ ENDIF( EXISTS ${vxl_SOURCE_DIR}/contrib/mul/CMakeLists.txt )
+ 
+ IF( EXISTS ${vxl_SOURCE_DIR}/contrib/oul/CMakeLists.txt )
+-  OPTION(BUILD_OUL "Build the Otago University library package?" YES)
++  OPTION(BUILD_OUL "Build the Otago University library package?" NO)
+ ENDIF( EXISTS ${vxl_SOURCE_DIR}/contrib/oul/CMakeLists.txt )
+ 
+ IF( EXISTS ${vxl_SOURCE_DIR}/contrib/prip/CMakeLists.txt )
+-- 
+1.7.11.7
+
diff --git a/0005-v3.5.0-fix-bkml-test.patch b/0005-v3.5.0-fix-bkml-test.patch
deleted file mode 100644
index 90dd9a0..0000000
--- a/0005-v3.5.0-fix-bkml-test.patch
+++ /dev/null
@@ -1,58 +0,0 @@
-From 8697b5c51bf883e04634d49c45421f2776f59fd3 Mon Sep 17 00:00:00 2001
-From: "Ankur Sinha (Ankur Sinha Gmail)" <sanjay.ankur@gmail.com>
-Date: Thu, 25 Apr 2019 17:05:39 +0100
-Subject: [PATCH 05/18] v3.5.0 fix bkml test
-
----
- contrib/brl/bbas/bkml/CMakeLists.txt       |  1 +
- contrib/brl/bbas/bkml/tests/CMakeLists.txt | 20 ++++++++++++++++----
- 2 files changed, 17 insertions(+), 4 deletions(-)
-
-diff --git a/contrib/brl/bbas/bkml/CMakeLists.txt b/contrib/brl/bbas/bkml/CMakeLists.txt
-index bb6a65f96d..e34211b0f6 100644
---- a/contrib/brl/bbas/bkml/CMakeLists.txt
-+++ b/contrib/brl/bbas/bkml/CMakeLists.txt
-@@ -6,6 +6,7 @@ set(bkml_sources
- )
- 
- FIND_PACKAGE(EXPAT REQUIRED)
-+FIND_PACKAGE(EXPATPP REQUIRED)
- 
- if(EXPAT_FOUND)
-  if(EXPATPP_FOUND)
-diff --git a/contrib/brl/bbas/bkml/tests/CMakeLists.txt b/contrib/brl/bbas/bkml/tests/CMakeLists.txt
-index 84c36469a4..9eddec1f66 100644
---- a/contrib/brl/bbas/bkml/tests/CMakeLists.txt
-+++ b/contrib/brl/bbas/bkml/tests/CMakeLists.txt
-@@ -1,12 +1,24 @@
- # This is contrib/brl/bbas/bkml/tests/CMakeLists.txt
-+FIND_PACKAGE(EXPAT REQUIRED)
-+FIND_PACKAGE(EXPATPP REQUIRED)
- 
- add_executable(bkml_test_all
-                 test_driver.cxx
-                 test_bkml.cxx
-               )
- 
--target_link_libraries(bkml_test_all bkml ${VXL_LIB_PREFIX}vgl ${VXL_LIB_PREFIX}testlib )
--add_test( NAME bkml_test_bkml COMMAND $<TARGET_FILE:bkml_test_all> test_bkml)
-+if(EXPAT_FOUND)
-+  if(EXPATPP_FOUND)
-+    target_link_libraries(bkml_test_all bkml expatpp expat ${VXL_LIB_PREFIX}vgl ${VXL_LIB_PREFIX}testlib )
-+    add_test( NAME bkml_test_bkml COMMAND $<TARGET_FILE:bkml_test_all> test_bkml)
- 
--add_executable(bkml_test_include test_include.cxx )
--target_link_libraries( bkml_test_include bkml )
-+    add_executable(bkml_test_include test_include.cxx )
-+    target_link_libraries( bkml_test_include bkml expatpp expat)
-+  endif()
-+else()
-+  target_link_libraries(bkml_test_all bkml ${VXL_LIB_PREFIX}vgl ${VXL_LIB_PREFIX}testlib )
-+  add_test( NAME bkml_test_bkml COMMAND $<TARGET_FILE:bkml_test_all> test_bkml)
-+
-+  add_executable(bkml_test_include test_include.cxx )
-+  target_link_libraries( bkml_test_include bkml )
-+endif()
--- 
-2.46.1
-
diff --git a/0006-BUG-rplyConfig.cmake-has-wrong-include-path.patch b/0006-BUG-rplyConfig.cmake-has-wrong-include-path.patch
new file mode 100644
index 0000000..0ee826c
--- /dev/null
+++ b/0006-BUG-rplyConfig.cmake-has-wrong-include-path.patch
@@ -0,0 +1,26 @@
+From 21a10dc2f967a985437777ce03248a256c08c133 Mon Sep 17 00:00:00 2001
+From: Mario Ceresa <mrceresa@gmail.com>
+Date: Wed, 10 Oct 2012 17:19:39 +0200
+Subject: [PATCH 06/23] BUG: rplyConfig.cmake has wrong include path
+
+Signed-off-by: Mario Ceresa <mrceresa@gmail.com>
+---
+ contrib/brl/bbas/bmsh3d/algo/CMakeLists.txt | 2 +-
+ 1 file changed, 1 insertion(+), 1 deletion(-)
+
+diff --git a/contrib/brl/bbas/bmsh3d/algo/CMakeLists.txt b/contrib/brl/bbas/bmsh3d/algo/CMakeLists.txt
+index c8be547..fe04412 100644
+--- a/contrib/brl/bbas/bmsh3d/algo/CMakeLists.txt
++++ b/contrib/brl/bbas/bmsh3d/algo/CMakeLists.txt
+@@ -4,7 +4,7 @@
+ FIND_PACKAGE(rply REQUIRED)
+ 
+ INCLUDE_DIRECTORIES( ${BRL_INCLUDE_DIR} )
+-INCLUDE_DIRECTORIES( ${RPLY_INCLUDE_DIR} )
++INCLUDE_DIRECTORIES( /usr/include/rply )
+ 
+ SET( bmsh3d_algo_sources
+   bmsh3d_fileio.cxx           bmsh3d_fileio.h
+-- 
+1.7.11.7
+
diff --git a/0006-v3.5.0-Correct-rply-includedir.patch b/0006-v3.5.0-Correct-rply-includedir.patch
deleted file mode 100644
index c579c1d..0000000
--- a/0006-v3.5.0-Correct-rply-includedir.patch
+++ /dev/null
@@ -1,114 +0,0 @@
-From 2252a472803e52dd504e243593f32f4312342591 Mon Sep 17 00:00:00 2001
-From: "Ankur Sinha (Ankur Sinha Gmail)" <sanjay.ankur@gmail.com>
-Date: Thu, 25 Apr 2019 23:32:15 +0100
-Subject: [PATCH 06/18] v3.5.0 Correct rply includedir
-
----
- contrib/brl/bbas/bvrml/pro/CMakeLists.txt      |  8 +++++++-
- contrib/brl/bbas/bwm/exe/CMakeLists.txt        |  8 +++++++-
- contrib/brl/bbas/volm/pro/CMakeLists.txt       |  8 +++++++-
- contrib/brl/bseg/boxm2/pro/CMakeLists.txt      |  7 +++++++
- contrib/brl/bseg/boxm2/volm/pro/CMakeLists.txt | 10 +++++++++-
- 5 files changed, 37 insertions(+), 4 deletions(-)
-
-diff --git a/contrib/brl/bbas/bvrml/pro/CMakeLists.txt b/contrib/brl/bbas/bvrml/pro/CMakeLists.txt
-index c1c82d0dd4..3a82f2e050 100644
---- a/contrib/brl/bbas/bvrml/pro/CMakeLists.txt
-+++ b/contrib/brl/bbas/bvrml/pro/CMakeLists.txt
-@@ -4,7 +4,13 @@ if (HAS_GEOTIFF)
- include_directories( ${BRL_INCLUDE_DIR}/bpro )
- include_directories( ${BRL_INCLUDE_DIR}/bpro/bprb )
- include_directories( ${BRL_INCLUDE_DIR}/bbas )
--include_directories( ${VTHREEP_INCLUDE_DIR}/rply )
-+
-+FIND_PACKAGE(RPLY REQUIRED)
-+if(RPLY_FOUND)
-+  include_directories( ${RPLY_INCLUDE_DIR} )
-+else()
-+  include_directories( ${VTHREEP_INCLUDE_DIR}/rply )
-+endif()
- 
- set(bvrml_pro_sources
-     bvrml_processes.h
-diff --git a/contrib/brl/bbas/bwm/exe/CMakeLists.txt b/contrib/brl/bbas/bwm/exe/CMakeLists.txt
-index 4b642eb232..43de7db5df 100644
---- a/contrib/brl/bbas/bwm/exe/CMakeLists.txt
-+++ b/contrib/brl/bbas/bwm/exe/CMakeLists.txt
-@@ -1,7 +1,13 @@
- # This is brl/bbas/bwm/exe/CMakeLists.txt
- # World Modeling GUI executables
- 
--include_directories( ${VTHREEP_INCLUDE_DIR}/rply )
-+FIND_PACKAGE(RPLY REQUIRED)
-+if(RPLY_FOUND)
-+  include_directories( ${RPLY_INCLUDE_DIR} )
-+else()
-+  include_directories( ${VTHREEP_INCLUDE_DIR}/rply )
-+endif()
-+
- include_directories( ${MUL_INCLUDE_DIR} )
- include_directories( ${OXL_INCLUDE_DIR} )
- 
-diff --git a/contrib/brl/bbas/volm/pro/CMakeLists.txt b/contrib/brl/bbas/volm/pro/CMakeLists.txt
-index 76c1216a4f..aa028ca71f 100644
---- a/contrib/brl/bbas/volm/pro/CMakeLists.txt
-+++ b/contrib/brl/bbas/volm/pro/CMakeLists.txt
-@@ -4,7 +4,13 @@ if(VXL_BUILD_RPL)
- include_directories( ${BRL_INCLUDE_DIR}/bbas )
- include_directories( ${BRL_INCLUDE_DIR}/bpro/core )
- include_directories( ${MUL_INCLUDE_DIR} )
--include_directories( ${VTHREEP_INCLUDE_DIR}/rply)
-+
-+FIND_PACKAGE(RPLY REQUIRED)
-+if(RPLY_FOUND)
-+  include_directories( ${RPLY_INCLUDE_DIR} )
-+else()
-+  include_directories( ${VTHREEP_INCLUDE_DIR}/rply )
-+endif()
- 
-   # The N-dimensional bin structure implementations use rpl/rsdl
- 
-diff --git a/contrib/brl/bseg/boxm2/pro/CMakeLists.txt b/contrib/brl/bseg/boxm2/pro/CMakeLists.txt
-index 7c2ec1d9c3..0536e327fd 100644
---- a/contrib/brl/bseg/boxm2/pro/CMakeLists.txt
-+++ b/contrib/brl/bseg/boxm2/pro/CMakeLists.txt
-@@ -11,7 +11,14 @@ if(EXPAT_FOUND)
-   include_directories( ${BRL_INCLUDE_DIR}/bbas )
-   include_directories( ${GEL_INCLUDE_DIR}/mrc/vpgl )
-   include_directories( ${GEL_INCLUDE_DIR}/mrc )
-+
-+FIND_PACKAGE(RPLY REQUIRED)
-+if(RPLY_FOUND)
-+  include_directories( ${RPLY_INCLUDE_DIR} )
-+else()
-   include_directories( ${VTHREEP_INCLUDE_DIR}/rply )
-+endif()
-+
- 
-   set(boxm2_pro_sources
-       boxm2_processes.h
-diff --git a/contrib/brl/bseg/boxm2/volm/pro/CMakeLists.txt b/contrib/brl/bseg/boxm2/volm/pro/CMakeLists.txt
-index 265cd5d066..2ec707047f 100644
---- a/contrib/brl/bseg/boxm2/volm/pro/CMakeLists.txt
-+++ b/contrib/brl/bseg/boxm2/volm/pro/CMakeLists.txt
-@@ -11,8 +11,16 @@ if(EXPAT_FOUND)
-   include_directories( ${BRL_INCLUDE_DIR}/bbas )
-   include_directories( ${GEL_INCLUDE_DIR}/mrc/vpgl )
-   include_directories( ${GEL_INCLUDE_DIR}/mrc )
-+
-+FIND_PACKAGE(RPLY REQUIRED)
-+if(RPLY_FOUND)
-+  include_directories( ${RPLY_INCLUDE_DIR} )
-+else()
-   include_directories( ${VTHREEP_INCLUDE_DIR}/rply )
--if(OpenCL_FOUND)
-+endif()
-+
-+if(OPENCL_FOUND)
-+  include_directories( ${OPENCL_INCLUDE_PATH} )
-   set( BOXM2_VOLM_PRO_LIBS boxm2_ocl)
- endif()
- 
--- 
-2.46.1
-
diff --git a/0007-Arguments-of-ply_open-and-create-changed.-Thanks-to-.patch b/0007-Arguments-of-ply_open-and-create-changed.-Thanks-to-.patch
new file mode 100644
index 0000000..bc2a4a6
--- /dev/null
+++ b/0007-Arguments-of-ply_open-and-create-changed.-Thanks-to-.patch
@@ -0,0 +1,45 @@
+From 48e82457160bf6484c5c15e6cdcc2641349948cd Mon Sep 17 00:00:00 2001
+From: Mario Ceresa <mrceresa@gmail.com>
+Date: Wed, 10 Oct 2012 17:20:58 +0200
+Subject: [PATCH 07/23] Arguments of ply_open and create changed. Thanks to
+ Thomas Bouffon for the patch
+
+Signed-off-by: Mario Ceresa <mrceresa@gmail.com>
+---
+ contrib/brl/bbas/bmsh3d/algo/bmsh3d_fileio_ply.cxx | 6 +++---
+ 1 file changed, 3 insertions(+), 3 deletions(-)
+
+diff --git a/contrib/brl/bbas/bmsh3d/algo/bmsh3d_fileio_ply.cxx b/contrib/brl/bbas/bmsh3d/algo/bmsh3d_fileio_ply.cxx
+index 3bb2240..8ad4a4d 100644
+--- a/contrib/brl/bbas/bmsh3d/algo/bmsh3d_fileio_ply.cxx
++++ b/contrib/brl/bbas/bmsh3d/algo/bmsh3d_fileio_ply.cxx
+@@ -50,7 +50,7 @@ bool bmsh3d_load_ply (bmsh3d_mesh* M, const char* file)
+   parsed_mesh.mesh = M;
+ 
+   // OPEN file
+-  p_ply ply = ply_open(file, NULL, 0, NULL);
++  p_ply ply = ply_open(file, NULL);
+   if (!ply)
+     return false;
+ 
+@@ -92,7 +92,7 @@ bool bmsh3d_load_ply_v (bmsh3d_mesh* M, const char* file)
+   parsed_mesh.mesh = M;
+ 
+   // OPEN file
+-  p_ply ply = ply_open(file, NULL, 0, NULL);
++  p_ply ply = ply_open(file, NULL);
+   if (!ply)
+     return false;
+ 
+@@ -242,7 +242,7 @@ bool bmsh3d_save_ply (bmsh3d_mesh* M, const char* file, bool ascii_mode, vcl_str
+   e_ply_storage_mode storage_mode = (ascii_mode) ? PLY_ASCII : PLY_LITTLE_ENDIAN;
+ 
+   // OPEN FILE
+-  p_ply oply = ply_create(file, storage_mode, NULL, 0, NULL);
++  p_ply oply = ply_create(file, storage_mode,NULL);
+ 
+   vcl_cerr << "  saving " << file << " :\n\t"
+            << M->vertexmap().size() << " points, "
+-- 
+1.7.11.7
+
diff --git a/0007-v3.5.0-remove-triangle.patch b/0007-v3.5.0-remove-triangle.patch
deleted file mode 100644
index 7c34082..0000000
--- a/0007-v3.5.0-remove-triangle.patch
+++ /dev/null
@@ -1,20107 +0,0 @@
-From 80bdd447db20e28e08adeaa35a6528957e286902 Mon Sep 17 00:00:00 2001
-From: "Ankur Sinha (Ankur Sinha Gmail)" <sanjay.ankur@gmail.com>
-Date: Mon, 23 Oct 2023 10:48:40 +0100
-Subject: [PATCH 07/18] v3.5.0: remove triangle
-
-Reference:
-https://github.com/InsightSoftwareConsortium/ITK/pull/1920/files
----
- config/cmake/Modules/FindNetlib.cmake |     2 +-
- v3p/netlib/CMakeLists.txt             |    19 -
- v3p/netlib/examples/.NoDartCoverage   |     0
- v3p/netlib/examples/A.poly            |    62 -
- v3p/netlib/examples/CMakeLists.txt    |    14 -
- v3p/netlib/examples/showme.c          |  3392 -----
- v3p/netlib/tests/CMakeLists.txt       |     4 -
- v3p/netlib/triangle.README            |   198 -
- v3p/netlib/triangle.c                 | 16011 ------------------------
- v3p/netlib/triangle.h                 |   299 -
- 10 files changed, 1 insertion(+), 20000 deletions(-)
- delete mode 100644 v3p/netlib/examples/.NoDartCoverage
- delete mode 100644 v3p/netlib/examples/A.poly
- delete mode 100644 v3p/netlib/examples/CMakeLists.txt
- delete mode 100644 v3p/netlib/examples/showme.c
- delete mode 100644 v3p/netlib/triangle.README
- delete mode 100644 v3p/netlib/triangle.c
- delete mode 100644 v3p/netlib/triangle.h
-
-diff --git a/config/cmake/Modules/FindNetlib.cmake b/config/cmake/Modules/FindNetlib.cmake
-index c953a8bbc3..0fba6dddf2 100644
---- a/config/cmake/Modules/FindNetlib.cmake
-+++ b/config/cmake/Modules/FindNetlib.cmake
-@@ -9,4 +9,4 @@
- set( NETLIB_FOUND "YES" )
- set( NETLIB_INCLUDE_DIR ${VXL_ROOT_SOURCE_DIR}/v3p/netlib )
- set( NETLIB_INSTALL_INCLUDE_DIR ${CMAKE_INSTALL_PREFIX}/include/vxl/v3p/netlib )
--set( NETLIB_LIBRARIES ${VXL_LIB_PREFIX}netlib ${VXL_LIB_PREFIX}v3p_netlib )
-+set( NETLIB_LIBRARIES ${VXL_LIB_PREFIX}v3p_netlib )
-diff --git a/v3p/netlib/CMakeLists.txt b/v3p/netlib/CMakeLists.txt
-index 1c3df5db0c..05941c9ed0 100644
---- a/v3p/netlib/CMakeLists.txt
-+++ b/v3p/netlib/CMakeLists.txt
-@@ -2,21 +2,6 @@
- 
- project( netlib C )
- 
--set(netlib_sources
--     # The "Triangle" program of Jonathan Richard Shewchuk
--     triangle.c triangle.h
--   )
--
--vxl_add_library(
--    LIBRARY_NAME ${VXL_LIB_PREFIX}netlib
--    LIBRARY_SOURCES ${netlib_sources}
--    DISABLE_MSVC_MP
--)
--
--if(UNIX)
--  target_link_libraries( ${VXL_LIB_PREFIX}netlib m )
--endif()
--
- # Allow sources in subdirectories to see the include files.
- include_directories(${netlib_SOURCE_DIR})
- 
-@@ -447,10 +432,6 @@ if(BUILD_TESTING)
-   add_subdirectory(tests)
- endif()
- 
--if(VXL_BUILD_EXAMPLES)
--  add_subdirectory(examples)
--endif()
--
- if (VXL_BUILD_OBJECT_LIBRARIES)
-   add_library(v3p_netlib-obj OBJECT ${v3p_netlib_sources})
- endif()
-diff --git a/v3p/netlib/examples/.NoDartCoverage b/v3p/netlib/examples/.NoDartCoverage
-deleted file mode 100644
-index e69de29bb2..0000000000
-diff --git a/v3p/netlib/examples/A.poly b/v3p/netlib/examples/A.poly
-deleted file mode 100644
-index 166a71773a..0000000000
---- a/v3p/netlib/examples/A.poly
-+++ /dev/null
-@@ -1,62 +0,0 @@
--29 2 1 0
--1 0.200000 -0.776400 -0.57
--2 0.220000 -0.773200 -0.55
--3 0.245600 -0.756400 -0.51
--4 0.277600 -0.702000 -0.53
--5 0.488800 -0.207600 0.28
--6 0.504800 -0.207600 0.30
--7 0.740800 -0.739600 0
--8 0.756000 -0.761200 -0.01
--9 0.774400 -0.772400 0
--10 0.800000 -0.776400 0.02
--11 0.800000 -0.792400 0.01
--12 0.579200 -0.792400 -0.21
--13 0.579200 -0.776400 -0.2
--14 0.621600 -0.771600 -0.15
--15 0.633600 -0.762800 -0.13
--16 0.639200 -0.744400 -0.1
--17 0.620800 -0.684400 -0.06
--18 0.587200 -0.604400 -0.01
--19 0.360800 -0.604400 -0.24
--20 0.319200 -0.706800 -0.39
--21 0.312000 -0.739600 -0.43
--22 0.318400 -0.761200 -0.44
--23 0.334400 -0.771600 -0.44
--24 0.371200 -0.776400 -0.41
--25 0.371200 -0.792400 -0.42
--26 0.374400 -0.570000 -0.2
--27 0.574400 -0.570000 0
--28 0.473600 -0.330800 0.14
--29 0.200000 -0.792400 -0.59
--29 0
--1 29 1
--2 1 2
--3 2 3
--4 3 4
--5 4 5
--6 5 6
--7 6 7
--8 7 8
--9 8 9
--10 9 10
--11 10 11
--12 11 12
--13 12 13
--14 13 14
--15 14 15
--16 15 16
--17 16 17
--18 17 18
--19 18 19
--20 19 20
--21 20 21
--22 21 22
--23 22 23
--24 23 24
--25 24 25
--26 25 29
--27 26 27
--28 27 28
--29 28 26
--1
--1 0.47 -0.5
-diff --git a/v3p/netlib/examples/CMakeLists.txt b/v3p/netlib/examples/CMakeLists.txt
-deleted file mode 100644
-index 1021aa2877..0000000000
---- a/v3p/netlib/examples/CMakeLists.txt
-+++ /dev/null
-@@ -1,14 +0,0 @@
--link_libraries(netlib)
--
--include(${VXL_CMAKE_DIR}/FindNetlib.cmake)
--if(NETLIB_FOUND)
--  include_directories(${NETLIB_INCLUDE_DIR})
--
--  find_package(X11)
--  if(X11_FOUND)
--    include_directories(${X11_INCLUDE_DIR})
--    add_executable(netlib_showme showme.c)
--    target_link_libraries(netlib_showme ${X11_LIBRARIES})
--  endif()
--
--endif()
-diff --git a/v3p/netlib/examples/showme.c b/v3p/netlib/examples/showme.c
-deleted file mode 100644
-index 815d63a0fd..0000000000
---- a/v3p/netlib/examples/showme.c
-+++ /dev/null
-@@ -1,3392 +0,0 @@
--/*****************************************************************************/
--/*                                                                           */
--/*    ,d88^^o 888                                   o    o                   */
--/*    8888    888o^88,  o88^^o Y88b    o    /      d8b  d8b      o88^^8o     */
--/*    "Y88b   888  888 d888   b Y88b  d8b  /      d888bdY88b    d888  88b    */
--/*     "Y88b, 888  888 8888   8  Y888/Y88b/      / Y88Y Y888b   8888oo888    */
--/*    o  8888 888  888 q888   p   Y8/  Y8/      /   YY   Y888b  q888         */
--/*    "oo88P" 888  888  "88oo"     Y    Y      /          Y888b  "88oooo"    */
--/*                                                                           */
--/*  A Display Program for Meshes and More.                                   */
--/*  (showme.c)                                                               */
--/*                                                                           */
--/*  Version 1.3                                                              */
--/*  July 20, 1996                                                            */
--/*                                                                           */
--/*  Copyright 1996                                                           */
--/*  Jonathan Richard Shewchuk                                                */
--/*  School of Computer Science                                               */
--/*  Carnegie Mellon University                                               */
--/*  5000 Forbes Avenue                                                       */
--/*  Pittsburgh, Pennsylvania  15213-3891                                     */
--/*  jrs@cs.cmu.edu                                                           */
--/*                                                                           */
--/*  This program may be freely redistributed under the condition that the    */
--/*    copyright notices (including this entire header and the copyright      */
--/*    notice printed when the `-h' switch is selected) are not removed, and  */
--/*    no compensation is received.  Private, research, and institutional     */
--/*    use is free.  You may distribute modified versions of this code UNDER  */
--/*    THE CONDITION THAT THIS CODE AND ANY MODIFICATIONS MADE TO IT IN THE   */
--/*    SAME FILE REMAIN UNDER COPYRIGHT OF THE ORIGINAL AUTHOR, BOTH SOURCE   */
--/*    AND OBJECT CODE ARE MADE FREELY AVAILABLE WITHOUT CHARGE, AND CLEAR    */
--/*    NOTICE IS GIVEN OF THE MODIFICATIONS.  Distribution of this code as    */
--/*    part of a commercial system is permissible ONLY BY DIRECT ARRANGEMENT  */
--/*    WITH THE AUTHOR.  (If you are not directly supplying this code to a    */
--/*    customer, and you are instead telling them how they can obtain it for  */
--/*    free, then you are not required to make any arrangement with me.)      */
--/*                                                                           */
--/*  Hypertext instructions for Triangle are available on the Web at          */
--/*                                                                           */
--/*      http://www.cs.cmu.edu/~quake/showme.html                             */
--/*                                                                           */
--/*  Show Me was created as part of the Archimedes project in the School of   */
--/*    Computer Science at Carnegie Mellon University.  Archimedes is a       */
--/*    system for compiling parallel finite element solvers.  For further     */
--/*    information, see Anja Feldmann, Omar Ghattas, John R. Gilbert, Gary L. */
--/*    Miller, David R. O'Hallaron, Eric J. Schwabe, Jonathan R. Shewchuk,    */
--/*    and Shang-Hua Teng.  "Automated Parallel Solution of Unstructured PDE  */
--/*    Problems."  To appear in Communications of the ACM, we hope.           */
--/*                                                                           */
--/*  If you make any improvements to this code, please please please let me   */
--/*    know, so that I may obtain the improvements.  Even if you don't change */
--/*    the code, I'd still love to hear what it's being used for.             */
--/*                                                                           */
--/*  Disclaimer:  Neither I nor Carnegie Mellon warrant this code in any way  */
--/*    whatsoever.  Use at your own risk.                                     */
--/*                                                                           */
--/*****************************************************************************/
--
--/* For single precision (which will save some memory and reduce paging),     */
--/*   write "#define SINGLE" below.                                           */
--/*                                                                           */
--/* For double precision (which will allow you to display triangulations of   */
--/*   a finer resolution), leave SINGLE undefined.                            */
--
--/* #define SINGLE */
--
--#ifdef SINGLE
--#define REAL float
--#else
--#define REAL double
--#endif
--
--/* Maximum number of characters in a file name (including the null).         */
--
--#define FILENAMESIZE 1024
--
--/* Maximum number of characters in a line read from a file (including the    */
--/*   null).                                                                  */
--
--#define INPUTLINESIZE 512
--
--#define STARTWIDTH 414
--#define STARTHEIGHT 414
--#define MINWIDTH 50
--#define MINHEIGHT 50
--#define BUTTONHEIGHT 21
--#define BUTTONROWS 3
--#define PANELHEIGHT (BUTTONHEIGHT * BUTTONROWS)
--#define MAXCOLORS 64
--
--#define IMAGE_TYPES 7
--#define NOTHING -1
--#define NODE 0
--#define POLY 1
--#define ELE 2
--#define EDGE 3
--#define PART 4
--#define ADJ 5
--#define VORO 6
--
--#define STARTEXPLOSION 0.5
--
--#include <stdio.h>
--#include <stdlib.h>
--#include <string.h>
--#include <X11/Xlib.h>
--#include <X11/Xutil.h>
--#include <X11/Xatom.h>
--
--/* The following obscenity seems to be necessary to ensure that this program */
--/* will port to Dec Alphas running OSF/1, because their stdio.h file commits */
--/* the unpardonable sin of including stdlib.h.  Hence, malloc(), free(), and */
--/* exit() may or may not already be defined at this point.  I declare these  */
--/* functions explicitly because some non-ANSI C compilers lack stdlib.h.     */
--
--#if !defined(_STDLIB_H_) && !defined(_STDLIB_H) && defined(__need_malloc_and_calloc)
--extern char *malloc();
--extern void free();
--extern void exit();
--extern double strtod();
--extern long strtol();
--#endif
--
--/* A necessary forward declaration.                                          */
--
--int load_image();
--
--Display *display;
--int screen;
--Window rootwindow;
--Window mainwindow;
--Window quitwin;
--Window leftwin;
--Window rightwin;
--Window upwin;
--Window downwin;
--Window resetwin;
--Window pswin;
--Window epswin;
--Window expwin;
--Window exppluswin;
--Window expminuswin;
--Window widthpluswin;
--Window widthminuswin;
--Window versionpluswin;
--Window versionminuswin;
--Window fillwin;
--Window nodewin[2];
--Window polywin[2];
--Window elewin[2];
--Window edgewin[2];
--Window partwin[2];
--Window adjwin[2];
--Window voronoiwin[2];
--
--int windowdepth;
--XEvent event;
--Colormap rootmap;
--XFontStruct *font;
--int width, height;
--int black, white;
--int showme_foreground;
--GC fontgc;
--GC blackfontgc;
--GC linegc;
--GC trianglegc;
--int colors[MAXCOLORS];
--XColor rgb[MAXCOLORS];
--int color;
--
--int start_image, current_image;
--int start_inc, current_inc;
--int loweriteration;
--int line_width;
--int loaded[2][IMAGE_TYPES];
--REAL xlo[2][IMAGE_TYPES], ylo[2][IMAGE_TYPES];
--REAL xhi[2][IMAGE_TYPES], yhi[2][IMAGE_TYPES];
--REAL xscale, yscale;
--REAL xoffset, yoffset;
--int zoom;
--
--int nodes[2], node_dim[2];
--REAL *nodeptr[2];
--int polynodes[2], poly_dim[2], polyedges[2], polyholes[2];
--REAL *polynodeptr[2], *polyholeptr[2];
--int *polyedgeptr[2];
--int elems[2], ele_corners[2];
--int *eleptr[2];
--int edges[2];
--int *edgeptr[2];
--REAL *normptr[2];
--int subdomains[2];
--int *partpart[2];
--REAL *partcenter[2], *partshift[2];
--int adjsubdomains[2];
--int *adjptr[2];
--int vnodes[2], vnode_dim[2];
--REAL *vnodeptr[2];
--int vedges[2];
--int *vedgeptr[2];
--REAL *vnormptr[2];
--int firstnumber[2];
--
--int quiet, fillelem, bw_ps, explode;
--REAL explosion;
--
--char filename[FILENAMESIZE];
--char nodefilename[2][FILENAMESIZE];
--char polyfilename[2][FILENAMESIZE];
--char elefilename[2][FILENAMESIZE];
--char edgefilename[2][FILENAMESIZE];
--char partfilename[2][FILENAMESIZE];
--char adjfilename[2][FILENAMESIZE];
--char vnodefilename[2][FILENAMESIZE];
--char vedgefilename[2][FILENAMESIZE];
--
--const
--char *colorname[] = {"aquamarine", "red", "green yellow", "magenta",
--                     "yellow", "green", "orange", "blue",
--                     "white", "sandy brown", "cyan", "moccasin",
--                     "cadet blue", "coral", "cornflower blue", "sky blue",
--                     "firebrick", "forest green", "gold", "goldenrod",
--                     "gray", "hot pink", "chartreuse", "pale violet red",
--                     "indian red", "khaki", "lavender", "light blue",
--                     "light gray", "light steel blue", "lime green", "azure",
--                     "maroon", "medium aquamarine", "dodger blue", "honeydew",
--                     "medium orchid", "medium sea green", "moccasin",
--                     "medium slate blue", "medium spring green",
--                     "medium turquoise", "medium violet red",
--                     "orange red", "chocolate", "light goldenrod",
--                     "orchid", "pale green", "pink", "plum",
--                     "purple", "salmon", "sea green",
--                     "sienna", "slate blue", "spring green",
--                     "steel blue", "tan", "thistle", "turquoise",
--                     "violet", "violet red", "wheat",
--                     "yellow green"};
--
--void syntax()
--{
--  printf("showme [-bfw_Qh] input_file\n");
--  printf("    -b  Black and white PostScript (default is color).\n");
--  printf("    -f  Fill triangles of partitioned mesh with color.\n");
--  printf("    -w  Set line width to some specified number.\n");
--  printf("    -Q  Quiet:  No terminal output except errors.\n");
--  printf("    -h  Help:  Detailed instructions for Show Me.\n");
--  exit(0);
--}
--
--void info()
--{
--  printf("Show Me\n");
--  printf("A Display Program for Meshes and More.\n");
--  printf("Version 1.3\n\n");
--  printf(
--"Copyright 1996 Jonathan Richard Shewchuk  (bugs/comments to jrs@cs.cmu.edu)\n"
--);
--  printf("School of Computer Science / Carnegie Mellon University\n");
--  printf("5000 Forbes Avenue / Pittsburgh, Pennsylvania  15213-3891\n");
--  printf(
--"Created as part of the Archimedes project (tools for parallel FEM).\n");
--  printf(
--"Supported in part by NSF Grant CMS-9318163 and an NSERC 1967 Scholarship.\n");
--  printf("There is no warranty whatsoever.  Use at your own risk.\n");
--#ifdef SINGLE
--  printf("This executable is compiled for single precision arithmetic.\n\n\n");
--#else
--  printf("This executable is compiled for double precision arithmetic.\n\n\n");
--#endif
--  printf(
--"Show Me graphically displays the contents of geometric files, especially\n");
--  printf(
--"those generated by Triangle, my two-dimensional quality mesh generator and\n"
--);
--  printf(
--"Delaunay triangulator.  Show Me can also write images in PostScript form.\n");
--  printf(
--"Show Me is also useful for checking the consistency of the files you create\n"
--);
--  printf(
--"as input to Triangle; Show Me does these checks more thoroughly than\n");
--  printf("Triangle does.  The command syntax is:\n\n");
--  printf("showme [-bfw_Qh] input_file\n\n");
--  printf(
--"The underscore indicates that a number should follow the -w switch.\n");
--  printf(
--"input_file may be one of several types of file.  It must have extension\n");
--  printf(
--".node, .poly, .ele, .edge, .part, or .adj.  If no extension is provided,\n");
--  printf(
--"Show Me will assume the extension .ele.  A .node file represents a set of\n");
--  printf(
--"points; a .poly file represents a Planar Straight Line Graph; an .ele file\n"
--);
--  printf(
--"(coupled with a .node file) represents the elements of a mesh or the\n");
--  printf(
--"triangles of a triangulation; an .edge file (coupled with a .node file)\n");
--  printf(
--"represents a set of edges; a .part file specifies a partition of a mesh;\n");
--  printf(
--"and a .adj file represents the adjacency graph defined by a partition.\n");
--  printf("\n");
--  printf("Command Line Switches:\n");
--  printf("\n");
--  printf(
--"    -b  Makes all PostScript output black and white.  If this switch is not\n"
--);
--  printf(
--"        selected, color PostScript is used for partitioned meshes and\n");
--  printf("        adjacency graphs (.part and .adj files).\n");
--  printf(
--"    -f  On color displays and in color PostScript, displays partitioned\n");
--  printf(
--"        meshes by filling triangles with color, rather than by coloring the\n"
--);
--  printf(
--"        edges.  This switch will result in a clearer picture if all\n");
--  printf(
--"        triangles are reasonably large, and a less clear picture if small\n");
--  printf(
--"        triangles are present.  (There is also a button to toggle this\n");
--  printf("        behavior.)\n");
--  printf(
--"    -w  Followed by an integer, specifies the line width used in all\n");
--  printf(
--"        images.  (There are also buttons to change the line width.)\n");
--  printf(
--"    -Q  Quiet:  Suppresses all explanation of what Show Me is doing, unless\n"
--);
--  printf("        an error occurs.\n");
--  printf("    -h  Help:  Displays these instructions.\n");
--  printf("\n");
--  printf("Controls:\n");
--  printf("\n");
--  printf(
--"  To zoom in on an image, point at the location where you want a closer\n");
--  printf(
--"  look, and click the left mouse button.  To zoom out, click the right\n");
--  printf(
--"  mouse button.  In either case, the point you click on will be centered in\n"
--);
--  printf(
--"  the window.  If you want to know the coordinates of a point, click the\n");
--  printf(
--"  middle mouse button; the coordinates will be printed on the terminal you\n"
--);
--  printf("  invoked Show Me from.\n\n");
--  printf(
--"  If you resize the window, the image will grow or shrink to match.\n");
--  printf("\n");
--  printf(
--"  There is a panel of control buttons at the bottom of the Show Me window:\n"
--);
--  printf("\n");
--  printf("  Quit:  Shuts down Show Me.\n");
--  printf("  <, >, ^, v:  Moves the image in the indicated direction.\n");
--  printf(
--"  Reset: Unzooms and centers the image in the window.  When you switch from\n"
--);
--  printf(
--"    one image to another, the viewing region does not change, so you may\n");
--  printf(
--"    need to reset the new image to make it fully visible.  This often is\n");
--  printf(
--"    the case when switching between Delaunay triangulations and their\n");
--  printf(
--"    corresponding Voronoi diagrams, as Voronoi vertices can be far from the\n"
--);
--  printf("    initial point set.\n");
--  printf(
--"  Width+, -:  Increases or decreases the width of all lines and points.\n");
--  printf(
--"  Exp, +, -:  These buttons appear only when you are viewing a partitioned\n"
--);
--  printf(
--"    mesh (.part file).  `Exp' toggles between an exploded and non-exploded\n"
--);
--  printf(
--"    image of the mesh.  The non-exploded image will not show the partition\n"
--);
--  printf(
--"    on a black and white monitor.  `+' and `-' allow you to adjust the\n");
--  printf(
--"    spacing between pieces of the mesh to better distinguish them.\n");
--  printf(
--"  Fill:  This button appears only when you are viewing a partitioned mesh\n");
--  printf(
--"    (.part file).  It toggles between color-filled triangles and colored\n");
--  printf(
--"    edges (as the -f switch does).  Filled triangles look better when all\n");
--  printf(
--"    triangles are reasonably large; colored edges look better when there\n");
--  printf("    are very small triangles present.\n");
--  printf(
--"  PS:  Creates a PostScript file containing the image you are viewing.  If\n"
--);
--  printf(
--"    the -b switch is selected, all PostScript output will be black and\n");
--  printf(
--"    white; otherwise, .part.ps and .adj.ps files will be color, independent\n"
--);
--  printf(
--"    of whether you are using a color monitor.  Normally the output will\n");
--  printf(
--"    preserve the properties of the image you see on the screen, including\n");
--  printf(
--"    zoom and line width; however, if black and white output is selected (-b\n"
--);
--  printf(
--"    switch), partitioned meshes will always be drawn exploded.  The output\n"
--);
--  printf(
--"    file name depends on the image being viewed.  If you want several\n");
--  printf(
--"    different snapshots (zooming in on different parts) of the same object,\n"
--);
--  printf(
--"    you'll have to rename each file after Show Me creates it so that it\n");
--  printf("    isn't overwritten by the next snapshot.\n");
--  printf(
--"  EPS:  Creates an encapsulated PostScript file, suitable for inclusion in\n"
--);
--  printf(
--"    documents.  Otherwise, this button is just like the PS button.  (The\n");
--  printf(
--"    main difference is that .eps files lack a `showpage' command at the\n");
--  printf("    end.)\n\n");
--  printf(
--"  There are two nearly-identical rows of buttons that load different images\n"
--);
--  printf("  from disk.  Each row contains the following buttons:\n\n");
--  printf("  node:  Loads a .node file.\n");
--  printf(
--"  poly:  Loads a .poly file (and possibly an associated .node file).\n");
--  printf("  ele:  Loads an .ele file (and associated .node file).\n");
--  printf("  edge:  Loads an .edge file (and associated .node file).\n");
--  printf(
--"  part:  Loads a .part file (and associated .node and .ele files).\n");
--  printf(
--"  adj:  Loads an .adj file (and associated .node, .ele, and .part files).\n");
--  printf("  voro:  Loads a .v.node and .v.edge file for a Voronoi diagram.\n");
--  printf("\n");
--  printf(
--"  Each row represents a different iteration number of the geometry files.\n");
--  printf(
--"  For a full explanation of iteration numbers, read the instructions for\n");
--  printf(
--"  Triangle.  Briefly, iteration numbers are used to allow a user to easily\n"
--);
--  printf(
--"  represent a sequence of related triangulations.  Iteration numbers are\n");
--  printf(
--"  used in the names of geometry files; for instance, mymesh.3.ele is a\n");
--  printf(
--"  triangle file with iteration number three, and mymesh.ele has an implicit\n"
--);
--  printf("  iteration number of zero.\n\n");
--  printf(
--"  The control buttons at the right end of each row display the two\n");
--  printf(
--"  iterations currently under view.  These buttons can be clicked to\n");
--  printf(
--"  increase or decrease the iteration numbers, and thus conveniently view\n");
--  printf("  a sequence of meshes.\n\n");
--  printf(
--"  Show Me keeps each file in memory after loading it, but you can force\n");
--  printf(
--"  Show Me to reread a set of files (for one iteration number) by reclicking\n"
--);
--  printf(
--"  the button that corresponds to the current image.  This is convenient if\n"
--);
--  printf("  you have changed a geometry file.\n\n");
--  printf("File Formats:\n\n");
--  printf(
--"  All files may contain comments prefixed by the character '#'.  Points,\n");
--  printf(
--"  segments, holes, triangles, edges, and subdomains must be numbered\n");
--  printf(
--"  consecutively, starting from either 1 or 0.  Whichever you choose, all\n");
--  printf(
--"  input files must be consistent (for any single iteration number); if the\n"
--);
--  printf(
--"  nodes are numbered from 1, so must be all other objects.  Show Me\n");
--  printf(
--"  automatically detects your choice while reading a .node (or .poly) file.\n"
--);
--  printf("  Examples of these file formats are given below.\n\n");
--  printf("  .node files:\n");
--  printf(
--"    First line:  <# of points> <dimension (must be 2)> <# of attributes>\n");
--  printf(
--"                                           <# of boundary markers (0 or 1)>\n"
--);
--  printf(
--"    Remaining lines:  <point #> <x> <y> [attributes] [boundary marker]\n");
--  printf("\n");
--  printf(
--"    The attributes, which are typically floating-point values of physical\n");
--  printf(
--"    quantities (such as mass or conductivity) associated with the nodes of\n"
--);
--  printf(
--"    a finite element mesh, are ignored by Show Me.  Show Me also ignores\n");
--  printf(
--"    boundary markers.  See the instructions for Triangle to find out what\n");
--  printf("    attributes and boundary markers are.\n\n");
--  printf("  .poly files:\n");
--  printf(
--"    First line:  <# of points> <dimension (must be 2)> <# of attributes>\n");
--  printf(
--"                                           <# of boundary markers (0 or 1)>\n"
--);
--  printf(
--"    Following lines:  <point #> <x> <y> [attributes] [boundary marker]\n");
--  printf("    One line:  <# of segments> <# of boundary markers (0 or 1)>\n");
--  printf(
--"    Following lines:  <segment #> <endpoint> <endpoint> [boundary marker]\n");
--  printf("    One line:  <# of holes>\n");
--  printf("    Following lines:  <hole #> <x> <y>\n");
--  printf("    [Optional additional lines that are ignored]\n\n");
--  printf(
--"    A .poly file represents a Planar Straight Line Graph (PSLG), an idea\n");
--  printf(
--"    familiar to computational geometers.  By definition, a PSLG is just a\n");
--  printf(
--"    list of points and edges.  A .poly file also contains some additional\n");
--  printf("    information.\n\n");
--  printf(
--"    The first section lists all the points, and is identical to the format\n"
--);
--  printf(
--"    of .node files.  <# of points> may be set to zero to indicate that the\n"
--);
--  printf(
--"    points are listed in a separate .node file; .poly files produced by\n");
--  printf(
--"    Triangle always have this format.  When Show Me reads such a file, it\n");
--  printf("    also reads the corresponding .node file.\n\n");
--  printf(
--"    The second section lists the segments.  Segments are edges whose\n");
--  printf(
--"    presence in a triangulation produced from the PSLG is enforced.  Each\n");
--  printf(
--"    segment is specified by listing the indices of its two endpoints.  This\n"
--);
--  printf(
--"    means that its endpoints must be included in the point list.  Each\n");
--  printf(
--"    segment, like each point, may have a boundary marker, which is ignored\n"
--);
--  printf("    by Show Me.\n\n");
--  printf(
--"    The third section lists holes and concavities that are desired in any\n");
--  printf(
--"    triangulation generated from the PSLG.  Holes are specified by\n");
--  printf("    identifying a point inside each hole.\n\n");
--  printf("  .ele files:\n");
--  printf(
--"    First line:  <# of triangles> <points per triangle> <# of attributes>\n");
--  printf(
--"    Remaining lines:  <triangle #> <point> <point> <point> ... [attributes]\n"
--);
--  printf("\n");
--  printf(
--"    Points are indices into the corresponding .node file.  Show Me ignores\n"
--);
--  printf(
--"    all but the first three points of each triangle; these should be the\n");
--  printf(
--"    corners listed in counterclockwise order around the triangle.  The\n");
--  printf("    attributes are ignored by Show Me.\n\n");
--  printf("  .edge files:\n");
--  printf("    First line:  <# of edges> <# of boundary markers (0 or 1)>\n");
--  printf(
--"    Following lines:  <edge #> <endpoint> <endpoint> [boundary marker]\n");
--  printf("\n");
--  printf(
--"    Endpoints are indices into the corresponding .node file.  The boundary\n"
--);
--  printf("    markers are ignored by Show Me.\n\n");
--  printf(
--"    In Voronoi diagrams, one also finds a special kind of edge that is an\n");
--  printf(
--"    infinite ray with only one endpoint.  For these edges, a different\n");
--  printf("    format is used:\n\n");
--  printf("        <edge #> <endpoint> -1 <direction x> <direction y>\n\n");
--  printf(
--"    The `direction' is a floating-point vector that indicates the direction\n"
--);
--  printf("    of the infinite ray.\n\n");
--  printf("  .part files:\n");
--  printf("    First line:  <# of triangles> <# of subdomains>\n");
--  printf("    Remaining lines:  <triangle #> <subdomain #>\n\n");
--  printf(
--"    The set of triangles is partitioned by a .part file; each triangle is\n");
--  printf("    mapped to a subdomain.\n\n");
--  printf("  .adj files:\n");
--  printf("    First line:  <# of subdomains>\n");
--  printf("    Remaining lines:  <adjacency matrix entry>\n\n");
--  printf(
--"    An .adj file represents adjacencies between subdomains (presumably\n");
--  printf("    computed by a partitioner).  The first line is followed by\n");
--  printf(
--"    (subdomains X subdomains) lines, each containing one entry of the\n");
--  printf(
--"    adjacency matrix.  A nonzero entry indicates that two subdomains are\n");
--  printf("    adjacent (share a point).\n\n");
--  printf("Example:\n\n");
--  printf(
--"  Here is a sample file `box.poly' describing a square with a square hole:\n"
--);
--  printf("\n");
--  printf(
--"    # A box with eight points in 2D, no attributes, no boundary marker.\n");
--  printf("    8 2 0 0\n");
--  printf("    # Outer box has these vertices:\n");
--  printf("     1   0 0\n");
--  printf("     2   0 3\n");
--  printf("     3   3 0\n");
--  printf("     4   3 3\n");
--  printf("    # Inner square has these vertices:\n");
--  printf("     5   1 1\n");
--  printf("     6   1 2\n");
--  printf("     7   2 1\n");
--  printf("     8   2 2\n");
--  printf("    # Five segments without boundary markers.\n");
--  printf("    5 0\n");
--  printf("     1   1 2          # Left side of outer box.\n");
--  printf("     2   5 7          # Segments 2 through 5 enclose the hole.\n");
--  printf("     3   7 8\n");
--  printf("     4   8 6\n");
--  printf("     5   6 5\n");
--  printf("    # One hole in the middle of the inner square.\n");
--  printf("    1\n");
--  printf("     1   1.5 1.5\n\n");
--  printf(
--"  After this PSLG is triangulated by Triangle, the resulting triangulation\n"
--);
--  printf(
--"  consists of a .node and .ele file.  Here is the former, `box.1.node',\n");
--  printf("  which duplicates the points of the PSLG:\n\n");
--  printf("    8  2  0  0\n");
--  printf("       1    0  0\n");
--  printf("       2    0  3\n");
--  printf("       3    3  0\n");
--  printf("       4    3  3\n");
--  printf("       5    1  1\n");
--  printf("       6    1  2\n");
--  printf("       7    2  1\n");
--  printf("       8    2  2\n");
--  printf("    # Generated by triangle -pcBev box\n");
--  printf("\n");
--  printf("  Here is the triangulation file, `box.1.ele'.\n");
--  printf("\n");
--  printf("    8  3  0\n");
--  printf("       1       1     5     6\n");
--  printf("       2       5     1     3\n");
--  printf("       3       2     6     8\n");
--  printf("       4       6     2     1\n");
--  printf("       5       7     3     4\n");
--  printf("       6       3     7     5\n");
--  printf("       7       8     4     2\n");
--  printf("       8       4     8     7\n");
--  printf("    # Generated by triangle -pcBev box\n\n");
--  printf("  Here is the edge file for the triangulation, `box.1.edge'.\n\n");
--  printf("    16  0\n");
--  printf("       1   1  5\n");
--  printf("       2   5  6\n");
--  printf("       3   6  1\n");
--  printf("       4   1  3\n");
--  printf("       5   3  5\n");
--  printf("       6   2  6\n");
--  printf("       7   6  8\n");
--  printf("       8   8  2\n");
--  printf("       9   2  1\n");
--  printf("      10   7  3\n");
--  printf("      11   3  4\n");
--  printf("      12   4  7\n");
--  printf("      13   7  5\n");
--  printf("      14   8  4\n");
--  printf("      15   4  2\n");
--  printf("      16   8  7\n");
--  printf("    # Generated by triangle -pcBev box\n");
--  printf("\n");
--  printf(
--"  Here's a file `box.1.part' that partitions the mesh into four subdomains.\n"
--);
--  printf("\n");
--  printf("    8  4\n");
--  printf("       1    3\n");
--  printf("       2    3\n");
--  printf("       3    4\n");
--  printf("       4    4\n");
--  printf("       5    1\n");
--  printf("       6    1\n");
--  printf("       7    2\n");
--  printf("       8    2\n");
--  printf("    # Generated by slice -s4 box.1\n\n");
--  printf(
--"  Here's a file `box.1.adj' that represents the resulting adjacencies.\n");
--  printf("\n");
--  printf("    4\n");
--  printf("      9\n");
--  printf("      2\n");
--  printf("      2\n");
--  printf("      0\n");
--  printf("      2\n");
--  printf("      9\n");
--  printf("      0\n");
--  printf("      2\n");
--  printf("      2\n");
--  printf("      0\n");
--  printf("      9\n");
--  printf("      2\n");
--  printf("      0\n");
--  printf("      2\n");
--  printf("      2\n");
--  printf("      9\n");
--  printf("\n");
--  printf("Display Speed:\n");
--  printf("\n");
--  printf(
--"  It is worthwhile to note that .edge files typically plot and print twice\n"
--);
--  printf(
--"  as quickly as .ele files, because .ele files cause each internal edge to\n"
--);
--  printf(
--"  be drawn twice.  For the same reason, PostScript files created from edge\n"
--);
--  printf("  sets are smaller than those created from triangulations.\n\n");
--  printf("Show Me on the Web:\n\n");
--  printf(
--"  To see an illustrated, updated version of these instructions, check out\n");
--  printf("\n");
--  printf("    http://www.cs.cmu.edu/~quake/showme.html\n");
--  printf("\n");
--  printf("A Brief Plea:\n");
--  printf("\n");
--  printf(
--"  If you use Show Me (or Triangle), and especially if you use it to\n");
--  printf(
--"  accomplish real work, I would like very much to hear from you.  A short\n");
--  printf(
--"  letter or email (to jrs@cs.cmu.edu) describing how you use Show Me (and\n");
--  printf(
--"  its sister programs) will mean a lot to me.  The more people I know\n");
--  printf(
--"  are using my programs, the more easily I can justify spending time on\n");
--  printf(
--"  improvements, which in turn will benefit you.  Also, I can put you\n");
--  printf(
--"  on a list to receive email whenever new versions are available.\n");
--  printf("\n");
--  printf(
--"  If you use a PostScript file generated by Show Me in a publication,\n");
--  printf("  please include an acknowledgment as well.\n\n");
--  exit(0);
--}
--
--void set_filenames(filename, lowermeshnumber)
--char *filename;
--int lowermeshnumber;
--{
--  char numberstring[100];
--  int i;
--
--  for (i = 0; i < 2; i++) {
--    strcpy(nodefilename[i], filename);
--    strcpy(polyfilename[i], filename);
--    strcpy(elefilename[i], filename);
--    strcpy(edgefilename[i], filename);
--    strcpy(partfilename[i], filename);
--    strcpy(adjfilename[i], filename);
--    strcpy(vnodefilename[i], filename);
--    strcpy(vedgefilename[i], filename);
--
--    if (lowermeshnumber + i > 0) {
--      sprintf(numberstring, ".%d", lowermeshnumber + i);
--      strcat(nodefilename[i], numberstring);
--      strcat(polyfilename[i], numberstring);
--      strcat(elefilename[i], numberstring);
--      strcat(edgefilename[i], numberstring);
--      strcat(partfilename[i], numberstring);
--      strcat(adjfilename[i], numberstring);
--      strcat(vnodefilename[i], numberstring);
--      strcat(vedgefilename[i], numberstring);
--    }
--
--    strcat(nodefilename[i], ".node");
--    strcat(polyfilename[i], ".poly");
--    strcat(elefilename[i], ".ele");
--    strcat(edgefilename[i], ".edge");
--    strcat(partfilename[i], ".part");
--    strcat(adjfilename[i], ".adj");
--    strcat(vnodefilename[i], ".v.node");
--    strcat(vedgefilename[i], ".v.edge");
--  }
--}
--
--#if 1 /* This function is already in netlib.lib, see triangle.c */
--void parsecommandline(int argc, char **argv);
--#else
--void parsecommandline(argc, argv)
--int argc;
--char **argv;
--{
--  int increment;
--  int meshnumber;
--  int i, j;
--
--  quiet = 0;
--  fillelem = 0;
--  line_width = 1;
--  bw_ps = 0;
--  start_image = ELE;
--  filename[0] = '\0';
--  for (i = 1; i < argc; i++) {
--    if (argv[i][0] == '-') {
--      for (j = 1; argv[i][j] != '\0'; j++) {
--        if (argv[i][j] == 'f') {
--          fillelem = 1;
--        }
--        if (argv[i][j] == 'w') {
--          if ((argv[i][j + 1] >= '1') && (argv[i][j + 1] <= '9')) {
--            line_width = 0;
--            while ((argv[i][j + 1] >= '0') && (argv[i][j + 1] <= '9')) {
--              j++;
--              line_width = line_width * 10 + (int) (argv[i][j] - '0');
--            }
--            if (line_width > 100) {
--              printf("Error:  Line width cannot exceed 100.\n");
--              line_width = 1;
--            }
--          }
--        }
--        if (argv[i][j] == 'b') {
--          bw_ps = 1;
--        }
--        if (argv[i][j] == 'Q') {
--          quiet = 1;
--        }
--        if ((argv[i][j] == 'h') || (argv[i][j] == 'H') ||
--            (argv[i][j] == '?')) {
--          info();
--        }
--      }
--    } else {
--      strcpy(filename, argv[i]);
--    }
--  }
--  if (filename[0] == '\0') {
--    syntax();
--  }
--  if (!strcmp(&filename[strlen(filename) - 5], ".node")) {
--    filename[strlen(filename) - 5] = '\0';
--    start_image = NODE;
--  }
--  if (!strcmp(&filename[strlen(filename) - 5], ".poly")) {
--    filename[strlen(filename) - 5] = '\0';
--    start_image = POLY;
--  }
--  if (!strcmp(&filename[strlen(filename) - 4], ".ele")) {
--    filename[strlen(filename) - 4] = '\0';
--    start_image = ELE;
--  }
--  if (!strcmp(&filename[strlen(filename) - 5], ".edge")) {
--    filename[strlen(filename) - 5] = '\0';
--    start_image = EDGE;
--  }
--  if (!strcmp(&filename[strlen(filename) - 5], ".part")) {
--    filename[strlen(filename) - 5] = '\0';
--    start_image = PART;
--  }
--  if (!strcmp(&filename[strlen(filename) - 4], ".adj")) {
--    filename[strlen(filename) - 4] = '\0';
--    start_image = ADJ;
--  }
--
--  increment = 0;
--  j = 1;
--  while (filename[j] != '\0') {
--    if ((filename[j] == '.') && (filename[j + 1] != '\0')) {
--      increment = j + 1;
--    }
--    j++;
--  }
--  meshnumber = 0;
--  if (increment > 0) {
--    j = increment;
--    do {
--      if ((filename[j] >= '0') && (filename[j] <= '9')) {
--        meshnumber = meshnumber * 10 + (int) (filename[j] - '0');
--      } else {
--        increment = 0;
--      }
--      j++;
--    } while (filename[j] != '\0');
--  }
--  if (increment > 0) {
--    filename[increment - 1] = '\0';
--  }
--
--  if (meshnumber == 0) {
--    start_inc = 0;
--    loweriteration = 0;
--  } else {
--    start_inc = 1;
--    loweriteration = meshnumber - 1;
--  }
--  set_filenames(filename, loweriteration);
--}
--#endif /* 0 */
--
--void free_inc(inc)
--int inc;
--{
--  if (loaded[inc][NODE]) {
--    free(nodeptr[inc]);
--  }
--  if (loaded[inc][POLY]) {
--    if (polynodes[inc] > 0) {
--      free(polynodeptr[inc]);
--    }
--    free(polyedgeptr[inc]);
--    free(polyholeptr[inc]);
--  }
--  if (loaded[inc][ELE]) {
--    free(eleptr[inc]);
--  }
--  if (loaded[inc][PART]) {
--    free(partpart[inc]);
--    free(partcenter[inc]);
--    free(partshift[inc]);
--  }
--  if (loaded[inc][EDGE]) {
--    free(edgeptr[inc]);
--    free(normptr[inc]);
--  }
--  if (loaded[inc][ADJ]) {
--    free(adjptr[inc]);
--  }
--  if (loaded[inc][VORO]) {
--    free(vnodeptr[inc]);
--    free(vedgeptr[inc]);
--    free(vnormptr[inc]);
--  }
--}
--
--void move_inc(inc)
--int inc;
--{
--  int i;
--
--  free_inc(1 - inc);
--  for (i = 0; i < IMAGE_TYPES; i++) {
--    loaded[1 - inc][i] = loaded[inc][i];
--    loaded[inc][i] = 0;
--    xlo[1 - inc][i] = xlo[inc][i];
--    ylo[1 - inc][i] = ylo[inc][i];
--    xhi[1 - inc][i] = xhi[inc][i];
--    yhi[1 - inc][i] = yhi[inc][i];
--  }
--  nodes[1 - inc] = nodes[inc];
--  node_dim[1 - inc] = node_dim[inc];
--  nodeptr[1 - inc] = nodeptr[inc];
--  polynodes[1 - inc] = polynodes[inc];
--  poly_dim[1 - inc] = poly_dim[inc];
--  polyedges[1 - inc] = polyedges[inc];
--  polyholes[1 - inc] = polyholes[inc];
--  polynodeptr[1 - inc] = polynodeptr[inc];
--  polyedgeptr[1 - inc] = polyedgeptr[inc];
--  polyholeptr[1 - inc] = polyholeptr[inc];
--  elems[1 - inc] = elems[inc];
--  ele_corners[1 - inc] = ele_corners[inc];
--  eleptr[1 - inc] = eleptr[inc];
--  edges[1 - inc] = edges[inc];
--  edgeptr[1 - inc] = edgeptr[inc];
--  normptr[1 - inc] = normptr[inc];
--  subdomains[1 - inc] = subdomains[inc];
--  partpart[1 - inc] = partpart[inc];
--  partcenter[1 - inc] = partcenter[inc];
--  partshift[1 - inc] = partshift[inc];
--  adjsubdomains[1 - inc] = adjsubdomains[inc];
--  adjptr[1 - inc] = adjptr[inc];
--  vnodes[1 - inc] = vnodes[inc];
--  vnode_dim[1 - inc] = vnode_dim[inc];
--  vnodeptr[1 - inc] = vnodeptr[inc];
--  vedges[1 - inc] = vedges[inc];
--  vedgeptr[1 - inc] = vedgeptr[inc];
--  vnormptr[1 - inc] = vnormptr[inc];
--  firstnumber[1 - inc] = firstnumber[inc];
--  firstnumber[inc] = -1;
--}
--
--void unload_inc(inc)
--int inc;
--{
--  int i;
--
--  current_image = NOTHING;
--  for (i = 0; i < IMAGE_TYPES; i++) {
--    loaded[inc][i] = 0;
--    firstnumber[inc] = -1;
--  }
--}
--
--void showme_init()
--{
--  current_image = NOTHING;
--  current_inc = 0;
--  explosion = STARTEXPLOSION;
--  unload_inc(0);
--  unload_inc(1);
--}
--
--char *readline(string, infile, infilename)
--char *string;
--FILE *infile;
--char *infilename;
--{
--  char *result;
--
--  do {
--    result = fgets(string, INPUTLINESIZE, infile);
--    if (result == (char *) NULL) {
--      printf("  Error:  Unexpected end of file in %s.\n",
--             infilename);
--      exit(1);
--    }
--    while ((*result != '\0') && (*result != '#')
--           && (*result != '.') && (*result != '+') && (*result != '-')
--           && ((*result < '0') || (*result > '9'))) {
--      result++;
--    }
--  } while ((*result == '#') || (*result == '\0'));
--  return result;
--}
--
--char *findfield(string)
--char *string;
--{
--  char *result;
--
--  result = string;
--  while ((*result != '\0') && (*result != '#')
--         && (*result != ' ') && (*result != '\t')) {
--    result++;
--  }
--  while ((*result != '\0') && (*result != '#')
--         && (*result != '.') && (*result != '+') && (*result != '-')
--         && ((*result < '0') || (*result > '9'))) {
--    result++;
--  }
--  if (*result == '#') {
--    *result = '\0';
--  }
--  return result;
--}
--
--int load_node(fname, firstnumber, nodes, dim, ptr, xmin, ymin, xmax, ymax)
--char *fname;
--int *firstnumber;
--int *nodes;
--int *dim;
--REAL **ptr;
--REAL *xmin;
--REAL *ymin;
--REAL *xmax;
--REAL *ymax;
--{
--  FILE *infile;
--  char inputline[INPUTLINESIZE];
--  char *stringptr;
--  int extras;
--  int nodemarks;
--  int index;
--  int nodenumber;
--  int i, j;
--  int smallerr;
--  REAL x, y;
--
--  *xmin = *ymin = 0.0;
--  *xmax = *ymax = 1.0;
--  if (!quiet) {
--    printf("Opening %s.\n", fname);
--  }
--  infile = fopen(fname, "r");
--  if (infile == (FILE *) NULL) {
--    printf("  Error:  Cannot access file %s.\n", fname);
--    return 1;
--  }
--  stringptr = readline(inputline, infile, fname);
--  *nodes = (int) strtol (stringptr, &stringptr, 0);
--  if (*nodes < 3) {
--    printf("  Error:  %s contains %d points.\n", fname, *nodes);
--    return 1;
--  }
--  stringptr = findfield(stringptr);
--  if (*stringptr == '\0') {
--    *dim = 2;
--  } else {
--    *dim = (int) strtol (stringptr, &stringptr, 0);
--  }
--  if (*dim < 1) {
--    printf("  Error:  %s has dimensionality %d.\n", fname, *dim);
--    return 1;
--  }
--  if (*dim != 2) {
--    printf("  I only understand two-dimensional meshes.\n");
--    return 1;
--  }
--  stringptr = findfield(stringptr);
--  if (*stringptr == '\0') {
--    extras = 0;
--  } else {
--    extras = (int) strtol (stringptr, &stringptr, 0);
--  }
--  if (extras < 0) {
--    printf("  Error:  %s has negative value for number of attributes.\n",
--           fname);
--    return 1;
--  }
--  stringptr = findfield(stringptr);
--  if (*stringptr == '\0') {
--    nodemarks = 0;
--  } else {
--    nodemarks = (int) strtol (stringptr, &stringptr, 0);
--  }
--  if (nodemarks < 0) {
--    printf("  Warning:  %s has negative value for number of point markers.\n",
--           fname);
--  }
--  if (nodemarks > 1) {
--    printf(
--   "  Warning:  %s has value greater than one for number of point markers.\n",
--           fname);
--  }
--  *ptr = (REAL *) malloc((*nodes + 1) * *dim * sizeof(REAL));
--  if (*ptr == (REAL *) NULL) {
--    printf("  Out of memory.\n");
--    return 1;
--  }
--  index = *dim;
--  smallerr = 1;
--  for (i = 0; i < *nodes; i++) {
--    stringptr = readline(inputline, infile, fname);
--    nodenumber = (int) strtol (stringptr, &stringptr, 0);
--    if ((i == 0) && (*firstnumber == -1)) {
--      if (nodenumber == 0) {
--        *firstnumber = 0;
--      } else {
--        *firstnumber = 1;
--      }
--    }
--    if ((nodenumber != *firstnumber + i) && (smallerr)) {
--      printf("  Warning:  Points in %s are not numbered correctly\n", fname);
--      printf("            (starting with point %d).\n", *firstnumber + i);
--      smallerr = 0;
--    }
--    for (j = 0; j < *dim; j++) {
--      stringptr = findfield(stringptr);
--      if (*stringptr == '\0') {
--        printf("Error:  Point %d is missing a coordinate in %s.\n",
--               *firstnumber + i, fname);
--        free(*ptr);
--        return 1;
--      }
--      (*ptr)[index++] = (REAL) strtod(stringptr, &stringptr);
--    }
--  }
--  fclose(infile);
--  index = *dim;
--  *xmin = *xmax = (*ptr)[index];
--  *ymin = *ymax = (*ptr)[index + 1];
--  for (i = 2; i <= *nodes; i++) {
--    index += *dim;
--    x = (*ptr)[index];
--    y = (*ptr)[index + 1];
--    if (x < *xmin) {
--      *xmin = x;
--    }
--    if (y < *ymin) {
--      *ymin = y;
--    }
--    if (x > *xmax) {
--      *xmax = x;
--    }
--    if (y > *ymax) {
--      *ymax = y;
--    }
--  }
--  if (*xmin == *xmax) {
--    *xmin -= 0.5;
--    *xmax += 0.5;
--  }
--  if (*ymin == *ymax) {
--    *ymin -= 0.5;
--    *ymax += 0.5;
--  }
--  return 0;
--}
--
--int load_poly(inc, fname, firstnumber, pnodes, dim, edges, holes, nodeptr,
--              edgeptr, holeptr, xmin, ymin, xmax, ymax)
--int inc;
--char *fname;
--int *firstnumber;
--int *pnodes;
--int *dim;
--int *edges;
--int *holes;
--REAL **nodeptr;
--int **edgeptr;
--REAL **holeptr;
--REAL *xmin;
--REAL *ymin;
--REAL *xmax;
--REAL *ymax;
--{
--  FILE *infile;
--  char inputline[INPUTLINESIZE];
--  char *stringptr;
--  int extras;
--  int nodemarks;
--  int segmentmarks;
--  int index;
--  int nodenumber, edgenumber, holenumber;
--  int maxnode;
--  int i, j;
--  int smallerr;
--  REAL x, y;
--
--  if (!quiet) {
--    printf("Opening %s.\n", fname);
--  }
--  infile = fopen(fname, "r");
--  if (infile == (FILE *) NULL) {
--    printf("  Error:  Cannot access file %s.\n", fname);
--    return 1;
--  }
--  stringptr = readline(inputline, infile, fname);
--  *pnodes = (int) strtol (stringptr, &stringptr, 0);
--  if (*pnodes == 0) {
--    if (!loaded[inc][NODE]) {
--      if (load_image(inc, NODE)) {
--        return 1;
--      }
--    }
--    maxnode = nodes[inc];
--    *xmin = xlo[inc][NODE];
--    *ymin = ylo[inc][NODE];
--    *xmax = xhi[inc][NODE];
--    *ymax = yhi[inc][NODE];
--  } else {
--    if (*pnodes < 1) {
--      printf("  Error:  %s contains %d points.\n", fname, *pnodes);
--      return 1;
--    }
--    maxnode = *pnodes;
--  }
--  stringptr = findfield(stringptr);
--  if (*stringptr == '\0') {
--    *dim = 2;
--  } else {
--    *dim = (int) strtol (stringptr, &stringptr, 0);
--  }
--  if (*dim < 1) {
--    printf("  Error:  %s has dimensionality %d.\n", fname, *dim);
--    return 1;
--  }
--  if (*dim != 2) {
--    printf("  I only understand two-dimensional meshes.\n");
--    return 1;
--  }
--  stringptr = findfield(stringptr);
--  if (*stringptr == '\0') {
--    extras = 0;
--  } else {
--    extras = (int) strtol (stringptr, &stringptr, 0);
--  }
--  if (extras < 0) {
--    printf("  Error:  %s has negative value for number of attributes.\n",
--           fname);
--    return 1;
--  }
--  stringptr = findfield(stringptr);
--  if (*stringptr == '\0') {
--    nodemarks = 0;
--  } else {
--    nodemarks = (int) strtol (stringptr, &stringptr, 0);
--  }
--  if (nodemarks < 0) {
--    printf("  Warning:  %s has negative value for number of point markers.\n",
--           fname);
--  }
--  if (nodemarks > 1) {
--    printf(
--   "  Warning:  %s has value greater than one for number of point markers.\n",
--           fname);
--  }
--  if (*pnodes > 0) {
--    *nodeptr = (REAL *) malloc((*pnodes + 1) * *dim * sizeof(REAL));
--    if (*nodeptr == (REAL *) NULL) {
--      printf("  Out of memory.\n");
--      return 1;
--    }
--    index = *dim;
--    smallerr = 1;
--    for (i = 0; i < *pnodes; i++) {
--      stringptr = readline(inputline, infile, fname);
--      nodenumber = (int) strtol (stringptr, &stringptr, 0);
--      if ((i == 0) && (*firstnumber == -1)) {
--        if (nodenumber == 0) {
--          *firstnumber = 0;
--        } else {
--          *firstnumber = 1;
--        }
--      }
--      if ((nodenumber != *firstnumber + i) && (smallerr)) {
--        printf("  Warning:  Points in %s are not numbered correctly.\n",
--               fname);
--        printf("            (starting with point %d).\n", *firstnumber + i);
--        smallerr = 0;
--      }
--      for (j = 0; j < *dim; j++) {
--        stringptr = findfield(stringptr);
--        if (*stringptr == '\0') {
--          printf("Error:  Point %d is missing a coordinate in %s.\n",
--                 *firstnumber + i, fname);
--          free(*nodeptr);
--          return 1;
--        }
--        (*nodeptr)[index++] = (REAL) strtod(stringptr, &stringptr);
--      }
--    }
--  }
--  stringptr = readline(inputline, infile, fname);
--  *edges = (int) strtol (stringptr, &stringptr, 0);
--  if (*edges < 0) {
--    printf("  Error:  %s contains %d segments.\n", fname, *edges);
--    free(*nodeptr);
--    return 1;
--  }
--  stringptr = findfield(stringptr);
--  if (*stringptr == '\0') {
--    segmentmarks = 0;
--  } else {
--    segmentmarks = (int) strtol (stringptr, &stringptr, 0);
--  }
--  if (segmentmarks < 0) {
--    printf("  Error:  %s has negative value for number of segment markers.\n",
--           fname);
--    free(*nodeptr);
--    return 1;
--  }
--  if (segmentmarks > 1) {
--    printf(
--   "  Error:  %s has value greater than one for number of segment markers.\n",
--           fname);
--    free(*nodeptr);
--    return 1;
--  }
--  *edgeptr = (int *) malloc(((*edges + 1) << 1) * sizeof(int));
--  if (*edgeptr == (int *) NULL) {
--    printf("  Out of memory.\n");
--    free(*nodeptr);
--    return 1;
--  }
--  index = 2;
--  smallerr = 1;
--  for (i = *firstnumber; i < *firstnumber + *edges; i++) {
--    stringptr = readline(inputline, infile, fname);
--    edgenumber = (int) strtol (stringptr, &stringptr, 0);
--    if ((edgenumber != i) && (smallerr)) {
--      printf("  Warning:  Segments in %s are not numbered correctly.\n",
--             fname);
--      printf("            (starting with segment %d).\n", i);
--      smallerr = 0;
--    }
--    stringptr = findfield(stringptr);
--    if (*stringptr == '\0') {
--      printf("Error:  Segment %d is missing its endpoints in %s.\n", i, fname);
--      free(*nodeptr);
--      free(*edgeptr);
--      return 1;
--    }
--    (*edgeptr)[index] = (int) strtol (stringptr, &stringptr, 0) + 1 -
--                        *firstnumber;
--    if (((*edgeptr)[index] < 1) || ((*edgeptr)[index] > maxnode)) {
--      printf("Error:  Segment %d has invalid endpoint in %s.\n", i, fname);
--      return 1;
--    }
--    stringptr = findfield(stringptr);
--    if (*stringptr == '\0') {
--      printf("Error:  Segment %d is missing an endpoint in %s.\n", i, fname);
--      free(*nodeptr);
--      free(*edgeptr);
--      return 1;
--    }
--    (*edgeptr)[index + 1] = (int) strtol (stringptr, &stringptr, 0) + 1 -
--                            *firstnumber;
--    if (((*edgeptr)[index + 1] < 1) || ((*edgeptr)[index + 1] > maxnode)) {
--      printf("Error:  Segment %d has invalid endpoint in %s.\n", i, fname);
--      return 1;
--    }
--    index += 2;
--  }
--  stringptr = readline(inputline, infile, fname);
--  *holes = (int) strtol (stringptr, &stringptr, 0);
--  if (*holes < 0) {
--    printf("  Error:  %s contains %d holes.\n", fname, *holes);
--    free(*nodeptr);
--    free(*edgeptr);
--    return 1;
--  }
--  *holeptr = (REAL *) malloc((*holes + 1) * *dim * sizeof(REAL));
--  if (*holeptr == (REAL *) NULL) {
--    printf("  Out of memory.\n");
--    free(*nodeptr);
--    free(*edgeptr);
--    return 1;
--  }
--  index = *dim;
--  smallerr = 1;
--  for (i = *firstnumber; i < *firstnumber + *holes; i++) {
--    stringptr = readline(inputline, infile, fname);
--    holenumber = (int) strtol (stringptr, &stringptr, 0);
--    if ((holenumber != i) && (smallerr)) {
--      printf("  Warning:  Holes in %s are not numbered correctly.\n", fname);
--      printf("            (starting with hole %d).\n", i);
--      smallerr = 0;
--    }
--    for (j = 0; j < *dim; j++) {
--      stringptr = findfield(stringptr);
--      if (*stringptr == '\0') {
--        printf("Error:  Hole %d is missing a coordinate in %s.\n", i,
--               fname);
--        free(*nodeptr);
--        free(*edgeptr);
--        free(*holeptr);
--        return 1;
--      }
--      (*holeptr)[index++] = (REAL) strtod(stringptr, &stringptr);
--    }
--  }
--  fclose(infile);
--  if (*pnodes > 0) {
--    index = *dim;
--    *xmin = *xmax = (*nodeptr)[index];
--    *ymin = *ymax = (*nodeptr)[index + 1];
--    for (i = 2; i <= *pnodes; i++) {
--      index += *dim;
--      x = (*nodeptr)[index];
--      y = (*nodeptr)[index + 1];
--      if (x < *xmin) {
--        *xmin = x;
--      }
--      if (y < *ymin) {
--        *ymin = y;
--      }
--      if (x > *xmax) {
--        *xmax = x;
--      }
--      if (y > *ymax) {
--        *ymax = y;
--      }
--    }
--  }
--  index = *dim;
--  for (i = 1; i <= *holes; i++) {
--    x = (*holeptr)[index];
--    y = (*holeptr)[index + 1];
--    if (x < *xmin) {
--      *xmin = x;
--    }
--    if (y < *ymin) {
--      *ymin = y;
--    }
--    if (x > *xmax) {
--      *xmax = x;
--    }
--    if (y > *ymax) {
--      *ymax = y;
--    }
--    index += *dim;
--  }
--  return 0;
--}
--
--int load_ele(fname, firstnumber, nodes, elems, corners, ptr)
--char *fname;
--int firstnumber;
--int nodes;
--int *elems;
--int *corners;
--int **ptr;
--{
--  FILE *infile;
--  char inputline[INPUTLINESIZE];
--  char *stringptr;
--  int extras;
--  int index;
--  int elemnumber;
--  int i, j;
--  int smallerr;
--
--  if (!quiet) {
--    printf("Opening %s.\n", fname);
--  }
--  infile = fopen(fname, "r");
--  if (infile == (FILE *) NULL) {
--    printf("  Error:  Cannot access file %s.\n", fname);
--    return 1;
--  }
--  stringptr = readline(inputline, infile, fname);
--  *elems = (int) strtol (stringptr, &stringptr, 0);
--  if (*elems < 1) {
--    printf("  Error:  %s contains %d triangles.\n", fname, *elems);
--    return 1;
--  }
--  stringptr = findfield(stringptr);
--  if (*stringptr == '\0') {
--    *corners = 3;
--  } else {
--    *corners = (int) strtol (stringptr, &stringptr, 0);
--  }
--  if (*corners < 3) {
--    printf("  Error:  Triangles in %s have only %d corners.\n", fname,
--           *corners);
--    return 1;
--  }
--  stringptr = findfield(stringptr);
--  if (*stringptr == '\0') {
--    extras = 0;
--  } else {
--    extras = (int) strtol (stringptr, &stringptr, 0);
--  }
--  if (extras < 0) {
--    printf("  Error:  %s has negative value for extra fields.\n", fname);
--    return 1;
--  }
--  *ptr = (int *) malloc((*elems + 1) * 3 * sizeof(int));
--  if (*ptr == (int *) NULL) {
--    printf("  Out of memory.\n");
--    return 1;
--  }
--  index = 3;
--  smallerr = 1;
--  for (i = firstnumber; i < firstnumber + *elems; i++) {
--    stringptr = readline(inputline, infile, fname);
--    elemnumber = (int) strtol (stringptr, &stringptr, 0);
--    if ((elemnumber != i) && (smallerr)) {
--      printf("  Warning:  Triangles in %s are not numbered correctly.\n",
--             fname);
--      printf("            (starting with triangle %d).\n", i);
--      smallerr = 0;
--    }
--    for (j = 0; j < 3; j++) {
--      stringptr = findfield(stringptr);
--      if (*stringptr == '\0') {
--        printf("Error:  Triangle %d is missing a corner in %s.\n", i, fname);
--        free(*ptr);
--        return 1;
--      }
--      (*ptr)[index] = (int) strtol (stringptr, &stringptr, 0) + 1 -
--                      firstnumber;
--      if (((*ptr)[index] < 1) || ((*ptr)[index] > nodes)) {
--        printf("Error:  Triangle %d has invalid corner in %s.\n", i, fname);
--        return 1;
--      }
--      index++;
--    }
--  }
--  fclose(infile);
--  return 0;
--}
--
--int load_edge(fname, firstnumber, nodes, edges, edgeptr, normptr)
--char *fname;
--int firstnumber;
--int nodes;
--int *edges;
--int **edgeptr;
--REAL **normptr;
--{
--  FILE *infile;
--  char inputline[INPUTLINESIZE];
--  char *stringptr;
--  int index;
--  int edgenumber;
--  int edgemarks;
--  int i;
--  int smallerr;
--
--  if (!quiet) {
--    printf("Opening %s.\n", fname);
--  }
--  infile = fopen(fname, "r");
--    if (infile == (FILE *) NULL) {
--      printf("  Error:  Cannot access file %s.\n", fname);
--      return 1;
--    }
--  stringptr = readline(inputline, infile, fname);
--  *edges = (int) strtol (stringptr, &stringptr, 0);
--  if (*edges < 1) {
--    printf("  Error:  %s contains %d edges.\n", fname, *edges);
--    return 1;
--  }
--  stringptr = findfield(stringptr);
--  if (*stringptr == '\0') {
--    edgemarks = 0;
--  } else {
--    edgemarks = (int) strtol (stringptr, &stringptr, 0);
--  }
--  if (edgemarks < 0) {
--    printf("  Error:  %s has negative value for number of edge markers.\n",
--           fname);
--    return 1;
--  }
--  if (edgemarks > 1) {
--    printf(
--   "  Error:  %s has value greater than one for number of edge markers.\n",
--           fname);
--    return 1;
--  }
--  *edgeptr = (int *) malloc(((*edges + 1) << 1) * sizeof(int));
--  if (*edgeptr == (int *) NULL) {
--    printf("  Out of memory.\n");
--    return 1;
--  }
--  *normptr = (REAL *) malloc(((*edges + 1) << 1) * sizeof(REAL));
--  if (*normptr == (REAL *) NULL) {
--    printf("  Out of memory.\n");
--    free(*edgeptr);
--    return 1;
--  }
--  index = 2;
--  smallerr = 1;
--  for (i = firstnumber; i < firstnumber + *edges; i++) {
--    stringptr = readline(inputline, infile, fname);
--    edgenumber = (int) strtol (stringptr, &stringptr, 0);
--    if ((edgenumber != i) && (smallerr)) {
--      printf("  Warning:  Edges in %s are not numbered correctly.\n", fname);
--      printf("            (starting with edge %d).\n", i);
--      smallerr = 0;
--    }
--    stringptr = findfield(stringptr);
--    if (*stringptr == '\0') {
--      printf("Error:  Edge %d is missing its endpoints in %s.\n", i, fname);
--      free(*edgeptr);
--      free(*normptr);
--      return 1;
--    }
--    (*edgeptr)[index] = (int) strtol (stringptr, &stringptr, 0) + 1 -
--                        firstnumber;
--    if (((*edgeptr)[index] < 1) || ((*edgeptr)[index] > nodes)) {
--      printf("Error:  Edge %d has invalid endpoint in %s.\n", i, fname);
--      return 1;
--    }
--    stringptr = findfield(stringptr);
--    if (*stringptr == '\0') {
--      printf("Error:  Edge %d is missing an endpoint in %s.\n", i, fname);
--      free(*edgeptr);
--      free(*normptr);
--      return 1;
--    }
--    (*edgeptr)[index + 1] = (int) strtol (stringptr, &stringptr, 0);
--    if ((*edgeptr)[index + 1] == -1) {
--      stringptr = findfield(stringptr);
--      if (*stringptr == '\0') {
--        printf("Error:  Edge %d is missing its direction in %s.\n", i, fname);
--        free(*edgeptr);
--        free(*normptr);
--        return 1;
--      }
--      (*normptr)[index] = (REAL) strtod(stringptr, &stringptr);
--      stringptr = findfield(stringptr);
--      if (*stringptr == '\0') {
--        printf("Error:  Edge %d is missing a direction coordinate in %s.\n",
--               i, fname);
--        free(*edgeptr);
--        free(*normptr);
--        return 1;
--      }
--      (*normptr)[index + 1] = (REAL) strtod(stringptr, &stringptr);
--    } else {
--      (*edgeptr)[index + 1] += 1 - firstnumber;
--      if (((*edgeptr)[index + 1] < 1) || ((*edgeptr)[index + 1] > nodes)) {
--        printf("Error:  Edge %d has invalid endpoint in %s.\n", i, fname);
--        return 1;
--      }
--    }
--    index += 2;
--  }
--  fclose(infile);
--  return 0;
--}
--
--int load_part(fname, dim, firstnumber, elems, nodeptr, eleptr, parts,
--              partition, partcenter, partshift)
--char *fname;
--int dim;
--int firstnumber;
--int elems;
--REAL *nodeptr;
--int *eleptr;
--int *parts;
--int **partition;
--REAL **partcenter;
--REAL **partshift;
--{
--  FILE *infile;
--  char inputline[INPUTLINESIZE];
--  char *stringptr;
--  int partelems;
--  int index;
--  int elemnumber;
--  int i, j;
--  int smallerr;
--  int *partsize;
--
--  if (!quiet) {
--    printf("Opening %s.\n", fname);
--  }
--  infile = fopen(fname, "r");
--  if (infile == (FILE *) NULL) {
--    printf("  Error:  Cannot access file %s.\n", fname);
--    return 1;
--  }
--  stringptr = readline(inputline, infile, fname);
--  partelems = (int) strtol (stringptr, &stringptr, 0);
--  if (partelems != elems) {
--    printf(
--      "  Error:  .ele and .part files do not agree on number of triangles.\n");
--    return 1;
--  }
--  stringptr = findfield(stringptr);
--  if (*stringptr == '\0') {
--    *parts = 1;
--  } else {
--    *parts = (int) strtol (stringptr, &stringptr, 0);
--  }
--  if (*parts < 1) {
--    printf("  Error:  %s specifies %d subdomains.\n", fname, *parts);
--    return 1;
--  }
--  *partition = (int *) malloc((elems + 1) * sizeof(int));
--  if (*partition == (int *) NULL) {
--    printf("  Out of memory.\n");
--    return 1;
--  }
--  smallerr = 1;
--  for (i = firstnumber; i < firstnumber + partelems; i++) {
--    stringptr = readline(inputline, infile, fname);
--    elemnumber = (int) strtol (stringptr, &stringptr, 0);
--    if ((elemnumber != i) && (smallerr)) {
--      printf("  Warning:  Triangles in %s are not numbered correctly.\n",
--             fname);
--      printf("            (starting with triangle %d).\n", i);
--      smallerr = 0;
--    }
--    stringptr = findfield(stringptr);
--    if (*stringptr == '\0') {
--      printf("Error:  Triangle %d has no subdomain in %s.\n", i, fname);
--      free(*partition);
--      return 1;
--    }
--    (*partition)[i] = (int) strtol (stringptr, &stringptr, 0) - firstnumber;
--    if (((*partition)[i] >= *parts) || ((*partition)[i] < 0)) {
--      printf("  Error:  Triangle %d of %s has an invalid subdomain.\n",
--             i, fname);
--      free(*partition);
--      return 1;
--    }
--  }
--  fclose(infile);
--  *partcenter = (REAL *) malloc(((*parts + 1) << 1) * sizeof(REAL));
--  if (*partcenter == (REAL *) NULL) {
--    printf("Error:  Out of memory.\n");
--    free(*partition);
--    return 1;
--  }
--  *partshift = (REAL *) malloc((*parts << 1) * sizeof(REAL));
--  if (*partshift == (REAL *) NULL) {
--    printf("Error:  Out of memory.\n");
--    free(*partition);
--    free(*partcenter);
--    return 1;
--  }
--  partsize = (int *) malloc((*parts + 1) * sizeof(int));
--  if (partsize == (int *) NULL) {
--    printf("Error:  Out of memory.\n");
--    free(*partition);
--    free(*partcenter);
--    free(*partshift);
--    return 1;
--  }
--  index = 3;
--  for (i = 0; i <= *parts; i++) {
--    partsize[i] = 0;
--    (*partcenter)[i << 1] = 0.0;
--    (*partcenter)[(i << 1) + 1] = 0.0;
--  }
--  for (i = 1; i <= elems; i++) {
--    partsize[(*partition)[i]] += 3;
--    for (j = 0; j < 3; j++) {
--      (*partcenter)[(*partition)[i] << 1] +=
--                nodeptr[eleptr[index] * dim];
--      (*partcenter)[((*partition)[i] << 1) + 1] +=
--                nodeptr[eleptr[index++] * dim + 1];
--    }
--  }
--  for (i = 0; i < *parts; i++) {
--    (*partcenter)[i << 1] /= (REAL) partsize[i];
--    (*partcenter)[(i << 1) + 1] /= (REAL) partsize[i];
--    (*partcenter)[*parts << 1] += (*partcenter)[i << 1];
--    (*partcenter)[(*parts << 1) + 1] += (*partcenter)[(i << 1) + 1];
--  }
--  (*partcenter)[*parts << 1] /= (REAL) *parts;
--  (*partcenter)[(*parts << 1) + 1] /= (REAL) *parts;
--  free(partsize);
--  return 0;
--}
--
--int load_adj(fname, subdomains, ptr)
--char *fname;
--int *subdomains;
--int **ptr;
--{
--  FILE *infile;
--  char inputline[INPUTLINESIZE];
--  char *stringptr;
--  int i, j;
--
--  if (!quiet) {
--    printf("Opening %s.\n", fname);
--  }
--  infile = fopen(fname, "r");
--  if (infile == (FILE *) NULL) {
--    printf("  Error:  Cannot access file %s.\n", fname);
--    return 1;
--  }
--  stringptr = readline(inputline, infile, fname);
--  *subdomains = (int) strtol (stringptr, &stringptr, 0);
--  if (*subdomains < 1) {
--    printf("  Error:  %s contains %d subdomains.\n", fname, *subdomains);
--    return 1;
--  }
--  *ptr = (int *) malloc(*subdomains * *subdomains * sizeof(int));
--  if (*ptr == (int *) NULL) {
--    printf("  Out of memory.\n");
--    return 1;
--  }
--  for (i = 0; i < *subdomains; i++) {
--    for (j = 0; j < *subdomains; j++) {
--      stringptr = readline(inputline, infile, fname);
--      (*ptr)[i * *subdomains + j] = (int) strtol (stringptr, &stringptr, 0);
--    }
--  }
--  return 0;
--}
--
--void findpartshift(parts, explosion, partcenter, partshift)
--int parts;
--REAL explosion;
--REAL *partcenter;
--REAL *partshift;
--{
--  int i;
--
--  for (i = 0; i < parts; i++) {
--    partshift[i << 1] = explosion *
--          (partcenter[i << 1] - partcenter[parts << 1]);
--    partshift[(i << 1) + 1] = explosion *
--          (partcenter[(i << 1) + 1] - partcenter[(parts << 1) + 1]);
--  }
--}
--
--int load_image(inc, image)
--int inc;
--int image;
--{
--  int error;
--
--  switch (image) {
--    case NODE:
--      error = load_node(nodefilename[inc], &firstnumber[inc], &nodes[inc],
--                        &node_dim[inc], &nodeptr[inc], &xlo[inc][NODE],
--                        &ylo[inc][NODE], &xhi[inc][NODE], &yhi[inc][NODE]);
--      break;
--    case POLY:
--      error = load_poly(inc, polyfilename[inc], &firstnumber[inc],
--                        &polynodes[inc], &poly_dim[inc], &polyedges[inc],
--                        &polyholes[inc], &polynodeptr[inc], &polyedgeptr[inc],
--                        &polyholeptr[inc],
--                        &xlo[inc][POLY], &ylo[inc][POLY],
--                        &xhi[inc][POLY], &yhi[inc][POLY]);
--      break;
--    case ELE:
--      error = load_ele(elefilename[inc], firstnumber[inc], nodes[inc],
--                       &elems[inc], &ele_corners[inc], &eleptr[inc]);
--      xlo[inc][ELE] = xlo[inc][NODE];
--      ylo[inc][ELE] = ylo[inc][NODE];
--      xhi[inc][ELE] = xhi[inc][NODE];
--      yhi[inc][ELE] = yhi[inc][NODE];
--      break;
--    case EDGE:
--      error = load_edge(edgefilename[inc], firstnumber[inc], nodes[inc],
--                        &edges[inc], &edgeptr[inc], &normptr[inc]);
--      xlo[inc][EDGE] = xlo[inc][NODE];
--      ylo[inc][EDGE] = ylo[inc][NODE];
--      xhi[inc][EDGE] = xhi[inc][NODE];
--      yhi[inc][EDGE] = yhi[inc][NODE];
--      break;
--    case PART:
--      error = load_part(partfilename[inc], node_dim[inc], firstnumber[inc],
--                        elems[inc], nodeptr[inc], eleptr[inc],
--                        &subdomains[inc], &partpart[inc], &partcenter[inc],
--                        &partshift[inc]);
--      if (!error) {
--        findpartshift(subdomains[inc], explosion, partcenter[inc],
--                      partshift[inc]);
--      }
--      xlo[inc][PART] = xlo[inc][NODE];
--      ylo[inc][PART] = ylo[inc][NODE];
--      xhi[inc][PART] = xhi[inc][NODE];
--      yhi[inc][PART] = yhi[inc][NODE];
--      break;
--    case ADJ:
--      error = load_adj(adjfilename[inc], &adjsubdomains[inc], &adjptr[inc]);
--      xlo[inc][ADJ] = xlo[inc][NODE];
--      ylo[inc][ADJ] = ylo[inc][NODE];
--      xhi[inc][ADJ] = xhi[inc][NODE];
--      yhi[inc][ADJ] = yhi[inc][NODE];
--      break;
--    case VORO:
--      error = load_node(vnodefilename[inc], &firstnumber[inc], &vnodes[inc],
--                        &vnode_dim[inc], &vnodeptr[inc], &xlo[inc][VORO],
--                        &ylo[inc][VORO], &xhi[inc][VORO], &yhi[inc][VORO]);
--      if (!error) {
--        error = load_edge(vedgefilename[inc], firstnumber[inc], vnodes[inc],
--                          &vedges[inc], &vedgeptr[inc], &vnormptr[inc]);
--      }
--      break;
--    default:
--      error = 1;
--  }
--  if (!error) {
--    loaded[inc][image] = 1;
--  }
--  return error;
--}
--
--void choose_image(inc, image)
--int inc;
--int image;
--{
--  if (!loaded[inc][image]) {
--    if ((image == ELE) || (image == EDGE) || (image == PART)
--        || (image == ADJ)) {
--      if (!loaded[inc][NODE]) {
--        if (load_image(inc, NODE)) {
--          return;
--        }
--      }
--    }
--    if ((image == PART) || (image == ADJ)) {
--      if (!loaded[inc][ELE]) {
--        if (load_image(inc, ELE)) {
--          return;
--        }
--      }
--    }
--    if (image == ADJ) {
--      if (!loaded[inc][PART]) {
--        if (load_image(inc, PART)) {
--          return;
--        }
--      }
--    }
--    if (load_image(inc, image)) {
--      return;
--    }
--  }
--  current_inc = inc;
--  current_image = image;
--}
--
--Window make_button(name, x, y, width)
--char *name;
--int x;
--int y;
--int width;
--{
--  XSetWindowAttributes attr;
--  XSizeHints hints;
--  Window button;
--
--  attr.background_pixel = black;
--  attr.border_pixel = white;
--  attr.backing_store = NotUseful;
--  attr.event_mask = ExposureMask | ButtonReleaseMask | ButtonPressMask;
--  attr.bit_gravity = SouthWestGravity;
--  attr.win_gravity = SouthWestGravity;
--  attr.save_under = False;
--  button = XCreateWindow(display, mainwindow, x, y, width, BUTTONHEIGHT - 4,
--                         2, 0, InputOutput, CopyFromParent,
--                         CWBackPixel | CWBorderPixel | CWEventMask |
--                         CWBitGravity | CWWinGravity | CWBackingStore |
--                         CWSaveUnder, &attr);
--  hints.width = width;
--  hints.height = BUTTONHEIGHT - 4;
--  hints.min_width = 0;
--  hints.min_height = BUTTONHEIGHT - 4;
--  hints.max_width = width;
--  hints.max_height = BUTTONHEIGHT - 4;
--  hints.width_inc = 1;
--  hints.height_inc = 1;
--  hints.flags = PMinSize | PMaxSize | PSize | PResizeInc;
--  XSetStandardProperties(display, button, name, "showme", None, (char **) NULL,
--                         0, &hints);
--  return button;
--}
--
--void make_buttons(y)
--int y;
--{
--  int i;
--
--  for (i = 1; i >= 0; i--) {
--    nodewin[i] = make_button("node", 0, y + (1 - i) * BUTTONHEIGHT, 42);
--    XMapWindow(display, nodewin[i]);
--    polywin[i] = make_button("poly", 44, y + (1 - i) * BUTTONHEIGHT, 42);
--    XMapWindow(display, polywin[i]);
--    elewin[i] = make_button("ele", 88, y + (1 - i) * BUTTONHEIGHT, 33);
--    XMapWindow(display, elewin[i]);
--    edgewin[i] = make_button("edge", 123, y + (1 - i) * BUTTONHEIGHT, 42);
--    XMapWindow(display, edgewin[i]);
--    partwin[i] = make_button("part", 167, y + (1 - i) * BUTTONHEIGHT, 42);
--    XMapWindow(display, partwin[i]);
--    adjwin[i] = make_button("adj", 211, y + (1 - i) * BUTTONHEIGHT, 33);
--    XMapWindow(display, adjwin[i]);
--    voronoiwin[i] = make_button("voro", 246, y + (1 - i) * BUTTONHEIGHT, 42);
--    XMapWindow(display, voronoiwin[i]);
--  }
--  versionpluswin = make_button("    +", 290, y, 52);
--  XMapWindow(display, versionpluswin);
--  versionminuswin = make_button("    -", 290, y + BUTTONHEIGHT, 52);
--  XMapWindow(display, versionminuswin);
--
--  quitwin = make_button("Quit", 0, y + 2 * BUTTONHEIGHT, 42);
--  XMapWindow(display, quitwin);
--  leftwin = make_button("<", 44, y + 2 * BUTTONHEIGHT, 14);
--  XMapWindow(display, leftwin);
--  rightwin = make_button(">", 60, y + 2 * BUTTONHEIGHT, 14);
--  XMapWindow(display, rightwin);
--  upwin = make_button("^", 76, y + 2 * BUTTONHEIGHT, 14);
--  XMapWindow(display, upwin);
--  downwin = make_button("v", 92, y + 2 * BUTTONHEIGHT, 14);
--  XMapWindow(display, downwin);
--  resetwin = make_button("Reset", 108, y + 2 * BUTTONHEIGHT, 52);
--  XMapWindow(display, resetwin);
--  widthpluswin = make_button("Width+", 162, y + 2 * BUTTONHEIGHT, 61);
--  XMapWindow(display, widthpluswin);
--  widthminuswin = make_button("-", 225, y + 2 * BUTTONHEIGHT, 14);
--  XMapWindow(display, widthminuswin);
--  expwin = make_button("Exp", 241, y + 2 * BUTTONHEIGHT, 33);
--  XMapWindow(display, expwin);
--  exppluswin = make_button("+", 276, y + 2 * BUTTONHEIGHT, 14);
--  XMapWindow(display, exppluswin);
--  expminuswin = make_button("-", 292, y + 2 * BUTTONHEIGHT, 14);
--  XMapWindow(display, expminuswin);
--  fillwin = make_button("Fill", 308, y + 2 * BUTTONHEIGHT, 41);
--  XMapWindow(display, fillwin);
--  pswin = make_button("PS", 351, y + 2 * BUTTONHEIGHT, 24);
--  XMapWindow(display, pswin);
--  epswin = make_button("EPS", 377, y + 2 * BUTTONHEIGHT, 33);
--  XMapWindow(display, epswin);
--}
--
--void fill_button(button)
--Window button;
--{
--  int x, y;
--  unsigned int w, h, d, b;
--  Window rootw;
--
--  XGetGeometry(display, button, &rootw, &x, &y, &w, &h, &d, &b);
--  XFillRectangle(display, button, fontgc, 0, 0, w, h);
--}
--
--void draw_buttons()
--{
--  char numberstring[32];
--  char buttonstring[6];
--  int i;
--
--  for (i = 1; i >= 0; i--) {
--    if ((current_image == NODE) && (current_inc == i)) {
--      fill_button(nodewin[i]);
--      XDrawString(display, nodewin[i], blackfontgc, 2, 13, "node", 4);
--    } else {
--      XClearWindow(display, nodewin[i]);
--      XDrawString(display, nodewin[i], fontgc, 2, 13, "node", 4);
--    }
--    if ((current_image == POLY) && (current_inc == i)) {
--      fill_button(polywin[i]);
--      XDrawString(display, polywin[i], blackfontgc, 2, 13, "poly", 4);
--    } else {
--      XClearWindow(display, polywin[i]);
--      XDrawString(display, polywin[i], fontgc, 2, 13, "poly", 4);
--    }
--    if ((current_image == ELE) && (current_inc == i)) {
--      fill_button(elewin[i]);
--      XDrawString(display, elewin[i], blackfontgc, 2, 13, "ele", 3);
--    } else {
--      XClearWindow(display, elewin[i]);
--      XDrawString(display, elewin[i], fontgc, 2, 13, "ele", 3);
--    }
--    if ((current_image == EDGE) && (current_inc == i)) {
--      fill_button(edgewin[i]);
--      XDrawString(display, edgewin[i], blackfontgc, 2, 13, "edge", 4);
--    } else {
--      XClearWindow(display, edgewin[i]);
--      XDrawString(display, edgewin[i], fontgc, 2, 13, "edge", 4);
--    }
--    if ((current_image == PART) && (current_inc == i)) {
--      fill_button(partwin[i]);
--      XDrawString(display, partwin[i], blackfontgc, 2, 13, "part", 4);
--    } else {
--      XClearWindow(display, partwin[i]);
--      XDrawString(display, partwin[i], fontgc, 2, 13, "part", 4);
--    }
--    if ((current_image == ADJ) && (current_inc == i)) {
--      fill_button(adjwin[i]);
--      XDrawString(display, adjwin[i], blackfontgc, 2, 13, "adj", 3);
--    } else {
--      XClearWindow(display, adjwin[i]);
--      XDrawString(display, adjwin[i], fontgc, 2, 13, "adj", 3);
--    }
--    if ((current_image == VORO) && (current_inc == i)) {
--      fill_button(voronoiwin[i]);
--      XDrawString(display, voronoiwin[i], blackfontgc, 2, 13, "voro", 4);
--    } else {
--      XClearWindow(display, voronoiwin[i]);
--      XDrawString(display, voronoiwin[i], fontgc, 2, 13, "voro", 4);
--    }
--  }
--
--  XClearWindow(display, versionpluswin);
--  sprintf(numberstring, "%d", loweriteration + 1);
--  sprintf(buttonstring, "%-4.4s+", numberstring);
--  XDrawString(display, versionpluswin, fontgc, 2, 13, buttonstring, 5);
--  XClearWindow(display, versionminuswin);
--  sprintf(numberstring, "%d", loweriteration);
--  if (loweriteration == 0) {
--    sprintf(buttonstring, "%-4.4s", numberstring);
--  } else {
--    sprintf(buttonstring, "%-4.4s-", numberstring);
--  }
--  XDrawString(display, versionminuswin, fontgc, 2, 13, buttonstring, 5);
--
--  XClearWindow(display, quitwin);
--  XDrawString(display, quitwin, fontgc, 2, 13, "Quit", 4);
--  XClearWindow(display, leftwin);
--  XDrawString(display, leftwin, fontgc, 2, 13, "<", 1);
--  XClearWindow(display, rightwin);
--  XDrawString(display, rightwin, fontgc, 2, 13, ">", 1);
--  XClearWindow(display, upwin);
--  XDrawString(display, upwin, fontgc, 2, 13, "^", 1);
--  XClearWindow(display, downwin);
--  XDrawString(display, downwin, fontgc, 2, 13, "v", 1);
--  XClearWindow(display, resetwin);
--  XDrawString(display, resetwin, fontgc, 2, 13, "Reset", 6);
--  XClearWindow(display, widthpluswin);
--  if (line_width < 100) {
--    XDrawString(display, widthpluswin, fontgc, 2, 13, "Width+", 6);
--  } else {
--    XDrawString(display, widthpluswin, fontgc, 2, 13, "Width ", 6);
--  }
--  XClearWindow(display, widthminuswin);
--  if (line_width > 1) {
--    XDrawString(display, widthminuswin, fontgc, 2, 13, "-", 1);
--  }
--  XClearWindow(display, expwin);
--  XClearWindow(display, exppluswin);
--  XClearWindow(display, expminuswin);
--  XClearWindow(display, fillwin);
--  if (current_image == PART) {
--    if (explode) {
--      fill_button(expwin);
--      XDrawString(display, expwin, blackfontgc, 2, 13, "Exp", 3);
--    } else {
--      XDrawString(display, expwin, fontgc, 2, 13, "Exp", 3);
--    }
--    XDrawString(display, exppluswin, fontgc, 2, 13, "+", 1);
--    XDrawString(display, expminuswin, fontgc, 2, 13, "-", 1);
--    if (fillelem) {
--      fill_button(fillwin);
--      XDrawString(display, fillwin, blackfontgc, 2, 13, "Fill", 4);
--    } else {
--      XDrawString(display, fillwin, fontgc, 2, 13, "Fill", 4);
--    }
--  }
--  XClearWindow(display, pswin);
--  XDrawString(display, pswin, fontgc, 2, 13, "PS", 2);
--  XClearWindow(display, epswin);
--  XDrawString(display, epswin, fontgc, 2, 13, "EPS", 3);
--}
--
--void showme_window(argc, argv)
--int argc;
--char **argv;
--{
--  XSetWindowAttributes attr;
--  XSizeHints hints;
--  XGCValues fontvalues, linevalues;
--  XColor alloc_color, exact_color;
--  int i;
--
--  display = XOpenDisplay((char *) NULL);
--  if (!display) {
--    printf("Error:  Cannot open display.\n");
--    exit(1);
--  }
--  screen = DefaultScreen(display);
--  rootwindow = DefaultRootWindow(display);
--  black = BlackPixel(display, screen);
--  white = WhitePixel(display, screen);
--  windowdepth = DefaultDepth(display, screen);
--  rootmap = DefaultColormap(display, screen);
--  width = STARTWIDTH;
--  height = STARTHEIGHT;
--  attr.background_pixel = black;
--  attr.border_pixel = white;
--  attr.backing_store = NotUseful;
--  attr.event_mask = ExposureMask | ButtonReleaseMask | ButtonPressMask |
--                    StructureNotifyMask;
--  attr.bit_gravity = NorthWestGravity;
--  attr.win_gravity = NorthWestGravity;
--  attr.save_under = False;
--  mainwindow = XCreateWindow(display, rootwindow, 0, 0, width,
--                             height + PANELHEIGHT, 3, 0,
--                             InputOutput, CopyFromParent,
--                             CWBackPixel | CWBorderPixel | CWEventMask |
--                             CWBitGravity | CWWinGravity | CWBackingStore |
--                             CWSaveUnder, &attr);
--  hints.width = width;
--  hints.height = height + PANELHEIGHT;
--  hints.min_width = MINWIDTH;
--  hints.min_height = MINHEIGHT + PANELHEIGHT;
--  hints.width_inc = 1;
--  hints.height_inc = 1;
--  hints.flags = PMinSize | PSize | PResizeInc;
--  XSetStandardProperties(display, mainwindow, "Show Me", "showme", None,
--                         argv, argc, &hints);
--
--  static const unsigned char temp_show_me_achimedes_local[18] = {'s','h','o','w','m','e','\0','A','r','c','h','i','m','e','d','e','s','\0'};
--  XChangeProperty(display, mainwindow, XA_WM_CLASS, XA_STRING, 8,
--                  PropModeReplace, temp_show_me_achimedes_local, 18U);
--  XClearWindow(display, mainwindow);
--  XMapWindow(display, mainwindow);
--  if ((windowdepth > 1) &&
--      XAllocNamedColor(display, rootmap, "yellow", &alloc_color,
--                       &exact_color)) {
--    color = 1;
--    explode = bw_ps;
--    fontvalues.foreground = alloc_color.pixel;
--    linevalues.foreground = alloc_color.pixel;
--    showme_foreground = alloc_color.pixel;
--    for (i = 0; i < 64; i++) {
--      if (XAllocNamedColor(display, rootmap, colorname[i], &alloc_color,
--                           &rgb[i])) {
--        colors[i] = alloc_color.pixel;
--      } else {
--        colors[i] = white;
--        rgb[i].red = alloc_color.red;
--        rgb[i].green = alloc_color.green;
--        rgb[i].blue = alloc_color.blue;
--        if (!quiet) {
--          printf("Warning:  I could not allocate %s.\n", colorname[i]);
--        }
--      }
--    }
--  } else {
--    color = 0;
--    fillelem = 0;
--    explode = 1;
--    fontvalues.foreground = white;
--    linevalues.foreground = white;
--    showme_foreground = white;
--  }
--  font = XLoadQueryFont(display, "9x15");
--  fontvalues.background = black;
--  fontvalues.font = font->fid;
--  fontvalues.fill_style = FillSolid;
--  fontvalues.line_width = 2;
--  fontgc = XCreateGC(display, rootwindow, GCForeground | GCBackground |
--                      GCFont | GCLineWidth | GCFillStyle, &fontvalues);
--  fontvalues.foreground = black;
--  blackfontgc = XCreateGC(display, rootwindow, GCForeground | GCBackground |
--                         GCFont | GCLineWidth | GCFillStyle, &fontvalues);
--  linevalues.background = black;
--  linevalues.line_width = line_width;
--  linevalues.cap_style = CapRound;
--  linevalues.join_style = JoinRound;
--  linevalues.fill_style = FillSolid;
--  linegc = XCreateGC(display, rootwindow, GCForeground | GCBackground |
--                     GCLineWidth | GCCapStyle | GCJoinStyle | GCFillStyle,
--                     &linevalues);
--  trianglegc = XCreateGC(display, rootwindow, GCForeground | GCBackground |
--                         GCLineWidth | GCCapStyle | GCJoinStyle | GCFillStyle,
--                         &linevalues);
--  make_buttons(height);
--  XFlush(display);
--}
--
--void draw_node(nodes, dim, ptr, xscale, yscale, xoffset, yoffset)
--int nodes;
--int dim;
--REAL *ptr;
--REAL xscale;
--REAL yscale;
--REAL xoffset;
--REAL yoffset;
--{
--  int i;
--  int index;
--
--  index = dim;
--  for (i = 1; i <= nodes; i++) {
--    XFillRectangle(display, mainwindow, linegc,
--                   (int) (ptr[index] * xscale + xoffset) - (line_width >> 1),
--                   (int) (ptr[index + 1] * yscale + yoffset) -
--                         (line_width >> 1), line_width, line_width);
--    index += dim;
--  }
--}
--
--void draw_poly(nodes, dim, edges, holes, nodeptr, edgeptr, holeptr,
--               xscale, yscale, xoffset, yoffset)
--int nodes;
--int dim;
--int edges;
--int holes;
--REAL *nodeptr;
--int *edgeptr;
--REAL *holeptr;
--REAL xscale;
--REAL yscale;
--REAL xoffset;
--REAL yoffset;
--{
--  int i;
--  int index;
--  REAL *point1, *point2;
--  int x1, y1, x2, y2;
--
--  index = dim;
--  for (i = 1; i <= nodes; i++) {
--    XFillRectangle(display, mainwindow, linegc,
--                   (int) (nodeptr[index] * xscale + xoffset) -
--                         (line_width >> 1),
--                   (int) (nodeptr[index + 1] * yscale + yoffset) -
--                         (line_width >> 1), line_width, line_width);
--    index += dim;
--  }
--  index = 2;
--  for (i = 1; i <= edges; i++) {
--    point1 = &nodeptr[edgeptr[index++] * dim];
--    point2 = &nodeptr[edgeptr[index++] * dim];
--    XDrawLine(display, mainwindow, linegc,
--              (int) (point1[0] * xscale + xoffset),
--              (int) (point1[1] * yscale + yoffset),
--              (int) (point2[0] * xscale + xoffset),
--              (int) (point2[1] * yscale + yoffset));
--  }
--  index = dim;
--  if (color) {
--    XSetForeground(display, linegc, colors[0]);
--  }
--  for (i = 1; i <= holes; i++) {
--    x1 = (int) (holeptr[index] * xscale + xoffset) - 3;
--    y1 = (int) (holeptr[index + 1] * yscale + yoffset) - 3;
--    x2 = x1 + 6;
--    y2 = y1 + 6;
--    XDrawLine(display, mainwindow, linegc, x1, y1, x2, y2);
--    XDrawLine(display, mainwindow, linegc, x1, y2, x2, y1);
--    index += dim;
--  }
--  XSetForeground(display, linegc, showme_foreground);
--}
--
--void draw_ele(inc, elems, corners, ptr, partition, shift,
--              xscale, yscale, xoffset, yoffset)
--int inc;
--int elems;
--int corners; /* unused */
--int *ptr;
--int *partition;
--REAL *shift;
--REAL xscale;
--REAL yscale;
--REAL xoffset;
--REAL yoffset;
--{
--  int i, j;
--  int index;
--  REAL shiftx = 0.0, shifty = 0.0;
--  REAL *prevpoint, *nowpoint;
--  XPoint *vertices = (XPoint *) NULL;
--
--  if (color && fillelem && (partition != (int *) NULL)) {
--    vertices = (XPoint *) malloc(3 * sizeof(XPoint));
--    if (vertices == (XPoint *) NULL) {
--      printf("Error:  Out of memory.\n");
--      exit(1);
--    }
--  }
--  index = 3;
--  for (i = 1; i <= elems; i++) {
--    if ((partition != (int *) NULL) && explode) {
--      shiftx = shift[partition[i] << 1];
--      shifty = shift[(partition[i] << 1) + 1];
--    }
--    if (color && (partition != (int *) NULL)) {
--      if (fillelem) {
--        XSetForeground(display, trianglegc, colors[partition[i] & 63]);
--      } else {
--        XSetForeground(display, linegc, colors[partition[i] & 63]);
--      }
--    }
--    if (color && fillelem && (partition != (int *) NULL)) {
--      if ((partition != (int *) NULL) && explode) {
--        for (j = 0; j < 3; j++) {
--          nowpoint = &nodeptr[inc][ptr[index + j] * node_dim[inc]];
--          vertices[j].x = (nowpoint[0] + shiftx) * xscale + xoffset;
--          vertices[j].y = (nowpoint[1] + shifty) * yscale + yoffset;
--        }
--      } else {
--        for (j = 0; j < 3; j++) {
--          nowpoint = &nodeptr[inc][ptr[index + j] * node_dim[inc]];
--          vertices[j].x = nowpoint[0] * xscale + xoffset;
--          vertices[j].y = nowpoint[1] * yscale + yoffset;
--        }
--      }
--      XFillPolygon(display, mainwindow, trianglegc, vertices, 3,
--                   Convex, CoordModeOrigin);
--    }
--    prevpoint = &nodeptr[inc][ptr[index + 2] * node_dim[inc]];
--    if ((partition != (int *) NULL) && explode) {
--      for (j = 0; j < 3; j++) {
--        nowpoint = &nodeptr[inc][ptr[index++] * node_dim[inc]];
--        XDrawLine(display, mainwindow, linegc,
--                  (int) ((prevpoint[0] + shiftx) * xscale + xoffset),
--                  (int) ((prevpoint[1] + shifty) * yscale + yoffset),
--                  (int) ((nowpoint[0] + shiftx) * xscale + xoffset),
--                  (int) ((nowpoint[1] + shifty) * yscale + yoffset));
--        prevpoint = nowpoint;
--      }
--    } else {
--      for (j = 0; j < 3; j++) {
--        nowpoint = &nodeptr[inc][ptr[index++] * node_dim[inc]];
--        XDrawLine(display, mainwindow, linegc,
--                  (int) (prevpoint[0] * xscale + xoffset),
--                  (int) (prevpoint[1] * yscale + yoffset),
--                  (int) (nowpoint[0] * xscale + xoffset),
--                  (int) (nowpoint[1] * yscale + yoffset));
--        prevpoint = nowpoint;
--      }
--    }
--  }
--  if (color && fillelem && (partition != (int *) NULL)) {
--    free(vertices);
--  }
--  XSetForeground(display, linegc, showme_foreground);
--}
--
--void draw_edge(nodes, dim, edges, nodeptr, edgeptr, normptr,
--               xscale, yscale, xoffset, yoffset)
--int nodes; /* unused */
--int dim;
--int edges;
--REAL *nodeptr;
--int *edgeptr;
--REAL *normptr;
--REAL xscale;
--REAL yscale;
--REAL xoffset;
--REAL yoffset;
--{
--  int i;
--  int index;
--  REAL *point1, *point2;
--  REAL normx, normy;
--  REAL normmult, normmultx, normmulty;
--  REAL windowxmin, windowymin, windowxmax, windowymax;
--
--  index = 2;
--  for (i = 1; i <= edges; i++) {
--    point1 = &nodeptr[edgeptr[index++] * dim];
--    if (edgeptr[index] == -1) {
--      normx = normptr[index - 1];
--      normy = normptr[index++];
--      normmultx = 0.0;
--      if (normx > 0) {
--        windowxmax = (width - 1 - xoffset) / xscale;
--        normmultx = (windowxmax - point1[0]) / normx;
--      } else if (normx < 0) {
--        windowxmin = -xoffset / xscale;
--        normmultx = (windowxmin - point1[0]) / normx;
--      }
--      normmulty = 0.0;
--      if (normy > 0) {
--        windowymax = -yoffset / yscale;
--        normmulty = (windowymax - point1[1]) / normy;
--      } else if (normy < 0) {
--        windowymin = (height - 1 - yoffset) / yscale;
--        normmulty = (windowymin - point1[1]) / normy;
--      }
--      if (normmultx == 0.0) {
--        normmult = normmulty;
--      } else if (normmulty == 0.0) {
--        normmult = normmultx;
--      } else if (normmultx < normmulty) {
--        normmult = normmultx;
--      } else {
--        normmult = normmulty;
--      }
--      if (normmult > 0.0) {
--        XDrawLine(display, mainwindow, linegc,
--                  (int) (point1[0] * xscale + xoffset),
--                  (int) (point1[1] * yscale + yoffset),
--                  (int) ((point1[0] + normmult * normx) * xscale + xoffset),
--                  (int) ((point1[1] + normmult * normy) * yscale + yoffset));
--      }
--    } else {
--      point2 = &nodeptr[edgeptr[index++] * dim];
--      XDrawLine(display, mainwindow, linegc,
--                (int) (point1[0] * xscale + xoffset),
--                (int) (point1[1] * yscale + yoffset),
--                (int) (point2[0] * xscale + xoffset),
--                (int) (point2[1] * yscale + yoffset));
--    }
--  }
--}
--
--void draw_adj(dim, subdomains, ptr, center, xscale, yscale,
--              xoffset, yoffset)
--int dim;
--int subdomains;
--int *ptr;
--REAL *center;
--REAL xscale;
--REAL yscale;
--REAL xoffset;
--REAL yoffset;
--{
--  int i, j;
--  REAL *point1, *point2;
--
--  for (i = 0; i < subdomains; i++) {
--    for (j = i + 1; j < subdomains; j++) {
--      if (ptr[i * subdomains + j]) {
--        point1 = &center[i * dim];
--        point2 = &center[j * dim];
--        XDrawLine(display, mainwindow, linegc,
--                  (int) (point1[0] * xscale + xoffset),
--                  (int) (point1[1] * yscale + yoffset),
--                  (int) (point2[0] * xscale + xoffset),
--                  (int) (point2[1] * yscale + yoffset));
--      }
--    }
--  }
--  for (i = 0; i < subdomains; i++) {
--    point1 = &center[i * dim];
--    if (color) {
--      XSetForeground(display, linegc, colors[i & 63]);
--    }
--    XFillArc(display, mainwindow, linegc,
--             (int) (point1[0] * xscale + xoffset) - 5 - (line_width >> 1),
--             (int) (point1[1] * yscale + yoffset) - 5 - (line_width >> 1),
--             line_width + 10, line_width + 10, 0, 23040);
--  }
--  XSetForeground(display, linegc, showme_foreground);
--}
--
--void draw(inc, image, xmin, ymin, xmax, ymax)
--int inc;
--int image;
--REAL xmin;
--REAL ymin;
--REAL xmax;
--REAL ymax;
--{
--  draw_buttons();
--  XClearWindow(display, mainwindow);
--  if (image == NOTHING) {
--    return;
--  }
--  if (!loaded[inc][image]) {
--    return;
--  }
--  if ((image == PART) && explode) {
--    xmin += (xmin - partcenter[inc][subdomains[inc] << 1]) * explosion;
--    xmax += (xmax - partcenter[inc][subdomains[inc] << 1]) * explosion;
--    ymin += (ymin - partcenter[inc][(subdomains[inc] << 1) + 1]) * explosion;
--    ymax += (ymax - partcenter[inc][(subdomains[inc] << 1) + 1]) * explosion;
--  }
--  xscale = (REAL) (width - line_width - 4) / (xmax - xmin);
--  yscale = (REAL) (height - line_width - 4) / (ymax - ymin);
--  if (xscale > yscale) {
--    xscale = yscale;
--  } else {
--    yscale = xscale;
--  }
--  xoffset = 0.5 * ((REAL) width - xscale * (xmax - xmin)) -
--            xscale * xmin;
--  yoffset = (REAL) height - 0.5 * ((REAL) height - yscale * (ymax - ymin)) +
--            yscale * ymin;
--  yscale = - yscale;
--  switch(image) {
--    case NODE:
--      draw_node(nodes[inc], node_dim[inc], nodeptr[inc],
--                xscale, yscale, xoffset, yoffset);
--      break;
--    case POLY:
--      if (polynodes[inc] > 0) {
--        draw_poly(polynodes[inc], poly_dim[inc], polyedges[inc],
--                  polyholes[inc], polynodeptr[inc], polyedgeptr[inc],
--                  polyholeptr[inc],
--                  xscale, yscale, xoffset, yoffset);
--      } else {
--        draw_poly(nodes[inc], node_dim[inc], polyedges[inc],
--                  polyholes[inc], nodeptr[inc], polyedgeptr[inc],
--                  polyholeptr[inc],
--                  xscale, yscale, xoffset, yoffset);
--      }
--      break;
--    case ELE:
--      draw_ele(inc, elems[inc], ele_corners[inc], eleptr[inc],
--               (int *) NULL, (REAL *) NULL,
--               xscale, yscale, xoffset, yoffset);
--      break;
--    case EDGE:
--      draw_edge(nodes[inc], node_dim[inc], edges[inc],
--                nodeptr[inc], edgeptr[inc], normptr[inc],
--                xscale, yscale, xoffset, yoffset);
--      break;
--    case PART:
--      draw_ele(inc, elems[inc], ele_corners[inc], eleptr[inc],
--               partpart[inc], partshift[inc],
--               xscale, yscale, xoffset, yoffset);
--      break;
--    case ADJ:
--      draw_adj(node_dim[inc], adjsubdomains[inc], adjptr[inc], partcenter[inc],
--               xscale, yscale, xoffset, yoffset);
--      break;
--    case VORO:
--      if (loaded[inc][NODE]) {
--        draw_node(nodes[inc], node_dim[inc], nodeptr[inc],
--                  xscale, yscale, xoffset, yoffset);
--      }
--      draw_edge(vnodes[inc], vnode_dim[inc], vedges[inc],
--                vnodeptr[inc], vedgeptr[inc], vnormptr[inc],
--                xscale, yscale, xoffset, yoffset);
--      break;
--    default:
--      break;
--  }
--}
--
--void addps(instring, outstring, eps)
--char *instring;
--char *outstring;
--int eps;
--{
--  strcpy(outstring, instring);
--  if (eps) {
--    strcat(outstring, ".eps");
--  } else {
--    strcat(outstring, ".ps");
--  }
--}
--
--int print_head(fname, file, llcornerx, llcornery, eps)
--char *fname;
--FILE **file;
--int llcornerx;
--int llcornery;
--int eps;
--{
--  if (!quiet) {
--    printf("Writing %s\n", fname);
--  }
--  *file = fopen(fname, "w");
--  if (*file == (FILE *) NULL) {
--    printf("  Error:  Could not open %s\n", fname);
--    return 1;
--  }
--  if (eps) {
--    fprintf(*file, "%%!PS-Adobe-2.0 EPSF-2.0\n");
--  } else {
--    fprintf(*file, "%%!PS-Adobe-2.0\n");
--  }
--  fprintf(*file, "%%%%BoundingBox: %d %d %d %d\n", llcornerx, llcornery,
--          612 - llcornerx, 792 - llcornery);
--  fprintf(*file, "%%%%Creator: Show Me\n");
--  fprintf(*file, "%%%%EndComments\n\n");
--  fprintf(*file, "1 setlinecap\n");
--  fprintf(*file, "1 setlinejoin\n");
--  fprintf(*file, "%d setlinewidth\n", line_width);
--  fprintf(*file, "%d %d moveto\n", llcornerx, llcornery);
--  fprintf(*file, "%d %d lineto\n", 612 - llcornerx, llcornery);
--  fprintf(*file, "%d %d lineto\n", 612 - llcornerx, 792 - llcornery);
--  fprintf(*file, "%d %d lineto\n", llcornerx, 792 - llcornery);
--  fprintf(*file, "closepath\nclip\nnewpath\n");
--  return 0;
--}
--
--void print_node(nodefile, nodes, dim, ptr, xscale, yscale,
--                xoffset, yoffset)
--FILE *nodefile;
--int nodes;
--int dim;
--REAL *ptr;
--REAL xscale;
--REAL yscale;
--REAL xoffset;
--REAL yoffset;
--{
--  int i;
--  int index;
--
--  index = dim;
--  for (i = 1; i <= nodes; i++) {
--    fprintf(nodefile, "%d %d %d 0 360 arc\nfill\n",
--            (int) (ptr[index] * xscale + xoffset),
--            (int) (ptr[index + 1] * yscale + yoffset),
--            1 + (line_width >> 1));
--    index += dim;
--  }
--}
--
--void print_poly(polyfile, nodes, dim, edges, holes, nodeptr, edgeptr, holeptr,
--                xscale, yscale, xoffset, yoffset)
--FILE *polyfile;
--int nodes;
--int dim;
--int edges;
--int holes; /* unused */
--REAL *nodeptr;
--int *edgeptr;
--REAL *holeptr; /* unused */
--REAL xscale;
--REAL yscale;
--REAL xoffset;
--REAL yoffset;
--{
--  int i;
--  int index;
--  REAL *point1, *point2;
--
--  index = dim;
--  for (i = 1; i <= nodes; i++) {
--    fprintf(polyfile, "%d %d %d 0 360 arc\nfill\n",
--            (int) (nodeptr[index] * xscale + xoffset),
--            (int) (nodeptr[index + 1] * yscale + yoffset),
--            1 + (line_width >> 1));
--    index += dim;
--  }
--  index = 2;
--  for (i = 1; i <= edges; i++) {
--    point1 = &nodeptr[edgeptr[index++] * dim];
--    point2 = &nodeptr[edgeptr[index++] * dim];
--    fprintf(polyfile, "%d %d moveto\n",
--            (int) (point1[0] * xscale + xoffset),
--            (int) (point1[1] * yscale + yoffset));
--    fprintf(polyfile, "%d %d lineto\nstroke\n",
--            (int) (point2[0] * xscale + xoffset),
--            (int) (point2[1] * yscale + yoffset));
--  }
--}
--
--void print_ele(elefile, nodes, dim, elems, corners, nodeptr, eleptr,
--               partition, shift,
--               xscale, yscale, xoffset, yoffset, llcornerx, llcornery)
--FILE *elefile;
--int nodes; /* unused */
--int dim;
--int elems;
--int corners; /* unused */
--REAL *nodeptr;
--int *eleptr;
--int *partition;
--REAL *shift;
--REAL xscale;
--REAL yscale;
--REAL xoffset;
--REAL yoffset;
--int llcornerx;
--int llcornery;
--{
--  int i, j;
--  int index, colorindex;
--  REAL shiftx, shifty;
--  REAL *nowpoint;
--
--  index = 3;
--  if ((partition != (int *) NULL) && !bw_ps) {
--    fprintf(elefile, "0 0 0 setrgbcolor\n");
--    fprintf(elefile, "%d %d moveto\n", llcornerx, llcornery);
--    fprintf(elefile, "%d %d lineto\n", 612 - llcornerx, llcornery);
--    fprintf(elefile, "%d %d lineto\n", 612 - llcornerx, 792 - llcornery);
--    fprintf(elefile, "%d %d lineto\n", llcornerx, 792 - llcornery);
--    fprintf(elefile, "fill\n");
--  }
--  for (i = 1; i <= elems; i++) {
--    if ((partition != (int *) NULL) && !bw_ps) {
--      colorindex = partition[i] & 63;
--      fprintf(elefile, "%6.3f %6.3f %6.3f setrgbcolor\n",
--              (REAL) rgb[colorindex].red / 65535.0,
--              (REAL) rgb[colorindex].green / 65535.0,
--              (REAL) rgb[colorindex].blue / 65535.0);
--    }
--    nowpoint = &nodeptr[eleptr[index + 2] * dim];
--    if ((partition != (int *) NULL) && (explode || bw_ps)) {
--      shiftx = shift[partition[i] << 1];
--      shifty = shift[(partition[i] << 1) + 1];
--      fprintf(elefile, "%d %d moveto\n",
--              (int) ((nowpoint[0] + shiftx) * xscale + xoffset),
--              (int) ((nowpoint[1] + shifty) * yscale + yoffset));
--      for (j = 0; j < 3; j++) {
--        nowpoint = &nodeptr[eleptr[index++] * dim];
--        fprintf(elefile, "%d %d lineto\n",
--                (int) ((nowpoint[0] + shiftx) * xscale + xoffset),
--                (int) ((nowpoint[1] + shifty) * yscale + yoffset));
--      }
--    } else {
--      fprintf(elefile, "%d %d moveto\n",
--              (int) (nowpoint[0] * xscale + xoffset),
--              (int) (nowpoint[1] * yscale + yoffset));
--      for (j = 0; j < 3; j++) {
--        nowpoint = &nodeptr[eleptr[index++] * dim];
--        fprintf(elefile, "%d %d lineto\n",
--                (int) (nowpoint[0] * xscale + xoffset),
--                (int) (nowpoint[1] * yscale + yoffset));
--      }
--    }
--    if (fillelem && !bw_ps) {
--      fprintf(elefile, "gsave\nfill\ngrestore\n1 1 0 setrgbcolor\n");
--    }
--    fprintf(elefile, "stroke\n");
--  }
--}
--
--void print_edge(edgefile, nodes, dim, edges, nodeptr, edgeptr, normptr,
--                xscale, yscale, xoffset, yoffset, llcornerx, llcornery)
--FILE *edgefile;
--int nodes; /* unused */
--int dim;
--int edges;
--REAL *nodeptr;
--int *edgeptr;
--REAL *normptr;
--REAL xscale;
--REAL yscale;
--REAL xoffset;
--REAL yoffset;
--int llcornerx;
--int llcornery;
--{
--  int i;
--  int index;
--  REAL *point1, *point2;
--  REAL normx, normy;
--  REAL normmult, normmultx, normmulty;
--  REAL windowxmin, windowymin, windowxmax, windowymax;
--
--  index = 2;
--  for (i = 1; i <= edges; i++) {
--    point1 = &nodeptr[edgeptr[index++] * dim];
--    if (edgeptr[index] == -1) {
--      normx = normptr[index - 1];
--      normy = normptr[index++];
--      normmultx = 0.0;
--      if (normx > 0) {
--        windowxmax = ((REAL) (612 - llcornerx) - xoffset) / xscale;
--        normmultx = (windowxmax - point1[0]) / normx;
--      } else if (normx < 0) {
--        windowxmin = ((REAL) llcornerx - xoffset) / xscale;
--        normmultx = (windowxmin - point1[0]) / normx;
--      }
--      normmulty = 0.0;
--      if (normy > 0) {
--        windowymax = ((REAL) (792 - llcornery) - yoffset) / yscale;
--        normmulty = (windowymax - point1[1]) / normy;
--      } else if (normy < 0) {
--        windowymin = ((REAL) llcornery - yoffset) / yscale;
--        normmulty = (windowymin - point1[1]) / normy;
--      }
--      if (normmultx == 0.0) {
--        normmult = normmulty;
--      } else if (normmulty == 0.0) {
--        normmult = normmultx;
--      } else if (normmultx < normmulty) {
--        normmult = normmultx;
--      } else {
--        normmult = normmulty;
--      }
--      if (normmult > 0.0) {
--        fprintf(edgefile, "%d %d moveto\n",
--                (int) (point1[0] * xscale + xoffset),
--                (int) (point1[1] * yscale + yoffset));
--        fprintf(edgefile, "%d %d lineto\nstroke\n",
--                (int) ((point1[0] + normmult * normx) * xscale + xoffset),
--                (int) ((point1[1] + normmult * normy) * yscale + yoffset));
--      }
--    } else {
--      point2 = &nodeptr[edgeptr[index++] * dim];
--      fprintf(edgefile, "%d %d moveto\n",
--              (int) (point1[0] * xscale + xoffset),
--              (int) (point1[1] * yscale + yoffset));
--      fprintf(edgefile, "%d %d lineto\nstroke\n",
--              (int) (point2[0] * xscale + xoffset),
--              (int) (point2[1] * yscale + yoffset));
--    }
--  }
--}
--
--void print_adj(adjfile, dim, subdomains, ptr, center, xscale, yscale,
--               xoffset, yoffset, llcornerx, llcornery)
--FILE *adjfile;
--int dim;
--int subdomains;
--int *ptr;
--REAL *center;
--REAL xscale;
--REAL yscale;
--REAL xoffset;
--REAL yoffset;
--int llcornerx;
--int llcornery;
--{
--  int i, j;
--  REAL *point1, *point2;
--  int colorindex;
--
--  if (!bw_ps) {
--    fprintf(adjfile, "0 0 0 setrgbcolor\n");
--    fprintf(adjfile, "%d %d moveto\n", llcornerx, llcornery);
--    fprintf(adjfile, "%d %d lineto\n", 612 - llcornerx, llcornery);
--    fprintf(adjfile, "%d %d lineto\n", 612 - llcornerx, 792 - llcornery);
--    fprintf(adjfile, "%d %d lineto\n", llcornerx, 792 - llcornery);
--    fprintf(adjfile, "fill\n");
--    fprintf(adjfile, "1 1 0 setrgbcolor\n");
--  }
--  for (i = 0; i < subdomains; i++) {
--    for (j = i + 1; j < subdomains; j++) {
--      if (ptr[i * subdomains + j]) {
--        point1 = &center[i * dim];
--        point2 = &center[j * dim];
--        fprintf(adjfile, "%d %d moveto\n",
--                (int) (point1[0] * xscale + xoffset),
--                (int) (point1[1] * yscale + yoffset));
--        fprintf(adjfile, "%d %d lineto\nstroke\n",
--                (int) (point2[0] * xscale + xoffset),
--                (int) (point2[1] * yscale + yoffset));
--      }
--    }
--  }
--  for (i = 0; i < subdomains; i++) {
--    point1 = &center[i * dim];
--    if (!bw_ps) {
--      colorindex = i & 63;
--      fprintf(adjfile, "%6.3f %6.3f %6.3f setrgbcolor\n",
--              (REAL) rgb[colorindex].red / 65535.0,
--              (REAL) rgb[colorindex].green / 65535.0,
--              (REAL) rgb[colorindex].blue / 65535.0);
--      fprintf(adjfile, "%d %d %d 0 360 arc\nfill\n",
--              (int) (point1[0] * xscale + xoffset),
--              (int) (point1[1] * yscale + yoffset),
--              5 + (line_width >> 1));
--    } else {
--      fprintf(adjfile, "%d %d %d 0 360 arc\nfill\n",
--              (int) (point1[0] * xscale + xoffset),
--              (int) (point1[1] * yscale + yoffset),
--              3 + (line_width >> 1));
--    }
--  }
--}
--
--void print(inc, image, xmin, ymin, xmax, ymax, eps)
--int inc;
--int image;
--REAL xmin;
--REAL ymin;
--REAL xmax;
--REAL ymax;
--int eps;
--{
--  REAL xxscale, yyscale, xxoffset, yyoffset;
--  char psfilename[FILENAMESIZE];
--  int llcornerx, llcornery;
--  FILE *psfile;
--
--  if (image == NOTHING) {
--    return;
--  }
--  if (!loaded[inc][image]) {
--    return;
--  }
--  if ((image == PART) && (explode || bw_ps)) {
--    xmin += (xmin - partcenter[inc][subdomains[inc] << 1]) * explosion;
--    xmax += (xmax - partcenter[inc][subdomains[inc] << 1]) * explosion;
--    ymin += (ymin - partcenter[inc][(subdomains[inc] << 1) + 1]) * explosion;
--    ymax += (ymax - partcenter[inc][(subdomains[inc] << 1) + 1]) * explosion;
--  }
--  xxscale = (460.0 - (REAL) line_width) / (xmax - xmin);
--  yyscale = (640.0 - (REAL) line_width) / (ymax - ymin);
--  if (xxscale > yyscale) {
--    xxscale = yyscale;
--    llcornerx = (604 - (int) (yyscale * (xmax - xmin)) - line_width) >> 1;
--    llcornery = 72;
--  } else {
--    yyscale = xxscale;
--    llcornerx = 72;
--    llcornery = (784 - (int) (xxscale * (ymax - ymin)) - line_width) >> 1;
--  }
--  xxoffset = 0.5 * (612.0 - xxscale * (xmax - xmin)) - xxscale * xmin +
--             (line_width >> 1);
--  yyoffset = 0.5 * (792.0 - yyscale * (ymax - ymin)) - yyscale * ymin +
--             (line_width >> 1);
--  switch(image) {
--    case NODE:
--      addps(nodefilename[inc], psfilename, eps);
--      break;
--    case POLY:
--      addps(polyfilename[inc], psfilename, eps);
--      break;
--    case ELE:
--      addps(elefilename[inc], psfilename, eps);
--      break;
--    case EDGE:
--      addps(edgefilename[inc], psfilename, eps);
--      break;
--    case PART:
--      addps(partfilename[inc], psfilename, eps);
--      break;
--    case ADJ:
--      addps(adjfilename[inc], psfilename, eps);
--      break;
--    case VORO:
--      addps(vedgefilename[inc], psfilename, eps);
--      break;
--    default:
--      break;
--  }
--  if (print_head(psfilename, &psfile, llcornerx, llcornery, eps)) {
--    return;
--  }
--  switch (image) {
--    case NODE:
--      print_node(psfile, nodes[inc], node_dim[inc], nodeptr[inc],
--                 xxscale, yyscale, xxoffset, yyoffset);
--      break;
--    case POLY:
--      if (polynodes[inc] > 0) {
--        print_poly(psfile, polynodes[inc], poly_dim[inc], polyedges[inc],
--                   polyholes[inc], polynodeptr[inc], polyedgeptr[inc],
--                   polyholeptr[inc], xxscale, yyscale, xxoffset, yyoffset);
--      } else {
--        print_poly(psfile, nodes[inc], node_dim[inc], polyedges[inc],
--                   polyholes[inc], nodeptr[inc], polyedgeptr[inc],
--                   polyholeptr[inc], xxscale, yyscale, xxoffset, yyoffset);
--      }
--      break;
--    case ELE:
--      print_ele(psfile, nodes[inc], node_dim[inc], elems[inc],
--                ele_corners[inc], nodeptr[inc], eleptr[inc],
--                (int *) NULL, (REAL *) NULL,
--                xxscale, yyscale, xxoffset, yyoffset, llcornerx, llcornery);
--      break;
--    case EDGE:
--      print_edge(psfile, nodes[inc], node_dim[inc], edges[inc],
--                 nodeptr[inc], edgeptr[inc], normptr[inc],
--                 xxscale, yyscale, xxoffset, yyoffset, llcornerx, llcornery);
--      break;
--    case PART:
--      print_ele(psfile, nodes[inc], node_dim[inc], elems[inc],
--                ele_corners[inc], nodeptr[inc], eleptr[inc],
--                partpart[inc], partshift[inc],
--                xxscale, yyscale, xxoffset, yyoffset, llcornerx, llcornery);
--      break;
--    case ADJ:
--      print_adj(psfile, node_dim[inc], adjsubdomains[inc], adjptr[inc],
--                partcenter[inc],
--                xxscale, yyscale, xxoffset, yyoffset, llcornerx, llcornery);
--      break;
--    case VORO:
--      print_edge(psfile, vnodes[inc], vnode_dim[inc], vedges[inc],
--                 vnodeptr[inc], vedgeptr[inc], vnormptr[inc],
--                 xxscale, yyscale, xxoffset, yyoffset, llcornerx, llcornery);
--      break;
--    default:
--      break;
--  }
--  if (!eps) {
--    fprintf(psfile, "showpage\n");
--  }
--  fclose(psfile);
--}
--
--int main(argc, argv)
--int argc;
--char **argv;
--{
--  REAL xmin = 0.0, ymin = 0.0, xmax = 0.0, ymax = 0.0;
--  REAL xptr, yptr, xspan, yspan;
--  int past_image;
--  int new_image = 0;
--  int new_inc = 0;
--
--  parsecommandline(argc, argv);
--  showme_init();
--  choose_image(start_inc, start_image);
--  showme_window(argc, argv);
--
--  if (current_image != NOTHING) {
--    xmin = xlo[current_inc][current_image];
--    ymin = ylo[current_inc][current_image];
--    xmax = xhi[current_inc][current_image];
--    ymax = yhi[current_inc][current_image];
--    zoom = 0;
--  }
--
--  XMaskEvent(display, ExposureMask, &event);
--  while (1) {
--    switch (event.type) {
--      case ButtonRelease:
--        if (event.xany.window == quitwin) {
--          XDestroyWindow(display, mainwindow);
--          XCloseDisplay(display);
--          return 0;
--        } else if (event.xany.window == leftwin) {
--          xspan = 0.25 * (xmax - xmin);
--          xmin += xspan;
--          xmax += xspan;
--          draw(current_inc, current_image, xmin, ymin, xmax, ymax);
--        } else if (event.xany.window == rightwin) {
--          xspan = 0.25 * (xmax - xmin);
--          xmin -= xspan;
--          xmax -= xspan;
--          draw(current_inc, current_image, xmin, ymin, xmax, ymax);
--        } else if (event.xany.window == upwin) {
--          yspan = 0.25 * (ymax - ymin);
--          ymin -= yspan;
--          ymax -= yspan;
--          draw(current_inc, current_image, xmin, ymin, xmax, ymax);
--        } else if (event.xany.window == downwin) {
--          yspan = 0.25 * (ymax - ymin);
--          ymin += yspan;
--          ymax += yspan;
--          draw(current_inc, current_image, xmin, ymin, xmax, ymax);
--        } else if (event.xany.window == resetwin) {
--          xmin = xlo[current_inc][current_image];
--          ymin = ylo[current_inc][current_image];
--          xmax = xhi[current_inc][current_image];
--          ymax = yhi[current_inc][current_image];
--          zoom = 0;
--          draw(current_inc, current_image, xmin, ymin, xmax, ymax);
--        } else if (event.xany.window == widthpluswin) {
--          if (line_width < 100) {
--            line_width++;
--            XSetLineAttributes(display, linegc, line_width, LineSolid,
--                               CapRound, JoinRound);
--            XSetLineAttributes(display, trianglegc, line_width, LineSolid,
--                               CapRound, JoinRound);
--            draw(current_inc, current_image, xmin, ymin, xmax, ymax);
--          }
--        } else if (event.xany.window == widthminuswin) {
--          if (line_width > 1) {
--            line_width--;
--            XSetLineAttributes(display, linegc, line_width, LineSolid,
--                               CapRound, JoinRound);
--            XSetLineAttributes(display, trianglegc, line_width, LineSolid,
--                               CapRound, JoinRound);
--            draw(current_inc, current_image, xmin, ymin, xmax, ymax);
--          }
--        } else if (event.xany.window == expwin) {
--          if ((current_image == PART) && loaded[current_inc][PART]) {
--            explode = !explode;
--            draw(current_inc, current_image, xmin, ymin, xmax, ymax);
--          }
--        } else if (event.xany.window == exppluswin) {
--          if ((current_image == PART) && loaded[current_inc][PART] && explode) {
--            explosion += 0.125;
--            findpartshift(subdomains[current_inc], explosion,
--                          partcenter[current_inc], partshift[current_inc]);
--            draw(current_inc, current_image, xmin, ymin, xmax, ymax);
--          }
--        } else if (event.xany.window == expminuswin) {
--          if ((current_image == PART) && loaded[current_inc][PART] && explode &&
--              (explosion >= 0.125)) {
--            explosion -= 0.125;
--            findpartshift(subdomains[current_inc], explosion,
--                          partcenter[current_inc], partshift[current_inc]);
--            draw(current_inc, current_image, xmin, ymin, xmax, ymax);
--          }
--        } else if (event.xany.window == fillwin) {
--          if ((current_image == PART) && loaded[current_inc][PART]) {
--            fillelem = !fillelem;
--            draw(current_inc, current_image, xmin, ymin, xmax, ymax);
--          }
--        } else if (event.xany.window == pswin) {
--          fill_button(pswin);
--          XFlush(display);
--          print(current_inc, current_image, xmin, ymin, xmax, ymax, 0);
--          XClearWindow(display, pswin);
--          XDrawString(display, pswin, fontgc, 2, 13, "PS", 2);
--        } else if (event.xany.window == epswin) {
--          fill_button(epswin);
--          XFlush(display);
--          print(current_inc, current_image, xmin, ymin, xmax, ymax, 1);
--          XClearWindow(display, epswin);
--          XDrawString(display, epswin, fontgc, 2, 13, "EPS", 3);
--        } else if (event.xany.window == versionpluswin) {
--          move_inc(1);
--          loweriteration++;
--          set_filenames(filename, loweriteration);
--          if (current_inc == 1) {
--            current_inc = 0;
--          } else {
--            current_image = NOTHING;
--            XClearWindow(display, mainwindow);
--          }
--          draw_buttons();
--        } else if (event.xany.window == versionminuswin) {
--          if (loweriteration > 0) {
--            move_inc(0);
--            loweriteration--;
--            set_filenames(filename, loweriteration);
--            if (current_inc == 0) {
--              current_inc = 1;
--            } else {
--              current_image = NOTHING;
--              XClearWindow(display, mainwindow);
--            }
--            draw_buttons();
--          }
--        } else if ((event.xany.window == nodewin[0]) ||
--                   (event.xany.window == polywin[0]) ||
--                   (event.xany.window == elewin[0]) ||
--                   (event.xany.window == edgewin[0]) ||
--                   (event.xany.window == partwin[0]) ||
--                   (event.xany.window == adjwin[0]) ||
--                   (event.xany.window == voronoiwin[0]) ||
--                   (event.xany.window == nodewin[1]) ||
--                   (event.xany.window == polywin[1]) ||
--                   (event.xany.window == elewin[1]) ||
--                   (event.xany.window == edgewin[1]) ||
--                   (event.xany.window == partwin[1]) ||
--                   (event.xany.window == adjwin[1]) ||
--                   (event.xany.window == voronoiwin[1])) {
--          if (event.xany.window == nodewin[0]) {
--            new_inc = 0;
--            new_image = NODE;
--          }
--          if (event.xany.window == polywin[0]) {
--            new_inc = 0;
--            new_image = POLY;
--          }
--          if (event.xany.window == elewin[0]) {
--            new_inc = 0;
--            new_image = ELE;
--          }
--          if (event.xany.window == edgewin[0]) {
--            new_inc = 0;
--            new_image = EDGE;
--          }
--          if (event.xany.window == partwin[0]) {
--            new_inc = 0;
--            new_image = PART;
--          }
--          if (event.xany.window == adjwin[0]) {
--            new_inc = 0;
--            new_image = ADJ;
--          }
--          if (event.xany.window == voronoiwin[0]) {
--            new_inc = 0;
--            new_image = VORO;
--          }
--          if (event.xany.window == nodewin[1]) {
--            new_inc = 1;
--            new_image = NODE;
--          }
--          if (event.xany.window == polywin[1]) {
--            new_inc = 1;
--            new_image = POLY;
--          }
--          if (event.xany.window == elewin[1]) {
--            new_inc = 1;
--            new_image = ELE;
--          }
--          if (event.xany.window == edgewin[1]) {
--            new_inc = 1;
--            new_image = EDGE;
--          }
--          if (event.xany.window == partwin[1]) {
--            new_inc = 1;
--            new_image = PART;
--          }
--          if (event.xany.window == adjwin[1]) {
--            new_inc = 1;
--            new_image = ADJ;
--          }
--          if (event.xany.window == voronoiwin[1]) {
--            new_inc = 1;
--            new_image = VORO;
--          }
--          past_image = current_image;
--          if ((current_inc == new_inc) && (current_image == new_image)) {
--            free_inc(new_inc);
--            unload_inc(new_inc);
--          }
--          choose_image(new_inc, new_image);
--          if ((past_image == NOTHING) && (current_image != NOTHING)) {
--            xmin = xlo[current_inc][current_image];
--            ymin = ylo[current_inc][current_image];
--            xmax = xhi[current_inc][current_image];
--            ymax = yhi[current_inc][current_image];
--            zoom = 0;
--          }
--          draw(current_inc, current_image, xmin, ymin, xmax, ymax);
--        } else {
--          xptr = ((REAL) event.xbutton.x - xoffset) / xscale;
--          yptr = ((REAL) event.xbutton.y - yoffset) / yscale;
--          if ((current_image == PART) && loaded[current_inc][PART] && explode) {
--            xptr = (xptr + partcenter[current_inc]
--                                     [subdomains[current_inc] << 1]
--                    * explosion) / (1.0 + explosion);
--            yptr = (yptr + partcenter[current_inc]
--                                     [(subdomains[current_inc] << 1) + 1]
--                    * explosion) / (1.0 + explosion);
--          }
--          if ((event.xbutton.button == Button1)
--              || (event.xbutton.button == Button3)) {
--            if (event.xbutton.button == Button1) {
--              xspan = 0.25 * (xmax - xmin);
--              yspan = 0.25 * (ymax - ymin);
--              zoom++;
--            } else {
--              xspan = xmax - xmin;
--              yspan = ymax - ymin;
--              zoom--;
--            }
--            xmin = xptr - xspan;
--            ymin = yptr - yspan;
--            xmax = xptr + xspan;
--            ymax = yptr + yspan;
--            draw(current_inc, current_image, xmin, ymin, xmax, ymax);
--          } else if (event.xbutton.button == Button2) {
--            printf("x = %.4g, y = %.4g\n", xptr, yptr);
--          }
--        }
--        break;
--      case DestroyNotify:
--        XDestroyWindow(display, mainwindow);
--        XCloseDisplay(display);
--        return 0;
--      case ConfigureNotify:
--        if ((width != event.xconfigure.width) ||
--            (height != event.xconfigure.height - PANELHEIGHT)) {
--          width = event.xconfigure.width;
--          height = event.xconfigure.height - PANELHEIGHT;
--          draw(current_inc, current_image, xmin, ymin, xmax, ymax);
--          while (XCheckMaskEvent(display, ExposureMask, &event));
--        }
--        break;
--      case Expose:
--        draw(current_inc, current_image, xmin, ymin, xmax, ymax);
--        while (XCheckMaskEvent(display, ExposureMask, &event));
--        break;
--      default:
--        break;
--    }
--    XNextEvent(display, &event);
--  }
--}
-diff --git a/v3p/netlib/tests/CMakeLists.txt b/v3p/netlib/tests/CMakeLists.txt
-index d23be0c165..a7471ffdf2 100644
---- a/v3p/netlib/tests/CMakeLists.txt
-+++ b/v3p/netlib/tests/CMakeLists.txt
-@@ -24,10 +24,6 @@ if(BUILD_TESTING)
-   add_test( NAME netlib_test_slamch COMMAND netlib_slamch_test )
-   target_link_libraries(netlib_slamch_test ${VXL_LIB_PREFIX}v3p_netlib)
-   # test
--  add_executable( netlib_tricall tricall.c )
--  add_test( NAME netlib_test_tricall COMMAND netlib_tricall )
--  target_link_libraries(netlib_tricall ${VXL_LIB_PREFIX}netlib)
--  # test
-   add_executable( netlib_integral_test integral-test.c )
-   add_test( NAME netlib_test_integral COMMAND netlib_integral_test )
-   target_link_libraries(netlib_integral_test ${VXL_LIB_PREFIX}v3p_netlib)
-diff --git a/v3p/netlib/triangle.README b/v3p/netlib/triangle.README
-deleted file mode 100644
-index b33ea00948..0000000000
---- a/v3p/netlib/triangle.README
-+++ /dev/null
-@@ -1,198 +0,0 @@
--Triangle
--A Two-Dimensional Quality Mesh Generator and Delaunay Triangulator.
--Version 1.6
--
--Show Me
--A Display Program for Meshes and More.
--Version 1.6
--
--Copyright 1993, 1995, 1997, 1998, 2002, 2005 Jonathan Richard Shewchuk
--2360 Woolsey #H
--Berkeley, California  94705-1927
--Please send bugs and comments to jrs@cs.berkeley.edu
--
--Created as part of the Quake project (tools for earthquake simulation).
--Supported in part by NSF Grant CMS-9318163 and an NSERC 1967 Scholarship.
--There is no warranty whatsoever.  Use at your own risk.
--
--
--Triangle generates exact Delaunay triangulations, constrained Delaunay
--triangulations, conforming Delaunay triangulations, Voronoi diagrams, and
--high-quality triangular meshes.  The latter can be generated with no small
--or large angles, and are thus suitable for finite element analysis.
--Show Me graphically displays the contents of the geometric files used by
--Triangle.  Show Me can also write images in PostScript form.
--
--Information on the algorithms used by Triangle, including complete
--references, can be found in the comments at the beginning of the triangle.c
--source file.  Another listing of these references, with PostScript copies
--of some of the papers, is available from the Web page
--
--    http://www.cs.cmu.edu/~quake/triangle.research.html
--
--------------------------------------------------------------------------------
--
--These programs may be freely redistributed under the condition that the
--copyright notices (including the copy of this notice in the code comments
--and the copyright notice printed when the `-h' switch is selected) are
--not removed, and no compensation is received.  Private, research, and
--institutional use is free.  You may distribute modified versions of this
--code UNDER THE CONDITION THAT THIS CODE AND ANY MODIFICATIONS MADE TO IT
--IN THE SAME FILE REMAIN UNDER COPYRIGHT OF THE ORIGINAL AUTHOR, BOTH
--SOURCE AND OBJECT CODE ARE MADE FREELY AVAILABLE WITHOUT CHARGE, AND
--CLEAR NOTICE IS GIVEN OF THE MODIFICATIONS.  Distribution of this code as
--part of a commercial system is permissible ONLY BY DIRECT ARRANGEMENT
--WITH THE AUTHOR.  (If you are not directly supplying this code to a
--customer, and you are instead telling them how they can obtain it for
--free, then you are not required to make any arrangement with me.)
--
--------------------------------------------------------------------------------
--
--The files included in this distribution are:
--
--  README           The file you're reading now.
--  triangle.c       Complete C source code for Triangle.
--  showme.c         Complete C source code for Show Me.
--  triangle.h       Include file for calling Triangle from another program.
--  tricall.c        Sample program that calls Triangle.
--  makefile         Makefile for compiling Triangle and Show Me.
--  A.poly           A sample input file.
--
--Each of Triangle and Show Me is a single portable C file.  The easiest way
--to compile them is to edit and use the included makefile.  Before
--compiling, read the makefile, which describes your options, and edit it
--accordingly.  You should specify:
--
--  The source and binary directories.
--
--  The C compiler and level of optimization.
--
--  The "correct" directories for include files (especially X include files),
--  if necessary.
--
--  Do you want single precision or double?  (The default is double.)  Do you
--  want to leave out some of Triangle's features to reduce the size of the
--  executable file?  Investigate the SINGLE, REDUCED, and CDT_ONLY symbols.
--
--  If yours is not a Unix system, define the NO_TIMER symbol to remove the
--  Unix-specific timing code.  Also, don't try to compile Show Me; it only
--  works with X Windows.
--
--  If you are compiling on an Intel x86 CPU and using gcc w/Linux or
--  Microsoft C, be sure to define the LINUX or CPU86 (for Microsoft) symbol
--  during compilation so that the exact arithmetic works right.
--
--Once you've done this, type "make" to compile the programs.  Alternatively,
--the files are usually easy to compile without a makefile:
--
--  cc -O -o triangle triangle.c -lm
--  cc -O -o showme showme.c -lX11
--
--On some systems, the C compiler won't be able to find the X include files
--or libraries, and you'll need to specify an include path or library path:
--
--  cc -O -I/usr/local/include -o showme showme.c -L/usr/local/lib -lX11
--
--Some processors, including Intel x86 family and possibly Motorola 68xxx
--family chips, are IEEE conformant but have extended length internal
--floating-point registers that may defeat Triangle's exact arithmetic
--routines by failing to cause enough roundoff error!  Typically, there is a
--way to set these internal registers so that they are rounded off to IEEE
--single or double precision format.  I believe (but I'm not certain) that
--Triangle has the right incantations for x86 chips, if you have gcc running
--under Linux (define the LINUX compiler symbol) or Microsoft C (define the
--CPU86 compiler symbol).
--
--If you have a different processor or operating system, or if I got the
--incantations wrong, you should check your C compiler or system manuals to
--find out how to configure these internal registers to the precision you are
--using.  Otherwise, the exact arithmetic routines won't be exact at all.
--See http://www.cs.cmu.edu/~quake/robust.pc.html for details.  Triangle's
--exact arithmetic hasn't a hope of working on machines like the Cray C90 or
--Y-MP, which are not IEEE conformant and have inaccurate rounding.
--
--Triangle and Show Me have both text and HTML documentation.  The latter is
--illustrated.  Find it on the Web at
--
--  http://www.cs.cmu.edu/~quake/triangle.html
--  http://www.cs.cmu.edu/~quake/showme.html
--
--Complete text instructions are printed by invoking each program with the
--`-h' switch:
--
--  triangle -h
--  showme -h
--
--The instructions are long; you'll probably want to pipe the output to
--`more' or `lpr' or redirect it to a file.
--
--Both programs give a short list of command line options if they are invoked
--without arguments (that is, just type `triangle' or `showme').
--
--Try out Triangle on the enclosed sample file, A.poly:
--
--  triangle -p A
--  showme A.poly &
--
--Triangle will read the Planar Straight Line Graph defined by A.poly, and
--write its constrained Delaunay triangulation to A.1.node and A.1.ele.
--Show Me will display the figure defined by A.poly.  There are two buttons
--marked "ele" in the Show Me window; click on the top one.  This will cause
--Show Me to load and display the triangulation.
--
--For contrast, try running
--
--  triangle -pq A
--
--Now, click on the same "ele" button.  A new triangulation will be loaded;
--this one having no angles smaller than 20 degrees.
--
--To see a Voronoi diagram, try this:
--
--  cp A.poly A.node
--  triangle -v A
--
--Click the "ele" button again.  You will see the Delaunay triangulation of
--the points in A.poly, without the segments.  Now click the top "voro" button.
--You will see the Voronoi diagram corresponding to that Delaunay triangulation.
--Click the "Reset" button to see the full extent of the diagram.
--
--------------------------------------------------------------------------------
--
--If you wish to call Triangle from another program, instructions for doing
--so are contained in the file `triangle.h' (but read Triangle's regular
--instructions first!).  Also look at `tricall.c', which provides an example
--of how to call Triangle.
--
--Type "make trilibrary" to create triangle.o, a callable object file.
--Alternatively, the object file is usually easy to compile without a
--makefile:
--
--  cc -DTRILIBRARY -O -c triangle.c
--
--Type "make distclean" to remove all the object and executable files created
--by make.
--
--------------------------------------------------------------------------------
--
--If you use Triangle, and especially if you use it to accomplish real work,
--I would like very much to hear from you.  A short letter or email (to
--jrs@cs.berkeley.edu) describing how you use Triangle will mean a lot to me.
--The more people I know are using this program, the more easily I can
--justify spending time on improvements and on the three-dimensional
--successor to Triangle, which in turn will benefit you.  Also, I can put you
--on a list to receive email whenever a new version of Triangle is available.
--
--If you use a mesh generated by Triangle or plotted by Show Me in a
--publication, please include an acknowledgment as well.  And please spell
--Triangle with a capital `T'!  If you want to include a citation, use
--`Jonathan Richard Shewchuk, ``Triangle:  Engineering a 2D Quality Mesh
--Generator and Delaunay Triangulator,'' in Applied Computational Geometry:
--Towards Geometric Engineering (Ming C. Lin and Dinesh Manocha, editors),
--volume 1148 of Lecture Notes in Computer Science, pages 203-222,
--Springer-Verlag, Berlin, May 1996.  (From the First ACM Workshop on Applied
--Computational Geometry.)'
--
--
--Jonathan Richard Shewchuk
--July 27, 2005
-diff --git a/v3p/netlib/triangle.c b/v3p/netlib/triangle.c
-deleted file mode 100644
-index 017dbe1fae..0000000000
---- a/v3p/netlib/triangle.c
-+++ /dev/null
-@@ -1,16011 +0,0 @@
--/*****************************************************************************/
--/*                                                                           */
--/*      888888888        ,o,                          / 888                  */
--/*         888    88o88o  "    o8888o  88o8888o o88888o 888  o88888o         */
--/*         888    888    888       88b 888  888 888 888 888 d888  88b        */
--/*         888    888    888  o88^o888 888  888 "88888" 888 8888oo888        */
--/*         888    888    888 C888  888 888  888  /      888 q888             */
--/*         888    888    888  "88o^888 888  888 Cb      888  "88oooo"        */
--/*                                              "8oo8D                       */
--/*                                                                           */
--/*  A Two-Dimensional Quality Mesh Generator and Delaunay Triangulator.      */
--/*  (triangle.c)                                                             */
--/*                                                                           */
--/*  Version 1.6                                                              */
--/*  July 28, 2005                                                            */
--/*                                                                           */
--/*  Copyright 1993, 1995, 1997, 1998, 2002, 2005                             */
--/*  Jonathan Richard Shewchuk                                                */
--/*  2360 Woolsey #H                                                          */
--/*  Berkeley, California  94705-1927                                         */
--/*  jrs@cs.berkeley.edu                                                      */
--/*                                                                           */
--/*  This program may be freely redistributed under the condition that the    */
--/*    copyright notices (including this entire header and the copyright      */
--/*    notice printed when the `-h' switch is selected) are not removed, and  */
--/*    no compensation is received.  Private, research, and institutional     */
--/*    use is free.  You may distribute modified versions of this code UNDER  */
--/*    THE CONDITION THAT THIS CODE AND ANY MODIFICATIONS MADE TO IT IN THE   */
--/*    SAME FILE REMAIN UNDER COPYRIGHT OF THE ORIGINAL AUTHOR, BOTH SOURCE   */
--/*    AND OBJECT CODE ARE MADE FREELY AVAILABLE WITHOUT CHARGE, AND CLEAR    */
--/*    NOTICE IS GIVEN OF THE MODIFICATIONS.  Distribution of this code as    */
--/*    part of a commercial system is permissible ONLY BY DIRECT ARRANGEMENT  */
--/*    WITH THE AUTHOR.  (If you are not directly supplying this code to a    */
--/*    customer, and you are instead telling them how they can obtain it for  */
--/*    free, then you are not required to make any arrangement with me.)      */
--/*                                                                           */
--/*  Hypertext instructions for Triangle are available on the Web at          */
--/*                                                                           */
--/*      http://www.cs.cmu.edu/~quake/triangle.html                           */
--/*                                                                           */
--/*  Disclaimer:  Neither I nor Carnegie Mellon warrant this code in any way  */
--/*    whatsoever.  This code is provided "as-is".  Use at your own risk.     */
--/*                                                                           */
--/*  Some of the references listed below are marked with an asterisk.  [*]    */
--/*    These references are available for downloading from the Web page       */
--/*                                                                           */
--/*      http://www.cs.cmu.edu/~quake/triangle.research.html                  */
--/*                                                                           */
--/*  Three papers discussing aspects of Triangle are available.  A short      */
--/*    overview appears in "Triangle:  Engineering a 2D Quality Mesh          */
--/*    Generator and Delaunay Triangulator," in Applied Computational         */
--/*    Geometry:  Towards Geometric Engineering, Ming C. Lin and Dinesh       */
--/*    Manocha, editors, Lecture Notes in Computer Science volume 1148,       */
--/*    pages 203-222, Springer-Verlag, Berlin, May 1996 (from the First ACM   */
--/*    Workshop on Applied Computational Geometry).  [*]                      */
--/*                                                                           */
--/*    The algorithms are discussed in the greatest detail in "Delaunay       */
--/*    Refinement Algorithms for Triangular Mesh Generation," Computational   */
--/*    Geometry:  Theory and Applications 22(1-3):21-74, May 2002.  [*]       */
--/*                                                                           */
--/*    More detail about the data structures may be found in my dissertation: */
--/*    "Delaunay Refinement Mesh Generation," Ph.D. thesis, Technical Report  */
--/*    CMU-CS-97-137, School of Computer Science, Carnegie Mellon University, */
--/*    Pittsburgh, Pennsylvania, 18 May 1997.  [*]                            */
--/*                                                                           */
--/*  Triangle was created as part of the Quake Project in the School of       */
--/*    Computer Science at Carnegie Mellon University.  For further           */
--/*    information, see Hesheng Bao, Jacobo Bielak, Omar Ghattas, Loukas F.   */
--/*    Kallivokas, David R. O'Hallaron, Jonathan R. Shewchuk, and Jifeng Xu,  */
--/*    "Large-scale Simulation of Elastic Wave Propagation in Heterogeneous   */
--/*    Media on Parallel Computers," Computer Methods in Applied Mechanics    */
--/*    and Engineering 152(1-2):85-102, 22 January 1998.                      */
--/*                                                                           */
--/*  Triangle's Delaunay refinement algorithm for quality mesh generation is  */
--/*    a hybrid of one due to Jim Ruppert, "A Delaunay Refinement Algorithm   */
--/*    for Quality 2-Dimensional Mesh Generation," Journal of Algorithms      */
--/*    18(3):548-585, May 1995 [*], and one due to L. Paul Chew, "Guaranteed- */
--/*    Quality Mesh Generation for Curved Surfaces," Proceedings of the Ninth */
--/*    Annual Symposium on Computational Geometry (San Diego, California),    */
--/*    pages 274-280, Association for Computing Machinery, May 1993,          */
--/*    http://portal.acm.org/citation.cfm?id=161150 .                         */
--/*                                                                           */
--/*  The Delaunay refinement algorithm has been modified so that it meshes    */
--/*    domains with small input angles well, as described in Gary L. Miller,  */
--/*    Steven E. Pav, and Noel J. Walkington, "When and Why Ruppert's         */
--/*    Algorithm Works," Twelfth International Meshing Roundtable, pages      */
--/*    91-102, Sandia National Laboratories, September 2003.  [*]             */
--/*                                                                           */
--/*  My implementation of the divide-and-conquer and incremental Delaunay     */
--/*    triangulation algorithms follows closely the presentation of Guibas    */
--/*    and Stolfi, even though I use a triangle-based data structure instead  */
--/*    of their quad-edge data structure.  (In fact, I originally implemented */
--/*    Triangle using the quad-edge data structure, but the switch to a       */
--/*    triangle-based data structure sped Triangle by a factor of two.)  The  */
--/*    mesh manipulation primitives and the two aforementioned Delaunay       */
--/*    triangulation algorithms are described by Leonidas J. Guibas and Jorge */
--/*    Stolfi, "Primitives for the Manipulation of General Subdivisions and   */
--/*    the Computation of Voronoi Diagrams," ACM Transactions on Graphics     */
--/*    4(2):74-123, April 1985, http://portal.acm.org/citation.cfm?id=282923 .*/
--/*                                                                           */
--/*  Their O(n log n) divide-and-conquer algorithm is adapted from Der-Tsai   */
--/*    Lee and Bruce J. Schachter, "Two Algorithms for Constructing the       */
--/*    Delaunay Triangulation," International Journal of Computer and         */
--/*    Information Science 9(3):219-242, 1980.  Triangle's improvement of the */
--/*    divide-and-conquer algorithm by alternating between vertical and       */
--/*    horizontal cuts was introduced by Rex A. Dwyer, "A Faster Divide-and-  */
--/*    Conquer Algorithm for Constructing Delaunay Triangulations,"           */
--/*    Algorithmica 2(2):137-151, 1987.                                       */
--/*                                                                           */
--/*  The incremental insertion algorithm was first proposed by C. L. Lawson,  */
--/*    "Software for C1 Surface Interpolation," in Mathematical Software III, */
--/*    John R. Rice, editor, Academic Press, New York, pp. 161-194, 1977.     */
--/*    For point location, I use the algorithm of Ernst P. Mucke, Isaac       */
--/*    Saias, and Binhai Zhu, "Fast Randomized Point Location Without         */
--/*    Preprocessing in Two- and Three-Dimensional Delaunay Triangulations,"  */
--/*    Proceedings of the Twelfth Annual Symposium on Computational Geometry, */
--/*    ACM, May 1996.  [*]  If I were to randomize the order of vertex        */
--/*    insertion (I currently don't bother), their result combined with the   */
--/*    result of Kenneth L. Clarkson and Peter W. Shor, "Applications of      */
--/*    Random Sampling in Computational Geometry II," Discrete &              */
--/*    Computational Geometry 4(1):387-421, 1989, would yield an expected     */
--/*    O(n^{4/3}) bound on running time.                                      */
--/*                                                                           */
--/*  The O(n log n) sweepline Delaunay triangulation algorithm is taken from  */
--/*    Steven Fortune, "A Sweepline Algorithm for Voronoi Diagrams",          */
--/*    Algorithmica 2(2):153-174, 1987.  A random sample of edges on the      */
--/*    boundary of the triangulation are maintained in a splay tree for the   */
--/*    purpose of point location.  Splay trees are described by Daniel        */
--/*    Dominic Sleator and Robert Endre Tarjan, "Self-Adjusting Binary Search */
--/*    Trees," Journal of the ACM 32(3):652-686, July 1985,                   */
--/*    http://portal.acm.org/citation.cfm?id=3835 .                           */
--/*                                                                           */
--/*  The algorithms for exact computation of the signs of determinants are    */
--/*    described in Jonathan Richard Shewchuk, "Adaptive Precision Floating-  */
--/*    Point Arithmetic and Fast Robust Geometric Predicates," Discrete &     */
--/*    Computational Geometry 18(3):305-363, October 1997.  (Also available   */
--/*    as Technical Report CMU-CS-96-140, School of Computer Science,         */
--/*    Carnegie Mellon University, Pittsburgh, Pennsylvania, May 1996.)  [*]  */
--/*    An abbreviated version appears as Jonathan Richard Shewchuk, "Robust   */
--/*    Adaptive Floating-Point Geometric Predicates," Proceedings of the      */
--/*    Twelfth Annual Symposium on Computational Geometry, ACM, May 1996. [*] */
--/*    Many of the ideas for my exact arithmetic routines originate with      */
--/*    Douglas M. Priest, "Algorithms for Arbitrary Precision Floating Point  */
--/*    Arithmetic," Tenth Symposium on Computer Arithmetic, pp. 132-143, IEEE */
--/*    Computer Society Press, 1991.  [*]  Many of the ideas for the correct  */
--/*    evaluation of the signs of determinants are taken from Steven Fortune  */
--/*    and Christopher J. Van Wyk, "Efficient Exact Arithmetic for Computa-   */
--/*    tional Geometry," Proceedings of the Ninth Annual Symposium on         */
--/*    Computational Geometry, ACM, pp. 163-172, May 1993, and from Steven    */
--/*    Fortune, "Numerical Stability of Algorithms for 2D Delaunay Triangu-   */
--/*    lations," International Journal of Computational Geometry & Applica-   */
--/*    tions 5(1-2):193-213, March-June 1995.                                 */
--/*                                                                           */
--/*  The method of inserting new vertices off-center (not precisely at the    */
--/*    circumcenter of every poor-quality triangle) is from Alper Ungor,      */
--/*    "Off-centers:  A New Type of Steiner Points for Computing Size-Optimal */
--/*    Quality-Guaranteed Delaunay Triangulations," Proceedings of LATIN      */
--/*    2004 (Buenos Aires, Argentina), April 2004.                            */
--/*                                                                           */
--/*  For definitions of and results involving Delaunay triangulations,        */
--/*    constrained and conforming versions thereof, and other aspects of      */
--/*    triangular mesh generation, see the excellent survey by Marshall Bern  */
--/*    and David Eppstein, "Mesh Generation and Optimal Triangulation," in    */
--/*    Computing and Euclidean Geometry, Ding-Zhu Du and Frank Hwang,         */
--/*    editors, World Scientific, Singapore, pp. 23-90, 1992.  [*]            */
--/*                                                                           */
--/*  The time for incrementally adding PSLG (planar straight line graph)      */
--/*    segments to create a constrained Delaunay triangulation is probably    */
--/*    O(t^2) per segment in the worst case and O(t) per segment in the       */
--/*    common case, where t is the number of triangles that intersect the     */
--/*    segment before it is inserted.  This doesn't count point location,     */
--/*    which can be much more expensive.  I could improve this to O(d log d)  */
--/*    time, but d is usually quite small, so it's not worth the bother.      */
--/*    (This note does not apply when the -s switch is used, invoking a       */
--/*    different method is used to insert segments.)                          */
--/*                                                                           */
--/*  The time for deleting a vertex from a Delaunay triangulation is O(d^2)   */
--/*    in the worst case and O(d) in the common case, where d is the degree   */
--/*    of the vertex being deleted.  I could improve this to O(d log d) time, */
--/*    but d is usually quite small, so it's not worth the bother.            */
--/*                                                                           */
--/*  Ruppert's Delaunay refinement algorithm typically generates triangles    */
--/*    at a linear rate (constant time per triangle) after the initial        */
--/*    triangulation is formed.  There may be pathological cases where        */
--/*    quadratic time is required, but these never arise in practice.         */
--/*                                                                           */
--/*  The geometric predicates (circumcenter calculations, segment             */
--/*    intersection formulae, etc.) appear in my "Lecture Notes on Geometric  */
--/*    Robustness" at http://www.cs.berkeley.edu/~jrs/mesh .                  */
--/*                                                                           */
--/*  If you make any improvements to this code, please please please let me   */
--/*    know, so that I may obtain the improvements.  Even if you don't change */
--/*    the code, I'd still love to hear what it's being used for.             */
--/*                                                                           */
--/*****************************************************************************/
--
--/* For single precision (which will save some memory and reduce paging),     */
--/*   define the symbol SINGLE by using the -DSINGLE compiler switch or by    */
--/*   writing "#define SINGLE" below.                                         */
--/*                                                                           */
--/* For double precision (which will allow you to refine meshes to a smaller  */
--/*   edge length), leave SINGLE undefined.                                   */
--/*                                                                           */
--/* Double precision uses more memory, but improves the resolution of the     */
--/*   meshes you can generate with Triangle.  It also reduces the likelihood  */
--/*   of a floating exception due to overflow.  Finally, it is much faster    */
--/*   than single precision on 64-bit architectures like the DEC Alpha.  I    */
--/*   recommend double precision unless you want to generate a mesh for which */
--/*   you do not have enough memory.                                          */
--
--/* #define SINGLE */
--
--#ifdef SINGLE
--#define REAL float
--#else /* not SINGLE */
--#define REAL double
--#endif /* not SINGLE */
--
--#define TRIANGLE_PTRINT size_t
--
--/* If yours is not a Unix system, define the NO_TIMER compiler switch to     */
--/*   remove the Unix-specific timing code.                                   */
--
--#define NO_TIMER
--
--/* To insert lots of self-checks for internal errors, define the SELF_CHECK  */
--/*   symbol.  This will slow down the program significantly.  It is best to  */
--/*   define the symbol using the -DSELF_CHECK compiler switch, but you could */
--/*   write "#define SELF_CHECK" below.  If you are modifying this code, I    */
--/*   recommend you turn self-checks on until your work is debugged.          */
--
--/* #define SELF_CHECK */
--
--/* To compile Triangle as a callable object library (triangle.o), define the */
--/*   TRILIBRARY symbol.  Read the file triangle.h for details on how to call */
--/*   the procedure triangulate() that results.                               */
--
--#define TRILIBRARY
--
--/* It is possible to generate a smaller version of Triangle using one or     */
--/*   both of the following symbols.  Define the REDUCED symbol to eliminate  */
--/*   all features that are primarily of research interest; specifically, the */
--/*   -i, -F, -s, and -C switches.  Define the CDT_ONLY symbol to eliminate   */
--/*   all meshing algorithms above and beyond constrained Delaunay            */
--/*   triangulation; specifically, the -r, -q, -a, -u, -D, -S, and -s         */
--/*   switches.  These reductions are most likely to be useful when           */
--/*   generating an object library (triangle.o) by defining the TRILIBRARY    */
--/*   symbol.                                                                 */
--
--/* #define REDUCED */
--/* #define CDT_ONLY */
--
--/* On some machines, my exact arithmetic routines might be defeated by the   */
--/*   use of internal extended precision floating-point registers.  The best  */
--/*   way to solve this problem is to set the floating-point registers to use */
--/*   single or double precision internally.  On 80x86 processors, this may   */
--/*   be accomplished by setting the CPU86 symbol for the Microsoft C         */
--/*   compiler, or the LINUX symbol for the gcc compiler running on Linux.    */
--/*                                                                           */
--/* An inferior solution is to declare certain values as `volatile', thus     */
--/*   forcing them to be stored to memory and rounded off.  Unfortunately,    */
--/*   this solution might slow Triangle down quite a bit.  To use volatile    */
--/*   values, write "#define INEXACT volatile" below.  Normally, however,     */
--/*   INEXACT should be defined to be nothing.  ("#define INEXACT".)          */
--/*                                                                           */
--/* For more discussion, see http://www.cs.cmu.edu/~quake/robust.pc.html .    */
--/*   For yet more discussion, see Section 5 of my paper, "Adaptive Precision */
--/*   Floating-Point Arithmetic and Fast Robust Geometric Predicates" (also   */
--/*   available as Section 6.6 of my dissertation).                           */
--
--/* #define CPU86 */
--/* #define LINUX */
--
--#define INEXACT /* Nothing */
--/* #define INEXACT volatile */
--
--/* Maximum number of characters in a file name (including the null).         */
--
--#define FILENAMESIZE 2048
--
--/* Maximum number of characters in a line read from a file (including the    */
--/*   null).                                                                  */
--
--#define INPUTLINESIZE 4096
--
--/* For efficiency, a variety of data structures are allocated in bulk.  The  */
--/*   following constants determine how many of each structure is allocated   */
--/*   at once.                                                                */
--
--#define TRIPERBLOCK 4092           /* Number of triangles allocated at once. */
--#define SUBSEGPERBLOCK 508       /* Number of subsegments allocated at once. */
--#define VERTEXPERBLOCK 4092         /* Number of vertices allocated at once. */
--#define VIRUSPERBLOCK 1020   /* Number of virus triangles allocated at once. */
--/* Number of encroached subsegments allocated at once. */
--#define BADSUBSEGPERBLOCK 252
--/* Number of skinny triangles allocated at once. */
--#define BADTRIPERBLOCK 4092
--/* Number of flipped triangles allocated at once. */
--#define FLIPSTACKERPERBLOCK 252
--/* Number of splay tree nodes allocated at once. */
--#define SPLAYNODEPERBLOCK 508
--
--/* The vertex types.   A DEADVERTEX has been deleted entirely.  An           */
--/*   UNDEADVERTEX is not part of the mesh, but is written to the output      */
--/*   .node file and affects the node indexing in the other output files.     */
--
--#define INPUTVERTEX 0
--#define SEGMENTVERTEX 1
--#define FREEVERTEX 2
--#define DEADVERTEX -32768
--#define UNDEADVERTEX -32767
--
--/* The next line is used to outsmart some very stupid compilers.  If your    */
--/*   compiler is smarter, feel free to replace the "int" with "void".        */
--/*   Not that it matters.                                                    */
--
--/*#define void int */
--
--/* Two constants for algorithms based on random sampling.  Both constants    */
--/*   have been chosen empirically to optimize their respective algorithms.   */
--
--/* Used for the point location scheme of Mucke, Saias, and Zhu, to decide    */
--/*   how large a random sample of triangles to inspect.                      */
--
--#define SAMPLEFACTOR 11
--
--/* Used in Fortune's sweepline Delaunay algorithm to determine what fraction */
--/*   of boundary edges should be maintained in the splay tree for point      */
--/*   location on the front.                                                  */
--
--#define SAMPLERATE 10
--
--/* A number that speaks for itself, every kissable digit.                    */
--
--#define PI 3.141592653589793238462643383279502884197169399375105820974944592308
--
--/* Another fave.                                                             */
--
--#define SQUAREROOTTWO 1.4142135623730950488016887242096980785696718753769480732
--
--/* And here's one for those of you who are intimidated by math.              */
--
--#define ONETHIRD 0.333333333333333333333333333333333333333333333333333333333333
--
--#include <stdio.h>
--#include <stdlib.h>
--#include <string.h>
--#include <math.h>
--#ifndef NO_TIMER
--#include <sys/time.h>
--#endif /* not NO_TIMER */
--#ifdef CPU86
--#include <float.h>
--#endif /* CPU86 */
--#ifdef LINUX
--#include <fpu_control.h>
--#endif /* LINUX */
--#ifdef TRILIBRARY
--#include "triangle.h"
--#endif /* TRILIBRARY */
--
--/* A few forward declarations.                                               */
--
--#ifndef TRILIBRARY
--char *readline();
--char *findfield();
--#endif /* not TRILIBRARY */
--
--/* Labels that signify the result of point location.  The result of a        */
--/*   search indicates that the point falls in the interior of a triangle, on */
--/*   an edge, on a vertex, or outside the mesh.                              */
--
--enum locateresult {INTRIANGLE, ONEDGE, ONVERTEX, OUTSIDE};
--
--/* Labels that signify the result of vertex insertion.  The result indicates */
--/*   that the vertex was inserted with complete success, was inserted but    */
--/*   encroaches upon a subsegment, was not inserted because it lies on a     */
--/*   segment, or was not inserted because another vertex occupies the same   */
--/*   location.                                                               */
--
--enum insertvertexresult {SUCCESSFULVERTEX, ENCROACHINGVERTEX, VIOLATINGVERTEX,
--                         DUPLICATEVERTEX};
--
--/* Labels that signify the result of direction finding.  The result          */
--/*   indicates that a segment connecting the two query points falls within   */
--/*   the direction triangle, along the left edge of the direction triangle,  */
--/*   or along the right edge of the direction triangle.                      */
--
--enum finddirectionresult {WITHIN, LEFTCOLLINEAR, RIGHTCOLLINEAR};
--
--/* Labels that signify the result of the circumcenter computation routine.   */
--/*   The return value indicates which edge of the triangle is shortest.      */
--
--enum circumcenterresult {OPPOSITEORG, OPPOSITEDEST, OPPOSITEAPEX};
--
--/*****************************************************************************/
--/*                                                                           */
--/*  The basic mesh data structures                                           */
--/*                                                                           */
--/*  There are three:  vertices, triangles, and subsegments (abbreviated      */
--/*  `subseg').  These three data structures, linked by pointers, comprise    */
--/*  the mesh.  A vertex simply represents a mesh vertex and its properties.  */
--/*  A triangle is a triangle.  A subsegment is a special data structure used */
--/*  to represent an impenetrable edge of the mesh (perhaps on the outer      */
--/*  boundary, on the boundary of a hole, or part of an internal boundary     */
--/*  separating two triangulated regions).  Subsegments represent boundaries, */
--/*  defined by the user, that triangles may not lie across.                  */
--/*                                                                           */
--/*  A triangle consists of a list of three vertices, a list of three         */
--/*  adjoining triangles, a list of three adjoining subsegments (when         */
--/*  segments exist), an arbitrary number of optional user-defined            */
--/*  floating-point attributes, and an optional area constraint.  The latter  */
--/*  is an upper bound on the permissible area of each triangle in a region,  */
--/*  used for mesh refinement.                                                */
--/*                                                                           */
--/*  For a triangle on a boundary of the mesh, some or all of the neighboring */
--/*  triangles may not be present.  For a triangle in the interior of the     */
--/*  mesh, often no neighboring subsegments are present.  Such absent         */
--/*  triangles and subsegments are never represented by NULL pointers; they   */
--/*  are represented by two special records:  `dummytri', the triangle that   */
--/*  fills "outer space", and `dummysub', the omnipresent subsegment.         */
--/*  `dummytri' and `dummysub' are used for several reasons; for instance,    */
--/*  they can be dereferenced and their contents examined without violating   */
--/*  protected memory.                                                        */
--/*                                                                           */
--/*  However, it is important to understand that a triangle includes other    */
--/*  information as well.  The pointers to adjoining vertices, triangles, and */
--/*  subsegments are ordered in a way that indicates their geometric relation */
--/*  to each other.  Furthermore, each of these pointers contains orientation */
--/*  information.  Each pointer to an adjoining triangle indicates which face */
--/*  of that triangle is contacted.  Similarly, each pointer to an adjoining  */
--/*  subsegment indicates which side of that subsegment is contacted, and how */
--/*  the subsegment is oriented relative to the triangle.                     */
--/*                                                                           */
--/*  The data structure representing a subsegment may be thought to be        */
--/*  abutting the edge of one or two triangle data structures:  either        */
--/*  sandwiched between two triangles, or resting against one triangle on an  */
--/*  exterior boundary or hole boundary.                                      */
--/*                                                                           */
--/*  A subsegment consists of a list of four vertices--the vertices of the    */
--/*  subsegment, and the vertices of the segment it is a part of--a list of   */
--/*  two adjoining subsegments, and a list of two adjoining triangles.  One   */
--/*  of the two adjoining triangles may not be present (though there should   */
--/*  always be one), and neighboring subsegments might not be present.        */
--/*  Subsegments also store a user-defined integer "boundary marker".         */
--/*  Typically, this integer is used to indicate what boundary conditions are */
--/*  to be applied at that location in a finite element simulation.           */
--/*                                                                           */
--/*  Like triangles, subsegments maintain information about the relative      */
--/*  orientation of neighboring objects.                                      */
--/*                                                                           */
--/*  Vertices are relatively simple.  A vertex is a list of floating-point    */
--/*  numbers, starting with the x, and y coordinates, followed by an          */
--/*  arbitrary number of optional user-defined floating-point attributes,     */
--/*  followed by an integer boundary marker.  During the segment insertion    */
--/*  phase, there is also a pointer from each vertex to a triangle that may   */
--/*  contain it.  Each pointer is not always correct, but when one is, it     */
--/*  speeds up segment insertion.  These pointers are assigned values once    */
--/*  at the beginning of the segment insertion phase, and are not used or     */
--/*  updated except during this phase.  Edge flipping during segment          */
--/*  insertion will render some of them incorrect.  Hence, don't rely upon    */
--/*  them for anything.                                                       */
--/*                                                                           */
--/*  Other than the exception mentioned above, vertices have no information   */
--/*  about what triangles, subfacets, or subsegments they are linked to.      */
--/*                                                                           */
--/*****************************************************************************/
--
--/*****************************************************************************/
--/*                                                                           */
--/*  Handles                                                                  */
--/*                                                                           */
--/*  The oriented triangle (`otri') and oriented subsegment (`osub') data     */
--/*  structures defined below do not themselves store any part of the mesh.   */
--/*  The mesh itself is made of `triangle's, `subseg's, and `vertex's.        */
--/*                                                                           */
--/*  Oriented triangles and oriented subsegments will usually be referred to  */
--/*  as "handles."  A handle is essentially a pointer into the mesh; it       */
--/*  allows you to "hold" one particular part of the mesh.  Handles are used  */
--/*  to specify the regions in which one is traversing and modifying the mesh.*/
--/*  A single `triangle' may be held by many handles, or none at all.  (The   */
--/*  latter case is not a memory leak, because the triangle is still          */
--/*  connected to other triangles in the mesh.)                               */
--/*                                                                           */
--/*  An `otri' is a handle that holds a triangle.  It holds a specific edge   */
--/*  of the triangle.  An `osub' is a handle that holds a subsegment.  It     */
--/*  holds either the left or right side of the subsegment.                   */
--/*                                                                           */
--/*  Navigation about the mesh is accomplished through a set of mesh          */
--/*  manipulation primitives, further below.  Many of these primitives take   */
--/*  a handle and produce a new handle that holds the mesh near the first     */
--/*  handle.  Other primitives take two handles and glue the corresponding    */
--/*  parts of the mesh together.  The orientation of the handles is           */
--/*  important.  For instance, when two triangles are glued together by the   */
--/*  bond() primitive, they are glued at the edges on which the handles lie.  */
--/*                                                                           */
--/*  Because vertices have no information about which triangles they are      */
--/*  attached to, I commonly represent a vertex by use of a handle whose      */
--/*  origin is the vertex.  A single handle can simultaneously represent a    */
--/*  triangle, an edge, and a vertex.                                         */
--/*                                                                           */
--/*****************************************************************************/
--
--/* The triangle data structure.  Each triangle contains three pointers to    */
--/*   adjoining triangles, plus three pointers to vertices, plus three        */
--/*   pointers to subsegments (declared below; these pointers are usually     */
--/*   `dummysub').  It may or may not also contain user-defined attributes    */
--/*   and/or a floating-point "area constraint."  It may also contain extra   */
--/*   pointers for nodes, when the user asks for high-order elements.         */
--/*   Because the size and structure of a `triangle' is not decided until     */
--/*   runtime, I haven't simply declared the type `triangle' as a struct.     */
--
--typedef REAL **triangle;            /* Really:  typedef triangle *triangle   */
--
--/* An oriented triangle:  includes a pointer to a triangle and orientation.  */
--/*   The orientation denotes an edge of the triangle.  Hence, there are      */
--/*   three possible orientations.  By convention, each edge always points    */
--/*   counterclockwise about the corresponding triangle.                      */
--
--struct otri {
--  triangle *tri;
--  int orient;                                         /* Ranges from 0 to 2. */
--};
--
--/* The subsegment data structure.  Each subsegment contains two pointers to  */
--/*   adjoining subsegments, plus four pointers to vertices, plus two         */
--/*   pointers to adjoining triangles, plus one boundary marker, plus one     */
--/*   segment number.                                                         */
--
--typedef REAL **subseg;                  /* Really:  typedef subseg *subseg   */
--
--/* An oriented subsegment:  includes a pointer to a subsegment and an        */
--/*   orientation.  The orientation denotes a side of the edge.  Hence, there */
--/*   are two possible orientations.  By convention, the edge is always       */
--/*   directed so that the "side" denoted is the right side of the edge.      */
--
--struct osub {
--  subseg *ss;
--  int ssorient;                                       /* Ranges from 0 to 1. */
--};
--
--/* The vertex data structure.  Each vertex is actually an array of REALs.    */
--/*   The number of REALs is unknown until runtime.  An integer boundary      */
--/*   marker, and sometimes a pointer to a triangle, is appended after the    */
--/*   REALs.                                                                  */
--
--typedef REAL *vertex;
--
--/* A queue used to store encroached subsegments.  Each subsegment's vertices */
--/*   are stored so that we can check whether a subsegment is still the same. */
--
--struct badsubseg {
--  subseg encsubseg;                             /* An encroached subsegment. */
--  vertex subsegorg, subsegdest;                         /* Its two vertices. */
--};
--
--/* A queue used to store bad triangles.  The key is the square of the cosine */
--/*   of the smallest angle of the triangle.  Each triangle's vertices are    */
--/*   stored so that one can check whether a triangle is still the same.      */
--
--struct badtriang {
--  triangle poortri;                       /* A skinny or too-large triangle. */
--  REAL key;                             /* cos^2 of smallest (apical) angle. */
--  vertex triangorg, triangdest, triangapex;           /* Its three vertices. */
--  struct badtriang *nexttriang;             /* Pointer to next bad triangle. */
--};
--
--/* A stack of triangles flipped during the most recent vertex insertion.     */
--/*   The stack is used to undo the vertex insertion if the vertex encroaches */
--/*   upon a subsegment.                                                      */
--
--struct flipstacker {
--  triangle flippedtri;                       /* A recently flipped triangle. */
--  struct flipstacker *prevflip;               /* Previous flip in the stack. */
--};
--
--/* A node in a heap used to store events for the sweepline Delaunay          */
--/*   algorithm.  Nodes do not point directly to their parents or children in */
--/*   the heap.  Instead, each node knows its position in the heap, and can   */
--/*   look up its parent and children in a separate array.  The `eventptr'    */
--/*   points either to a `vertex' or to a triangle (in encoded format, so     */
--/*   that an orientation is included).  In the latter case, the origin of    */
--/*   the oriented triangle is the apex of a "circle event" of the sweepline  */
--/*   algorithm.  To distinguish site events from circle events, all circle   */
--/*   events are given an invalid (smaller than `xmin') x-coordinate `xkey'.  */
--
--struct event {
--  REAL xkey, ykey;                              /* Coordinates of the event. */
--  void *eventptr;      /* Can be a vertex or the location of a circle event. */
--  int heapposition;              /* Marks this event's position in the heap. */
--};
--
--/* A node in the splay tree.  Each node holds an oriented ghost triangle     */
--/*   that represents a boundary edge of the growing triangulation.  When a   */
--/*   circle event covers two boundary edges with a triangle, so that they    */
--/*   are no longer boundary edges, those edges are not immediately deleted   */
--/*   from the tree; rather, they are lazily deleted when they are next       */
--/*   encountered.  (Since only a random sample of boundary edges are kept    */
--/*   in the tree, lazy deletion is faster.)  `keydest' is used to verify     */
--/*   that a triangle is still the same as when it entered the splay tree; if */
--/*   it has been rotated (due to a circle event), it no longer represents a  */
--/*   boundary edge and should be deleted.                                    */
--
--struct splaynode {
--  struct otri keyedge;                     /* Lprev of an edge on the front. */
--  vertex keydest;           /* Used to verify that splay node is still live. */
--  struct splaynode *lchild, *rchild;              /* Children in splay tree. */
--};
--
--/* A type used to allocate memory.  firstblock is the first block of items.  */
--/*   nowblock is the block from which items are currently being allocated.   */
--/*   nextitem points to the next slab of free memory for an item.            */
--/*   deaditemstack is the head of a linked list (stack) of deallocated items */
--/*   that can be recycled.  unallocateditems is the number of items that     */
--/*   remain to be allocated from nowblock.                                   */
--/*                                                                           */
--/* Traversal is the process of walking through the entire list of items, and */
--/*   is separate from allocation.  Note that a traversal will visit items on */
--/*   the "deaditemstack" stack as well as live items.  pathblock points to   */
--/*   the block currently being traversed.  pathitem points to the next item  */
--/*   to be traversed.  pathitemsleft is the number of items that remain to   */
--/*   be traversed in pathblock.                                              */
--/*                                                                           */
--/* alignbytes determines how new records should be aligned in memory.        */
--/*   itembytes is the length of a record in bytes (after rounding up).       */
--/*   itemsperblock is the number of items allocated at once in a single      */
--/*   block.  itemsfirstblock is the number of items in the first block,      */
--/*   which can vary from the others.  items is the number of currently       */
--/*   allocated items.  maxitems is the maximum number of items that have     */
--/*   been allocated at once; it is the current number of items plus the      */
--/*   number of records kept on deaditemstack.                                */
--
--struct memorypool {
--  void **firstblock, **nowblock;
--  void *nextitem;
--  void *deaditemstack;
--  void **pathblock;
--  void *pathitem;
--  int alignbytes;
--  int itembytes;
--  int itemsperblock;
--  int itemsfirstblock;
--  long items, maxitems;
--  int unallocateditems;
--  int pathitemsleft;
--};
--
--
--/* Global constants.                                                         */
--
--REAL splitter;       /* Used to split REAL factors for exact multiplication. */
--REAL epsilon;                             /* Floating-point machine epsilon. */
--REAL resulterrbound;
--REAL ccwerrboundA, ccwerrboundB, ccwerrboundC;
--REAL iccerrboundA, iccerrboundB, iccerrboundC;
--REAL o3derrboundA, o3derrboundB, o3derrboundC;
--
--/* Random number seed is not constant, but I've made it global anyway.       */
--
--TRIANGLE_PTRINT randomseed;                     /* Current random number seed. */
--
--
--/* Mesh data structure.  Triangle operates on only one mesh, but the mesh    */
--/*   structure is used (instead of global variables) to allow reentrancy.    */
--
--struct mesh {
--
--/* Variables used to allocate memory for triangles, subsegments, vertices,   */
--/*   viri (triangles being eaten), encroached segments, bad (skinny or too   */
--/*   large) triangles, and splay tree nodes.                                 */
--
--  struct memorypool triangles;
--  struct memorypool subsegs;
--  struct memorypool vertices;
--  struct memorypool viri;
--  struct memorypool badsubsegs;
--  struct memorypool badtriangles;
--  struct memorypool flipstackers;
--  struct memorypool splaynodes;
--
--/* Variables that maintain the bad triangle queues.  The queues are          */
--/*   ordered from 4095 (highest priority) to 0 (lowest priority).            */
--
--  struct badtriang *queuefront[4096];
--  struct badtriang *queuetail[4096];
--  int nextnonemptyq[4096];
--  int firstnonemptyq;
--
--/* Variable that maintains the stack of recently flipped triangles.          */
--
--  struct flipstacker *lastflip;
--
--/* Other variables. */
--
--  REAL xmin, xmax, ymin, ymax;                            /* x and y bounds. */
--  REAL xminextreme;      /* Nonexistent x value used as a flag in sweepline. */
--  int invertices;                               /* Number of input vertices. */
--  int inelements;                              /* Number of input triangles. */
--  int insegments;                               /* Number of input segments. */
--  int holes;                                       /* Number of input holes. */
--  int regions;                                   /* Number of input regions. */
--  int undeads;    /* Number of input vertices that don't appear in the mesh. */
--  long edges;                                     /* Number of output edges. */
--  int mesh_dim;                                /* Dimension (ought to be 2). */
--  int nextras;                           /* Number of attributes per vertex. */
--  int eextras;                         /* Number of attributes per triangle. */
--  long hullsize;                          /* Number of edges in convex hull. */
--  int steinerleft;                 /* Number of Steiner points not yet used. */
--  int vertexmarkindex;         /* Index to find boundary marker of a vertex. */
--  int vertex2triindex;     /* Index to find a triangle adjacent to a vertex. */
--  int highorderindex;  /* Index to find extra nodes for high-order elements. */
--  int elemattribindex;            /* Index to find attributes of a triangle. */
--  int areaboundindex;             /* Index to find area bound of a triangle. */
--  int checksegments;         /* Are there segments in the triangulation yet? */
--  int checkquality;                  /* Has quality triangulation begun yet? */
--  int readnodefile;                           /* Has a .node file been read? */
--  long samples;              /* Number of random samples for point location. */
--
--  long incirclecount;                 /* Number of incircle tests performed. */
--  long counterclockcount;     /* Number of counterclockwise tests performed. */
--  long orient3dcount;           /* Number of 3D orientation tests performed. */
--  long hyperbolacount;      /* Number of right-of-hyperbola tests performed. */
--  long circumcentercount;  /* Number of circumcenter calculations performed. */
--  long circletopcount;       /* Number of circle top calculations performed. */
--
--/* Triangular bounding box vertices.                                         */
--
--  vertex infvertex1, infvertex2, infvertex3;
--
--/* Pointer to the `triangle' that occupies all of "outer space."             */
--
--  triangle *dummytri;
--  triangle *dummytribase;    /* Keep base address so we can free() it later. */
--
--/* Pointer to the omnipresent subsegment.  Referenced by any triangle or     */
--/*   subsegment that isn't really connected to a subsegment at that          */
--/*   location.                                                               */
--
--  subseg *dummysub;
--  subseg *dummysubbase;      /* Keep base address so we can free() it later. */
--
--/* Pointer to a recently visited triangle.  Improves point location if       */
--/*   proximate vertices are inserted sequentially.                           */
--
--  struct otri recenttri;
--
--};                                                  /* End of `struct mesh'. */
--
--
--/* Data structure for command line switches and file names.  This structure  */
--/*   is used (instead of global variables) to allow reentrancy.              */
--
--struct behavior {
--
--/* Switches for the triangulator.                                            */
--/*   poly: -p switch.  refine: -r switch.                                    */
--/*   quality: -q switch.                                                     */
--/*     minangle: minimum angle bound, specified after -q switch.             */
--/*     goodangle: cosine squared of minangle.                                */
--/*     offconstant: constant used to place off-center Steiner points.        */
--/*   vararea: -a switch without number.                                      */
--/*   fixedarea: -a switch with number.                                       */
--/*     maxarea: maximum area bound, specified after -a switch.               */
--/*   usertest: -u switch.                                                    */
--/*   regionattrib: -A switch.  convex: -c switch.                            */
--/*   weighted: 1 for -w switch, 2 for -W switch.  jettison: -j switch        */
--/*   firstnumber: inverse of -z switch.  All items are numbered starting     */
--/*     from `firstnumber'.                                                   */
--/*   edgesout: -e switch.  voronoi: -v switch.                               */
--/*   neighbors: -n switch.  geomview: -g switch.                             */
--/*   nobound: -B switch.  nopolywritten: -P switch.                          */
--/*   nonodewritten: -N switch.  noelewritten: -E switch.                     */
--/*   noiterationnum: -I switch.  noholes: -O switch.                         */
--/*   noexact: -X switch.                                                     */
--/*   order: element order, specified after -o switch.                        */
--/*   nobisect: count of how often -Y switch is selected.                     */
--/*   steiner: maximum number of Steiner points, specified after -S switch.   */
--/*   incremental: -i switch.  sweepline: -F switch.                          */
--/*   dwyer: inverse of -l switch.                                            */
--/*   splitseg: -s switch.                                                    */
--/*   conformdel: -D switch.  docheck: -C switch.                             */
--/*   quiet: -Q switch.  verbose: count of how often -V switch is selected.   */
--/*   usesegments: -p, -r, -q, or -c switch; determines whether segments are  */
--/*     used at all.                                                          */
--/*                                                                           */
--/* Read the instructions to find out the meaning of these switches.          */
--
--  int poly, refine, quality, vararea, fixedarea, usertest;
--  int regionattrib, convex, weighted, jettison;
--  int firstnumber;
--  int edgesout, voronoi, neighbors, geomview;
--  int nobound, nopolywritten, nonodewritten, noelewritten, noiterationnum;
--  int noholes, noexact, conformdel;
--  int incremental, sweepline, dwyer;
--  int splitseg;
--  int docheck;
--  int quiet, verbose;
--  int usesegments;
--  int order;
--  int nobisect;
--  int steiner;
--  REAL minangle, goodangle, offconstant;
--  REAL maxarea;
--
--/* Variables for file names.                                                 */
--
--#ifndef TRILIBRARY
--  char innodefilename[FILENAMESIZE];
--  char inelefilename[FILENAMESIZE];
--  char inpolyfilename[FILENAMESIZE];
--  char areafilename[FILENAMESIZE];
--  char outnodefilename[FILENAMESIZE];
--  char outelefilename[FILENAMESIZE];
--  char outpolyfilename[FILENAMESIZE];
--  char edgefilename[FILENAMESIZE];
--  char vnodefilename[FILENAMESIZE];
--  char vedgefilename[FILENAMESIZE];
--  char neighborfilename[FILENAMESIZE];
--  char offfilename[FILENAMESIZE];
--#endif /* not TRILIBRARY */
--
--};                                              /* End of `struct behavior'. */
--
--
--/*****************************************************************************/
--/*                                                                           */
--/*  Mesh manipulation primitives.  Each triangle contains three pointers to  */
--/*  other triangles, with orientations.  Each pointer points not to the      */
--/*  first byte of a triangle, but to one of the first three bytes of a       */
--/*  triangle.  It is necessary to extract both the triangle itself and the   */
--/*  orientation.  To save memory, I keep both pieces of information in one   */
--/*  pointer.  To make this possible, I assume that all triangles are aligned */
--/*  to four-byte boundaries.  The decode() routine below decodes a pointer,  */
--/*  extracting an orientation (in the range 0 to 2) and a pointer to the     */
--/*  beginning of a triangle.  The encode() routine compresses a pointer to a */
--/*  triangle and an orientation into a single pointer.  My assumptions that  */
--/*  triangles are four-byte-aligned and that the `TRIANGLE_PTRINT' type is     */
--/*  long enough to hold a pointer are two of the few kludges in this program.*/
--/*                                                                           */
--/*  Subsegments are manipulated similarly.  A pointer to a subsegment        */
--/*  carries both an address and an orientation in the range 0 to 1.          */
--/*                                                                           */
--/*  The other primitives take an oriented triangle or oriented subsegment,   */
--/*  and return an oriented triangle or oriented subsegment or vertex; or     */
--/*  they change the connections in the data structure.                       */
--/*                                                                           */
--/*  Below, triangles and subsegments are denoted by their vertices.  The     */
--/*  triangle abc has origin (org) a, destination (dest) b, and apex (apex)   */
--/*  c.  These vertices occur in counterclockwise order about the triangle.   */
--/*  The handle abc may simultaneously denote vertex a, edge ab, and triangle */
--/*  abc.                                                                     */
--/*                                                                           */
--/*  Similarly, the subsegment ab has origin (sorg) a and destination (sdest) */
--/*  b.  If ab is thought to be directed upward (with b directly above a),    */
--/*  then the handle ab is thought to grasp the right side of ab, and may     */
--/*  simultaneously denote vertex a and edge ab.                              */
--/*                                                                           */
--/*  An asterisk (*) denotes a vertex whose identity is unknown.              */
--/*                                                                           */
--/*  Given this notation, a partial list of mesh manipulation primitives      */
--/*  follows.                                                                 */
--/*                                                                           */
--/*                                                                           */
--/*  For triangles:                                                           */
--/*                                                                           */
--/*  sym:  Find the abutting triangle; same edge.                             */
--/*  sym(abc) -> ba*                                                          */
--/*                                                                           */
--/*  lnext:  Find the next edge (counterclockwise) of a triangle.             */
--/*  lnext(abc) -> bca                                                        */
--/*                                                                           */
--/*  lprev:  Find the previous edge (clockwise) of a triangle.                */
--/*  lprev(abc) -> cab                                                        */
--/*                                                                           */
--/*  onext:  Find the next edge counterclockwise with the same origin.        */
--/*  onext(abc) -> ac*                                                        */
--/*                                                                           */
--/*  oprev:  Find the next edge clockwise with the same origin.               */
--/*  oprev(abc) -> a*b                                                        */
--/*                                                                           */
--/*  dnext:  Find the next edge counterclockwise with the same destination.   */
--/*  dnext(abc) -> *ba                                                        */
--/*                                                                           */
--/*  dprev:  Find the next edge clockwise with the same destination.          */
--/*  dprev(abc) -> cb*                                                        */
--/*                                                                           */
--/*  rnext:  Find the next edge (counterclockwise) of the adjacent triangle.  */
--/*  rnext(abc) -> *a*                                                        */
--/*                                                                           */
--/*  rprev:  Find the previous edge (clockwise) of the adjacent triangle.     */
--/*  rprev(abc) -> b**                                                        */
--/*                                                                           */
--/*  org:  Origin          dest:  Destination          apex:  Apex            */
--/*  org(abc) -> a         dest(abc) -> b              apex(abc) -> c         */
--/*                                                                           */
--/*  bond:  Bond two triangles together at the resepective handles.           */
--/*  bond(abc, bad)                                                           */
--/*                                                                           */
--/*                                                                           */
--/*  For subsegments:                                                         */
--/*                                                                           */
--/*  ssym:  Reverse the orientation of a subsegment.                          */
--/*  ssym(ab) -> ba                                                           */
--/*                                                                           */
--/*  spivot:  Find adjoining subsegment with the same origin.                 */
--/*  spivot(ab) -> a*                                                         */
--/*                                                                           */
--/*  snext:  Find next subsegment in sequence.                                */
--/*  snext(ab) -> b*                                                          */
--/*                                                                           */
--/*  sorg:  Origin                      sdest:  Destination                   */
--/*  sorg(ab) -> a                      sdest(ab) -> b                        */
--/*                                                                           */
--/*  sbond:  Bond two subsegments together at the respective origins.         */
--/*  sbond(ab, ac)                                                            */
--/*                                                                           */
--/*                                                                           */
--/*  For interacting tetrahedra and subfacets:                                */
--/*                                                                           */
--/*  tspivot:  Find a subsegment abutting a triangle.                         */
--/*  tspivot(abc) -> ba                                                       */
--/*                                                                           */
--/*  stpivot:  Find a triangle abutting a subsegment.                         */
--/*  stpivot(ab) -> ba*                                                       */
--/*                                                                           */
--/*  tsbond:  Bond a triangle to a subsegment.                                */
--/*  tsbond(abc, ba)                                                          */
--/*                                                                           */
--/*****************************************************************************/
--
--/********* Mesh manipulation primitives begin here                   *********/
--/**                                                                         **/
--/**                                                                         **/
--
--/* Fast lookup arrays to speed some of the mesh manipulation primitives.     */
--
--int plus1mod3[3] = {1, 2, 0};
--int minus1mod3[3] = {2, 0, 1};
--
--/********* Primitives for triangles                                  *********/
--/*                                                                           */
--/*                                                                           */
--
--/* decode() converts a pointer to an oriented triangle.  The orientation is  */
--/*   extracted from the two least significant bits of the pointer.           */
--
--#define decode(ptr, otri)                                                     \
--  (otri).orient = (int) ((TRIANGLE_PTRINT) (ptr) & (TRIANGLE_PTRINT) 3l);         \
--  (otri).tri = (triangle *)                                                   \
--                  ((TRIANGLE_PTRINT) (ptr) ^ (TRIANGLE_PTRINT) (otri).orient)
--
--/* encode() compresses an oriented triangle into a single pointer.  It       */
--/*   relies on the assumption that all triangles are aligned to four-byte    */
--/*   boundaries, so the two least significant bits of (otri).tri are zero.   */
--
--#define encode(otri)                                                          \
--  (triangle) ((TRIANGLE_PTRINT) (otri).tri | (TRIANGLE_PTRINT) (otri).orient)
--
--/* The following handle manipulation primitives are all described by Guibas  */
--/*   and Stolfi.  However, Guibas and Stolfi use an edge-based data          */
--/*   structure, whereas I use a triangle-based data structure.               */
--
--/* sym() finds the abutting triangle, on the same edge.  Note that the edge  */
--/*   direction is necessarily reversed, because the handle specified by an   */
--/*   oriented triangle is directed counterclockwise around the triangle.     */
--
--#define sym(otri1, otri2)                                                     \
--  ptr = (otri1).tri[(otri1).orient];                                          \
--  decode(ptr, otri2);
--
--#define symself(otri)                                                         \
--  ptr = (otri).tri[(otri).orient];                                            \
--  decode(ptr, otri);
--
--/* lnext() finds the next edge (counterclockwise) of a triangle.             */
--
--#define lnext(otri1, otri2)                                                   \
--  (otri2).tri = (otri1).tri;                                                  \
--  (otri2).orient = plus1mod3[(otri1).orient]
--
--#define lnextself(otri)                                                       \
--  (otri).orient = plus1mod3[(otri).orient]
--
--/* lprev() finds the previous edge (clockwise) of a triangle.                */
--
--#define lprev(otri1, otri2)                                                   \
--  (otri2).tri = (otri1).tri;                                                  \
--  (otri2).orient = minus1mod3[(otri1).orient]
--
--#define lprevself(otri)                                                       \
--  (otri).orient = minus1mod3[(otri).orient]
--
--/* onext() spins counterclockwise around a vertex; that is, it finds the     */
--/*   next edge with the same origin in the counterclockwise direction.  This */
--/*   edge is part of a different triangle.                                   */
--
--#define onext(otri1, otri2)                                                   \
--  lprev(otri1, otri2);                                                        \
--  symself(otri2);
--
--#define onextself(otri)                                                       \
--  lprevself(otri);                                                            \
--  symself(otri);
--
--/* oprev() spins clockwise around a vertex; that is, it finds the next edge  */
--/*   with the same origin in the clockwise direction.  This edge is part of  */
--/*   a different triangle.                                                   */
--
--#define oprev(otri1, otri2)                                                   \
--  sym(otri1, otri2);                                                          \
--  lnextself(otri2);
--
--#define oprevself(otri)                                                       \
--  symself(otri);                                                              \
--  lnextself(otri);
--
--/* dnext() spins counterclockwise around a vertex; that is, it finds the     */
--/*   next edge with the same destination in the counterclockwise direction.  */
--/*   This edge is part of a different triangle.                              */
--
--#define dnext(otri1, otri2)                                                   \
--  sym(otri1, otri2);                                                          \
--  lprevself(otri2);
--
--#define dnextself(otri)                                                       \
--  symself(otri);                                                              \
--  lprevself(otri);
--
--/* dprev() spins clockwise around a vertex; that is, it finds the next edge  */
--/*   with the same destination in the clockwise direction.  This edge is     */
--/*   part of a different triangle.                                           */
--
--#define dprev(otri1, otri2)                                                   \
--  lnext(otri1, otri2);                                                        \
--  symself(otri2);
--
--#define dprevself(otri)                                                       \
--  lnextself(otri);                                                            \
--  symself(otri);
--
--/* rnext() moves one edge counterclockwise about the adjacent triangle.      */
--/*   (It's best understood by reading Guibas and Stolfi.  It involves        */
--/*   changing triangles twice.)                                              */
--
--#define rnext(otri1, otri2)                                                   \
--  sym(otri1, otri2);                                                          \
--  lnextself(otri2);                                                           \
--  symself(otri2);
--
--#define rnextself(otri)                                                       \
--  symself(otri);                                                              \
--  lnextself(otri);                                                            \
--  symself(otri);
--
--/* rprev() moves one edge clockwise about the adjacent triangle.             */
--/*   (It's best understood by reading Guibas and Stolfi.  It involves        */
--/*   changing triangles twice.)                                              */
--
--#define rprev(otri1, otri2)                                                   \
--  sym(otri1, otri2);                                                          \
--  lprevself(otri2);                                                           \
--  symself(otri2);
--
--#define rprevself(otri)                                                       \
--  symself(otri);                                                              \
--  lprevself(otri);                                                            \
--  symself(otri);
--
--/* These primitives determine or set the origin, destination, or apex of a   */
--/* triangle.                                                                 */
--
--#define org(otri, vertexptr)                                                  \
--  vertexptr = (vertex) (otri).tri[plus1mod3[(otri).orient] + 3]
--
--#define dest(otri, vertexptr)                                                 \
--  vertexptr = (vertex) (otri).tri[minus1mod3[(otri).orient] + 3]
--
--#define apex(otri, vertexptr)                                                 \
--  vertexptr = (vertex) (otri).tri[(otri).orient + 3]
--
--#define setorg(otri, vertexptr)                                               \
--  (otri).tri[plus1mod3[(otri).orient] + 3] = (triangle) vertexptr
--
--#define setdest(otri, vertexptr)                                              \
--  (otri).tri[minus1mod3[(otri).orient] + 3] = (triangle) vertexptr
--
--#define setapex(otri, vertexptr)                                              \
--  (otri).tri[(otri).orient + 3] = (triangle) vertexptr
--
--/* Bond two triangles together.                                              */
--
--#define bond(otri1, otri2)                                                    \
--  (otri1).tri[(otri1).orient] = encode(otri2);                                \
--  (otri2).tri[(otri2).orient] = encode(otri1)
--
--/* Dissolve a bond (from one side).  Note that the other triangle will still */
--/*   think it's connected to this triangle.  Usually, however, the other     */
--/*   triangle is being deleted entirely, or bonded to another triangle, so   */
--/*   it doesn't matter.                                                      */
--
--#define dissolve(otri)                                                        \
--  (otri).tri[(otri).orient] = (triangle) m->dummytri
--
--/* Copy an oriented triangle.                                                */
--
--#define otricopy(otri1, otri2)                                                \
--  (otri2).tri = (otri1).tri;                                                  \
--  (otri2).orient = (otri1).orient
--
--/* Test for equality of oriented triangles.                                  */
--
--#define otriequal(otri1, otri2)                                               \
--  (((otri1).tri == (otri2).tri) &&                                            \
--   ((otri1).orient == (otri2).orient))
--
--/* Primitives to infect or cure a triangle with the virus.  These rely on    */
--/*   the assumption that all subsegments are aligned to four-byte boundaries.*/
--
--#define infect(otri)                                                          \
--  (otri).tri[6] = (triangle)                                                  \
--                    ((TRIANGLE_PTRINT) (otri).tri[6] | (TRIANGLE_PTRINT) 2l)
--
--#define uninfect(otri)                                                        \
--  (otri).tri[6] = (triangle)                                                  \
--                    ((TRIANGLE_PTRINT) (otri).tri[6] & ~ (TRIANGLE_PTRINT) 2l)
--
--/* Test a triangle for viral infection.                                      */
--
--#define infected(otri)                                                        \
--  (((TRIANGLE_PTRINT) (otri).tri[6] & (TRIANGLE_PTRINT) 2l) != 0l)
--
--/* Check or set a triangle's attributes.                                     */
--
--#define elemattribute(otri, attnum)                                           \
--  ((REAL *) (otri).tri)[m->elemattribindex + (attnum)]
--
--#define setelemattribute(otri, attnum, value)                                 \
--  ((REAL *) (otri).tri)[m->elemattribindex + (attnum)] = value
--
--/* Check or set a triangle's maximum area bound.                             */
--
--#define areabound(otri)  ((REAL *) (otri).tri)[m->areaboundindex]
--
--#define setareabound(otri, value)                                             \
--  ((REAL *) (otri).tri)[m->areaboundindex] = value
--
--/* Check or set a triangle's deallocation.  Its second pointer is set to     */
--/*   NULL to indicate that it is not allocated.  (Its first pointer is used  */
--/*   for the stack of dead items.)  Its fourth pointer (its first vertex)    */
--/*   is set to NULL in case a `badtriang' structure points to it.            */
--
--#define deadtri(tria)  ((tria)[1] == (triangle) NULL)
--
--#define killtri(tria)                                                         \
--  (tria)[1] = (triangle) NULL;                                                \
--  (tria)[3] = (triangle) NULL
--
--/********* Primitives for subsegments                                *********/
--/*                                                                           */
--/*                                                                           */
--
--/* sdecode() converts a pointer to an oriented subsegment.  The orientation  */
--/*   is extracted from the least significant bit of the pointer.  The two    */
--/*   least significant bits (one for orientation, one for viral infection)   */
--/*   are masked out to produce the real pointer.                             */
--
--#define sdecode(sptr, osub)                                                   \
--  (osub).ssorient = (int) ((TRIANGLE_PTRINT) (sptr) & (TRIANGLE_PTRINT) 1l);      \
--  (osub).ss = (subseg *)                                                      \
--              ((TRIANGLE_PTRINT) (sptr) & ~ (TRIANGLE_PTRINT) 3l)
--
--/* sencode() compresses an oriented subsegment into a single pointer.  It    */
--/*   relies on the assumption that all subsegments are aligned to two-byte   */
--/*   boundaries, so the least significant bit of (osub).ss is zero.          */
--
--#define sencode(osub)                                                         \
--  (subseg) ((TRIANGLE_PTRINT) (osub).ss | (TRIANGLE_PTRINT) (osub).ssorient)
--
--/* ssym() toggles the orientation of a subsegment.                           */
--
--#define ssym(osub1, osub2)                                                    \
--  (osub2).ss = (osub1).ss;                                                    \
--  (osub2).ssorient = 1 - (osub1).ssorient
--
--#define ssymself(osub)                                                        \
--  (osub).ssorient = 1 - (osub).ssorient
--
--/* spivot() finds the other subsegment (from the same segment) that shares   */
--/*   the same origin.                                                        */
--
--#define spivot(osub1, osub2)                                                  \
--  sptr = (osub1).ss[(osub1).ssorient];                                        \
--  sdecode(sptr, osub2)
--
--#define spivotself(osub)                                                      \
--  sptr = (osub).ss[(osub).ssorient];                                          \
--  sdecode(sptr, osub)
--
--/* snext() finds the next subsegment (from the same segment) in sequence;    */
--/*   one whose origin is the input subsegment's destination.                 */
--
--#define snext(osub1, osub2)                                                   \
--  sptr = (osub1).ss[1 - (osub1).ssorient];                                    \
--  sdecode(sptr, osub2)
--
--#define snextself(osub)                                                       \
--  sptr = (osub).ss[1 - (osub).ssorient];                                      \
--  sdecode(sptr, osub)
--
--/* These primitives determine or set the origin or destination of a          */
--/*   subsegment or the segment that includes it.                             */
--
--#define sorg(osub, vertexptr)                                                 \
--  vertexptr = (vertex) (osub).ss[2 + (osub).ssorient]
--
--#define sdest(osub, vertexptr)                                                \
--  vertexptr = (vertex) (osub).ss[3 - (osub).ssorient]
--
--#define setsorg(osub, vertexptr)                                              \
--  (osub).ss[2 + (osub).ssorient] = (subseg) vertexptr
--
--#define setsdest(osub, vertexptr)                                             \
--  (osub).ss[3 - (osub).ssorient] = (subseg) vertexptr
--
--#define segorg(osub, vertexptr)                                               \
--  vertexptr = (vertex) (osub).ss[4 + (osub).ssorient]
--
--#define segdest(osub, vertexptr)                                              \
--  vertexptr = (vertex) (osub).ss[5 - (osub).ssorient]
--
--#define setsegorg(osub, vertexptr)                                            \
--  (osub).ss[4 + (osub).ssorient] = (subseg) vertexptr
--
--#define setsegdest(osub, vertexptr)                                           \
--  (osub).ss[5 - (osub).ssorient] = (subseg) vertexptr
--
--/* These primitives read or set a boundary marker.  Boundary markers are     */
--/*   used to hold user-defined tags for setting boundary conditions in       */
--/*   finite element solvers.                                                 */
--
--#define mark(osub)  (* (int *) ((osub).ss + 8))
--
--#define setmark(osub, value)                                                  \
--  * (int *) ((osub).ss + 8) = value
--
--/* Bond two subsegments together.                                            */
--
--#define sbond(osub1, osub2)                                                   \
--  (osub1).ss[(osub1).ssorient] = sencode(osub2);                              \
--  (osub2).ss[(osub2).ssorient] = sencode(osub1)
--
--/* Dissolve a subsegment bond (from one side).  Note that the other          */
--/*   subsegment will still think it's connected to this subsegment.          */
--
--#define sdissolve(osub)                                                       \
--  (osub).ss[(osub).ssorient] = (subseg) m->dummysub
--
--/* Copy a subsegment.                                                        */
--
--#define subsegcopy(osub1, osub2)                                              \
--  (osub2).ss = (osub1).ss;                                                    \
--  (osub2).ssorient = (osub1).ssorient
--
--/* Test for equality of subsegments.                                         */
--
--#define subsegequal(osub1, osub2)                                             \
--  (((osub1).ss == (osub2).ss) &&                                              \
--   ((osub1).ssorient == (osub2).ssorient))
--
--/* Check or set a subsegment's deallocation.  Its second pointer is set to   */
--/*   NULL to indicate that it is not allocated.  (Its first pointer is used  */
--/*   for the stack of dead items.)  Its third pointer (its first vertex)     */
--/*   is set to NULL in case a `badsubseg' structure points to it.            */
--
--#define deadsubseg(sub)  ((sub)[1] == (subseg) NULL)
--
--#define killsubseg(sub)                                                       \
--  (sub)[1] = (subseg) NULL;                                                   \
--  (sub)[2] = (subseg) NULL
--
--/********* Primitives for interacting triangles and subsegments      *********/
--/*                                                                           */
--/*                                                                           */
--
--/* tspivot() finds a subsegment abutting a triangle.                         */
--
--#define tspivot(otri, osub)                                                   \
--  sptr = (subseg) (otri).tri[6 + (otri).orient];                              \
--  sdecode(sptr, osub)
--
--/* stpivot() finds a triangle abutting a subsegment.  It requires that the   */
--/*   variable `ptr' of type `triangle' be defined.                           */
--
--#define stpivot(osub, otri)                                                   \
--  ptr = (triangle) (osub).ss[6 + (osub).ssorient];                            \
--  decode(ptr, otri)
--
--/* Bond a triangle to a subsegment.                                          */
--
--#define tsbond(otri, osub)                                                    \
--  (otri).tri[6 + (otri).orient] = (triangle) sencode(osub);                   \
--  (osub).ss[6 + (osub).ssorient] = (subseg) encode(otri)
--
--/* Dissolve a bond (from the triangle side).                                 */
--
--#define tsdissolve(otri)                                                      \
--  (otri).tri[6 + (otri).orient] = (triangle) m->dummysub
--
--/* Dissolve a bond (from the subsegment side).                               */
--
--#define stdissolve(osub)                                                      \
--  (osub).ss[6 + (osub).ssorient] = (subseg) m->dummytri
--
--/********* Primitives for vertices                                   *********/
--/*                                                                           */
--/*                                                                           */
--
--#define vertexmark(vx)  ((int *) (vx))[m->vertexmarkindex]
--
--#define setvertexmark(vx, value)                                              \
--  ((int *) (vx))[m->vertexmarkindex] = value
--
--#define vertextype(vx)  ((int *) (vx))[m->vertexmarkindex + 1]
--
--#define setvertextype(vx, value)                                              \
--  ((int *) (vx))[m->vertexmarkindex + 1] = value
--
--#define vertex2tri(vx)  ((triangle *) (vx))[m->vertex2triindex]
--
--#define setvertex2tri(vx, value)                                              \
--  ((triangle *) (vx))[m->vertex2triindex] = value
--
--/**                                                                         **/
--/**                                                                         **/
--/********* Mesh manipulation primitives end here                     *********/
--
--/********* User-defined triangle evaluation routine begins here      *********/
--/**                                                                         **/
--/**                                                                         **/
--
--/*****************************************************************************/
--/*                                                                           */
--/*  triunsuitable()   Determine if a triangle is unsuitable, and thus must   */
--/*                    be further refined.                                    */
--/*                                                                           */
--/*  You may write your own procedure that decides whether or not a selected  */
--/*  triangle is too big (and needs to be refined).  There are two ways to do */
--/*  this.                                                                    */
--/*                                                                           */
--/*  (1)  Modify the procedure `triunsuitable' below, then recompile          */
--/*  Triangle.                                                                */
--/*                                                                           */
--/*  (2)  Define the symbol EXTERNAL_TEST (either by adding the definition    */
--/*  to this file, or by using the appropriate compiler switch).  This way,   */
--/*  you can compile triangle.c separately from your test.  Write your own    */
--/*  `triunsuitable' procedure in a separate C file (using the same prototype */
--/*  as below).  Compile it and link the object code with triangle.o.         */
--/*                                                                           */
--/*  This procedure returns 1 if the triangle is too large and should be      */
--/*  refined; 0 otherwise.                                                    */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifdef EXTERNAL_TEST
--
--int triunsuitable();
--
--#else /* not EXTERNAL_TEST */
--
--#ifdef ANSI_DECLARATORS
--int triunsuitable(vertex triorg, vertex tridest, vertex triapex, REAL area)
--#else /* not ANSI_DECLARATORS */
--int triunsuitable(triorg, tridest, triapex, area)
--vertex triorg;                              /* The triangle's origin vertex. */
--vertex tridest;                        /* The triangle's destination vertex. */
--vertex triapex;                               /* The triangle's apex vertex. */
--REAL area;                                      /* The area of the triangle. */
--#endif /* not ANSI_DECLARATORS */
--
--{
--  REAL dxoa, dxda, dxod;
--  REAL dyoa, dyda, dyod;
--  REAL oalen, dalen, odlen;
--  REAL maxlen;
--
--  dxoa = triorg[0] - triapex[0];
--  dyoa = triorg[1] - triapex[1];
--  dxda = tridest[0] - triapex[0];
--  dyda = tridest[1] - triapex[1];
--  dxod = triorg[0] - tridest[0];
--  dyod = triorg[1] - tridest[1];
--  /* Find the squares of the lengths of the triangle's three edges. */
--  oalen = dxoa * dxoa + dyoa * dyoa;
--  dalen = dxda * dxda + dyda * dyda;
--  odlen = dxod * dxod + dyod * dyod;
--  /* Find the square of the length of the longest edge. */
--  maxlen = (dalen > oalen) ? dalen : oalen;
--  maxlen = (odlen > maxlen) ? odlen : maxlen;
--
--  if (maxlen > 0.05 * (triorg[0] * triorg[0] + triorg[1] * triorg[1]) + 0.02) {
--    return 1;
--  } else {
--    return 0;
--  }
--}
--
--#endif /* not EXTERNAL_TEST */
--
--/**                                                                         **/
--/**                                                                         **/
--/********* User-defined triangle evaluation routine ends here        *********/
--
--/********* Memory allocation and program exit wrappers begin here    *********/
--/**                                                                         **/
--/**                                                                         **/
--
--#ifdef ANSI_DECLARATORS
--void triexit(int status)
--#else /* not ANSI_DECLARATORS */
--void triexit(status)
--int status;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  exit(status);
--}
--
--#ifdef ANSI_DECLARATORS
--void *trimalloc(int size)
--#else /* not ANSI_DECLARATORS */
--void *trimalloc(size)
--int size;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  void *memptr;
--
--  memptr = (void *) malloc((unsigned int) size);
--  if (memptr == (void *) NULL) {
--    printf("Error:  Out of memory.\n");
--    triexit(1);
--  }
--  return(memptr);
--}
--
--#ifdef ANSI_DECLARATORS
--void trifree(void *memptr)
--#else /* not ANSI_DECLARATORS */
--void trifree(memptr)
--void *memptr;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  free(memptr);
--}
--
--/**                                                                         **/
--/**                                                                         **/
--/********* Memory allocation and program exit wrappers end here      *********/
--
--/********* User interaction routines begin here                      *********/
--/**                                                                         **/
--/**                                                                         **/
--
--/*****************************************************************************/
--/*                                                                           */
--/*  syntax()   Print list of command line switches.                          */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifndef TRILIBRARY
--
--void syntax()
--{
--#ifdef CDT_ONLY
--#ifdef REDUCED
--  printf("triangle [-pAcjevngBPNEIOXzo_lQVh] input_file\n");
--#else /* not REDUCED */
--  printf("triangle [-pAcjevngBPNEIOXzo_iFlCQVh] input_file\n");
--#endif /* not REDUCED */
--#else /* not CDT_ONLY */
--#ifdef REDUCED
--  printf("triangle [-prq__a__uAcDjevngBPNEIOXzo_YS__lQVh] input_file\n");
--#else /* not REDUCED */
--  printf("triangle [-prq__a__uAcDjevngBPNEIOXzo_YS__iFlsCQVh] input_file\n");
--#endif /* not REDUCED */
--#endif /* not CDT_ONLY */
--
--  printf("    -p  Triangulates a Planar Straight Line Graph (.poly file).\n");
--#ifndef CDT_ONLY
--  printf("    -r  Refines a previously generated mesh.\n");
--  printf(
--    "    -q  Quality mesh generation.  A minimum angle may be specified.\n");
--  printf("    -a  Applies a maximum triangle area constraint.\n");
--  printf("    -u  Applies a user-defined triangle constraint.\n");
--#endif /* not CDT_ONLY */
--  printf(
--    "    -A  Applies attributes to identify triangles in certain regions.\n");
--  printf("    -c  Encloses the convex hull with segments.\n");
--#ifndef CDT_ONLY
--  printf("    -D  Conforming Delaunay:  all triangles are truly Delaunay.\n");
--#endif /* not CDT_ONLY */
--/*
--  printf("    -w  Weighted Delaunay triangulation.\n");
--  printf("    -W  Regular triangulation (lower hull of a height field).\n");
--*/
--  printf("    -j  Jettison unused vertices from output .node file.\n");
--  printf("    -e  Generates an edge list.\n");
--  printf("    -v  Generates a Voronoi diagram.\n");
--  printf("    -n  Generates a list of triangle neighbors.\n");
--  printf("    -g  Generates an .off file for Geomview.\n");
--  printf("    -B  Suppresses output of boundary information.\n");
--  printf("    -P  Suppresses output of .poly file.\n");
--  printf("    -N  Suppresses output of .node file.\n");
--  printf("    -E  Suppresses output of .ele file.\n");
--  printf("    -I  Suppresses mesh iteration numbers.\n");
--  printf("    -O  Ignores holes in .poly file.\n");
--  printf("    -X  Suppresses use of exact arithmetic.\n");
--  printf("    -z  Numbers all items starting from zero (rather than one).\n");
--  printf("    -o2 Generates second-order subparametric elements.\n");
--#ifndef CDT_ONLY
--  printf("    -Y  Suppresses boundary segment splitting.\n");
--  printf("    -S  Specifies maximum number of added Steiner points.\n");
--#endif /* not CDT_ONLY */
--#ifndef REDUCED
--  printf("    -i  Uses incremental method, rather than divide-and-conquer.\n");
--  printf("    -F  Uses Fortune's sweepline algorithm, rather than d-and-c.\n");
--#endif /* not REDUCED */
--  printf("    -l  Uses vertical cuts only, rather than alternating cuts.\n");
--#ifndef REDUCED
--#ifndef CDT_ONLY
--  printf(
--    "    -s  Force segments into mesh by splitting (instead of using CDT).\n");
--#endif /* not CDT_ONLY */
--  printf("    -C  Check consistency of final mesh.\n");
--#endif /* not REDUCED */
--  printf("    -Q  Quiet:  No terminal output except errors.\n");
--  printf("    -V  Verbose:  Detailed information on what I'm doing.\n");
--  printf("    -h  Help:  Detailed instructions for Triangle.\n");
--  triexit(0);
--}
--
--#endif /* not TRILIBRARY */
--
--/*****************************************************************************/
--/*                                                                           */
--/*  info()   Print out complete instructions.                                */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifndef TRILIBRARY
--
--void info()
--{
--  printf("Triangle\n");
--  printf(
--"A Two-Dimensional Quality Mesh Generator and Delaunay Triangulator.\n");
--  printf("Version 1.6\n\n");
--  printf(
--"Copyright 1993, 1995, 1997, 1998, 2002, 2005 Jonathan Richard Shewchuk\n");
--  printf("2360 Woolsey #H / Berkeley, California 94705-1927\n");
--  printf("Bugs/comments to jrs@cs.berkeley.edu\n");
--  printf(
--"Created as part of the Quake project (tools for earthquake simulation).\n");
--  printf(
--"Supported in part by NSF Grant CMS-9318163 and an NSERC 1967 Scholarship.\n");
--  printf("There is no warranty whatsoever.  Use at your own risk.\n");
--#ifdef SINGLE
--  printf("This executable is compiled for single precision arithmetic.\n\n\n");
--#else /* not SINGLE */
--  printf("This executable is compiled for double precision arithmetic.\n\n\n");
--#endif /* not SINGLE */
--  printf(
--"Triangle generates exact Delaunay triangulations, constrained Delaunay\n");
--  printf(
--"triangulations, conforming Delaunay triangulations, Voronoi diagrams, and\n");
--  printf(
--"high-quality triangular meshes.  The latter can be generated with no small\n"
--);
--  printf(
--"or large angles, and are thus suitable for finite element analysis.  If no\n"
--);
--  printf(
--"command line switch is specified, your .node input file is read, and the\n");
--  printf(
--"Delaunay triangulation is returned in .node and .ele output files.  The\n");
--  printf("command syntax is:\n\n");
--  printf("triangle [-prq__a__uAcDjevngBPNEIOXzo_YS__iFlsCQVh] input_file\n\n");
--  printf(
--"Underscores indicate that numbers may optionally follow certain switches.\n");
--  printf(
--"Do not leave any space between a switch and its numeric parameter.\n");
--  printf(
--"input_file must be a file with extension .node, or extension .poly if the\n");
--  printf(
--"-p switch is used.  If -r is used, you must supply .node and .ele files,\n");
--  printf(
--"and possibly a .poly file and an .area file as well.  The formats of these\n"
--);
--  printf("files are described below.\n\n");
--  printf("Command Line Switches:\n\n");
--  printf(
--"    -p  Reads a Planar Straight Line Graph (.poly file), which can specify\n"
--);
--  printf(
--"        vertices, segments, holes, regional attributes, and regional area\n");
--  printf(
--"        constraints.  Generates a constrained Delaunay triangulation (CDT)\n"
--);
--  printf(
--"        fitting the input; or, if -s, -q, -a, or -u is used, a conforming\n");
--  printf(
--"        constrained Delaunay triangulation (CCDT).  If you want a truly\n");
--  printf(
--"        Delaunay (not just constrained Delaunay) triangulation, use -D as\n");
--  printf(
--"        well.  When -p is not used, Triangle reads a .node file by default.\n"
--);
--  printf(
--"    -r  Refines a previously generated mesh.  The mesh is read from a .node\n"
--);
--  printf(
--"        file and an .ele file.  If -p is also used, a .poly file is read\n");
--  printf(
--"        and used to constrain segments in the mesh.  If -a is also used\n");
--  printf(
--"        (with no number following), an .area file is read and used to\n");
--  printf(
--"        impose area constraints on the mesh.  Further details on refinement\n"
--);
--  printf("        appear below.\n");
--  printf(
--"    -q  Quality mesh generation by Delaunay refinement (a hybrid of Paul\n");
--  printf(
--"        Chew's and Jim Ruppert's algorithms).  Adds vertices to the mesh to\n"
--);
--  printf(
--"        ensure that all angles are between 20 and 140 degrees.  An\n");
--  printf(
--"        alternative bound on the minimum angle, replacing 20 degrees, may\n");
--  printf(
--"        be specified after the `q'.  The specified angle may include a\n");
--  printf(
--"        decimal point, but not exponential notation.  Note that a bound of\n"
--);
--  printf(
--"        theta degrees on the smallest angle also implies a bound of\n");
--  printf(
--"        (180 - 2 theta) on the largest angle.  If the minimum angle is 28.6\n"
--);
--  printf(
--"        degrees or smaller, Triangle is mathematically guaranteed to\n");
--  printf(
--"        terminate (assuming infinite precision arithmetic--Triangle may\n");
--  printf(
--"        fail to terminate if you run out of precision).  In practice,\n");
--  printf(
--"        Triangle often succeeds for minimum angles up to 34 degrees.  For\n");
--  printf(
--"        some meshes, however, you might need to reduce the minimum angle to\n"
--);
--  printf(
--"        avoid problems associated with insufficient floating-point\n");
--  printf("        precision.\n");
--  printf(
--"    -a  Imposes a maximum triangle area.  If a number follows the `a', no\n");
--  printf(
--"        triangle is generated whose area is larger than that number.  If no\n"
--);
--  printf(
--"        number is specified, an .area file (if -r is used) or .poly file\n");
--  printf(
--"        (if -r is not used) specifies a set of maximum area constraints.\n");
--  printf(
--"        An .area file contains a separate area constraint for each\n");
--  printf(
--"        triangle, and is useful for refining a finite element mesh based on\n"
--);
--  printf(
--"        a posteriori error estimates.  A .poly file can optionally contain\n"
--);
--  printf(
--"        an area constraint for each segment-bounded region, thereby\n");
--  printf(
--"        controlling triangle densities in a first triangulation of a PSLG.\n"
--);
--  printf(
--"        You can impose both a fixed area constraint and a varying area\n");
--  printf(
--"        constraint by invoking the -a switch twice, once with and once\n");
--  printf(
--"        without a number following.  Each area specified may include a\n");
--  printf("        decimal point.\n");
--  printf(
--"    -u  Imposes a user-defined constraint on triangle size.  There are two\n"
--);
--  printf(
--"        ways to use this feature.  One is to edit the triunsuitable()\n");
--  printf(
--"        procedure in triangle.c to encode any constraint you like, then\n");
--  printf(
--"        recompile Triangle.  The other is to compile triangle.c with the\n");
--  printf(
--"        EXTERNAL_TEST symbol set (compiler switch -DEXTERNAL_TEST), then\n");
--  printf(
--"        link Triangle with a separate object file that implements\n");
--  printf(
--"        triunsuitable().  In either case, the -u switch causes the user-\n");
--  printf("        defined test to be applied to every triangle.\n");
--  printf(
--"    -A  Assigns an additional floating-point attribute to each triangle\n");
--  printf(
--"        that identifies what segment-bounded region each triangle belongs\n");
--  printf(
--"        to.  Attributes are assigned to regions by the .poly file.  If a\n");
--  printf(
--"        region is not explicitly marked by the .poly file, triangles in\n");
--  printf(
--"        that region are assigned an attribute of zero.  The -A switch has\n");
--  printf(
--"        an effect only when the -p switch is used and the -r switch is not.\n"
--);
--  printf(
--"    -c  Creates segments on the convex hull of the triangulation.  If you\n");
--  printf(
--"        are triangulating a vertex set, this switch causes a .poly file to\n"
--);
--  printf(
--"        be written, containing all edges of the convex hull.  If you are\n");
--  printf(
--"        triangulating a PSLG, this switch specifies that the whole convex\n");
--  printf(
--"        hull of the PSLG should be triangulated, regardless of what\n");
--  printf(
--"        segments the PSLG has.  If you do not use this switch when\n");
--  printf(
--"        triangulating a PSLG, Triangle assumes that you have identified the\n"
--);
--  printf(
--"        region to be triangulated by surrounding it with segments of the\n");
--  printf(
--"        input PSLG.  Beware:  if you are not careful, this switch can cause\n"
--);
--  printf(
--"        the introduction of an extremely thin angle between a PSLG segment\n"
--);
--  printf(
--"        and a convex hull segment, which can cause overrefinement (and\n");
--  printf(
--"        possibly failure if Triangle runs out of precision).  If you are\n");
--  printf(
--"        refining a mesh, the -c switch works differently:  it causes a\n");
--  printf(
--"        .poly file to be written containing the boundary edges of the mesh\n"
--);
--  printf("        (useful if no .poly file was read).\n");
--  printf(
--"    -D  Conforming Delaunay triangulation:  use this switch if you want to\n"
--);
--  printf(
--"        ensure that all the triangles in the mesh are Delaunay, and not\n");
--  printf(
--"        merely constrained Delaunay; or if you want to ensure that all the\n"
--);
--  printf(
--"        Voronoi vertices lie within the triangulation.  (Some finite volume\n"
--);
--  printf(
--"        methods have this requirement.)  This switch invokes Ruppert's\n");
--  printf(
--"        original algorithm, which splits every subsegment whose diametral\n");
--  printf(
--"        circle is encroached.  It usually increases the number of vertices\n"
--);
--  printf("        and triangles.\n");
--  printf(
--"    -j  Jettisons vertices that are not part of the final triangulation\n");
--  printf(
--"        from the output .node file.  By default, Triangle copies all\n");
--  printf(
--"        vertices in the input .node file to the output .node file, in the\n");
--  printf(
--"        same order, so their indices do not change.  The -j switch prevents\n"
--);
--  printf(
--"        duplicated input vertices, or vertices `eaten' by holes, from\n");
--  printf(
--"        appearing in the output .node file.  Thus, if two input vertices\n");
--  printf(
--"        have exactly the same coordinates, only the first appears in the\n");
--  printf(
--"        output.  If any vertices are jettisoned, the vertex numbering in\n");
--  printf(
--"        the output .node file differs from that of the input .node file.\n");
--  printf(
--"    -e  Outputs (to an .edge file) a list of edges of the triangulation.\n");
--  printf(
--"    -v  Outputs the Voronoi diagram associated with the triangulation.\n");
--  printf(
--"        Does not attempt to detect degeneracies, so some Voronoi vertices\n");
--  printf(
--"        may be duplicated.  See the discussion of Voronoi diagrams below.\n");
--  printf(
--"    -n  Outputs (to a .neigh file) a list of triangles neighboring each\n");
--  printf("        triangle.\n");
--  printf(
--"    -g  Outputs the mesh to an Object File Format (.off) file, suitable for\n"
--);
--  printf("        viewing with the Geometry Center's Geomview package.\n");
--  printf(
--"    -B  No boundary markers in the output .node, .poly, and .edge output\n");
--  printf(
--"        files.  See the detailed discussion of boundary markers below.\n");
--  printf(
--"    -P  No output .poly file.  Saves disk space, but you lose the ability\n");
--  printf(
--"        to maintain constraining segments on later refinements of the mesh.\n"
--);
--  printf("    -N  No output .node file.\n");
--  printf("    -E  No output .ele file.\n");
--  printf(
--"    -I  No iteration numbers.  Suppresses the output of .node and .poly\n");
--  printf(
--"        files, so your input files won't be overwritten.  (If your input is\n"
--);
--  printf(
--"        a .poly file only, a .node file is written.)  Cannot be used with\n");
--  printf(
--"        the -r switch, because that would overwrite your input .ele file.\n");
--  printf(
--"        Shouldn't be used with the -q, -a, -u, or -s switch if you are\n");
--  printf(
--"        using a .node file for input, because no .node file is written, so\n"
--);
--  printf("        there is no record of any added Steiner points.\n");
--  printf("    -O  No holes.  Ignores the holes in the .poly file.\n");
--  printf(
--"    -X  No exact arithmetic.  Normally, Triangle uses exact floating-point\n"
--);
--  printf(
--"        arithmetic for certain tests if it thinks the inexact tests are not\n"
--);
--  printf(
--"        accurate enough.  Exact arithmetic ensures the robustness of the\n");
--  printf(
--"        triangulation algorithms, despite floating-point roundoff error.\n");
--  printf(
--"        Disabling exact arithmetic with the -X switch causes a small\n");
--  printf(
--"        improvement in speed and creates the possibility that Triangle will\n"
--);
--  printf("        fail to produce a valid mesh.  Not recommended.\n");
--  printf(
--"    -z  Numbers all items starting from zero (rather than one).  Note that\n"
--);
--  printf(
--"        this switch is normally overridden by the value used to number the\n"
--);
--  printf(
--"        first vertex of the input .node or .poly file.  However, this\n");
--  printf(
--"        switch is useful when calling Triangle from another program.\n");
--  printf(
--"    -o2 Generates second-order subparametric elements with six nodes each.\n"
--);
--  printf(
--"    -Y  No new vertices on the boundary.  This switch is useful when the\n");
--  printf(
--"        mesh boundary must be preserved so that it conforms to some\n");
--  printf(
--"        adjacent mesh.  Be forewarned that you will probably sacrifice much\n"
--);
--  printf(
--"        of the quality of the mesh; Triangle will try, but the resulting\n");
--  printf(
--"        mesh may contain poorly shaped triangles.  Works well if all the\n");
--  printf(
--"        boundary vertices are closely spaced.  Specify this switch twice\n");
--  printf(
--"        (`-YY') to prevent all segment splitting, including internal\n");
--  printf("        boundaries.\n");
--  printf(
--"    -S  Specifies the maximum number of Steiner points (vertices that are\n");
--  printf(
--"        not in the input, but are added to meet the constraints on minimum\n"
--);
--  printf(
--"        angle and maximum area).  The default is to allow an unlimited\n");
--  printf(
--"        number.  If you specify this switch with no number after it,\n");
--  printf(
--"        the limit is set to zero.  Triangle always adds vertices at segment\n"
--);
--  printf(
--"        intersections, even if it needs to use more vertices than the limit\n"
--);
--  printf(
--"        you set.  When Triangle inserts segments by splitting (-s), it\n");
--  printf(
--"        always adds enough vertices to ensure that all the segments of the\n"
--);
--  printf("        PLSG are recovered, ignoring the limit if necessary.\n");
--  printf(
--"    -i  Uses an incremental rather than a divide-and-conquer algorithm to\n");
--  printf(
--"        construct a Delaunay triangulation.  Try it if the divide-and-\n");
--  printf("        conquer algorithm fails.\n");
--  printf(
--"    -F  Uses Steven Fortune's sweepline algorithm to construct a Delaunay\n");
--  printf(
--"        triangulation.  Warning:  does not use exact arithmetic for all\n");
--  printf("        calculations.  An exact result is not guaranteed.\n");
--  printf(
--"    -l  Uses only vertical cuts in the divide-and-conquer algorithm.  By\n");
--  printf(
--"        default, Triangle alternates between vertical and horizontal cuts,\n"
--);
--  printf(
--"        which usually improve the speed except with vertex sets that are\n");
--  printf(
--"        small or short and wide.  This switch is primarily of theoretical\n");
--  printf("        interest.\n");
--  printf(
--"    -s  Specifies that segments should be forced into the triangulation by\n"
--);
--  printf(
--"        recursively splitting them at their midpoints, rather than by\n");
--  printf(
--"        generating a constrained Delaunay triangulation.  Segment splitting\n"
--);
--  printf(
--"        is true to Ruppert's original algorithm, but can create needlessly\n"
--);
--  printf(
--"        small triangles.  This switch is primarily of theoretical interest.\n"
--);
--  printf(
--"    -C  Check the consistency of the final mesh.  Uses exact arithmetic for\n"
--);
--  printf(
--"        checking, even if the -X switch is used.  Useful if you suspect\n");
--  printf("        Triangle is buggy.\n");
--  printf(
--"    -Q  Quiet:  Suppresses all explanation of what Triangle is doing,\n");
--  printf("        unless an error occurs.\n");
--  printf(
--"    -V  Verbose:  Gives detailed information about what Triangle is doing.\n"
--);
--  printf(
--"        Add more `V's for increasing amount of detail.  `-V' is most\n");
--  printf(
--"        useful; itgives information on algorithmic progress and much more\n");
--  printf(
--"        detailed statistics.  `-VV' gives vertex-by-vertex details, and\n");
--  printf(
--"        prints so much that Triangle runs much more slowly.  `-VVVV' gives\n"
--);
--  printf("        information only a debugger could love.\n");
--  printf("    -h  Help:  Displays these instructions.\n");
--  printf("\n");
--  printf("Definitions:\n");
--  printf("\n");
--  printf(
--"  A Delaunay triangulation of a vertex set is a triangulation whose\n");
--  printf(
--"  vertices are the vertex set, that covers the convex hull of the vertex\n");
--  printf(
--"  set.  A Delaunay triangulation has the property that no vertex lies\n");
--  printf(
--"  inside the circumscribing circle (circle that passes through all three\n");
--  printf("  vertices) of any triangle in the triangulation.\n\n");
--  printf(
--"  A Voronoi diagram of a vertex set is a subdivision of the plane into\n");
--  printf(
--"  polygonal cells (some of which may be unbounded, meaning infinitely\n");
--  printf(
--"  large), where each cell is the set of points in the plane that are closer\n"
--);
--  printf(
--"  to some input vertex than to any other input vertex.  The Voronoi diagram\n"
--);
--  printf("  is a geometric dual of the Delaunay triangulation.\n\n");
--  printf(
--"  A Planar Straight Line Graph (PSLG) is a set of vertices and segments.\n");
--  printf(
--"  Segments are simply edges, whose endpoints are all vertices in the PSLG.\n"
--);
--  printf(
--"  Segments may intersect each other only at their endpoints.  The file\n");
--  printf("  format for PSLGs (.poly files) is described below.\n\n");
--  printf(
--"  A constrained Delaunay triangulation (CDT) of a PSLG is similar to a\n");
--  printf(
--"  Delaunay triangulation, but each PSLG segment is present as a single edge\n"
--);
--  printf(
--"  of the CDT.  (A constrained Delaunay triangulation is not truly a\n");
--  printf(
--"  Delaunay triangulation, because some of its triangles might not be\n");
--  printf(
--"  Delaunay.)  By definition, a CDT does not have any vertices other than\n");
--  printf(
--"  those specified in the input PSLG.  Depending on context, a CDT might\n");
--  printf(
--"  cover the convex hull of the PSLG, or it might cover only a segment-\n");
--  printf("  bounded region (e.g. a polygon).\n\n");
--  printf(
--"  A conforming Delaunay triangulation of a PSLG is a triangulation in which\n"
--);
--  printf(
--"  each triangle is truly Delaunay, and each PSLG segment is represented by\n"
--);
--  printf(
--"  a linear contiguous sequence of edges of the triangulation.  New vertices\n"
--);
--  printf(
--"  (not part of the PSLG) may appear, and each input segment may have been\n");
--  printf(
--"  subdivided into shorter edges (subsegments) by these additional vertices.\n"
--);
--  printf(
--"  The new vertices are frequently necessary to maintain the Delaunay\n");
--  printf("  property while ensuring that every segment is represented.\n\n");
--  printf(
--"  A conforming constrained Delaunay triangulation (CCDT) of a PSLG is a\n");
--  printf(
--"  triangulation of a PSLG whose triangles are constrained Delaunay.  New\n");
--  printf("  vertices may appear, and input segments may be subdivided into\n");
--  printf(
--"  subsegments, but not to guarantee that segments are respected; rather, to\n"
--);
--  printf(
--"  improve the quality of the triangles.  The high-quality meshes produced\n");
--  printf(
--"  by the -q switch are usually CCDTs, but can be made conforming Delaunay\n");
--  printf("  with the -D switch.\n\n");
--  printf("File Formats:\n\n");
--  printf(
--"  All files may contain comments prefixed by the character '#'.  Vertices,\n"
--);
--  printf(
--"  triangles, edges, holes, and maximum area constraints must be numbered\n");
--  printf(
--"  consecutively, starting from either 1 or 0.  Whichever you choose, all\n");
--  printf(
--"  input files must be consistent; if the vertices are numbered from 1, so\n");
--  printf(
--"  must be all other objects.  Triangle automatically detects your choice\n");
--  printf(
--"  while reading the .node (or .poly) file.  (When calling Triangle from\n");
--  printf(
--"  another program, use the -z switch if you wish to number objects from\n");
--  printf("  zero.)  Examples of these file formats are given below.\n\n");
--  printf("  .node files:\n");
--  printf(
--"    First line:  <# of vertices> <dimension (must be 2)> <# of attributes>\n"
--);
--  printf(
--"                                           <# of boundary markers (0 or 1)>\n"
--);
--  printf(
--"    Remaining lines:  <vertex #> <x> <y> [attributes] [boundary marker]\n");
--  printf("\n");
--  printf(
--"    The attributes, which are typically floating-point values of physical\n");
--  printf(
--"    quantities (such as mass or conductivity) associated with the nodes of\n"
--);
--  printf(
--"    a finite element mesh, are copied unchanged to the output mesh.  If -q,\n"
--);
--  printf(
--"    -a, -u, -D, or -s is selected, each new Steiner point added to the mesh\n"
--);
--  printf("    has attributes assigned to it by linear interpolation.\n\n");
--  printf(
--"    If the fourth entry of the first line is `1', the last column of the\n");
--  printf(
--"    remainder of the file is assumed to contain boundary markers.  Boundary\n"
--);
--  printf(
--"    markers are used to identify boundary vertices and vertices resting on\n"
--);
--  printf(
--"    PSLG segments; a complete description appears in a section below.  The\n"
--);
--  printf(
--"    .node file produced by Triangle contains boundary markers in the last\n");
--  printf("    column unless they are suppressed by the -B switch.\n\n");
--  printf("  .ele files:\n");
--  printf(
--"    First line:  <# of triangles> <nodes per triangle> <# of attributes>\n");
--  printf(
--"    Remaining lines:  <triangle #> <node> <node> <node> ... [attributes]\n");
--  printf("\n");
--  printf(
--"    Nodes are indices into the corresponding .node file.  The first three\n");
--  printf(
--"    nodes are the corner vertices, and are listed in counterclockwise order\n"
--);
--  printf(
--"    around each triangle.  (The remaining nodes, if any, depend on the type\n"
--);
--  printf("    of finite element used.)\n\n");
--  printf(
--"    The attributes are just like those of .node files.  Because there is no\n"
--);
--  printf(
--"    simple mapping from input to output triangles, Triangle attempts to\n");
--  printf(
--"    interpolate attributes, and may cause a lot of diffusion of attributes\n"
--);
--  printf(
--"    among nearby triangles as the triangulation is refined.  Attributes do\n"
--);
--  printf("    not diffuse across segments, so attributes used to identify\n");
--  printf("    segment-bounded regions remain intact.\n\n");
--  printf(
--"    In .ele files produced by Triangle, each triangular element has three\n");
--  printf(
--"    nodes (vertices) unless the -o2 switch is used, in which case\n");
--  printf(
--"    subparametric quadratic elements with six nodes each are generated.\n");
--  printf(
--"    The first three nodes are the corners in counterclockwise order, and\n");
--  printf(
--"    the fourth, fifth, and sixth nodes lie on the midpoints of the edges\n");
--  printf(
--"    opposite the first, second, and third vertices, respectively.\n");
--  printf("\n");
--  printf("  .poly files:\n");
--  printf(
--"    First line:  <# of vertices> <dimension (must be 2)> <# of attributes>\n"
--);
--  printf(
--"                                           <# of boundary markers (0 or 1)>\n"
--);
--  printf(
--"    Following lines:  <vertex #> <x> <y> [attributes] [boundary marker]\n");
--  printf("    One line:  <# of segments> <# of boundary markers (0 or 1)>\n");
--  printf(
--"    Following lines:  <segment #> <endpoint> <endpoint> [boundary marker]\n");
--  printf("    One line:  <# of holes>\n");
--  printf("    Following lines:  <hole #> <x> <y>\n");
--  printf(
--"    Optional line:  <# of regional attributes and/or area constraints>\n");
--  printf(
--"    Optional following lines:  <region #> <x> <y> <attribute> <max area>\n");
--  printf("\n");
--  printf(
--"    A .poly file represents a PSLG, as well as some additional information.\n"
--);
--  printf(
--"    The first section lists all the vertices, and is identical to the\n");
--  printf(
--"    format of .node files.  <# of vertices> may be set to zero to indicate\n"
--);
--  printf(
--"    that the vertices are listed in a separate .node file; .poly files\n");
--  printf(
--"    produced by Triangle always have this format.  A vertex set represented\n"
--);
--  printf(
--"    this way has the advantage that it may easily be triangulated with or\n");
--  printf(
--"    without segments (depending on whether the -p switch is invoked).\n");
--  printf("\n");
--  printf(
--"    The second section lists the segments.  Segments are edges whose\n");
--  printf(
--"    presence in the triangulation is enforced.  (Depending on the choice of\n"
--);
--  printf(
--"    switches, segment might be subdivided into smaller edges).  Each\n");
--  printf(
--"    segment is specified by listing the indices of its two endpoints.  This\n"
--);
--  printf(
--"    means that you must include its endpoints in the vertex list.  Each\n");
--  printf("    segment, like each point, may have a boundary marker.\n\n");
--  printf(
--"    If -q, -a, -u, and -s are not selected, Triangle produces a constrained\n"
--);
--  printf(
--"    Delaunay triangulation (CDT), in which each segment appears as a single\n"
--);
--  printf(
--"    edge in the triangulation.  If -q, -a, -u, or -s is selected, Triangle\n"
--);
--  printf(
--"    produces a conforming constrained Delaunay triangulation (CCDT), in\n");
--  printf(
--"    which segments may be subdivided into smaller edges.  If -D is\n");
--  printf(
--"    selected, Triangle produces a conforming Delaunay triangulation, so\n");
--  printf(
--"    that every triangle is Delaunay, and not just constrained Delaunay.\n");
--  printf("\n");
--  printf(
--"    The third section lists holes (and concavities, if -c is selected) in\n");
--  printf(
--"    the triangulation.  Holes are specified by identifying a point inside\n");
--  printf(
--"    each hole.  After the triangulation is formed, Triangle creates holes\n");
--  printf(
--"    by eating triangles, spreading out from each hole point until its\n");
--  printf(
--"    progress is blocked by segments in the PSLG.  You must be careful to\n");
--  printf(
--"    enclose each hole in segments, or your whole triangulation might be\n");
--  printf(
--"    eaten away.  If the two triangles abutting a segment are eaten, the\n");
--  printf(
--"    segment itself is also eaten.  Do not place a hole directly on a\n");
--  printf("    segment; if you do, Triangle chooses one side of the segment\n");
--  printf("    arbitrarily.\n\n");
--  printf(
--"    The optional fourth section lists regional attributes (to be assigned\n");
--  printf(
--"    to all triangles in a region) and regional constraints on the maximum\n");
--  printf(
--"    triangle area.  Triangle reads this section only if the -A switch is\n");
--  printf(
--"    used or the -a switch is used without a number following it, and the -r\n"
--);
--  printf(
--"    switch is not used.  Regional attributes and area constraints are\n");
--  printf(
--"    propagated in the same manner as holes:  you specify a point for each\n");
--  printf(
--"    attribute and/or constraint, and the attribute and/or constraint\n");
--  printf(
--"    affects the whole region (bounded by segments) containing the point.\n");
--  printf(
--"    If two values are written on a line after the x and y coordinate, the\n");
--  printf(
--"    first such value is assumed to be a regional attribute (but is only\n");
--  printf(
--"    applied if the -A switch is selected), and the second value is assumed\n"
--);
--  printf(
--"    to be a regional area constraint (but is only applied if the -a switch\n"
--);
--  printf(
--"    is selected).  You may specify just one value after the coordinates,\n");
--  printf(
--"    which can serve as both an attribute and an area constraint, depending\n"
--);
--  printf(
--"    on the choice of switches.  If you are using the -A and -a switches\n");
--  printf(
--"    simultaneously and wish to assign an attribute to some region without\n");
--  printf("    imposing an area constraint, use a negative maximum area.\n\n");
--  printf(
--"    When a triangulation is created from a .poly file, you must either\n");
--  printf(
--"    enclose the entire region to be triangulated in PSLG segments, or\n");
--  printf(
--"    use the -c switch, which automatically creates extra segments that\n");
--  printf(
--"    enclose the convex hull of the PSLG.  If you do not use the -c switch,\n"
--);
--  printf(
--"    Triangle eats all triangles that are not enclosed by segments; if you\n");
--  printf(
--"    are not careful, your whole triangulation may be eaten away.  If you do\n"
--);
--  printf(
--"    use the -c switch, you can still produce concavities by the appropriate\n"
--);
--  printf(
--"    placement of holes just inside the boundary of the convex hull.\n");
--  printf("\n");
--  printf(
--"    An ideal PSLG has no intersecting segments, nor any vertices that lie\n");
--  printf(
--"    upon segments (except, of course, the endpoints of each segment).  You\n"
--);
--  printf(
--"    aren't required to make your .poly files ideal, but you should be aware\n"
--);
--  printf(
--"    of what can go wrong.  Segment intersections are relatively safe--\n");
--  printf(
--"    Triangle calculates the intersection points for you and adds them to\n");
--  printf(
--"    the triangulation--as long as your machine's floating-point precision\n");
--  printf(
--"    doesn't become a problem.  You are tempting the fates if you have three\n"
--);
--  printf(
--"    segments that cross at the same location, and expect Triangle to figure\n"
--);
--  printf(
--"    out where the intersection point is.  Thanks to floating-point roundoff\n"
--);
--  printf(
--"    error, Triangle will probably decide that the three segments intersect\n"
--);
--  printf(
--"    at three different points, and you will find a minuscule triangle in\n");
--  printf(
--"    your output--unless Triangle tries to refine the tiny triangle, uses\n");
--  printf(
--"    up the last bit of machine precision, and fails to terminate at all.\n");
--  printf(
--"    You're better off putting the intersection point in the input files,\n");
--  printf(
--"    and manually breaking up each segment into two.  Similarly, if you\n");
--  printf(
--"    place a vertex at the middle of a segment, and hope that Triangle will\n"
--);
--  printf(
--"    break up the segment at that vertex, you might get lucky.  On the other\n"
--);
--  printf(
--"    hand, Triangle might decide that the vertex doesn't lie precisely on\n");
--  printf(
--"    the segment, and you'll have a needle-sharp triangle in your output--or\n"
--);
--  printf("    a lot of tiny triangles if you're generating a quality mesh.\n");
--  printf("\n");
--  printf(
--"    When Triangle reads a .poly file, it also writes a .poly file, which\n");
--  printf(
--"    includes all the subsegments--the edges that are parts of input\n");
--  printf(
--"    segments.  If the -c switch is used, the output .poly file also\n");
--  printf(
--"    includes all of the edges on the convex hull.  Hence, the output .poly\n"
--);
--  printf(
--"    file is useful for finding edges associated with input segments and for\n"
--);
--  printf(
--"    setting boundary conditions in finite element simulations.  Moreover,\n");
--  printf(
--"    you will need the output .poly file if you plan to refine the output\n");
--  printf(
--"    mesh, and don't want segments to be missing in later triangulations.\n");
--  printf("\n");
--  printf("  .area files:\n");
--  printf("    First line:  <# of triangles>\n");
--  printf("    Following lines:  <triangle #> <maximum area>\n");
--  printf("\n");
--  printf(
--"    An .area file associates with each triangle a maximum area that is used\n"
--);
--  printf(
--"    for mesh refinement.  As with other file formats, every triangle must\n");
--  printf(
--"    be represented, and the triangles must be numbered consecutively.  A\n");
--  printf(
--"    triangle may be left unconstrained by assigning it a negative maximum\n");
--  printf("    area.\n\n");
--  printf("  .edge files:\n");
--  printf("    First line:  <# of edges> <# of boundary markers (0 or 1)>\n");
--  printf(
--"    Following lines:  <edge #> <endpoint> <endpoint> [boundary marker]\n");
--  printf("\n");
--  printf(
--"    Endpoints are indices into the corresponding .node file.  Triangle can\n"
--);
--  printf(
--"    produce .edge files (use the -e switch), but cannot read them.  The\n");
--  printf(
--"    optional column of boundary markers is suppressed by the -B switch.\n");
--  printf("\n");
--  printf(
--"    In Voronoi diagrams, one also finds a special kind of edge that is an\n");
--  printf(
--"    infinite ray with only one endpoint.  For these edges, a different\n");
--  printf("    format is used:\n\n");
--  printf("        <edge #> <endpoint> -1 <direction x> <direction y>\n\n");
--  printf(
--"    The `direction' is a floating-point vector that indicates the direction\n"
--);
--  printf("    of the infinite ray.\n\n");
--  printf("  .neigh files:\n");
--  printf(
--"    First line:  <# of triangles> <# of neighbors per triangle (always 3)>\n"
--);
--  printf(
--"    Following lines:  <triangle #> <neighbor> <neighbor> <neighbor>\n");
--  printf("\n");
--  printf(
--"    Neighbors are indices into the corresponding .ele file.  An index of -1\n"
--);
--  printf(
--"    indicates no neighbor (because the triangle is on an exterior\n");
--  printf(
--"    boundary).  The first neighbor of triangle i is opposite the first\n");
--  printf("    corner of triangle i, and so on.\n\n");
--  printf(
--"    Triangle can produce .neigh files (use the -n switch), but cannot read\n"
--);
--  printf("    them.\n\n");
--  printf("Boundary Markers:\n\n");
--  printf(
--"  Boundary markers are tags used mainly to identify which output vertices\n");
--  printf(
--"  and edges are associated with which PSLG segment, and to identify which\n");
--  printf(
--"  vertices and edges occur on a boundary of the triangulation.  A common\n");
--  printf(
--"  use is to determine where boundary conditions should be applied to a\n");
--  printf(
--"  finite element mesh.  You can prevent boundary markers from being written\n"
--);
--  printf("  into files produced by Triangle by using the -B switch.\n\n");
--  printf(
--"  The boundary marker associated with each segment in an output .poly file\n"
--);
--  printf("  and each edge in an output .edge file is chosen as follows:\n");
--  printf(
--"    - If an output edge is part or all of a PSLG segment with a nonzero\n");
--  printf(
--"      boundary marker, then the edge is assigned the same marker.\n");
--  printf(
--"    - Otherwise, if the edge lies on a boundary of the triangulation\n");
--  printf(
--"      (even the boundary of a hole), then the edge is assigned the marker\n");
--  printf("      one (1).\n");
--  printf("    - Otherwise, the edge is assigned the marker zero (0).\n");
--  printf(
--"  The boundary marker associated with each vertex in an output .node file\n");
--  printf("  is chosen as follows:\n");
--  printf(
--"    - If a vertex is assigned a nonzero boundary marker in the input file,\n"
--);
--  printf(
--"      then it is assigned the same marker in the output .node file.\n");
--  printf(
--"    - Otherwise, if the vertex lies on a PSLG segment (even if it is an\n");
--  printf(
--"      endpoint of the segment) with a nonzero boundary marker, then the\n");
--  printf(
--"      vertex is assigned the same marker.  If the vertex lies on several\n");
--  printf("      such segments, one of the markers is chosen arbitrarily.\n");
--  printf(
--"    - Otherwise, if the vertex occurs on a boundary of the triangulation,\n");
--  printf("      then the vertex is assigned the marker one (1).\n");
--  printf("    - Otherwise, the vertex is assigned the marker zero (0).\n");
--  printf("\n");
--  printf(
--"  If you want Triangle to determine for you which vertices and edges are on\n"
--);
--  printf(
--"  the boundary, assign them the boundary marker zero (or use no markers at\n"
--);
--  printf(
--"  all) in your input files.  In the output files, all boundary vertices,\n");
--  printf("  edges, and segments will be assigned the value one.\n\n");
--  printf("Triangulation Iteration Numbers:\n\n");
--  printf(
--"  Because Triangle can read and refine its own triangulations, input\n");
--  printf(
--"  and output files have iteration numbers.  For instance, Triangle might\n");
--  printf(
--"  read the files mesh.3.node, mesh.3.ele, and mesh.3.poly, refine the\n");
--  printf(
--"  triangulation, and output the files mesh.4.node, mesh.4.ele, and\n");
--  printf("  mesh.4.poly.  Files with no iteration number are treated as if\n");
--  printf(
--"  their iteration number is zero; hence, Triangle might read the file\n");
--  printf(
--"  points.node, triangulate it, and produce the files points.1.node and\n");
--  printf("  points.1.ele.\n\n");
--  printf(
--"  Iteration numbers allow you to create a sequence of successively finer\n");
--  printf(
--"  meshes suitable for multigrid methods.  They also allow you to produce a\n"
--);
--  printf(
--"  sequence of meshes using error estimate-driven mesh refinement.\n");
--  printf("\n");
--  printf(
--"  If you're not using refinement or quality meshing, and you don't like\n");
--  printf(
--"  iteration numbers, use the -I switch to disable them.  This switch also\n");
--  printf(
--"  disables output of .node and .poly files to prevent your input files from\n"
--);
--  printf(
--"  being overwritten.  (If the input is a .poly file that contains its own\n");
--  printf(
--"  points, a .node file is written.  This can be quite convenient for\n");
--  printf("  computing CDTs or quality meshes.)\n\n");
--  printf("Examples of How to Use Triangle:\n\n");
--  printf(
--"  `triangle dots' reads vertices from dots.node, and writes their Delaunay\n"
--);
--  printf(
--"  triangulation to dots.1.node and dots.1.ele.  (dots.1.node is identical\n");
--  printf(
--"  to dots.node.)  `triangle -I dots' writes the triangulation to dots.ele\n");
--  printf(
--"  instead.  (No additional .node file is needed, so none is written.)\n");
--  printf("\n");
--  printf(
--"  `triangle -pe object.1' reads a PSLG from object.1.poly (and possibly\n");
--  printf(
--"  object.1.node, if the vertices are omitted from object.1.poly) and writes\n"
--);
--  printf(
--"  its constrained Delaunay triangulation to object.2.node and object.2.ele.\n"
--);
--  printf(
--"  The segments are copied to object.2.poly, and all edges are written to\n");
--  printf("  object.2.edge.\n\n");
--  printf(
--"  `triangle -pq31.5a.1 object' reads a PSLG from object.poly (and possibly\n"
--);
--  printf(
--"  object.node), generates a mesh whose angles are all between 31.5 and 117\n"
--);
--  printf(
--"  degrees and whose triangles all have areas of 0.1 or less, and writes the\n"
--);
--  printf(
--"  mesh to object.1.node and object.1.ele.  Each segment may be broken up\n");
--  printf("  into multiple subsegments; these are written to object.1.poly.\n");
--  printf("\n");
--  printf(
--"  Here is a sample file `box.poly' describing a square with a square hole:\n"
--);
--  printf("\n");
--  printf(
--"    # A box with eight vertices in 2D, no attributes, one boundary marker.\n"
--);
--  printf("    8 2 0 1\n");
--  printf("     # Outer box has these vertices:\n");
--  printf("     1   0 0   0\n");
--  printf("     2   0 3   0\n");
--  printf("     3   3 0   0\n");
--  printf("     4   3 3   33     # A special marker for this vertex.\n");
--  printf("     # Inner square has these vertices:\n");
--  printf("     5   1 1   0\n");
--  printf("     6   1 2   0\n");
--  printf("     7   2 1   0\n");
--  printf("     8   2 2   0\n");
--  printf("    # Five segments with boundary markers.\n");
--  printf("    5 1\n");
--  printf("     1   1 2   5      # Left side of outer box.\n");
--  printf("     # Square hole has these segments:\n");
--  printf("     2   5 7   0\n");
--  printf("     3   7 8   0\n");
--  printf("     4   8 6   10\n");
--  printf("     5   6 5   0\n");
--  printf("    # One hole in the middle of the inner square.\n");
--  printf("    1\n");
--  printf("     1   1.5 1.5\n");
--  printf("\n");
--  printf(
--"  Note that some segments are missing from the outer square, so you must\n");
--  printf(
--"  use the `-c' switch.  After `triangle -pqc box.poly', here is the output\n"
--);
--  printf(
--"  file `box.1.node', with twelve vertices.  The last four vertices were\n");
--  printf(
--"  added to meet the angle constraint.  Vertices 1, 2, and 9 have markers\n");
--  printf(
--"  from segment 1.  Vertices 6 and 8 have markers from segment 4.  All the\n");
--  printf(
--"  other vertices but 4 have been marked to indicate that they lie on a\n");
--  printf("  boundary.\n\n");
--  printf("    12  2  0  1\n");
--  printf("       1    0   0      5\n");
--  printf("       2    0   3      5\n");
--  printf("       3    3   0      1\n");
--  printf("       4    3   3     33\n");
--  printf("       5    1   1      1\n");
--  printf("       6    1   2     10\n");
--  printf("       7    2   1      1\n");
--  printf("       8    2   2     10\n");
--  printf("       9    0   1.5    5\n");
--  printf("      10    1.5   0    1\n");
--  printf("      11    3   1.5    1\n");
--  printf("      12    1.5   3    1\n");
--  printf("    # Generated by triangle -pqc box.poly\n");
--  printf("\n");
--  printf("  Here is the output file `box.1.ele', with twelve triangles.\n");
--  printf("\n");
--  printf("    12  3  0\n");
--  printf("       1     5   6   9\n");
--  printf("       2    10   3   7\n");
--  printf("       3     6   8  12\n");
--  printf("       4     9   1   5\n");
--  printf("       5     6   2   9\n");
--  printf("       6     7   3  11\n");
--  printf("       7    11   4   8\n");
--  printf("       8     7   5  10\n");
--  printf("       9    12   2   6\n");
--  printf("      10     8   7  11\n");
--  printf("      11     5   1  10\n");
--  printf("      12     8   4  12\n");
--  printf("    # Generated by triangle -pqc box.poly\n\n");
--  printf(
--"  Here is the output file `box.1.poly'.  Note that segments have been added\n"
--);
--  printf(
--"  to represent the convex hull, and some segments have been subdivided by\n");
--  printf(
--"  newly added vertices.  Note also that <# of vertices> is set to zero to\n");
--  printf("  indicate that the vertices should be read from the .node file.\n");
--  printf("\n");
--  printf("    0  2  0  1\n");
--  printf("    12  1\n");
--  printf("       1     1   9     5\n");
--  printf("       2     5   7     1\n");
--  printf("       3     8   7     1\n");
--  printf("       4     6   8    10\n");
--  printf("       5     5   6     1\n");
--  printf("       6     3  10     1\n");
--  printf("       7     4  11     1\n");
--  printf("       8     2  12     1\n");
--  printf("       9     9   2     5\n");
--  printf("      10    10   1     1\n");
--  printf("      11    11   3     1\n");
--  printf("      12    12   4     1\n");
--  printf("    1\n");
--  printf("       1   1.5 1.5\n");
--  printf("    # Generated by triangle -pqc box.poly\n");
--  printf("\n");
--  printf("Refinement and Area Constraints:\n");
--  printf("\n");
--  printf(
--"  The -r switch causes a mesh (.node and .ele files) to be read and\n");
--  printf(
--"  refined.  If the -p switch is also used, a .poly file is read and used to\n"
--);
--  printf(
--"  specify edges that are constrained and cannot be eliminated (although\n");
--  printf(
--"  they can be subdivided into smaller edges) by the refinement process.\n");
--  printf("\n");
--  printf(
--"  When you refine a mesh, you generally want to impose tighter constraints.\n"
--);
--  printf(
--"  One way to accomplish this is to use -q with a larger angle, or -a\n");
--  printf(
--"  followed by a smaller area than you used to generate the mesh you are\n");
--  printf(
--"  refining.  Another way to do this is to create an .area file, which\n");
--  printf(
--"  specifies a maximum area for each triangle, and use the -a switch\n");
--  printf(
--"  (without a number following).  Each triangle's area constraint is applied\n"
--);
--  printf(
--"  to that triangle.  Area constraints tend to diffuse as the mesh is\n");
--  printf(
--"  refined, so if there are large variations in area constraint between\n");
--  printf(
--"  adjacent triangles, you may not get the results you want.  In that case,\n"
--);
--  printf(
--"  consider instead using the -u switch and writing a C procedure that\n");
--  printf("  determines which triangles are too large.\n\n");
--  printf(
--"  If you are refining a mesh composed of linear (three-node) elements, the\n"
--);
--  printf(
--"  output mesh contains all the nodes present in the input mesh, in the same\n"
--);
--  printf(
--"  order, with new nodes added at the end of the .node file.  However, the\n");
--  printf(
--"  refinement is not hierarchical: there is no guarantee that each output\n");
--  printf(
--"  element is contained in a single input element.  Often, an output element\n"
--);
--  printf(
--"  can overlap two or three input elements, and some input edges are not\n");
--  printf(
--"  present in the output mesh.  Hence, a sequence of refined meshes forms a\n"
--);
--  printf(
--"  hierarchy of nodes, but not a hierarchy of elements.  If you refine a\n");
--  printf(
--"  mesh of higher-order elements, the hierarchical property applies only to\n"
--);
--  printf(
--"  the nodes at the corners of an element; the midpoint nodes on each edge\n");
--  printf("  are discarded before the mesh is refined.\n\n");
--  printf(
--"  Maximum area constraints in .poly files operate differently from those in\n"
--);
--  printf(
--"  .area files.  A maximum area in a .poly file applies to the whole\n");
--  printf(
--"  (segment-bounded) region in which a point falls, whereas a maximum area\n");
--  printf(
--"  in an .area file applies to only one triangle.  Area constraints in .poly\n"
--);
--  printf(
--"  files are used only when a mesh is first generated, whereas area\n");
--  printf(
--"  constraints in .area files are used only to refine an existing mesh, and\n"
--);
--  printf(
--"  are typically based on a posteriori error estimates resulting from a\n");
--  printf("  finite element simulation on that mesh.\n\n");
--  printf(
--"  `triangle -rq25 object.1' reads object.1.node and object.1.ele, then\n");
--  printf(
--"  refines the triangulation to enforce a 25 degree minimum angle, and then\n"
--);
--  printf(
--"  writes the refined triangulation to object.2.node and object.2.ele.\n");
--  printf("\n");
--  printf(
--"  `triangle -rpaa6.2 z.3' reads z.3.node, z.3.ele, z.3.poly, and z.3.area.\n"
--);
--  printf(
--"  After reconstructing the mesh and its subsegments, Triangle refines the\n");
--  printf(
--"  mesh so that no triangle has area greater than 6.2, and furthermore the\n");
--  printf(
--"  triangles satisfy the maximum area constraints in z.3.area.  No angle\n");
--  printf(
--"  bound is imposed at all.  The output is written to z.4.node, z.4.ele, and\n"
--);
--  printf("  z.4.poly.\n\n");
--  printf(
--"  The sequence `triangle -qa1 x', `triangle -rqa.3 x.1', `triangle -rqa.1\n");
--  printf(
--"  x.2' creates a sequence of successively finer meshes x.1, x.2, and x.3,\n");
--  printf("  suitable for multigrid.\n\n");
--  printf("Convex Hulls and Mesh Boundaries:\n\n");
--  printf(
--"  If the input is a vertex set (not a PSLG), Triangle produces its convex\n");
--  printf(
--"  hull as a by-product in the output .poly file if you use the -c switch.\n");
--  printf(
--"  There are faster algorithms for finding a two-dimensional convex hull\n");
--  printf("  than triangulation, of course, but this one comes for free.\n\n");
--  printf(
--"  If the input is an unconstrained mesh (you are using the -r switch but\n");
--  printf(
--"  not the -p switch), Triangle produces a list of its boundary edges\n");
--  printf(
--"  (including hole boundaries) as a by-product when you use the -c switch.\n");
--  printf(
--"  If you also use the -p switch, the output .poly file contains all the\n");
--  printf("  segments from the input .poly file as well.\n\n");
--  printf("Voronoi Diagrams:\n\n");
--  printf(
--"  The -v switch produces a Voronoi diagram, in files suffixed .v.node and\n");
--  printf(
--"  .v.edge.  For example, `triangle -v points' reads points.node, produces\n");
--  printf(
--"  its Delaunay triangulation in points.1.node and points.1.ele, and\n");
--  printf(
--"  produces its Voronoi diagram in points.1.v.node and points.1.v.edge.  The\n"
--);
--  printf(
--"  .v.node file contains a list of all Voronoi vertices, and the .v.edge\n");
--  printf(
--"  file contains a list of all Voronoi edges, some of which may be infinite\n"
--);
--  printf(
--"  rays.  (The choice of filenames makes it easy to run the set of Voronoi\n");
--  printf("  vertices through Triangle, if so desired.)\n\n");
--  printf(
--"  This implementation does not use exact arithmetic to compute the Voronoi\n"
--);
--  printf(
--"  vertices, and does not check whether neighboring vertices are identical.\n"
--);
--  printf(
--"  Be forewarned that if the Delaunay triangulation is degenerate or\n");
--  printf(
--"  near-degenerate, the Voronoi diagram may have duplicate vertices or\n");
--  printf("  crossing edges.\n\n");
--  printf(
--"  The result is a valid Voronoi diagram only if Triangle's output is a true\n"
--);
--  printf(
--"  Delaunay triangulation.  The Voronoi output is usually meaningless (and\n");
--  printf(
--"  may contain crossing edges and other pathology) if the output is a CDT or\n"
--);
--  printf(
--"  CCDT, or if it has holes or concavities.  If the triangulated domain is\n");
--  printf(
--"  convex and has no holes, you can use -D switch to force Triangle to\n");
--  printf(
--"  construct a conforming Delaunay triangulation instead of a CCDT, so the\n");
--  printf("  Voronoi diagram will be valid.\n\n");
--  printf("Mesh Topology:\n\n");
--  printf(
--"  You may wish to know which triangles are adjacent to a certain Delaunay\n");
--  printf(
--"  edge in an .edge file, which Voronoi cells are adjacent to a certain\n");
--  printf(
--"  Voronoi edge in a .v.edge file, or which Voronoi cells are adjacent to\n");
--  printf(
--"  each other.  All of this information can be found by cross-referencing\n");
--  printf(
--"  output files with the recollection that the Delaunay triangulation and\n");
--  printf("  the Voronoi diagram are planar duals.\n\n");
--  printf(
--"  Specifically, edge i of an .edge file is the dual of Voronoi edge i of\n");
--  printf(
--"  the corresponding .v.edge file, and is rotated 90 degrees counterclock-\n");
--  printf(
--"  wise from the Voronoi edge.  Triangle j of an .ele file is the dual of\n");
--  printf(
--"  vertex j of the corresponding .v.node file.  Voronoi cell k is the dual\n");
--  printf("  of vertex k of the corresponding .node file.\n\n");
--  printf(
--"  Hence, to find the triangles adjacent to a Delaunay edge, look at the\n");
--  printf(
--"  vertices of the corresponding Voronoi edge.  If the endpoints of a\n");
--  printf(
--"  Voronoi edge are Voronoi vertices 2 and 6 respectively, then triangles 2\n"
--);
--  printf(
--"  and 6 adjoin the left and right sides of the corresponding Delaunay edge,\n"
--);
--  printf(
--"  respectively.  To find the Voronoi cells adjacent to a Voronoi edge, look\n"
--);
--  printf(
--"  at the endpoints of the corresponding Delaunay edge.  If the endpoints of\n"
--);
--  printf(
--"  a Delaunay edge are input vertices 7 and 12, then Voronoi cells 7 and 12\n"
--);
--  printf(
--"  adjoin the right and left sides of the corresponding Voronoi edge,\n");
--  printf(
--"  respectively.  To find which Voronoi cells are adjacent to each other,\n");
--  printf("  just read the list of Delaunay edges.\n\n");
--  printf(
--"  Triangle does not write a list of the edges adjoining each Voronoi cell,\n"
--);
--  printf(
--"  but you can reconstructed it straightforwardly.  For instance, to find\n");
--  printf(
--"  all the edges of Voronoi cell 1, search the output .edge file for every\n");
--  printf(
--"  edge that has input vertex 1 as an endpoint.  The corresponding dual\n");
--  printf(
--"  edges in the output .v.edge file form the boundary of Voronoi cell 1.\n");
--  printf("\n");
--  printf(
--"  For each Voronoi vertex, the .neigh file gives a list of the three\n");
--  printf(
--"  Voronoi vertices attached to it.  You might find this more convenient\n");
--  printf("  than the .v.edge file.\n\n");
--  printf("Quadratic Elements:\n\n");
--  printf(
--"  Triangle generates meshes with subparametric quadratic elements if the\n");
--  printf(
--"  -o2 switch is specified.  Quadratic elements have six nodes per element,\n"
--);
--  printf(
--"  rather than three.  `Subparametric' means that the edges of the triangles\n"
--);
--  printf(
--"  are always straight, so that subparametric quadratic elements are\n");
--  printf(
--"  geometrically identical to linear elements, even though they can be used\n"
--);
--  printf(
--"  with quadratic interpolating functions.  The three extra nodes of an\n");
--  printf(
--"  element fall at the midpoints of the three edges, with the fourth, fifth,\n"
--);
--  printf(
--"  and sixth nodes appearing opposite the first, second, and third corners\n");
--  printf("  respectively.\n\n");
--  printf("Domains with Small Angles:\n\n");
--  printf(
--"  If two input segments adjoin each other at a small angle, clearly the -q\n"
--);
--  printf(
--"  switch cannot remove the small angle.  Moreover, Triangle may have no\n");
--  printf(
--"  choice but to generate additional triangles whose smallest angles are\n");
--  printf(
--"  smaller than the specified bound.  However, these triangles only appear\n");
--  printf(
--"  between input segments separated by small angles.  Moreover, if you\n");
--  printf(
--"  request a minimum angle of theta degrees, Triangle will generally produce\n"
--);
--  printf(
--"  no angle larger than 180 - 2 theta, even if it is forced to compromise on\n"
--);
--  printf("  the minimum angle.\n\n");
--  printf("Statistics:\n\n");
--  printf(
--"  After generating a mesh, Triangle prints a count of entities in the\n");
--  printf(
--"  output mesh, including the number of vertices, triangles, edges, exterior\n"
--);
--  printf(
--"  boundary edges (i.e. subsegments on the boundary of the triangulation,\n");
--  printf(
--"  including hole boundaries), interior boundary edges (i.e. subsegments of\n"
--);
--  printf(
--"  input segments not on the boundary), and total subsegments.  If you've\n");
--  printf(
--"  forgotten the statistics for an existing mesh, run Triangle on that mesh\n"
--);
--  printf(
--"  with the -rNEP switches to read the mesh and print the statistics without\n"
--);
--  printf(
--"  writing any files.  Use -rpNEP if you've got a .poly file for the mesh.\n");
--  printf("\n");
--  printf(
--"  The -V switch produces extended statistics, including a rough estimate\n");
--  printf(
--"  of memory use, the number of calls to geometric predicates, and\n");
--  printf(
--"  histograms of the angles and the aspect ratios of the triangles in the\n");
--  printf("  mesh.\n\n");
--  printf("Exact Arithmetic:\n\n");
--  printf(
--"  Triangle uses adaptive exact arithmetic to perform what computational\n");
--  printf(
--"  geometers call the `orientation' and `incircle' tests.  If the floating-\n"
--);
--  printf(
--"  point arithmetic of your machine conforms to the IEEE 754 standard (as\n");
--  printf(
--"  most workstations do), and does not use extended precision internal\n");
--  printf(
--"  floating-point registers, then your output is guaranteed to be an\n");
--  printf(
--"  absolutely true Delaunay or constrained Delaunay triangulation, roundoff\n"
--);
--  printf(
--"  error notwithstanding.  The word `adaptive' implies that these arithmetic\n"
--);
--  printf(
--"  routines compute the result only to the precision necessary to guarantee\n"
--);
--  printf(
--"  correctness, so they are usually nearly as fast as their approximate\n");
--  printf("  counterparts.\n\n");
--  printf(
--"  May CPUs, including Intel x86 processors, have extended precision\n");
--  printf(
--"  floating-point registers.  These must be reconfigured so their precision\n"
--);
--  printf(
--"  is reduced to memory precision.  Triangle does this if it is compiled\n");
--  printf("  correctly.  See the makefile for details.\n\n");
--  printf(
--"  The exact tests can be disabled with the -X switch.  On most inputs, this\n"
--);
--  printf(
--"  switch reduces the computation time by about eight percent--it's not\n");
--  printf(
--"  worth the risk.  There are rare difficult inputs (having many collinear\n");
--  printf(
--"  and cocircular vertices), however, for which the difference in speed\n");
--  printf(
--"  could be a factor of two.  Be forewarned that these are precisely the\n");
--  printf(
--"  inputs most likely to cause errors if you use the -X switch.  Hence, the\n"
--);
--  printf("  -X switch is not recommended.\n\n");
--  printf(
--"  Unfortunately, the exact tests don't solve every numerical problem.\n");
--  printf(
--"  Exact arithmetic is not used to compute the positions of new vertices,\n");
--  printf(
--"  because the bit complexity of vertex coordinates would grow without\n");
--  printf(
--"  bound.  Hence, segment intersections aren't computed exactly; in very\n");
--  printf(
--"  unusual cases, roundoff error in computing an intersection point might\n");
--  printf(
--"  actually lead to an inverted triangle and an invalid triangulation.\n");
--  printf(
--"  (This is one reason to specify your own intersection points in your .poly\n"
--);
--  printf(
--"  files.)  Similarly, exact arithmetic is not used to compute the vertices\n"
--);
--  printf("  of the Voronoi diagram.\n\n");
--  printf(
--"  Another pair of problems not solved by the exact arithmetic routines is\n");
--  printf(
--"  underflow and overflow.  If Triangle is compiled for double precision\n");
--  printf(
--"  arithmetic, I believe that Triangle's geometric predicates work correctly\n"
--);
--  printf(
--"  if the exponent of every input coordinate falls in the range [-148, 201].\n"
--);
--  printf(
--"  Underflow can silently prevent the orientation and incircle tests from\n");
--  printf(
--"  being performed exactly, while overflow typically causes a floating\n");
--  printf("  exception.\n\n");
--  printf("Calling Triangle from Another Program:\n\n");
--  printf("  Read the file triangle.h for details.\n\n");
--  printf("Troubleshooting:\n\n");
--  printf("  Please read this section before mailing me bugs.\n\n");
--  printf("  `My output mesh has no triangles!'\n\n");
--  printf(
--"    If you're using a PSLG, you've probably failed to specify a proper set\n"
--);
--  printf(
--"    of bounding segments, or forgotten to use the -c switch.  Or you may\n");
--  printf(
--"    have placed a hole badly, thereby eating all your triangles.  To test\n");
--  printf("    these possibilities, try again with the -c and -O switches.\n");
--  printf(
--"    Alternatively, all your input vertices may be collinear, in which case\n"
--);
--  printf("    you can hardly expect to triangulate them.\n\n");
--  printf("  `Triangle doesn't terminate, or just crashes.'\n\n");
--  printf(
--"    Bad things can happen when triangles get so small that the distance\n");
--  printf(
--"    between their vertices isn't much larger than the precision of your\n");
--  printf(
--"    machine's arithmetic.  If you've compiled Triangle for single-precision\n"
--);
--  printf(
--"    arithmetic, you might do better by recompiling it for double-precision.\n"
--);
--  printf(
--"    Then again, you might just have to settle for more lenient constraints\n"
--);
--  printf(
--"    on the minimum angle and the maximum area than you had planned.\n");
--  printf("\n");
--  printf(
--"    You can minimize precision problems by ensuring that the origin lies\n");
--  printf(
--"    inside your vertex set, or even inside the densest part of your\n");
--  printf(
--"    mesh.  If you're triangulating an object whose x-coordinates all fall\n");
--  printf(
--"    between 6247133 and 6247134, you're not leaving much floating-point\n");
--  printf("    precision for Triangle to work with.\n\n");
--  printf(
--"    Precision problems can occur covertly if the input PSLG contains two\n");
--  printf(
--"    segments that meet (or intersect) at an extremely small angle, or if\n");
--  printf(
--"    such an angle is introduced by the -c switch.  If you don't realize\n");
--  printf(
--"    that a tiny angle is being formed, you might never discover why\n");
--  printf(
--"    Triangle is crashing.  To check for this possibility, use the -S switch\n"
--);
--  printf(
--"    (with an appropriate limit on the number of Steiner points, found by\n");
--  printf(
--"    trial-and-error) to stop Triangle early, and view the output .poly file\n"
--);
--  printf(
--"    with Show Me (described below).  Look carefully for regions where dense\n"
--);
--  printf(
--"    clusters of vertices are forming and for small angles between segments.\n"
--);
--  printf(
--"    Zoom in closely, as such segments might look like a single segment from\n"
--);
--  printf("    a distance.\n\n");
--  printf(
--"    If some of the input values are too large, Triangle may suffer a\n");
--  printf(
--"    floating exception due to overflow when attempting to perform an\n");
--  printf(
--"    orientation or incircle test.  (Read the section on exact arithmetic\n");
--  printf(
--"    above.)  Again, I recommend compiling Triangle for double (rather\n");
--  printf("    than single) precision arithmetic.\n\n");
--  printf(
--"    Unexpected problems can arise if you use quality meshing (-q, -a, or\n");
--  printf(
--"    -u) with an input that is not segment-bounded--that is, if your input\n");
--  printf(
--"    is a vertex set, or you're using the -c switch.  If the convex hull of\n"
--);
--  printf(
--"    your input vertices has collinear vertices on its boundary, an input\n");
--  printf(
--"    vertex that you think lies on the convex hull might actually lie just\n");
--  printf(
--"    inside the convex hull.  If so, the vertex and the nearby convex hull\n");
--  printf(
--"    edge form an extremely thin triangle.  When Triangle tries to refine\n");
--  printf(
--"    the mesh to enforce angle and area constraints, Triangle might generate\n"
--);
--  printf(
--"    extremely tiny triangles, or it might fail because of insufficient\n");
--  printf("    floating-point precision.\n\n");
--  printf(
--"  `The numbering of the output vertices doesn't match the input vertices.'\n"
--);
--  printf("\n");
--  printf(
--"    You may have had duplicate input vertices, or you may have eaten some\n");
--  printf(
--"    of your input vertices with a hole, or by placing them outside the area\n"
--);
--  printf(
--"    enclosed by segments.  In any case, you can solve the problem by not\n");
--  printf("    using the -j switch.\n\n");
--  printf(
--"  `Triangle executes without incident, but when I look at the resulting\n");
--  printf(
--"  mesh, it has overlapping triangles or other geometric inconsistencies.'\n");
--  printf("\n");
--  printf(
--"    If you select the -X switch, Triangle occasionally makes mistakes due\n");
--  printf(
--"    to floating-point roundoff error.  Although these errors are rare,\n");
--  printf(
--"    don't use the -X switch.  If you still have problems, please report the\n"
--);
--  printf("    bug.\n\n");
--  printf(
--"  `Triangle executes without incident, but when I look at the resulting\n");
--  printf("  Voronoi diagram, it has overlapping edges or other geometric\n");
--  printf("  inconsistencies.'\n");
--  printf("\n");
--  printf(
--"    If your input is a PSLG (-p), you can only expect a meaningful Voronoi\n"
--);
--  printf(
--"    diagram if the domain you are triangulating is convex and free of\n");
--  printf(
--"    holes, and you use the -D switch to construct a conforming Delaunay\n");
--  printf("    triangulation (instead of a CDT or CCDT).\n\n");
--  printf(
--"  Strange things can happen if you've taken liberties with your PSLG.  Do\n");
--  printf(
--"  you have a vertex lying in the middle of a segment?  Triangle sometimes\n");
--  printf(
--"  copes poorly with that sort of thing.  Do you want to lay out a collinear\n"
--);
--  printf(
--"  row of evenly spaced, segment-connected vertices?  Have you simply\n");
--  printf(
--"  defined one long segment connecting the leftmost vertex to the rightmost\n"
--);
--  printf(
--"  vertex, and a bunch of vertices lying along it?  This method occasionally\n"
--);
--  printf(
--"  works, especially with horizontal and vertical lines, but often it\n");
--  printf(
--"  doesn't, and you'll have to connect each adjacent pair of vertices with a\n"
--);
--  printf("  separate segment.  If you don't like it, tough.\n\n");
--  printf(
--"  Furthermore, if you have segments that intersect other than at their\n");
--  printf(
--"  endpoints, try not to let the intersections fall extremely close to PSLG\n"
--);
--  printf("  vertices or each other.\n\n");
--  printf(
--"  If you have problems refining a triangulation not produced by Triangle:\n");
--  printf(
--"  Are you sure the triangulation is geometrically valid?  Is it formatted\n");
--  printf(
--"  correctly for Triangle?  Are the triangles all listed so the first three\n"
--);
--  printf(
--"  vertices are their corners in counterclockwise order?  Are all of the\n");
--  printf(
--"  triangles constrained Delaunay?  Triangle's Delaunay refinement algorithm\n"
--);
--  printf("  assumes that it starts with a CDT.\n\n");
--  printf("Show Me:\n\n");
--  printf(
--"  Triangle comes with a separate program named `Show Me', whose primary\n");
--  printf(
--"  purpose is to draw meshes on your screen or in PostScript.  Its secondary\n"
--);
--  printf(
--"  purpose is to check the validity of your input files, and do so more\n");
--  printf(
--"  thoroughly than Triangle does.  Unlike Triangle, Show Me requires that\n");
--  printf(
--"  you have the X Windows system.  Sorry, Microsoft Windows users.\n");
--  printf("\n");
--  printf("Triangle on the Web:\n");
--  printf("\n");
--  printf("  To see an illustrated version of these instructions, check out\n");
--  printf("\n");
--  printf("    http://www.cs.cmu.edu/~quake/triangle.html\n");
--  printf("\n");
--  printf("A Brief Plea:\n");
--  printf("\n");
--  printf(
--"  If you use Triangle, and especially if you use it to accomplish real\n");
--  printf(
--"  work, I would like very much to hear from you.  A short letter or email\n");
--  printf(
--"  (to jrs@cs.berkeley.edu) describing how you use Triangle will mean a lot\n"
--);
--  printf(
--"  to me.  The more people I know are using this program, the more easily I\n"
--);
--  printf(
--"  can justify spending time on improvements, which in turn will benefit\n");
--  printf(
--"  you.  Also, I can put you on a list to receive email whenever a new\n");
--  printf("  version of Triangle is available.\n\n");
--  printf(
--"  If you use a mesh generated by Triangle in a publication, please include\n"
--);
--  printf(
--"  an acknowledgment as well.  And please spell Triangle with a capital `T'!\n"
--);
--  printf(
--"  If you want to include a citation, use `Jonathan Richard Shewchuk,\n");
--  printf(
--"  ``Triangle: Engineering a 2D Quality Mesh Generator and Delaunay\n");
--  printf(
--"  Triangulator,'' in Applied Computational Geometry:  Towards Geometric\n");
--  printf(
--"  Engineering (Ming C. Lin and Dinesh Manocha, editors), volume 1148 of\n");
--  printf(
--"  Lecture Notes in Computer Science, pages 203-222, Springer-Verlag,\n");
--  printf(
--"  Berlin, May 1996.  (From the First ACM Workshop on Applied Computational\n"
--);
--  printf("  Geometry.)'\n\n");
--  printf("Research credit:\n\n");
--  printf(
--"  Of course, I can take credit for only a fraction of the ideas that made\n");
--  printf(
--"  this mesh generator possible.  Triangle owes its existence to the efforts\n"
--);
--  printf(
--"  of many fine computational geometers and other researchers, including\n");
--  printf(
--"  Marshall Bern, L. Paul Chew, Kenneth L. Clarkson, Boris Delaunay, Rex A.\n"
--);
--  printf(
--"  Dwyer, David Eppstein, Steven Fortune, Leonidas J. Guibas, Donald E.\n");
--  printf(
--"  Knuth, Charles L. Lawson, Der-Tsai Lee, Gary L. Miller, Ernst P. Mucke,\n");
--  printf(
--"  Steven E. Pav, Douglas M. Priest, Jim Ruppert, Isaac Saias, Bruce J.\n");
--  printf(
--"  Schachter, Micha Sharir, Peter W. Shor, Daniel D. Sleator, Jorge Stolfi,\n"
--);
--  printf("  Robert E. Tarjan, Alper Ungor, Christopher J. Van Wyk, Noel J.\n");
--  printf(
--"  Walkington, and Binhai Zhu.  See the comments at the beginning of the\n");
--  printf("  source code for references.\n\n");
--  triexit(0);
--}
--
--#endif /* not TRILIBRARY */
--
--/*****************************************************************************/
--/*                                                                           */
--/*  internalerror()   Ask the user to send me the defective product.  Exit.  */
--/*                                                                           */
--/*****************************************************************************/
--
--void internalerror()
--{
--  printf("  Please report this bug to jrs@cs.berkeley.edu\n");
--  printf("  Include the message above, your input data set, and the exact\n");
--  printf("    command line you used to run Triangle.\n");
--  triexit(1);
--}
--
--/*****************************************************************************/
--/*                                                                           */
--/*  parsecommandline()   Read the command line, identify switches, and set   */
--/*                       up options and file names.                          */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifdef ANSI_DECLARATORS
--void parsecommandline(int argc, const char * const * const argv, struct behavior *b)
--#else /* not ANSI_DECLARATORS */
--void parsecommandline(argc, argv, b)
--int argc;
--const char * const * const argv;
--struct behavior *b;
--#endif /* not ANSI_DECLARATORS */
--
--{
--#ifdef TRILIBRARY
--#define STARTINDEX 0
--#else /* not TRILIBRARY */
--#define STARTINDEX 1
--  int increment;
--  int meshnumber;
--#endif /* not TRILIBRARY */
--  int i, j, k;
--  char workstring[FILENAMESIZE];
--
--  b->poly = b->refine = b->quality = 0;
--  b->vararea = b->fixedarea = b->usertest = 0;
--  b->regionattrib = b->convex = b->weighted = b->jettison = 0;
--  b->firstnumber = 1;
--  b->edgesout = b->voronoi = b->neighbors = b->geomview = 0;
--  b->nobound = b->nopolywritten = b->nonodewritten = b->noelewritten = 0;
--  b->noiterationnum = 0;
--  b->noholes = b->noexact = 0;
--  b->incremental = b->sweepline = 0;
--  b->dwyer = 1;
--  b->splitseg = 0;
--  b->docheck = 0;
--  b->nobisect = 0;
--  b->conformdel = 0;
--  b->steiner = -1;
--  b->order = 1;
--  b->minangle = 0.0;
--  b->maxarea = -1.0;
--  b->quiet = b->verbose = 0;
--#ifndef TRILIBRARY
--  b->innodefilename[0] = '\0';
--#endif /* not TRILIBRARY */
--
--  for (i = STARTINDEX; i < argc; i++) {
--#ifndef TRILIBRARY
--    if (argv[i][0] == '-') {
--#endif /* not TRILIBRARY */
--      for (j = STARTINDEX; argv[i][j] != '\0'; j++) {
--        if (argv[i][j] == 'p') {
--          b->poly = 1;
--        }
--#ifndef CDT_ONLY
--        if (argv[i][j] == 'r') {
--          b->refine = 1;
--        }
--        if (argv[i][j] == 'q') {
--          b->quality = 1;
--          if (((argv[i][j + 1] >= '0') && (argv[i][j + 1] <= '9')) ||
--              (argv[i][j + 1] == '.')) {
--            k = 0;
--            while (((argv[i][j + 1] >= '0') && (argv[i][j + 1] <= '9')) ||
--                   (argv[i][j + 1] == '.')) {
--              j++;
--              workstring[k] = argv[i][j];
--              k++;
--            }
--            workstring[k] = '\0';
--            b->minangle = (REAL) strtod(workstring, (char **) NULL);
--          } else {
--            b->minangle = 20.0;
--          }
--        }
--        if (argv[i][j] == 'a') {
--          b->quality = 1;
--          if (((argv[i][j + 1] >= '0') && (argv[i][j + 1] <= '9')) ||
--              (argv[i][j + 1] == '.')) {
--            b->fixedarea = 1;
--            k = 0;
--            while (((argv[i][j + 1] >= '0') && (argv[i][j + 1] <= '9')) ||
--                   (argv[i][j + 1] == '.')) {
--              j++;
--              workstring[k] = argv[i][j];
--              k++;
--            }
--            workstring[k] = '\0';
--            b->maxarea = (REAL) strtod(workstring, (char **) NULL);
--            if (b->maxarea <= 0.0) {
--              printf("Error:  Maximum area must be greater than zero.\n");
--              triexit(1);
--            }
--          } else {
--            b->vararea = 1;
--          }
--        }
--        if (argv[i][j] == 'u') {
--          b->quality = 1;
--          b->usertest = 1;
--        }
--#endif /* not CDT_ONLY */
--        if (argv[i][j] == 'A') {
--          b->regionattrib = 1;
--        }
--        if (argv[i][j] == 'c') {
--          b->convex = 1;
--        }
--        if (argv[i][j] == 'w') {
--          b->weighted = 1;
--        }
--        if (argv[i][j] == 'W') {
--          b->weighted = 2;
--        }
--        if (argv[i][j] == 'j') {
--          b->jettison = 1;
--        }
--        if (argv[i][j] == 'z') {
--          b->firstnumber = 0;
--        }
--        if (argv[i][j] == 'e') {
--          b->edgesout = 1;
--        }
--        if (argv[i][j] == 'v') {
--          b->voronoi = 1;
--        }
--        if (argv[i][j] == 'n') {
--          b->neighbors = 1;
--        }
--        if (argv[i][j] == 'g') {
--          b->geomview = 1;
--        }
--        if (argv[i][j] == 'B') {
--          b->nobound = 1;
--        }
--        if (argv[i][j] == 'P') {
--          b->nopolywritten = 1;
--        }
--        if (argv[i][j] == 'N') {
--          b->nonodewritten = 1;
--        }
--        if (argv[i][j] == 'E') {
--          b->noelewritten = 1;
--        }
--#ifndef TRILIBRARY
--        if (argv[i][j] == 'I') {
--          b->noiterationnum = 1;
--        }
--#endif /* not TRILIBRARY */
--        if (argv[i][j] == 'O') {
--          b->noholes = 1;
--        }
--        if (argv[i][j] == 'X') {
--          b->noexact = 1;
--        }
--        if (argv[i][j] == 'o') {
--          if (argv[i][j + 1] == '2') {
--            j++;
--            b->order = 2;
--          }
--        }
--#ifndef CDT_ONLY
--        if (argv[i][j] == 'Y') {
--          b->nobisect++;
--        }
--        if (argv[i][j] == 'S') {
--          b->steiner = 0;
--          while ((argv[i][j + 1] >= '0') && (argv[i][j + 1] <= '9')) {
--            j++;
--            b->steiner = b->steiner * 10 + (int) (argv[i][j] - '0');
--          }
--        }
--#endif /* not CDT_ONLY */
--#ifndef REDUCED
--        if (argv[i][j] == 'i') {
--          b->incremental = 1;
--        }
--        if (argv[i][j] == 'F') {
--          b->sweepline = 1;
--        }
--#endif /* not REDUCED */
--        if (argv[i][j] == 'l') {
--          b->dwyer = 0;
--        }
--#ifndef REDUCED
--#ifndef CDT_ONLY
--        if (argv[i][j] == 's') {
--          b->splitseg = 1;
--        }
--        if ((argv[i][j] == 'D') || (argv[i][j] == 'L')) {
--          b->quality = 1;
--          b->conformdel = 1;
--        }
--#endif /* not CDT_ONLY */
--        if (argv[i][j] == 'C') {
--          b->docheck = 1;
--        }
--#endif /* not REDUCED */
--        if (argv[i][j] == 'Q') {
--          b->quiet = 1;
--        }
--        if (argv[i][j] == 'V') {
--          b->verbose++;
--        }
--#ifndef TRILIBRARY
--        if ((argv[i][j] == 'h') || (argv[i][j] == 'H') ||
--            (argv[i][j] == '?')) {
--          info();
--        }
--#endif /* not TRILIBRARY */
--      }
--#ifndef TRILIBRARY
--    } else {
--      strncpy(b->innodefilename, argv[i], FILENAMESIZE - 1);
--      b->innodefilename[FILENAMESIZE - 1] = '\0';
--    }
--#endif /* not TRILIBRARY */
--  }
--#ifndef TRILIBRARY
--  if (b->innodefilename[0] == '\0') {
--    syntax();
--  }
--  if (!strcmp(&b->innodefilename[strlen(b->innodefilename) - 5], ".node")) {
--    b->innodefilename[strlen(b->innodefilename) - 5] = '\0';
--  }
--  if (!strcmp(&b->innodefilename[strlen(b->innodefilename) - 5], ".poly")) {
--    b->innodefilename[strlen(b->innodefilename) - 5] = '\0';
--    b->poly = 1;
--  }
--#ifndef CDT_ONLY
--  if (!strcmp(&b->innodefilename[strlen(b->innodefilename) - 4], ".ele")) {
--    b->innodefilename[strlen(b->innodefilename) - 4] = '\0';
--    b->refine = 1;
--  }
--  if (!strcmp(&b->innodefilename[strlen(b->innodefilename) - 5], ".area")) {
--    b->innodefilename[strlen(b->innodefilename) - 5] = '\0';
--    b->refine = 1;
--    b->quality = 1;
--    b->vararea = 1;
--  }
--#endif /* not CDT_ONLY */
--#endif /* not TRILIBRARY */
--  b->usesegments = b->poly || b->refine || b->quality || b->convex;
--  b->goodangle = cos(b->minangle * PI / 180.0);
--  if (b->goodangle == 1.0) {
--    b->offconstant = 0.0;
--  } else {
--    b->offconstant = 0.475 * sqrt((1.0 + b->goodangle) / (1.0 - b->goodangle));
--  }
--  b->goodangle *= b->goodangle;
--  if (b->refine && b->noiterationnum) {
--    printf(
--      "Error:  You cannot use the -I switch when refining a triangulation.\n");
--    triexit(1);
--  }
--  /* Be careful not to allocate space for element area constraints that */
--  /*   will never be assigned any value (other than the default -1.0).  */
--  if (!b->refine && !b->poly) {
--    b->vararea = 0;
--  }
--  /* Be careful not to add an extra attribute to each element unless the */
--  /*   input supports it (PSLG in, but not refining a preexisting mesh). */
--  if (b->refine || !b->poly) {
--    b->regionattrib = 0;
--  }
--  /* Regular/weighted triangulations are incompatible with PSLGs */
--  /*   and meshing.                                              */
--  if (b->weighted && (b->poly || b->quality)) {
--    b->weighted = 0;
--    if (!b->quiet) {
--      printf("Warning:  weighted triangulations (-w, -W) are incompatible\n");
--      printf("  with PSLGs (-p) and meshing (-q, -a, -u).  Weights ignored.\n"
--             );
--    }
--  }
--  if (b->jettison && b->nonodewritten && !b->quiet) {
--    printf("Warning:  -j and -N switches are somewhat incompatible.\n");
--    printf("  If any vertices are jettisoned, you will need the output\n");
--    printf("  .node file to reconstruct the new node indices.");
--  }
--
--#ifndef TRILIBRARY
--  strcpy(b->inpolyfilename, b->innodefilename);
--  strcpy(b->inelefilename, b->innodefilename);
--  strcpy(b->areafilename, b->innodefilename);
--  increment = 0;
--  strcpy(workstring, b->innodefilename);
--  j = 1;
--  while (workstring[j] != '\0') {
--    if ((workstring[j] == '.') && (workstring[j + 1] != '\0')) {
--      increment = j + 1;
--    }
--    j++;
--  }
--  meshnumber = 0;
--  if (increment > 0) {
--    j = increment;
--    do {
--      if ((workstring[j] >= '0') && (workstring[j] <= '9')) {
--        meshnumber = meshnumber * 10 + (int) (workstring[j] - '0');
--      } else {
--        increment = 0;
--      }
--      j++;
--    } while (workstring[j] != '\0');
--  }
--  if (b->noiterationnum) {
--    strcpy(b->outnodefilename, b->innodefilename);
--    strcpy(b->outelefilename, b->innodefilename);
--    strcpy(b->edgefilename, b->innodefilename);
--    strcpy(b->vnodefilename, b->innodefilename);
--    strcpy(b->vedgefilename, b->innodefilename);
--    strcpy(b->neighborfilename, b->innodefilename);
--    strcpy(b->offfilename, b->innodefilename);
--    strcat(b->outnodefilename, ".node");
--    strcat(b->outelefilename, ".ele");
--    strcat(b->edgefilename, ".edge");
--    strcat(b->vnodefilename, ".v.node");
--    strcat(b->vedgefilename, ".v.edge");
--    strcat(b->neighborfilename, ".neigh");
--    strcat(b->offfilename, ".off");
--  } else if (increment == 0) {
--    strcpy(b->outnodefilename, b->innodefilename);
--    strcpy(b->outpolyfilename, b->innodefilename);
--    strcpy(b->outelefilename, b->innodefilename);
--    strcpy(b->edgefilename, b->innodefilename);
--    strcpy(b->vnodefilename, b->innodefilename);
--    strcpy(b->vedgefilename, b->innodefilename);
--    strcpy(b->neighborfilename, b->innodefilename);
--    strcpy(b->offfilename, b->innodefilename);
--    strcat(b->outnodefilename, ".1.node");
--    strcat(b->outpolyfilename, ".1.poly");
--    strcat(b->outelefilename, ".1.ele");
--    strcat(b->edgefilename, ".1.edge");
--    strcat(b->vnodefilename, ".1.v.node");
--    strcat(b->vedgefilename, ".1.v.edge");
--    strcat(b->neighborfilename, ".1.neigh");
--    strcat(b->offfilename, ".1.off");
--  } else {
--    workstring[increment] = '%';
--    workstring[increment + 1] = 'd';
--    workstring[increment + 2] = '\0';
--    sprintf(b->outnodefilename, workstring, meshnumber + 1);
--    strcpy(b->outpolyfilename, b->outnodefilename);
--    strcpy(b->outelefilename, b->outnodefilename);
--    strcpy(b->edgefilename, b->outnodefilename);
--    strcpy(b->vnodefilename, b->outnodefilename);
--    strcpy(b->vedgefilename, b->outnodefilename);
--    strcpy(b->neighborfilename, b->outnodefilename);
--    strcpy(b->offfilename, b->outnodefilename);
--    strcat(b->outnodefilename, ".node");
--    strcat(b->outpolyfilename, ".poly");
--    strcat(b->outelefilename, ".ele");
--    strcat(b->edgefilename, ".edge");
--    strcat(b->vnodefilename, ".v.node");
--    strcat(b->vedgefilename, ".v.edge");
--    strcat(b->neighborfilename, ".neigh");
--    strcat(b->offfilename, ".off");
--  }
--  strcat(b->innodefilename, ".node");
--  strcat(b->inpolyfilename, ".poly");
--  strcat(b->inelefilename, ".ele");
--  strcat(b->areafilename, ".area");
--#endif /* not TRILIBRARY */
--}
--
--/**                                                                         **/
--/**                                                                         **/
--/********* User interaction routines begin here                      *********/
--
--/********* Debugging routines begin here                             *********/
--/**                                                                         **/
--/**                                                                         **/
--
--/*****************************************************************************/
--/*                                                                           */
--/*  printtriangle()   Print out the details of an oriented triangle.         */
--/*                                                                           */
--/*  I originally wrote this procedure to simplify debugging; it can be       */
--/*  called directly from the debugger, and presents information about an     */
--/*  oriented triangle in digestible form.  It's also used when the           */
--/*  highest level of verbosity (`-VVV') is specified.                        */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifdef ANSI_DECLARATORS
--void printtriangle(struct mesh *m, struct behavior *b, struct otri *t)
--#else /* not ANSI_DECLARATORS */
--void printtriangle(m, b, t)
--struct mesh *m;
--struct behavior *b;
--struct otri *t;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  struct otri printtri;
--  struct osub printsh;
--  vertex printvertex;
--
--  printf("triangle x%lx with orientation %d:\n", (TRIANGLE_PTRINT) t->tri,
--         t->orient);
--  decode(t->tri[0], printtri);
--  if (printtri.tri == m->dummytri) {
--    printf("    [0] = Outer space\n");
--  } else {
--    printf("    [0] = x%lx  %d\n", (TRIANGLE_PTRINT) printtri.tri,
--           printtri.orient);
--  }
--  decode(t->tri[1], printtri);
--  if (printtri.tri == m->dummytri) {
--    printf("    [1] = Outer space\n");
--  } else {
--    printf("    [1] = x%lx  %d\n", (TRIANGLE_PTRINT) printtri.tri,
--           printtri.orient);
--  }
--  decode(t->tri[2], printtri);
--  if (printtri.tri == m->dummytri) {
--    printf("    [2] = Outer space\n");
--  } else {
--    printf("    [2] = x%lx  %d\n", (TRIANGLE_PTRINT) printtri.tri,
--           printtri.orient);
--  }
--
--  org(*t, printvertex);
--  if (printvertex == (vertex) NULL)
--    printf("    Origin[%d] = NULL\n", (t->orient + 1) % 3 + 3);
--  else
--    printf("    Origin[%d] = x%lx  (%.12g, %.12g)\n",
--           (t->orient + 1) % 3 + 3, (TRIANGLE_PTRINT) printvertex,
--           printvertex[0], printvertex[1]);
--  dest(*t, printvertex);
--  if (printvertex == (vertex) NULL)
--    printf("    Dest  [%d] = NULL\n", (t->orient + 2) % 3 + 3);
--  else
--    printf("    Dest  [%d] = x%lx  (%.12g, %.12g)\n",
--           (t->orient + 2) % 3 + 3, (TRIANGLE_PTRINT) printvertex,
--           printvertex[0], printvertex[1]);
--  apex(*t, printvertex);
--  if (printvertex == (vertex) NULL)
--    printf("    Apex  [%d] = NULL\n", t->orient + 3);
--  else
--    printf("    Apex  [%d] = x%lx  (%.12g, %.12g)\n",
--           t->orient + 3, (TRIANGLE_PTRINT) printvertex,
--           printvertex[0], printvertex[1]);
--
--  if (b->usesegments) {
--    sdecode(t->tri[6], printsh);
--    if (printsh.ss != m->dummysub) {
--      printf("    [6] = x%lx  %d\n", (TRIANGLE_PTRINT) printsh.ss,
--             printsh.ssorient);
--    }
--    sdecode(t->tri[7], printsh);
--    if (printsh.ss != m->dummysub) {
--      printf("    [7] = x%lx  %d\n", (TRIANGLE_PTRINT) printsh.ss,
--             printsh.ssorient);
--    }
--    sdecode(t->tri[8], printsh);
--    if (printsh.ss != m->dummysub) {
--      printf("    [8] = x%lx  %d\n", (TRIANGLE_PTRINT) printsh.ss,
--             printsh.ssorient);
--    }
--  }
--
--  if (b->vararea) {
--    printf("    Area constraint:  %.4g\n", areabound(*t));
--  }
--}
--
--/*****************************************************************************/
--/*                                                                           */
--/*  printsubseg()   Print out the details of an oriented subsegment.         */
--/*                                                                           */
--/*  I originally wrote this procedure to simplify debugging; it can be       */
--/*  called directly from the debugger, and presents information about an     */
--/*  oriented subsegment in digestible form.  It's also used when the highest */
--/*  level of verbosity (`-VVV') is specified.                                */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifdef ANSI_DECLARATORS
--void printsubseg(struct mesh *m, struct behavior *b, struct osub *s)
--#else /* not ANSI_DECLARATORS */
--void printsubseg(m, b, s)
--struct mesh *m;
--struct behavior *b;
--struct osub *s;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  struct osub printsh;
--  struct otri printtri;
--  vertex printvertex;
--
--  printf("subsegment x%lx with orientation %d and mark %d:\n",
--         (TRIANGLE_PTRINT) s->ss, s->ssorient, mark(*s));
--  sdecode(s->ss[0], printsh);
--  if (printsh.ss == m->dummysub) {
--    printf("    [0] = No subsegment\n");
--  } else {
--    printf("    [0] = x%lx  %d\n", (TRIANGLE_PTRINT) printsh.ss,
--           printsh.ssorient);
--  }
--  sdecode(s->ss[1], printsh);
--  if (printsh.ss == m->dummysub) {
--    printf("    [1] = No subsegment\n");
--  } else {
--    printf("    [1] = x%lx  %d\n", (TRIANGLE_PTRINT) printsh.ss,
--           printsh.ssorient);
--  }
--
--  sorg(*s, printvertex);
--  if (printvertex == (vertex) NULL)
--    printf("    Origin[%d] = NULL\n", 2 + s->ssorient);
--  else
--    printf("    Origin[%d] = x%lx  (%.12g, %.12g)\n",
--           2 + s->ssorient, (TRIANGLE_PTRINT) printvertex,
--           printvertex[0], printvertex[1]);
--  sdest(*s, printvertex);
--  if (printvertex == (vertex) NULL)
--    printf("    Dest  [%d] = NULL\n", 3 - s->ssorient);
--  else
--    printf("    Dest  [%d] = x%lx  (%.12g, %.12g)\n",
--           3 - s->ssorient, (TRIANGLE_PTRINT) printvertex,
--           printvertex[0], printvertex[1]);
--
--  decode(s->ss[6], printtri);
--  if (printtri.tri == m->dummytri) {
--    printf("    [6] = Outer space\n");
--  } else {
--    printf("    [6] = x%lx  %d\n", (TRIANGLE_PTRINT) printtri.tri,
--           printtri.orient);
--  }
--  decode(s->ss[7], printtri);
--  if (printtri.tri == m->dummytri) {
--    printf("    [7] = Outer space\n");
--  } else {
--    printf("    [7] = x%lx  %d\n", (TRIANGLE_PTRINT) printtri.tri,
--           printtri.orient);
--  }
--
--  segorg(*s, printvertex);
--  if (printvertex == (vertex) NULL)
--    printf("    Segment origin[%d] = NULL\n", 4 + s->ssorient);
--  else
--    printf("    Segment origin[%d] = x%lx  (%.12g, %.12g)\n",
--           4 + s->ssorient, (TRIANGLE_PTRINT) printvertex,
--           printvertex[0], printvertex[1]);
--  segdest(*s, printvertex);
--  if (printvertex == (vertex) NULL)
--    printf("    Segment dest  [%d] = NULL\n", 5 - s->ssorient);
--  else
--    printf("    Segment dest  [%d] = x%lx  (%.12g, %.12g)\n",
--           5 - s->ssorient, (TRIANGLE_PTRINT) printvertex,
--           printvertex[0], printvertex[1]);
--}
--
--/**                                                                         **/
--/**                                                                         **/
--/********* Debugging routines end here                               *********/
--
--/********* Memory management routines begin here                     *********/
--/**                                                                         **/
--/**                                                                         **/
--
--/*****************************************************************************/
--/*                                                                           */
--/*  poolzero()   Set all of a pool's fields to zero.                         */
--/*                                                                           */
--/*  This procedure should never be called on a pool that has any memory      */
--/*  allocated to it, as that memory would leak.                              */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifdef ANSI_DECLARATORS
--void poolzero(struct memorypool *pool)
--#else /* not ANSI_DECLARATORS */
--void poolzero(pool)
--struct memorypool *pool;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  pool->firstblock = (void **) NULL;
--  pool->nowblock = (void **) NULL;
--  pool->nextitem = (void *) NULL;
--  pool->deaditemstack = (void *) NULL;
--  pool->pathblock = (void **) NULL;
--  pool->pathitem = (void *) NULL;
--  pool->alignbytes = 0;
--  pool->itembytes = 0;
--  pool->itemsperblock = 0;
--  pool->itemsfirstblock = 0;
--  pool->items = 0;
--  pool->maxitems = 0;
--  pool->unallocateditems = 0;
--  pool->pathitemsleft = 0;
--}
--
--/*****************************************************************************/
--/*                                                                           */
--/*  poolrestart()   Deallocate all items in a pool.                          */
--/*                                                                           */
--/*  The pool is returned to its starting state, except that no memory is     */
--/*  freed to the operating system.  Rather, the previously allocated blocks  */
--/*  are ready to be reused.                                                  */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifdef ANSI_DECLARATORS
--void poolrestart(struct memorypool *pool)
--#else /* not ANSI_DECLARATORS */
--void poolrestart(pool)
--struct memorypool *pool;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  TRIANGLE_PTRINT alignptr;
--
--  pool->items = 0;
--  pool->maxitems = 0;
--
--  /* Set the currently active block. */
--  pool->nowblock = pool->firstblock;
--  /* Find the first item in the pool.  Increment by the size of (void *). */
--  alignptr = (TRIANGLE_PTRINT) (pool->nowblock + 1);
--  /* Align the item on an `alignbytes'-byte boundary. */
--  pool->nextitem = (void *)
--    (alignptr + (TRIANGLE_PTRINT) pool->alignbytes -
--     (alignptr % (TRIANGLE_PTRINT) pool->alignbytes));
--  /* There are lots of unallocated items left in this block. */
--  pool->unallocateditems = pool->itemsfirstblock;
--  /* The stack of deallocated items is empty. */
--  pool->deaditemstack = (void *) NULL;
--}
--
--/*****************************************************************************/
--/*                                                                           */
--/*  poolinit()   Initialize a pool of memory for allocation of items.        */
--/*                                                                           */
--/*  This routine initializes the machinery for allocating items.  A `pool'   */
--/*  is created whose records have size at least `bytecount'.  Items will be  */
--/*  allocated in `itemcount'-item blocks.  Each item is assumed to be a      */
--/*  collection of words, and either pointers or floating-point values are    */
--/*  assumed to be the "primary" word type.  (The "primary" word type is used */
--/*  to determine alignment of items.)  If `alignment' isn't zero, all items  */
--/*  will be `alignment'-byte aligned in memory.  `alignment' must be either  */
--/*  a multiple or a factor of the primary word size; powers of two are safe. */
--/*  `alignment' is normally used to create a few unused bits at the bottom   */
--/*  of each item's pointer, in which information may be stored.              */
--/*                                                                           */
--/*  Don't change this routine unless you understand it.                      */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifdef ANSI_DECLARATORS
--void poolinit(struct memorypool *pool, int bytecount, int itemcount,
--              int firstitemcount, int alignment)
--#else /* not ANSI_DECLARATORS */
--void poolinit(pool, bytecount, itemcount, firstitemcount, alignment)
--struct memorypool *pool;
--int bytecount;
--int itemcount;
--int firstitemcount;
--int alignment;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  /* Find the proper alignment, which must be at least as large as:   */
--  /*   - The parameter `alignment'.                                   */
--  /*   - sizeof(void *), so the stack of dead items can be maintained */
--  /*       without unaligned accesses.                                */
--  if (alignment > sizeof(void *)) {
--    pool->alignbytes = alignment;
--  } else {
--    pool->alignbytes = sizeof(void *);
--  }
--  pool->itembytes = ((bytecount - 1) / pool->alignbytes + 1) *
--                    pool->alignbytes;
--  pool->itemsperblock = itemcount;
--  if (firstitemcount == 0) {
--    pool->itemsfirstblock = itemcount;
--  } else {
--    pool->itemsfirstblock = firstitemcount;
--  }
--
--  /* Allocate a block of items.  Space for `itemsfirstblock' items and one  */
--  /*   pointer (to point to the next block) are allocated, as well as space */
--  /*   to ensure alignment of the items.                                    */
--  pool->firstblock = (void **)
--    trimalloc(pool->itemsfirstblock * pool->itembytes + (int) sizeof(void *) +
--              pool->alignbytes);
--  /* Set the next block pointer to NULL. */
--  *(pool->firstblock) = (void *) NULL;
--  poolrestart(pool);
--}
--
--/*****************************************************************************/
--/*                                                                           */
--/*  pooldeinit()   Free to the operating system all memory taken by a pool.  */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifdef ANSI_DECLARATORS
--void pooldeinit(struct memorypool *pool)
--#else /* not ANSI_DECLARATORS */
--void pooldeinit(pool)
--struct memorypool *pool;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  while (pool->firstblock != (void **) NULL) {
--    pool->nowblock = (void **) *(pool->firstblock);
--    trifree((void *) pool->firstblock);
--    pool->firstblock = pool->nowblock;
--  }
--}
--
--/*****************************************************************************/
--/*                                                                           */
--/*  poolalloc()   Allocate space for an item.                                */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifdef ANSI_DECLARATORS
--void *poolalloc(struct memorypool *pool)
--#else /* not ANSI_DECLARATORS */
--void *poolalloc(pool)
--struct memorypool *pool;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  void *newitem;
--  void **newblock;
--  TRIANGLE_PTRINT alignptr;
--
--  /* First check the linked list of dead items.  If the list is not   */
--  /*   empty, allocate an item from the list rather than a fresh one. */
--  if (pool->deaditemstack != (void *) NULL) {
--    newitem = pool->deaditemstack;               /* Take first item in list. */
--    pool->deaditemstack = * (void **) pool->deaditemstack;
--  } else {
--    /* Check if there are any free items left in the current block. */
--    if (pool->unallocateditems == 0) {
--      /* Check if another block must be allocated. */
--      if (*(pool->nowblock) == (void *) NULL) {
--        /* Allocate a new block of items, pointed to by the previous block. */
--        newblock = (void **) trimalloc(pool->itemsperblock * pool->itembytes +
--                                       (int) sizeof(void *) +
--                                       pool->alignbytes);
--        *(pool->nowblock) = (void *) newblock;
--        /* The next block pointer is NULL. */
--        *newblock = (void *) NULL;
--      }
--
--      /* Move to the new block. */
--      pool->nowblock = (void **) *(pool->nowblock);
--      /* Find the first item in the block.    */
--      /*   Increment by the size of (void *). */
--      alignptr = (TRIANGLE_PTRINT) (pool->nowblock + 1);
--      /* Align the item on an `alignbytes'-byte boundary. */
--      pool->nextitem = (void *)
--        (alignptr + (TRIANGLE_PTRINT) pool->alignbytes -
--         (alignptr % (TRIANGLE_PTRINT) pool->alignbytes));
--      /* There are lots of unallocated items left in this block. */
--      pool->unallocateditems = pool->itemsperblock;
--    }
--
--    /* Allocate a new item. */
--    newitem = pool->nextitem;
--    /* Advance `nextitem' pointer to next free item in block. */
--    pool->nextitem = (void *) ((char *) pool->nextitem + pool->itembytes);
--    pool->unallocateditems--;
--    pool->maxitems++;
--  }
--  pool->items++;
--  return newitem;
--}
--
--/*****************************************************************************/
--/*                                                                           */
--/*  pooldealloc()   Deallocate space for an item.                            */
--/*                                                                           */
--/*  The deallocated space is stored in a queue for later reuse.              */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifdef ANSI_DECLARATORS
--void pooldealloc(struct memorypool *pool, void *dyingitem)
--#else /* not ANSI_DECLARATORS */
--void pooldealloc(pool, dyingitem)
--struct memorypool *pool;
--void *dyingitem;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  /* Push freshly killed item onto stack. */
--  *((void **) dyingitem) = pool->deaditemstack;
--  pool->deaditemstack = dyingitem;
--  pool->items--;
--}
--
--/*****************************************************************************/
--/*                                                                           */
--/*  traversalinit()   Prepare to traverse the entire list of items.          */
--/*                                                                           */
--/*  This routine is used in conjunction with traverse().                     */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifdef ANSI_DECLARATORS
--void traversalinit(struct memorypool *pool)
--#else /* not ANSI_DECLARATORS */
--void traversalinit(pool)
--struct memorypool *pool;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  TRIANGLE_PTRINT alignptr;
--
--  /* Begin the traversal in the first block. */
--  pool->pathblock = pool->firstblock;
--  /* Find the first item in the block.  Increment by the size of (void *). */
--  alignptr = (TRIANGLE_PTRINT) (pool->pathblock + 1);
--  /* Align with item on an `alignbytes'-byte boundary. */
--  pool->pathitem = (void *)
--    (alignptr + (TRIANGLE_PTRINT) pool->alignbytes -
--     (alignptr % (TRIANGLE_PTRINT) pool->alignbytes));
--  /* Set the number of items left in the current block. */
--  pool->pathitemsleft = pool->itemsfirstblock;
--}
--
--/*****************************************************************************/
--/*                                                                           */
--/*  traverse()   Find the next item in the list.                             */
--/*                                                                           */
--/*  This routine is used in conjunction with traversalinit().  Be forewarned */
--/*  that this routine successively returns all items in the list, including  */
--/*  deallocated ones on the deaditemqueue.  It's up to you to figure out     */
--/*  which ones are actually dead.  Why?  I don't want to allocate extra      */
--/*  space just to demarcate dead items.  It can usually be done more         */
--/*  space-efficiently by a routine that knows something about the structure  */
--/*  of the item.                                                             */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifdef ANSI_DECLARATORS
--void *traverse(struct memorypool *pool)
--#else /* not ANSI_DECLARATORS */
--void *traverse(pool)
--struct memorypool *pool;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  void *newitem;
--  TRIANGLE_PTRINT alignptr;
--
--  /* Stop upon exhausting the list of items. */
--  if (pool->pathitem == pool->nextitem) {
--    return (void *) NULL;
--  }
--
--  /* Check whether any untraversed items remain in the current block. */
--  if (pool->pathitemsleft == 0) {
--    /* Find the next block. */
--    pool->pathblock = (void **) *(pool->pathblock);
--    /* Find the first item in the block.  Increment by the size of (void *). */
--    alignptr = (TRIANGLE_PTRINT) (pool->pathblock + 1);
--    /* Align with item on an `alignbytes'-byte boundary. */
--    pool->pathitem = (void *)
--      (alignptr + (TRIANGLE_PTRINT) pool->alignbytes -
--       (alignptr % (TRIANGLE_PTRINT) pool->alignbytes));
--    /* Set the number of items left in the current block. */
--    pool->pathitemsleft = pool->itemsperblock;
--  }
--
--  newitem = pool->pathitem;
--  /* Find the next item in the block. */
--  pool->pathitem = (void *) ((char *) pool->pathitem + pool->itembytes);
--  pool->pathitemsleft--;
--  return newitem;
--}
--
--/*****************************************************************************/
--/*                                                                           */
--/*  dummyinit()   Initialize the triangle that fills "outer space" and the   */
--/*                omnipresent subsegment.                                    */
--/*                                                                           */
--/*  The triangle that fills "outer space," called `dummytri', is pointed to  */
--/*  by every triangle and subsegment on a boundary (be it outer or inner) of */
--/*  the triangulation.  Also, `dummytri' points to one of the triangles on   */
--/*  the convex hull (until the holes and concavities are carved), making it  */
--/*  possible to find a starting triangle for point location.                 */
--/*                                                                           */
--/*  The omnipresent subsegment, `dummysub', is pointed to by every triangle  */
--/*  or subsegment that doesn't have a full complement of real subsegments    */
--/*  to point to.                                                             */
--/*                                                                           */
--/*  `dummytri' and `dummysub' are generally required to fulfill only a few   */
--/*  invariants:  their vertices must remain NULL and `dummytri' must always  */
--/*  be bonded (at offset zero) to some triangle on the convex hull of the    */
--/*  mesh, via a boundary edge.  Otherwise, the connections of `dummytri' and */
--/*  `dummysub' may change willy-nilly.  This makes it possible to avoid      */
--/*  writing a good deal of special-case code (in the edge flip, for example) */
--/*  for dealing with the boundary of the mesh, places where no subsegment is */
--/*  present, and so forth.  Other entities are frequently bonded to          */
--/*  `dummytri' and `dummysub' as if they were real mesh entities, with no    */
--/*  harm done.                                                               */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifdef ANSI_DECLARATORS
--void dummyinit(struct mesh *m, struct behavior *b, int trianglebytes,
--               int subsegbytes)
--#else /* not ANSI_DECLARATORS */
--void dummyinit(m, b, trianglebytes, subsegbytes)
--struct mesh *m;
--struct behavior *b;
--int trianglebytes;
--int subsegbytes;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  TRIANGLE_PTRINT alignptr;
--
--  /* Set up `dummytri', the `triangle' that occupies "outer space." */
--  m->dummytribase = (triangle *) trimalloc(trianglebytes +
--                                           m->triangles.alignbytes);
--  /* Align `dummytri' on a `triangles.alignbytes'-byte boundary. */
--  alignptr = (TRIANGLE_PTRINT) m->dummytribase;
--  m->dummytri = (triangle *)
--    (alignptr + (TRIANGLE_PTRINT) m->triangles.alignbytes -
--     (alignptr % (TRIANGLE_PTRINT) m->triangles.alignbytes));
--  /* Initialize the three adjoining triangles to be "outer space."  These  */
--  /*   will eventually be changed by various bonding operations, but their */
--  /*   values don't really matter, as long as they can legally be          */
--  /*   dereferenced.                                                       */
--  m->dummytri[0] = (triangle) m->dummytri;
--  m->dummytri[1] = (triangle) m->dummytri;
--  m->dummytri[2] = (triangle) m->dummytri;
--  /* Three NULL vertices. */
--  m->dummytri[3] = (triangle) NULL;
--  m->dummytri[4] = (triangle) NULL;
--  m->dummytri[5] = (triangle) NULL;
--
--  if (b->usesegments) {
--    /* Set up `dummysub', the omnipresent subsegment pointed to by any */
--    /*   triangle side or subsegment end that isn't attached to a real */
--    /*   subsegment.                                                   */
--    m->dummysubbase = (subseg *) trimalloc(subsegbytes +
--                                           m->subsegs.alignbytes);
--    /* Align `dummysub' on a `subsegs.alignbytes'-byte boundary. */
--    alignptr = (TRIANGLE_PTRINT) m->dummysubbase;
--    m->dummysub = (subseg *)
--      (alignptr + (TRIANGLE_PTRINT) m->subsegs.alignbytes -
--       (alignptr % (TRIANGLE_PTRINT) m->subsegs.alignbytes));
--    /* Initialize the two adjoining subsegments to be the omnipresent      */
--    /*   subsegment.  These will eventually be changed by various bonding  */
--    /*   operations, but their values don't really matter, as long as they */
--    /*   can legally be dereferenced.                                      */
--    m->dummysub[0] = (subseg) m->dummysub;
--    m->dummysub[1] = (subseg) m->dummysub;
--    /* Four NULL vertices. */
--    m->dummysub[2] = (subseg) NULL;
--    m->dummysub[3] = (subseg) NULL;
--    m->dummysub[4] = (subseg) NULL;
--    m->dummysub[5] = (subseg) NULL;
--    /* Initialize the two adjoining triangles to be "outer space." */
--    m->dummysub[6] = (subseg) m->dummytri;
--    m->dummysub[7] = (subseg) m->dummytri;
--    /* Set the boundary marker to zero. */
--    * (int *) (m->dummysub + 8) = 0;
--
--    /* Initialize the three adjoining subsegments of `dummytri' to be */
--    /*   the omnipresent subsegment.                                  */
--    m->dummytri[6] = (triangle) m->dummysub;
--    m->dummytri[7] = (triangle) m->dummysub;
--    m->dummytri[8] = (triangle) m->dummysub;
--  }
--}
--
--/*****************************************************************************/
--/*                                                                           */
--/*  initializevertexpool()   Calculate the size of the vertex data structure */
--/*                           and initialize its memory pool.                 */
--/*                                                                           */
--/*  This routine also computes the `vertexmarkindex' and `vertex2triindex'   */
--/*  indices used to find values within each vertex.                          */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifdef ANSI_DECLARATORS
--void initializevertexpool(struct mesh *m, struct behavior *b)
--#else /* not ANSI_DECLARATORS */
--void initializevertexpool(m, b)
--struct mesh *m;
--struct behavior *b;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  int vertexsize;
--
--  /* The index within each vertex at which the boundary marker is found,    */
--  /*   followed by the vertex type.  Ensure the vertex marker is aligned to */
--  /*   a sizeof(int)-byte address.                                          */
--  m->vertexmarkindex = ((m->mesh_dim + m->nextras) * sizeof(REAL) +
--                        sizeof(int) - 1) /
--                       sizeof(int);
--  vertexsize = (m->vertexmarkindex + 2) * sizeof(int);
--  if (b->poly) {
--    /* The index within each vertex at which a triangle pointer is found.  */
--    /*   Ensure the pointer is aligned to a sizeof(triangle)-byte address. */
--    m->vertex2triindex = (vertexsize + sizeof(triangle) - 1) /
--                         sizeof(triangle);
--    vertexsize = (m->vertex2triindex + 1) * sizeof(triangle);
--  }
--
--  /* Initialize the pool of vertices. */
--  poolinit(&m->vertices, vertexsize, VERTEXPERBLOCK,
--           m->invertices > VERTEXPERBLOCK ? m->invertices : VERTEXPERBLOCK,
--           sizeof(REAL));
--}
--
--/*****************************************************************************/
--/*                                                                           */
--/*  initializetrisubpools()   Calculate the sizes of the triangle and        */
--/*                            subsegment data structures and initialize      */
--/*                            their memory pools.                            */
--/*                                                                           */
--/*  This routine also computes the `highorderindex', `elemattribindex', and  */
--/*  `areaboundindex' indices used to find values within each triangle.       */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifdef ANSI_DECLARATORS
--void initializetrisubpools(struct mesh *m, struct behavior *b)
--#else /* not ANSI_DECLARATORS */
--void initializetrisubpools(m, b)
--struct mesh *m;
--struct behavior *b;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  int trisize;
--
--  /* The index within each triangle at which the extra nodes (above three)  */
--  /*   associated with high order elements are found.  There are three      */
--  /*   pointers to other triangles, three pointers to corners, and possibly */
--  /*   three pointers to subsegments before the extra nodes.                */
--  m->highorderindex = 6 + (b->usesegments * 3);
--  /* The number of bytes occupied by a triangle. */
--  trisize = ((b->order + 1) * (b->order + 2) / 2 + (m->highorderindex - 3)) *
--            sizeof(triangle);
--  /* The index within each triangle at which its attributes are found, */
--  /*   where the index is measured in REALs.                           */
--  m->elemattribindex = (trisize + sizeof(REAL) - 1) / sizeof(REAL);
--  /* The index within each triangle at which the maximum area constraint  */
--  /*   is found, where the index is measured in REALs.  Note that if the  */
--  /*   `regionattrib' flag is set, an additional attribute will be added. */
--  m->areaboundindex = m->elemattribindex + m->eextras + b->regionattrib;
--  /* If triangle attributes or an area bound are needed, increase the number */
--  /*   of bytes occupied by a triangle.                                      */
--  if (b->vararea) {
--    trisize = (m->areaboundindex + 1) * sizeof(REAL);
--  } else if (m->eextras + b->regionattrib > 0) {
--    trisize = m->areaboundindex * sizeof(REAL);
--  }
--  /* If a Voronoi diagram or triangle neighbor graph is requested, make    */
--  /*   sure there's room to store an integer index in each triangle.  This */
--  /*   integer index can occupy the same space as the subsegment pointers  */
--  /*   or attributes or area constraint or extra nodes.                    */
--  if ((b->voronoi || b->neighbors) &&
--      (trisize < 6 * sizeof(triangle) + sizeof(int))) {
--    trisize = 6 * sizeof(triangle) + sizeof(int);
--  }
--
--  /* Having determined the memory size of a triangle, initialize the pool. */
--  poolinit(&m->triangles, trisize, TRIPERBLOCK,
--           (2 * m->invertices - 2) > TRIPERBLOCK ? (2 * m->invertices - 2) :
--           TRIPERBLOCK, 4);
--
--  if (b->usesegments) {
--    /* Initialize the pool of subsegments.  Take into account all eight */
--    /*   pointers and one boundary marker.                              */
--    poolinit(&m->subsegs, 8 * sizeof(triangle) + sizeof(int),
--             SUBSEGPERBLOCK, SUBSEGPERBLOCK, 4);
--
--    /* Initialize the "outer space" triangle and omnipresent subsegment. */
--    dummyinit(m, b, m->triangles.itembytes, m->subsegs.itembytes);
--  } else {
--    /* Initialize the "outer space" triangle. */
--    dummyinit(m, b, m->triangles.itembytes, 0);
--  }
--}
--
--/*****************************************************************************/
--/*                                                                           */
--/*  triangledealloc()   Deallocate space for a triangle, marking it dead.    */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifdef ANSI_DECLARATORS
--void triangledealloc(struct mesh *m, triangle *dyingtriangle)
--#else /* not ANSI_DECLARATORS */
--void triangledealloc(m, dyingtriangle)
--struct mesh *m;
--triangle *dyingtriangle;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  /* Mark the triangle as dead.  This makes it possible to detect dead */
--  /*   triangles when traversing the list of all triangles.            */
--  killtri(dyingtriangle);
--  pooldealloc(&m->triangles, (void *) dyingtriangle);
--}
--
--/*****************************************************************************/
--/*                                                                           */
--/*  triangletraverse()   Traverse the triangles, skipping dead ones.         */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifdef ANSI_DECLARATORS
--triangle *triangletraverse(struct mesh *m)
--#else /* not ANSI_DECLARATORS */
--triangle *triangletraverse(m)
--struct mesh *m;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  triangle *newtriangle;
--
--  do {
--    newtriangle = (triangle *) traverse(&m->triangles);
--    if (newtriangle == (triangle *) NULL) {
--      return (triangle *) NULL;
--    }
--  } while (deadtri(newtriangle));                         /* Skip dead ones. */
--  return newtriangle;
--}
--
--/*****************************************************************************/
--/*                                                                           */
--/*  subsegdealloc()   Deallocate space for a subsegment, marking it dead.    */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifdef ANSI_DECLARATORS
--void subsegdealloc(struct mesh *m, subseg *dyingsubseg)
--#else /* not ANSI_DECLARATORS */
--void subsegdealloc(m, dyingsubseg)
--struct mesh *m;
--subseg *dyingsubseg;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  /* Mark the subsegment as dead.  This makes it possible to detect dead */
--  /*   subsegments when traversing the list of all subsegments.          */
--  killsubseg(dyingsubseg);
--  pooldealloc(&m->subsegs, (void *) dyingsubseg);
--}
--
--/*****************************************************************************/
--/*                                                                           */
--/*  subsegtraverse()   Traverse the subsegments, skipping dead ones.         */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifdef ANSI_DECLARATORS
--subseg *subsegtraverse(struct mesh *m)
--#else /* not ANSI_DECLARATORS */
--subseg *subsegtraverse(m)
--struct mesh *m;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  subseg *newsubseg;
--
--  do {
--    newsubseg = (subseg *) traverse(&m->subsegs);
--    if (newsubseg == (subseg *) NULL) {
--      return (subseg *) NULL;
--    }
--  } while (deadsubseg(newsubseg));                        /* Skip dead ones. */
--  return newsubseg;
--}
--
--/*****************************************************************************/
--/*                                                                           */
--/*  vertexdealloc()   Deallocate space for a vertex, marking it dead.        */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifdef ANSI_DECLARATORS
--void vertexdealloc(struct mesh *m, vertex dyingvertex)
--#else /* not ANSI_DECLARATORS */
--void vertexdealloc(m, dyingvertex)
--struct mesh *m;
--vertex dyingvertex;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  /* Mark the vertex as dead.  This makes it possible to detect dead */
--  /*   vertices when traversing the list of all vertices.            */
--  setvertextype(dyingvertex, DEADVERTEX);
--  pooldealloc(&m->vertices, (void *) dyingvertex);
--}
--
--/*****************************************************************************/
--/*                                                                           */
--/*  vertextraverse()   Traverse the vertices, skipping dead ones.            */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifdef ANSI_DECLARATORS
--vertex vertextraverse(struct mesh *m)
--#else /* not ANSI_DECLARATORS */
--vertex vertextraverse(m)
--struct mesh *m;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  vertex newvertex;
--
--  do {
--    newvertex = (vertex) traverse(&m->vertices);
--    if (newvertex == (vertex) NULL) {
--      return (vertex) NULL;
--    }
--  } while (vertextype(newvertex) == DEADVERTEX);          /* Skip dead ones. */
--  return newvertex;
--}
--
--/*****************************************************************************/
--/*                                                                           */
--/*  badsubsegdealloc()   Deallocate space for a bad subsegment, marking it   */
--/*                       dead.                                               */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifndef CDT_ONLY
--
--#ifdef ANSI_DECLARATORS
--void badsubsegdealloc(struct mesh *m, struct badsubseg *dyingseg)
--#else /* not ANSI_DECLARATORS */
--void badsubsegdealloc(m, dyingseg)
--struct mesh *m;
--struct badsubseg *dyingseg;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  /* Set subsegment's origin to NULL.  This makes it possible to detect dead */
--  /*   badsubsegs when traversing the list of all badsubsegs             .   */
--  dyingseg->subsegorg = (vertex) NULL;
--  pooldealloc(&m->badsubsegs, (void *) dyingseg);
--}
--
--#endif /* not CDT_ONLY */
--
--/*****************************************************************************/
--/*                                                                           */
--/*  badsubsegtraverse()   Traverse the bad subsegments, skipping dead ones.  */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifndef CDT_ONLY
--
--#ifdef ANSI_DECLARATORS
--struct badsubseg *badsubsegtraverse(struct mesh *m)
--#else /* not ANSI_DECLARATORS */
--struct badsubseg *badsubsegtraverse(m)
--struct mesh *m;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  struct badsubseg *newseg;
--
--  do {
--    newseg = (struct badsubseg *) traverse(&m->badsubsegs);
--    if (newseg == (struct badsubseg *) NULL) {
--      return (struct badsubseg *) NULL;
--    }
--  } while (newseg->subsegorg == (vertex) NULL);           /* Skip dead ones. */
--  return newseg;
--}
--
--#endif /* not CDT_ONLY */
--
--/*****************************************************************************/
--/*                                                                           */
--/*  getvertex()   Get a specific vertex, by number, from the list.           */
--/*                                                                           */
--/*  The first vertex is number 'firstnumber'.                                */
--/*                                                                           */
--/*  Note that this takes O(n) time (with a small constant, if VERTEXPERBLOCK */
--/*  is large).  I don't care to take the trouble to make it work in constant */
--/*  time.                                                                    */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifdef ANSI_DECLARATORS
--vertex getvertex(struct mesh *m, struct behavior *b, int number)
--#else /* not ANSI_DECLARATORS */
--vertex getvertex(m, b, number)
--struct mesh *m;
--struct behavior *b;
--int number;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  void **getblock;
--  char *foundvertex;
--  TRIANGLE_PTRINT alignptr;
--  int current;
--
--  getblock = m->vertices.firstblock;
--  current = b->firstnumber;
--
--  /* Find the right block. */
--  if (current + m->vertices.itemsfirstblock <= number) {
--    getblock = (void **) *getblock;
--    current += m->vertices.itemsfirstblock;
--    while (current + m->vertices.itemsperblock <= number) {
--      getblock = (void **) *getblock;
--      current += m->vertices.itemsperblock;
--    }
--  }
--
--  /* Now find the right vertex. */
--  alignptr = (TRIANGLE_PTRINT) (getblock + 1);
--  foundvertex = (char *) (alignptr + (TRIANGLE_PTRINT) m->vertices.alignbytes -
--                          (alignptr % (TRIANGLE_PTRINT) m->vertices.alignbytes));
--  return (vertex) (foundvertex + m->vertices.itembytes * (number - current));
--}
--
--/*****************************************************************************/
--/*                                                                           */
--/*  triangledeinit()   Free all remaining allocated memory.                  */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifdef ANSI_DECLARATORS
--void triangledeinit(struct mesh *m, struct behavior *b)
--#else /* not ANSI_DECLARATORS */
--void triangledeinit(m, b)
--struct mesh *m;
--struct behavior *b;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  pooldeinit(&m->triangles);
--  trifree((void *) m->dummytribase);
--  if (b->usesegments) {
--    pooldeinit(&m->subsegs);
--    trifree((void *) m->dummysubbase);
--  }
--  pooldeinit(&m->vertices);
--#ifndef CDT_ONLY
--  if (b->quality) {
--    pooldeinit(&m->badsubsegs);
--    if ((b->minangle > 0.0) || b->vararea || b->fixedarea || b->usertest) {
--      pooldeinit(&m->badtriangles);
--      pooldeinit(&m->flipstackers);
--    }
--  }
--#endif /* not CDT_ONLY */
--}
--
--/**                                                                         **/
--/**                                                                         **/
--/********* Memory management routines end here                       *********/
--
--/********* Constructors begin here                                   *********/
--/**                                                                         **/
--/**                                                                         **/
--
--/*****************************************************************************/
--/*                                                                           */
--/*  maketriangle()   Create a new triangle with orientation zero.            */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifdef ANSI_DECLARATORS
--void maketriangle(struct mesh *m, struct behavior *b, struct otri *newotri)
--#else /* not ANSI_DECLARATORS */
--void maketriangle(m, b, newotri)
--struct mesh *m;
--struct behavior *b;
--struct otri *newotri;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  int i;
--
--  newotri->tri = (triangle *) poolalloc(&m->triangles);
--  /* Initialize the three adjoining triangles to be "outer space". */
--  newotri->tri[0] = (triangle) m->dummytri;
--  newotri->tri[1] = (triangle) m->dummytri;
--  newotri->tri[2] = (triangle) m->dummytri;
--  /* Three NULL vertices. */
--  newotri->tri[3] = (triangle) NULL;
--  newotri->tri[4] = (triangle) NULL;
--  newotri->tri[5] = (triangle) NULL;
--  if (b->usesegments) {
--    /* Initialize the three adjoining subsegments to be the omnipresent */
--    /*   subsegment.                                                    */
--    newotri->tri[6] = (triangle) m->dummysub;
--    newotri->tri[7] = (triangle) m->dummysub;
--    newotri->tri[8] = (triangle) m->dummysub;
--  }
--  for (i = 0; i < m->eextras; i++) {
--    setelemattribute(*newotri, i, 0.0);
--  }
--  if (b->vararea) {
--    setareabound(*newotri, -1.0);
--  }
--
--  newotri->orient = 0;
--}
--
--/*****************************************************************************/
--/*                                                                           */
--/*  makesubseg()   Create a new subsegment with orientation zero.            */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifdef ANSI_DECLARATORS
--void makesubseg(struct mesh *m, struct osub *newsubseg)
--#else /* not ANSI_DECLARATORS */
--void makesubseg(m, newsubseg)
--struct mesh *m;
--struct osub *newsubseg;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  newsubseg->ss = (subseg *) poolalloc(&m->subsegs);
--  /* Initialize the two adjoining subsegments to be the omnipresent */
--  /*   subsegment.                                                  */
--  newsubseg->ss[0] = (subseg) m->dummysub;
--  newsubseg->ss[1] = (subseg) m->dummysub;
--  /* Four NULL vertices. */
--  newsubseg->ss[2] = (subseg) NULL;
--  newsubseg->ss[3] = (subseg) NULL;
--  newsubseg->ss[4] = (subseg) NULL;
--  newsubseg->ss[5] = (subseg) NULL;
--  /* Initialize the two adjoining triangles to be "outer space." */
--  newsubseg->ss[6] = (subseg) m->dummytri;
--  newsubseg->ss[7] = (subseg) m->dummytri;
--  /* Set the boundary marker to zero. */
--  setmark(*newsubseg, 0);
--
--  newsubseg->ssorient = 0;
--}
--
--/**                                                                         **/
--/**                                                                         **/
--/********* Constructors end here                                     *********/
--
--/********* Geometric primitives begin here                           *********/
--/**                                                                         **/
--/**                                                                         **/
--
--/* The adaptive exact arithmetic geometric predicates implemented herein are */
--/*   described in detail in my paper, "Adaptive Precision Floating-Point     */
--/*   Arithmetic and Fast Robust Geometric Predicates."  See the header for a */
--/*   full citation.                                                          */
--
--/* Which of the following two methods of finding the absolute values is      */
--/*   fastest is compiler-dependent.  A few compilers can inline and optimize */
--/*   the fabs() call; but most will incur the overhead of a function call,   */
--/*   which is disastrously slow.  A faster way on IEEE machines might be to  */
--/*   mask the appropriate bit, but that's difficult to do in C without       */
--/*   forcing the value to be stored to memory (rather than be kept in the    */
--/*   register to which the optimizer assigned it).                           */
--
--#define Absolute(a)  ((a) >= 0.0 ? (a) : -(a))
--/* #define Absolute(a)  fabs(a) */
--
--/* Many of the operations are broken up into two pieces, a main part that    */
--/*   performs an approximate operation, and a "tail" that computes the       */
--/*   roundoff error of that operation.                                       */
--/*                                                                           */
--/* The operations Fast_Two_Sum(), Fast_Two_Diff(), Two_Sum(), Two_Diff(),    */
--/*   Split(), and Two_Product() are all implemented as described in the      */
--/*   reference.  Each of these macros requires certain variables to be       */
--/*   defined in the calling routine.  The variables `bvirt', `c', `abig',    */
--/*   `_i', `_j', `_k', `_l', `_m', and `_n' are declared `INEXACT' because   */
--/*   they store the result of an operation that may incur roundoff error.    */
--/*   The input parameter `x' (or the highest numbered `x_' parameter) must   */
--/*   also be declared `INEXACT'.                                             */
--
--#define Fast_Two_Sum_Tail(a, b, x, y) \
--  bvirt = x - a; \
--  y = b - bvirt
--
--#define Fast_Two_Sum(a, b, x, y) \
--  x = (REAL) (a + b); \
--  Fast_Two_Sum_Tail(a, b, x, y)
--
--#define Two_Sum_Tail(a, b, x, y) \
--  bvirt = (REAL) (x - a); \
--  avirt = x - bvirt; \
--  bround = b - bvirt; \
--  around = a - avirt; \
--  y = around + bround
--
--#define Two_Sum(a, b, x, y) \
--  x = (REAL) (a + b); \
--  Two_Sum_Tail(a, b, x, y)
--
--#define Two_Diff_Tail(a, b, x, y) \
--  bvirt = (REAL) (a - x); \
--  avirt = x + bvirt; \
--  bround = bvirt - b; \
--  around = a - avirt; \
--  y = around + bround
--
--#define Two_Diff(a, b, x, y) \
--  x = (REAL) (a - b); \
--  Two_Diff_Tail(a, b, x, y)
--
--#define Split(a, ahi, alo) \
--  c = (REAL) (splitter * a); \
--  abig = (REAL) (c - a); \
--  ahi = c - abig; \
--  alo = a - ahi
--
--#define Two_Product_Tail(a, b, x, y) \
--  Split(a, ahi, alo); \
--  Split(b, bhi, blo); \
--  err1 = x - (ahi * bhi); \
--  err2 = err1 - (alo * bhi); \
--  err3 = err2 - (ahi * blo); \
--  y = (alo * blo) - err3
--
--#define Two_Product(a, b, x, y) \
--  x = (REAL) (a * b); \
--  Two_Product_Tail(a, b, x, y)
--
--/* Two_Product_Presplit() is Two_Product() where one of the inputs has       */
--/*   already been split.  Avoids redundant splitting.                        */
--
--#define Two_Product_Presplit(a, b, bhi, blo, x, y) \
--  x = (REAL) (a * b); \
--  Split(a, ahi, alo); \
--  err1 = x - (ahi * bhi); \
--  err2 = err1 - (alo * bhi); \
--  err3 = err2 - (ahi * blo); \
--  y = (alo * blo) - err3
--
--/* Square() can be done more quickly than Two_Product().                     */
--
--#define Square_Tail(a, x, y) \
--  Split(a, ahi, alo); \
--  err1 = x - (ahi * ahi); \
--  err3 = err1 - ((ahi + ahi) * alo); \
--  y = (alo * alo) - err3
--
--#define Square(a, x, y) \
--  x = (REAL) (a * a); \
--  Square_Tail(a, x, y)
--
--/* Macros for summing expansions of various fixed lengths.  These are all    */
--/*   unrolled versions of Expansion_Sum().                                   */
--
--#define Two_One_Sum(a1, a0, b, x2, x1, x0) \
--  Two_Sum(a0, b , _i, x0); \
--  Two_Sum(a1, _i, x2, x1)
--
--#define Two_One_Diff(a1, a0, b, x2, x1, x0) \
--  Two_Diff(a0, b , _i, x0); \
--  Two_Sum( a1, _i, x2, x1)
--
--#define Two_Two_Sum(a1, a0, b1, b0, x3, x2, x1, x0) \
--  Two_One_Sum(a1, a0, b0, _j, _0, x0); \
--  Two_One_Sum(_j, _0, b1, x3, x2, x1)
--
--#define Two_Two_Diff(a1, a0, b1, b0, x3, x2, x1, x0) \
--  Two_One_Diff(a1, a0, b0, _j, _0, x0); \
--  Two_One_Diff(_j, _0, b1, x3, x2, x1)
--
--/* Macro for multiplying a two-component expansion by a single component.    */
--
--#define Two_One_Product(a1, a0, b, x3, x2, x1, x0) \
--  Split(b, bhi, blo); \
--  Two_Product_Presplit(a0, b, bhi, blo, _i, x0); \
--  Two_Product_Presplit(a1, b, bhi, blo, _j, _0); \
--  Two_Sum(_i, _0, _k, x1); \
--  Fast_Two_Sum(_j, _k, x3, x2)
--
--/*****************************************************************************/
--/*                                                                           */
--/*  exactinit()   Initialize the variables used for exact arithmetic.        */
--/*                                                                           */
--/*  `epsilon' is the largest power of two such that 1.0 + epsilon = 1.0 in   */
--/*  floating-point arithmetic.  `epsilon' bounds the relative roundoff       */
--/*  error.  It is used for floating-point error analysis.                    */
--/*                                                                           */
--/*  `splitter' is used to split floating-point numbers into two half-        */
--/*  length significands for exact multiplication.                            */
--/*                                                                           */
--/*  I imagine that a highly optimizing compiler might be too smart for its   */
--/*  own good, and somehow cause this routine to fail, if it pretends that    */
--/*  floating-point arithmetic is too much like real arithmetic.              */
--/*                                                                           */
--/*  Don't change this routine unless you fully understand it.                */
--/*                                                                           */
--/*****************************************************************************/
--
--void exactinit()
--{
--  REAL half;
--  REAL check, lastcheck;
--  int every_other;
--#ifdef LINUX
--  int cword;
--#endif /* LINUX */
--
--#ifdef CPU86
--#ifdef SINGLE
--  _control87(_PC_24, _MCW_PC); /* Set FPU control word for single precision. */
--#else /* not SINGLE */
--  _control87(_PC_53, _MCW_PC); /* Set FPU control word for double precision. */
--#endif /* not SINGLE */
--#endif /* CPU86 */
--#ifdef LINUX
--#ifdef SINGLE
--  /*  cword = 4223; */
--  cword = 4210;                 /* set FPU control word for single precision */
--#else /* not SINGLE */
--  /*  cword = 4735; */
--  cword = 4722;                 /* set FPU control word for double precision */
--#endif /* not SINGLE */
--  _FPU_SETCW(cword);
--#endif /* LINUX */
--
--  every_other = 1;
--  half = 0.5;
--  epsilon = 1.0;
--  splitter = 1.0;
--  check = 1.0;
--  /* Repeatedly divide `epsilon' by two until it is too small to add to      */
--  /*   one without causing roundoff.  (Also check if the sum is equal to     */
--  /*   the previous sum, for machines that round up instead of using exact   */
--  /*   rounding.  Not that these routines will work on such machines.)       */
--  do {
--    lastcheck = check;
--    epsilon *= half;
--    if (every_other) {
--      splitter *= 2.0;
--    }
--    every_other = !every_other;
--    check = 1.0 + epsilon;
--  } while ((check != 1.0) && (check != lastcheck));
--  splitter += 1.0;
--  /* Error bounds for orientation and incircle tests. */
--  resulterrbound = (3.0 + 8.0 * epsilon) * epsilon;
--  ccwerrboundA = (3.0 + 16.0 * epsilon) * epsilon;
--  ccwerrboundB = (2.0 + 12.0 * epsilon) * epsilon;
--  ccwerrboundC = (9.0 + 64.0 * epsilon) * epsilon * epsilon;
--  iccerrboundA = (10.0 + 96.0 * epsilon) * epsilon;
--  iccerrboundB = (4.0 + 48.0 * epsilon) * epsilon;
--  iccerrboundC = (44.0 + 576.0 * epsilon) * epsilon * epsilon;
--  o3derrboundA = (7.0 + 56.0 * epsilon) * epsilon;
--  o3derrboundB = (3.0 + 28.0 * epsilon) * epsilon;
--  o3derrboundC = (26.0 + 288.0 * epsilon) * epsilon * epsilon;
--}
--
--/*****************************************************************************/
--/*                                                                           */
--/*  fast_expansion_sum_zeroelim()   Sum two expansions, eliminating zero     */
--/*                                  components from the output expansion.    */
--/*                                                                           */
--/*  Sets h = e + f.  See my Robust Predicates paper for details.             */
--/*                                                                           */
--/*  If round-to-even is used (as with IEEE 754), maintains the strongly      */
--/*  nonoverlapping property.  (That is, if e is strongly nonoverlapping, h   */
--/*  will be also.)  Does NOT maintain the nonoverlapping or nonadjacent      */
--/*  properties.                                                              */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifdef ANSI_DECLARATORS
--static int fast_expansion_sum_zeroelim(int elen, REAL *e, int flen, REAL *f, REAL *h)
--#else /* not ANSI_DECLARATORS */
--int fast_expansion_sum_zeroelim(elen, e, flen, f, h)  /* h cannot be e or f. */
--int elen;
--REAL *e;
--int flen;
--REAL *f;
--REAL *h;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  REAL Q;
--  INEXACT REAL Qnew;
--  INEXACT REAL hh;
--  INEXACT REAL bvirt;
--  REAL avirt, bround, around;
--  int eindex, findex, hindex;
--  REAL enow, fnow;
--
--  enow = e[0];
--  fnow = f[0];
--  eindex = findex = 0;
--  if ( (fnow > enow) == (fnow > -enow) ) {
--    Q = enow;
--    enow = e[++eindex];
--  } else {
--    Q = fnow;
--    fnow = f[++findex];
--  }
--  hindex = 0;
--  if ((eindex < elen) && (findex < flen)) {
--    if ((fnow > enow) == (fnow > -enow)) {
--      Fast_Two_Sum(enow, Q, Qnew, hh);
--      enow = e[++eindex];
--    } else {
--      Fast_Two_Sum(fnow, Q, Qnew, hh);
--      fnow = f[++findex];
--    }
--    Q = Qnew;
--    if (hh != 0.0) {
--      h[hindex++] = hh;
--    }
--    while ((eindex < elen) && (findex < flen)) {
--      if ((fnow > enow) == (fnow > -enow)) {
--        Two_Sum(Q, enow, Qnew, hh);
--        enow = e[++eindex];
--      } else {
--        Two_Sum(Q, fnow, Qnew, hh);
--        fnow = f[++findex];
--      }
--      Q = Qnew;
--      if (hh != 0.0) {
--        h[hindex++] = hh;
--      }
--    }
--  }
--  while (eindex < elen) {
--    Two_Sum(Q, enow, Qnew, hh);
--    enow = e[++eindex];
--    Q = Qnew;
--    if (hh != 0.0) {
--      h[hindex++] = hh;
--    }
--  }
--  while (findex < flen) {
--    Two_Sum(Q, fnow, Qnew, hh);
--    fnow = f[++findex];
--    Q = Qnew;
--    if (hh != 0.0) {
--      h[hindex++] = hh;
--    }
--  }
--  if ((Q != 0.0) || (hindex == 0)) {
--    h[hindex++] = Q;
--  }
--  return hindex;
--}
--
--/*****************************************************************************/
--/*                                                                           */
--/*  scale_expansion_zeroelim()   Multiply an expansion by a scalar,          */
--/*                               eliminating zero components from the        */
--/*                               output expansion.                           */
--/*                                                                           */
--/*  Sets h = be.  See my Robust Predicates paper for details.                */
--/*                                                                           */
--/*  Maintains the nonoverlapping property.  If round-to-even is used (as     */
--/*  with IEEE 754), maintains the strongly nonoverlapping and nonadjacent    */
--/*  properties as well.  (That is, if e has one of these properties, so      */
--/*  will h.)                                                                 */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifdef ANSI_DECLARATORS
--int scale_expansion_zeroelim(int elen, REAL *e, REAL b, REAL *h)
--#else /* not ANSI_DECLARATORS */
--int scale_expansion_zeroelim(elen, e, b, h)   /* e and h cannot be the same. */
--int elen;
--REAL *e;
--REAL b;
--REAL *h;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  INEXACT REAL Q, sum;
--  REAL hh;
--  INEXACT REAL product1;
--  REAL product0;
--  int eindex, hindex;
--  REAL enow;
--  INEXACT REAL bvirt;
--  REAL avirt, bround, around;
--  INEXACT REAL c;
--  INEXACT REAL abig;
--  REAL ahi, alo, bhi, blo;
--  REAL err1, err2, err3;
--
--  Split(b, bhi, blo);
--  Two_Product_Presplit(e[0], b, bhi, blo, Q, hh);
--  hindex = 0;
--  if (hh != 0) {
--    h[hindex++] = hh;
--  }
--  for (eindex = 1; eindex < elen; eindex++) {
--    enow = e[eindex];
--    Two_Product_Presplit(enow, b, bhi, blo, product1, product0);
--    Two_Sum(Q, product0, sum, hh);
--    if (hh != 0) {
--      h[hindex++] = hh;
--    }
--    Fast_Two_Sum(product1, sum, Q, hh);
--    if (hh != 0) {
--      h[hindex++] = hh;
--    }
--  }
--  if ((Q != 0.0) || (hindex == 0)) {
--    h[hindex++] = Q;
--  }
--  return hindex;
--}
--
--/*****************************************************************************/
--/*                                                                           */
--/*  estimate()   Produce a one-word estimate of an expansion's value.        */
--/*                                                                           */
--/*  See my Robust Predicates paper for details.                              */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifdef ANSI_DECLARATORS
--REAL estimate(int elen, REAL *e)
--#else /* not ANSI_DECLARATORS */
--REAL estimate(elen, e)
--int elen;
--REAL *e;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  REAL Q;
--  int eindex;
--
--  Q = e[0];
--  for (eindex = 1; eindex < elen; eindex++) {
--    Q += e[eindex];
--  }
--  return Q;
--}
--
--/*****************************************************************************/
--/*                                                                           */
--/*  counterclockwise()   Return a positive value if the points pa, pb, and   */
--/*                       pc occur in counterclockwise order; a negative      */
--/*                       value if they occur in clockwise order; and zero    */
--/*                       if they are collinear.  The result is also a rough  */
--/*                       approximation of twice the signed area of the       */
--/*                       triangle defined by the three points.               */
--/*                                                                           */
--/*  Uses exact arithmetic if necessary to ensure a correct answer.  The      */
--/*  result returned is the determinant of a matrix.  This determinant is     */
--/*  computed adaptively, in the sense that exact arithmetic is used only to  */
--/*  the degree it is needed to ensure that the returned value has the        */
--/*  correct sign.  Hence, this function is usually quite fast, but will run  */
--/*  more slowly when the input points are collinear or nearly so.            */
--/*                                                                           */
--/*  See my Robust Predicates paper for details.                              */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifdef ANSI_DECLARATORS
--REAL counterclockwiseadapt(vertex pa, vertex pb, vertex pc, REAL detsum)
--#else /* not ANSI_DECLARATORS */
--REAL counterclockwiseadapt(pa, pb, pc, detsum)
--vertex pa;
--vertex pb;
--vertex pc;
--REAL detsum;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  INEXACT REAL acx, acy, bcx, bcy;
--  REAL acxtail, acytail, bcxtail, bcytail;
--  INEXACT REAL detleft, detright;
--  REAL detlefttail, detrighttail;
--  REAL det, errbound;
--  REAL B[4] = {0.}, C1[8] = {0.}, C2[12] = {0.}, D[16] = {0.};
--  INEXACT REAL B3;
--  int C1length, C2length, Dlength;
--  REAL u[4] = {0.};
--  INEXACT REAL u3;
--  INEXACT REAL s1, t1;
--  REAL s0, t0;
--
--  INEXACT REAL bvirt;
--  REAL avirt, bround, around;
--  INEXACT REAL c;
--  INEXACT REAL abig;
--  REAL ahi, alo, bhi, blo;
--  REAL err1, err2, err3;
--  INEXACT REAL _i, _j;
--  REAL _0;
--
--  acx = (REAL) (pa[0] - pc[0]);
--  bcx = (REAL) (pb[0] - pc[0]);
--  acy = (REAL) (pa[1] - pc[1]);
--  bcy = (REAL) (pb[1] - pc[1]);
--
--  Two_Product(acx, bcy, detleft, detlefttail);
--  Two_Product(acy, bcx, detright, detrighttail);
--
--  Two_Two_Diff(detleft, detlefttail, detright, detrighttail,
--               B3, B[2], B[1], B[0]);
--  B[3] = B3;
--
--  det = estimate(4, B);
--  errbound = ccwerrboundB * detsum;
--  if ((det >= errbound) || (-det >= errbound)) {
--    return det;
--  }
--
--  Two_Diff_Tail(pa[0], pc[0], acx, acxtail);
--  Two_Diff_Tail(pb[0], pc[0], bcx, bcxtail);
--  Two_Diff_Tail(pa[1], pc[1], acy, acytail);
--  Two_Diff_Tail(pb[1], pc[1], bcy, bcytail);
--
--  if ((acxtail == 0.0) && (acytail == 0.0)
--      && (bcxtail == 0.0) && (bcytail == 0.0)) {
--    return det;
--  }
--
--  errbound = ccwerrboundC * detsum + resulterrbound * Absolute(det);
--  det += (acx * bcytail + bcy * acxtail)
--       - (acy * bcxtail + bcx * acytail);
--  if ((det >= errbound) || (-det >= errbound)) {
--    return det;
--  }
--
--  Two_Product(acxtail, bcy, s1, s0);
--  Two_Product(acytail, bcx, t1, t0);
--  Two_Two_Diff(s1, s0, t1, t0, u3, u[2], u[1], u[0]);
--  u[3] = u3;
--  C1length = fast_expansion_sum_zeroelim(4, B, 4, u, C1);
--
--  Two_Product(acx, bcytail, s1, s0);
--  Two_Product(acy, bcxtail, t1, t0);
--  Two_Two_Diff(s1, s0, t1, t0, u3, u[2], u[1], u[0]);
--  u[3] = u3;
--  C2length = fast_expansion_sum_zeroelim(C1length, C1, 4, u, C2);
--
--  Two_Product(acxtail, bcytail, s1, s0);
--  Two_Product(acytail, bcxtail, t1, t0);
--  Two_Two_Diff(s1, s0, t1, t0, u3, u[2], u[1], u[0]);
--  u[3] = u3;
--  Dlength = fast_expansion_sum_zeroelim(C2length, C2, 4, u, D);
--
--  return(D[Dlength - 1]);
--}
--
--#ifdef ANSI_DECLARATORS
--REAL counterclockwise(struct mesh *m, struct behavior *b,
--                      vertex pa, vertex pb, vertex pc)
--#else /* not ANSI_DECLARATORS */
--REAL counterclockwise(m, b, pa, pb, pc)
--struct mesh *m;
--struct behavior *b;
--vertex pa;
--vertex pb;
--vertex pc;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  REAL detleft, detright, det;
--  REAL detsum, errbound;
--
--  m->counterclockcount++;
--
--  detleft = (pa[0] - pc[0]) * (pb[1] - pc[1]);
--  detright = (pa[1] - pc[1]) * (pb[0] - pc[0]);
--  det = detleft - detright;
--
--  if (b->noexact) {
--    return det;
--  }
--
--  if (detleft > 0.0) {
--    if (detright <= 0.0) {
--      return det;
--    } else {
--      detsum = detleft + detright;
--    }
--  } else if (detleft < 0.0) {
--    if (detright >= 0.0) {
--      return det;
--    } else {
--      detsum = -detleft - detright;
--    }
--  } else {
--    return det;
--  }
--
--  errbound = ccwerrboundA * detsum;
--  if ((det >= errbound) || (-det >= errbound)) {
--    return det;
--  }
--
--  return counterclockwiseadapt(pa, pb, pc, detsum);
--}
--
--/*****************************************************************************/
--/*                                                                           */
--/*  incircle()   Return a positive value if the point pd lies inside the     */
--/*               circle passing through pa, pb, and pc; a negative value if  */
--/*               it lies outside; and zero if the four points are cocircular.*/
--/*               The points pa, pb, and pc must be in counterclockwise       */
--/*               order, or the sign of the result will be reversed.          */
--/*                                                                           */
--/*  Uses exact arithmetic if necessary to ensure a correct answer.  The      */
--/*  result returned is the determinant of a matrix.  This determinant is     */
--/*  computed adaptively, in the sense that exact arithmetic is used only to  */
--/*  the degree it is needed to ensure that the returned value has the        */
--/*  correct sign.  Hence, this function is usually quite fast, but will run  */
--/*  more slowly when the input points are cocircular or nearly so.           */
--/*                                                                           */
--/*  See my Robust Predicates paper for details.                              */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifdef ANSI_DECLARATORS
--REAL incircleadapt(vertex pa, vertex pb, vertex pc, vertex pd, REAL permanent)
--#else /* not ANSI_DECLARATORS */
--REAL incircleadapt(pa, pb, pc, pd, permanent)
--vertex pa;
--vertex pb;
--vertex pc;
--vertex pd;
--REAL permanent;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  INEXACT REAL adx, bdx, cdx, ady, bdy, cdy;
--  REAL det, errbound;
--
--  INEXACT REAL bdxcdy1, cdxbdy1, cdxady1, adxcdy1, adxbdy1, bdxady1;
--  REAL bdxcdy0, cdxbdy0, cdxady0, adxcdy0, adxbdy0, bdxady0;
--  REAL bc[4], ca[4], ab[4];
--  INEXACT REAL bc3, ca3, ab3;
--  REAL axbc[8], axxbc[16] ={0.}, aybc[8], ayybc[16] = {0.}, adet[32] = {0.};
--  int axbclen, axxbclen, aybclen, ayybclen, alen;
--  REAL bxca[8], bxxca[16] = {0.}, byca[8], byyca[16] = {0.}, bdet[32] = {0.};
--  int bxcalen, bxxcalen, bycalen, byycalen, blen;
--  REAL cxab[8], cxxab[16] = {0.}, cyab[8], cyyab[16] = {0.}, cdet[32] = {0.};
--  int cxablen, cxxablen, cyablen, cyyablen, clen;
--  REAL abdet[64] = {0,};
--  int ablen;
--  REAL fin1[1152] = {0.}, fin2[1152] = {0.};
--  REAL *finnow, *finother, *finswap;
--  int finlength;
--
--  REAL adxtail, bdxtail, cdxtail, adytail, bdytail, cdytail;
--  INEXACT REAL adxadx1, adyady1, bdxbdx1, bdybdy1, cdxcdx1, cdycdy1;
--  REAL adxadx0, adyady0, bdxbdx0, bdybdy0, cdxcdx0, cdycdy0;
--  REAL aa[4], bb[4], cc[4];
--  INEXACT REAL aa3, bb3, cc3;
--  INEXACT REAL ti1, tj1;
--  REAL ti0, tj0;
--  REAL u[4] = {0.}, v[4] = {0.};
--  INEXACT REAL u3, v3;
--  REAL temp8[8], temp16a[16] = {0.}, temp16b[16] = {0.}, temp16c[16] = {0.};
--  REAL temp32a[32] = {0.}, temp32b[32] = {0.}, temp48[48] = {0.}, temp64[64] = {0.};
--  int temp8len, temp16alen, temp16blen, temp16clen;
--  int temp32alen, temp32blen, temp48len, temp64len;
--  REAL axtbb[8], axtcc[8], aytbb[8], aytcc[8];
--  int axtbblen, axtcclen, aytbblen, aytcclen;
--  REAL bxtaa[8], bxtcc[8], bytaa[8], bytcc[8];
--  int bxtaalen, bxtcclen, bytaalen, bytcclen;
--  REAL cxtaa[8], cxtbb[8], cytaa[8], cytbb[8];
--  int cxtaalen, cxtbblen, cytaalen, cytbblen;
--  REAL axtbc[8], aytbc[8], bxtca[8], bytca[8], cxtab[8], cytab[8];
--  int axtbclen = 8, aytbclen = 8, bxtcalen = 8, bytcalen = 8, cxtablen = 8, cytablen = 8;
--  REAL axtbct[16], aytbct[16], bxtcat[16], bytcat[16], cxtabt[16], cytabt[16];
--  int axtbctlen, aytbctlen, bxtcatlen, bytcatlen, cxtabtlen, cytabtlen;
--  REAL axtbctt[8], aytbctt[8], bxtcatt[8];
--  REAL bytcatt[8], cxtabtt[8], cytabtt[8];
--  int axtbcttlen, aytbcttlen, bxtcattlen, bytcattlen, cxtabttlen, cytabttlen;
--  REAL abt[8], bct[8], cat[8];
--  int abtlen, bctlen, catlen;
--  REAL abtt[4], bctt[4], catt[4];
--  int abttlen, bcttlen, cattlen;
--  INEXACT REAL abtt3, bctt3, catt3;
--  REAL negate;
--
--  INEXACT REAL bvirt;
--  REAL avirt, bround, around;
--  INEXACT REAL c;
--  INEXACT REAL abig;
--  REAL ahi, alo, bhi, blo;
--  REAL err1, err2, err3;
--  INEXACT REAL _i, _j;
--  REAL _0;
--
--  adx = (REAL) (pa[0] - pd[0]);
--  bdx = (REAL) (pb[0] - pd[0]);
--  cdx = (REAL) (pc[0] - pd[0]);
--  ady = (REAL) (pa[1] - pd[1]);
--  bdy = (REAL) (pb[1] - pd[1]);
--  cdy = (REAL) (pc[1] - pd[1]);
--
--  Two_Product(bdx, cdy, bdxcdy1, bdxcdy0);
--  Two_Product(cdx, bdy, cdxbdy1, cdxbdy0);
--  Two_Two_Diff(bdxcdy1, bdxcdy0, cdxbdy1, cdxbdy0, bc3, bc[2], bc[1], bc[0]);
--  bc[3] = bc3;
--  axbclen = scale_expansion_zeroelim(4, bc, adx, axbc);
--  axxbclen = scale_expansion_zeroelim(axbclen, axbc, adx, axxbc);
--  aybclen = scale_expansion_zeroelim(4, bc, ady, aybc);
--  ayybclen = scale_expansion_zeroelim(aybclen, aybc, ady, ayybc);
--  alen = fast_expansion_sum_zeroelim(axxbclen, axxbc, ayybclen, ayybc, adet);
--
--  Two_Product(cdx, ady, cdxady1, cdxady0);
--  Two_Product(adx, cdy, adxcdy1, adxcdy0);
--  Two_Two_Diff(cdxady1, cdxady0, adxcdy1, adxcdy0, ca3, ca[2], ca[1], ca[0]);
--  ca[3] = ca3;
--  bxcalen = scale_expansion_zeroelim(4, ca, bdx, bxca);
--  bxxcalen = scale_expansion_zeroelim(bxcalen, bxca, bdx, bxxca);
--  bycalen = scale_expansion_zeroelim(4, ca, bdy, byca);
--  byycalen = scale_expansion_zeroelim(bycalen, byca, bdy, byyca);
--  blen = fast_expansion_sum_zeroelim(bxxcalen, bxxca, byycalen, byyca, bdet);
--
--  Two_Product(adx, bdy, adxbdy1, adxbdy0);
--  Two_Product(bdx, ady, bdxady1, bdxady0);
--  Two_Two_Diff(adxbdy1, adxbdy0, bdxady1, bdxady0, ab3, ab[2], ab[1], ab[0]);
--  ab[3] = ab3;
--  cxablen = scale_expansion_zeroelim(4, ab, cdx, cxab);
--  cxxablen = scale_expansion_zeroelim(cxablen, cxab, cdx, cxxab);
--  cyablen = scale_expansion_zeroelim(4, ab, cdy, cyab);
--  cyyablen = scale_expansion_zeroelim(cyablen, cyab, cdy, cyyab);
--  clen = fast_expansion_sum_zeroelim(cxxablen, cxxab, cyyablen, cyyab, cdet);
--
--  ablen = fast_expansion_sum_zeroelim(alen, adet, blen, bdet, abdet);
--  finlength = fast_expansion_sum_zeroelim(ablen, abdet, clen, cdet, fin1);
--
--  det = estimate(finlength, fin1);
--  errbound = iccerrboundB * permanent;
--  if ((det >= errbound) || (-det >= errbound)) {
--    return det;
--  }
--
--  Two_Diff_Tail(pa[0], pd[0], adx, adxtail);
--  Two_Diff_Tail(pa[1], pd[1], ady, adytail);
--  Two_Diff_Tail(pb[0], pd[0], bdx, bdxtail);
--  Two_Diff_Tail(pb[1], pd[1], bdy, bdytail);
--  Two_Diff_Tail(pc[0], pd[0], cdx, cdxtail);
--  Two_Diff_Tail(pc[1], pd[1], cdy, cdytail);
--  if ((adxtail == 0.0) && (bdxtail == 0.0) && (cdxtail == 0.0)
--      && (adytail == 0.0) && (bdytail == 0.0) && (cdytail == 0.0)) {
--    return det;
--  }
--
--  errbound = iccerrboundC * permanent + resulterrbound * Absolute(det);
--  det += ((adx * adx + ady * ady) * ((bdx * cdytail + cdy * bdxtail)
--                                     - (bdy * cdxtail + cdx * bdytail))
--          + 2.0 * (adx * adxtail + ady * adytail) * (bdx * cdy - bdy * cdx))
--       + ((bdx * bdx + bdy * bdy) * ((cdx * adytail + ady * cdxtail)
--                                     - (cdy * adxtail + adx * cdytail))
--          + 2.0 * (bdx * bdxtail + bdy * bdytail) * (cdx * ady - cdy * adx))
--       + ((cdx * cdx + cdy * cdy) * ((adx * bdytail + bdy * adxtail)
--                                     - (ady * bdxtail + bdx * adytail))
--          + 2.0 * (cdx * cdxtail + cdy * cdytail) * (adx * bdy - ady * bdx));
--  if ((det >= errbound) || (-det >= errbound)) {
--    return det;
--  }
--
--  finnow = fin1;
--  finother = fin2;
--
--  if ((bdxtail != 0.0) || (bdytail != 0.0)
--      || (cdxtail != 0.0) || (cdytail != 0.0)) {
--    Square(adx, adxadx1, adxadx0);
--    Square(ady, adyady1, adyady0);
--    Two_Two_Sum(adxadx1, adxadx0, adyady1, adyady0, aa3, aa[2], aa[1], aa[0]);
--    aa[3] = aa3;
--  }
--  if ((cdxtail != 0.0) || (cdytail != 0.0)
--      || (adxtail != 0.0) || (adytail != 0.0)) {
--    Square(bdx, bdxbdx1, bdxbdx0);
--    Square(bdy, bdybdy1, bdybdy0);
--    Two_Two_Sum(bdxbdx1, bdxbdx0, bdybdy1, bdybdy0, bb3, bb[2], bb[1], bb[0]);
--    bb[3] = bb3;
--  }
--  if ((adxtail != 0.0) || (adytail != 0.0)
--      || (bdxtail != 0.0) || (bdytail != 0.0)) {
--    Square(cdx, cdxcdx1, cdxcdx0);
--    Square(cdy, cdycdy1, cdycdy0);
--    Two_Two_Sum(cdxcdx1, cdxcdx0, cdycdy1, cdycdy0, cc3, cc[2], cc[1], cc[0]);
--    cc[3] = cc3;
--  }
--
--  if (adxtail != 0.0) {
--    axtbclen = scale_expansion_zeroelim(4, bc, adxtail, axtbc);
--    temp16alen = scale_expansion_zeroelim(axtbclen, axtbc, 2.0 * adx,
--                                          temp16a);
--
--    axtcclen = scale_expansion_zeroelim(4, cc, adxtail, axtcc);
--    temp16blen = scale_expansion_zeroelim(axtcclen, axtcc, bdy, temp16b);
--
--    axtbblen = scale_expansion_zeroelim(4, bb, adxtail, axtbb);
--    temp16clen = scale_expansion_zeroelim(axtbblen, axtbb, -cdy, temp16c);
--
--    temp32alen = fast_expansion_sum_zeroelim(temp16alen, temp16a,
--                                            temp16blen, temp16b, temp32a);
--    temp48len = fast_expansion_sum_zeroelim(temp16clen, temp16c,
--                                            temp32alen, temp32a, temp48);
--    finlength = fast_expansion_sum_zeroelim(finlength, finnow, temp48len,
--                                            temp48, finother);
--    finswap = finnow; finnow = finother; finother = finswap;
--  }
--  if (adytail != 0.0) {
--    aytbclen = scale_expansion_zeroelim(4, bc, adytail, aytbc);
--    temp16alen = scale_expansion_zeroelim(aytbclen, aytbc, 2.0 * ady,
--                                          temp16a);
--
--    aytbblen = scale_expansion_zeroelim(4, bb, adytail, aytbb);
--    temp16blen = scale_expansion_zeroelim(aytbblen, aytbb, cdx, temp16b);
--
--    aytcclen = scale_expansion_zeroelim(4, cc, adytail, aytcc);
--    temp16clen = scale_expansion_zeroelim(aytcclen, aytcc, -bdx, temp16c);
--
--    temp32alen = fast_expansion_sum_zeroelim(temp16alen, temp16a,
--                                            temp16blen, temp16b, temp32a);
--    temp48len = fast_expansion_sum_zeroelim(temp16clen, temp16c,
--                                            temp32alen, temp32a, temp48);
--    finlength = fast_expansion_sum_zeroelim(finlength, finnow, temp48len,
--                                            temp48, finother);
--    finswap = finnow; finnow = finother; finother = finswap;
--  }
--  if (bdxtail != 0.0) {
--    bxtcalen = scale_expansion_zeroelim(4, ca, bdxtail, bxtca);
--    temp16alen = scale_expansion_zeroelim(bxtcalen, bxtca, 2.0 * bdx,
--                                          temp16a);
--
--    bxtaalen = scale_expansion_zeroelim(4, aa, bdxtail, bxtaa);
--    temp16blen = scale_expansion_zeroelim(bxtaalen, bxtaa, cdy, temp16b);
--
--    bxtcclen = scale_expansion_zeroelim(4, cc, bdxtail, bxtcc);
--    temp16clen = scale_expansion_zeroelim(bxtcclen, bxtcc, -ady, temp16c);
--
--    temp32alen = fast_expansion_sum_zeroelim(temp16alen, temp16a,
--                                            temp16blen, temp16b, temp32a);
--    temp48len = fast_expansion_sum_zeroelim(temp16clen, temp16c,
--                                            temp32alen, temp32a, temp48);
--    finlength = fast_expansion_sum_zeroelim(finlength, finnow, temp48len,
--                                            temp48, finother);
--    finswap = finnow; finnow = finother; finother = finswap;
--  }
--  if (bdytail != 0.0) {
--    bytcalen = scale_expansion_zeroelim(4, ca, bdytail, bytca);
--    temp16alen = scale_expansion_zeroelim(bytcalen, bytca, 2.0 * bdy,
--                                          temp16a);
--
--    bytcclen = scale_expansion_zeroelim(4, cc, bdytail, bytcc);
--    temp16blen = scale_expansion_zeroelim(bytcclen, bytcc, adx, temp16b);
--
--    bytaalen = scale_expansion_zeroelim(4, aa, bdytail, bytaa);
--    temp16clen = scale_expansion_zeroelim(bytaalen, bytaa, -cdx, temp16c);
--
--    temp32alen = fast_expansion_sum_zeroelim(temp16alen, temp16a,
--                                            temp16blen, temp16b, temp32a);
--    temp48len = fast_expansion_sum_zeroelim(temp16clen, temp16c,
--                                            temp32alen, temp32a, temp48);
--    finlength = fast_expansion_sum_zeroelim(finlength, finnow, temp48len,
--                                            temp48, finother);
--    finswap = finnow; finnow = finother; finother = finswap;
--  }
--  if (cdxtail != 0.0) {
--    cxtablen = scale_expansion_zeroelim(4, ab, cdxtail, cxtab);
--    temp16alen = scale_expansion_zeroelim(cxtablen, cxtab, 2.0 * cdx,
--                                          temp16a);
--
--    cxtbblen = scale_expansion_zeroelim(4, bb, cdxtail, cxtbb);
--    temp16blen = scale_expansion_zeroelim(cxtbblen, cxtbb, ady, temp16b);
--
--    cxtaalen = scale_expansion_zeroelim(4, aa, cdxtail, cxtaa);
--    temp16clen = scale_expansion_zeroelim(cxtaalen, cxtaa, -bdy, temp16c);
--
--    temp32alen = fast_expansion_sum_zeroelim(temp16alen, temp16a,
--                                            temp16blen, temp16b, temp32a);
--    temp48len = fast_expansion_sum_zeroelim(temp16clen, temp16c,
--                                            temp32alen, temp32a, temp48);
--    finlength = fast_expansion_sum_zeroelim(finlength, finnow, temp48len,
--                                            temp48, finother);
--    finswap = finnow; finnow = finother; finother = finswap;
--  }
--  if (cdytail != 0.0) {
--    cytablen = scale_expansion_zeroelim(4, ab, cdytail, cytab);
--    temp16alen = scale_expansion_zeroelim(cytablen, cytab, 2.0 * cdy,
--                                          temp16a);
--
--    cytaalen = scale_expansion_zeroelim(4, aa, cdytail, cytaa);
--    temp16blen = scale_expansion_zeroelim(cytaalen, cytaa, bdx, temp16b);
--
--    cytbblen = scale_expansion_zeroelim(4, bb, cdytail, cytbb);
--    temp16clen = scale_expansion_zeroelim(cytbblen, cytbb, -adx, temp16c);
--
--    temp32alen = fast_expansion_sum_zeroelim(temp16alen, temp16a,
--                                            temp16blen, temp16b, temp32a);
--    temp48len = fast_expansion_sum_zeroelim(temp16clen, temp16c,
--                                            temp32alen, temp32a, temp48);
--    finlength = fast_expansion_sum_zeroelim(finlength, finnow, temp48len,
--                                            temp48, finother);
--    finswap = finnow; finnow = finother; finother = finswap;
--  }
--
--  if ((adxtail != 0.0) || (adytail != 0.0)) {
--    if ((bdxtail != 0.0) || (bdytail != 0.0)
--        || (cdxtail != 0.0) || (cdytail != 0.0)) {
--      Two_Product(bdxtail, cdy, ti1, ti0);
--      Two_Product(bdx, cdytail, tj1, tj0);
--      Two_Two_Sum(ti1, ti0, tj1, tj0, u3, u[2], u[1], u[0]);
--      u[3] = u3;
--      negate = -bdy;
--      Two_Product(cdxtail, negate, ti1, ti0);
--      negate = -bdytail;
--      Two_Product(cdx, negate, tj1, tj0);
--      Two_Two_Sum(ti1, ti0, tj1, tj0, v3, v[2], v[1], v[0]);
--      v[3] = v3;
--      bctlen = fast_expansion_sum_zeroelim(4, u, 4, v, bct);
--
--      Two_Product(bdxtail, cdytail, ti1, ti0);
--      Two_Product(cdxtail, bdytail, tj1, tj0);
--      Two_Two_Diff(ti1, ti0, tj1, tj0, bctt3, bctt[2], bctt[1], bctt[0]);
--      bctt[3] = bctt3;
--      bcttlen = 4;
--    } else {
--      bct[0] = 0.0;
--      bctlen = 1;
--      bctt[0] = 0.0;
--      bcttlen = 1;
--    }
--
--    if (adxtail != 0.0) {
--      temp16alen = scale_expansion_zeroelim(axtbclen, axtbc, adxtail, temp16a);
--      axtbctlen = scale_expansion_zeroelim(bctlen, bct, adxtail, axtbct);
--      temp32alen = scale_expansion_zeroelim(axtbctlen, axtbct, 2.0 * adx,
--                                            temp32a);
--      temp48len = fast_expansion_sum_zeroelim(temp16alen, temp16a,
--                                              temp32alen, temp32a, temp48);
--      finlength = fast_expansion_sum_zeroelim(finlength, finnow, temp48len,
--                                              temp48, finother);
--      finswap = finnow; finnow = finother; finother = finswap;
--      if (bdytail != 0.0) {
--        temp8len = scale_expansion_zeroelim(4, cc, adxtail, temp8);
--        temp16alen = scale_expansion_zeroelim(temp8len, temp8, bdytail,
--                                              temp16a);
--        finlength = fast_expansion_sum_zeroelim(finlength, finnow, temp16alen,
--                                                temp16a, finother);
--        finswap = finnow; finnow = finother; finother = finswap;
--      }
--      if (cdytail != 0.0) {
--        temp8len = scale_expansion_zeroelim(4, bb, -adxtail, temp8);
--        temp16alen = scale_expansion_zeroelim(temp8len, temp8, cdytail,
--                                              temp16a);
--        finlength = fast_expansion_sum_zeroelim(finlength, finnow, temp16alen,
--                                                temp16a, finother);
--        finswap = finnow; finnow = finother; finother = finswap;
--      }
--
--      temp32alen = scale_expansion_zeroelim(axtbctlen, axtbct, adxtail,
--                                            temp32a);
--      axtbcttlen = scale_expansion_zeroelim(bcttlen, bctt, adxtail, axtbctt);
--      temp16alen = scale_expansion_zeroelim(axtbcttlen, axtbctt, 2.0 * adx,
--                                            temp16a);
--      temp16blen = scale_expansion_zeroelim(axtbcttlen, axtbctt, adxtail,
--                                            temp16b);
--      temp32blen = fast_expansion_sum_zeroelim(temp16alen, temp16a,
--                                              temp16blen, temp16b, temp32b);
--      temp64len = fast_expansion_sum_zeroelim(temp32alen, temp32a,
--                                              temp32blen, temp32b, temp64);
--      finlength = fast_expansion_sum_zeroelim(finlength, finnow, temp64len,
--                                              temp64, finother);
--      finswap = finnow; finnow = finother; finother = finswap;
--    }
--    if (adytail != 0.0) {
--      temp16alen = scale_expansion_zeroelim(aytbclen, aytbc, adytail, temp16a);
--      aytbctlen = scale_expansion_zeroelim(bctlen, bct, adytail, aytbct);
--      temp32alen = scale_expansion_zeroelim(aytbctlen, aytbct, 2.0 * ady,
--                                            temp32a);
--      temp48len = fast_expansion_sum_zeroelim(temp16alen, temp16a,
--                                              temp32alen, temp32a, temp48);
--      finlength = fast_expansion_sum_zeroelim(finlength, finnow, temp48len,
--                                              temp48, finother);
--      finswap = finnow; finnow = finother; finother = finswap;
--
--
--      temp32alen = scale_expansion_zeroelim(aytbctlen, aytbct, adytail,
--                                            temp32a);
--      aytbcttlen = scale_expansion_zeroelim(bcttlen, bctt, adytail, aytbctt);
--      temp16alen = scale_expansion_zeroelim(aytbcttlen, aytbctt, 2.0 * ady,
--                                            temp16a);
--      temp16blen = scale_expansion_zeroelim(aytbcttlen, aytbctt, adytail,
--                                            temp16b);
--      temp32blen = fast_expansion_sum_zeroelim(temp16alen, temp16a,
--                                              temp16blen, temp16b, temp32b);
--      temp64len = fast_expansion_sum_zeroelim(temp32alen, temp32a,
--                                              temp32blen, temp32b, temp64);
--      finlength = fast_expansion_sum_zeroelim(finlength, finnow, temp64len,
--                                              temp64, finother);
--      finswap = finnow; finnow = finother; finother = finswap;
--    }
--  }
--  if ((bdxtail != 0.0) || (bdytail != 0.0)) {
--    if ((cdxtail != 0.0) || (cdytail != 0.0)
--        || (adxtail != 0.0) || (adytail != 0.0)) {
--      Two_Product(cdxtail, ady, ti1, ti0);
--      Two_Product(cdx, adytail, tj1, tj0);
--      Two_Two_Sum(ti1, ti0, tj1, tj0, u3, u[2], u[1], u[0]);
--      u[3] = u3;
--      negate = -cdy;
--      Two_Product(adxtail, negate, ti1, ti0);
--      negate = -cdytail;
--      Two_Product(adx, negate, tj1, tj0);
--      Two_Two_Sum(ti1, ti0, tj1, tj0, v3, v[2], v[1], v[0]);
--      v[3] = v3;
--      catlen = fast_expansion_sum_zeroelim(4, u, 4, v, cat);
--
--      Two_Product(cdxtail, adytail, ti1, ti0);
--      Two_Product(adxtail, cdytail, tj1, tj0);
--      Two_Two_Diff(ti1, ti0, tj1, tj0, catt3, catt[2], catt[1], catt[0]);
--      catt[3] = catt3;
--      cattlen = 4;
--    } else {
--      cat[0] = 0.0;
--      catlen = 1;
--      catt[0] = 0.0;
--      cattlen = 1;
--    }
--
--    if (bdxtail != 0.0) {
--      temp16alen = scale_expansion_zeroelim(bxtcalen, bxtca, bdxtail, temp16a);
--      bxtcatlen = scale_expansion_zeroelim(catlen, cat, bdxtail, bxtcat);
--      temp32alen = scale_expansion_zeroelim(bxtcatlen, bxtcat, 2.0 * bdx,
--                                            temp32a);
--      temp48len = fast_expansion_sum_zeroelim(temp16alen, temp16a,
--                                              temp32alen, temp32a, temp48);
--      finlength = fast_expansion_sum_zeroelim(finlength, finnow, temp48len,
--                                              temp48, finother);
--      finswap = finnow; finnow = finother; finother = finswap;
--      if (cdytail != 0.0) {
--        temp8len = scale_expansion_zeroelim(4, aa, bdxtail, temp8);
--        temp16alen = scale_expansion_zeroelim(temp8len, temp8, cdytail,
--                                              temp16a);
--        finlength = fast_expansion_sum_zeroelim(finlength, finnow, temp16alen,
--                                                temp16a, finother);
--        finswap = finnow; finnow = finother; finother = finswap;
--      }
--      if (adytail != 0.0) {
--        temp8len = scale_expansion_zeroelim(4, cc, -bdxtail, temp8);
--        temp16alen = scale_expansion_zeroelim(temp8len, temp8, adytail,
--                                              temp16a);
--        finlength = fast_expansion_sum_zeroelim(finlength, finnow, temp16alen,
--                                                temp16a, finother);
--        finswap = finnow; finnow = finother; finother = finswap;
--      }
--
--      temp32alen = scale_expansion_zeroelim(bxtcatlen, bxtcat, bdxtail,
--                                            temp32a);
--      bxtcattlen = scale_expansion_zeroelim(cattlen, catt, bdxtail, bxtcatt);
--      temp16alen = scale_expansion_zeroelim(bxtcattlen, bxtcatt, 2.0 * bdx,
--                                            temp16a);
--      temp16blen = scale_expansion_zeroelim(bxtcattlen, bxtcatt, bdxtail,
--                                            temp16b);
--      temp32blen = fast_expansion_sum_zeroelim(temp16alen, temp16a,
--                                              temp16blen, temp16b, temp32b);
--      temp64len = fast_expansion_sum_zeroelim(temp32alen, temp32a,
--                                              temp32blen, temp32b, temp64);
--      finlength = fast_expansion_sum_zeroelim(finlength, finnow, temp64len,
--                                              temp64, finother);
--      finswap = finnow; finnow = finother; finother = finswap;
--    }
--    if (bdytail != 0.0) {
--      temp16alen = scale_expansion_zeroelim(bytcalen, bytca, bdytail, temp16a);
--      bytcatlen = scale_expansion_zeroelim(catlen, cat, bdytail, bytcat);
--      temp32alen = scale_expansion_zeroelim(bytcatlen, bytcat, 2.0 * bdy,
--                                            temp32a);
--      temp48len = fast_expansion_sum_zeroelim(temp16alen, temp16a,
--                                              temp32alen, temp32a, temp48);
--      finlength = fast_expansion_sum_zeroelim(finlength, finnow, temp48len,
--                                              temp48, finother);
--      finswap = finnow; finnow = finother; finother = finswap;
--
--
--      temp32alen = scale_expansion_zeroelim(bytcatlen, bytcat, bdytail,
--                                            temp32a);
--      bytcattlen = scale_expansion_zeroelim(cattlen, catt, bdytail, bytcatt);
--      temp16alen = scale_expansion_zeroelim(bytcattlen, bytcatt, 2.0 * bdy,
--                                            temp16a);
--      temp16blen = scale_expansion_zeroelim(bytcattlen, bytcatt, bdytail,
--                                            temp16b);
--      temp32blen = fast_expansion_sum_zeroelim(temp16alen, temp16a,
--                                              temp16blen, temp16b, temp32b);
--      temp64len = fast_expansion_sum_zeroelim(temp32alen, temp32a,
--                                              temp32blen, temp32b, temp64);
--      finlength = fast_expansion_sum_zeroelim(finlength, finnow, temp64len,
--                                              temp64, finother);
--      finswap = finnow; finnow = finother; finother = finswap;
--    }
--  }
--  if ((cdxtail != 0.0) || (cdytail != 0.0)) {
--    if ((adxtail != 0.0) || (adytail != 0.0)
--        || (bdxtail != 0.0) || (bdytail != 0.0)) {
--      Two_Product(adxtail, bdy, ti1, ti0);
--      Two_Product(adx, bdytail, tj1, tj0);
--      Two_Two_Sum(ti1, ti0, tj1, tj0, u3, u[2], u[1], u[0]);
--      u[3] = u3;
--      negate = -ady;
--      Two_Product(bdxtail, negate, ti1, ti0);
--      negate = -adytail;
--      Two_Product(bdx, negate, tj1, tj0);
--      Two_Two_Sum(ti1, ti0, tj1, tj0, v3, v[2], v[1], v[0]);
--      v[3] = v3;
--      abtlen = fast_expansion_sum_zeroelim(4, u, 4, v, abt);
--
--      Two_Product(adxtail, bdytail, ti1, ti0);
--      Two_Product(bdxtail, adytail, tj1, tj0);
--      Two_Two_Diff(ti1, ti0, tj1, tj0, abtt3, abtt[2], abtt[1], abtt[0]);
--      abtt[3] = abtt3;
--      abttlen = 4;
--    } else {
--      abt[0] = 0.0;
--      abtlen = 1;
--      abtt[0] = 0.0;
--      abttlen = 1;
--    }
--
--    if (cdxtail != 0.0) {
--      temp16alen = scale_expansion_zeroelim(cxtablen, cxtab, cdxtail, temp16a);
--      cxtabtlen = scale_expansion_zeroelim(abtlen, abt, cdxtail, cxtabt);
--      temp32alen = scale_expansion_zeroelim(cxtabtlen, cxtabt, 2.0 * cdx,
--                                            temp32a);
--      temp48len = fast_expansion_sum_zeroelim(temp16alen, temp16a,
--                                              temp32alen, temp32a, temp48);
--      finlength = fast_expansion_sum_zeroelim(finlength, finnow, temp48len,
--                                              temp48, finother);
--      finswap = finnow; finnow = finother; finother = finswap;
--      if (adytail != 0.0) {
--        temp8len = scale_expansion_zeroelim(4, bb, cdxtail, temp8);
--        temp16alen = scale_expansion_zeroelim(temp8len, temp8, adytail,
--                                              temp16a);
--        finlength = fast_expansion_sum_zeroelim(finlength, finnow, temp16alen,
--                                                temp16a, finother);
--        finswap = finnow; finnow = finother; finother = finswap;
--      }
--      if (bdytail != 0.0) {
--        temp8len = scale_expansion_zeroelim(4, aa, -cdxtail, temp8);
--        temp16alen = scale_expansion_zeroelim(temp8len, temp8, bdytail,
--                                              temp16a);
--        finlength = fast_expansion_sum_zeroelim(finlength, finnow, temp16alen,
--                                                temp16a, finother);
--        finswap = finnow; finnow = finother; finother = finswap;
--      }
--
--      temp32alen = scale_expansion_zeroelim(cxtabtlen, cxtabt, cdxtail,
--                                            temp32a);
--      cxtabttlen = scale_expansion_zeroelim(abttlen, abtt, cdxtail, cxtabtt);
--      temp16alen = scale_expansion_zeroelim(cxtabttlen, cxtabtt, 2.0 * cdx,
--                                            temp16a);
--      temp16blen = scale_expansion_zeroelim(cxtabttlen, cxtabtt, cdxtail,
--                                            temp16b);
--      temp32blen = fast_expansion_sum_zeroelim(temp16alen, temp16a,
--                                              temp16blen, temp16b, temp32b);
--      temp64len = fast_expansion_sum_zeroelim(temp32alen, temp32a,
--                                              temp32blen, temp32b, temp64);
--      finlength = fast_expansion_sum_zeroelim(finlength, finnow, temp64len,
--                                              temp64, finother);
--      finswap = finnow; finnow = finother; finother = finswap;
--    }
--    if (cdytail != 0.0) {
--      temp16alen = scale_expansion_zeroelim(cytablen, cytab, cdytail, temp16a);
--      cytabtlen = scale_expansion_zeroelim(abtlen, abt, cdytail, cytabt);
--      temp32alen = scale_expansion_zeroelim(cytabtlen, cytabt, 2.0 * cdy,
--                                            temp32a);
--      temp48len = fast_expansion_sum_zeroelim(temp16alen, temp16a,
--                                              temp32alen, temp32a, temp48);
--      finlength = fast_expansion_sum_zeroelim(finlength, finnow, temp48len,
--                                              temp48, finother);
--      finswap = finnow; finnow = finother; finother = finswap;
--
--
--      temp32alen = scale_expansion_zeroelim(cytabtlen, cytabt, cdytail,
--                                            temp32a);
--      cytabttlen = scale_expansion_zeroelim(abttlen, abtt, cdytail, cytabtt);
--      temp16alen = scale_expansion_zeroelim(cytabttlen, cytabtt, 2.0 * cdy,
--                                            temp16a);
--      temp16blen = scale_expansion_zeroelim(cytabttlen, cytabtt, cdytail,
--                                            temp16b);
--      temp32blen = fast_expansion_sum_zeroelim(temp16alen, temp16a,
--                                              temp16blen, temp16b, temp32b);
--      temp64len = fast_expansion_sum_zeroelim(temp32alen, temp32a,
--                                              temp32blen, temp32b, temp64);
--      finlength = fast_expansion_sum_zeroelim(finlength, finnow, temp64len,
--                                              temp64, finother);
--      finnow = finother;
--    }
--  }
--
--  return finnow[finlength - 1];
--}
--
--#ifdef ANSI_DECLARATORS
--REAL incircle(struct mesh *m, struct behavior *b,
--              vertex pa, vertex pb, vertex pc, vertex pd)
--#else /* not ANSI_DECLARATORS */
--REAL incircle(m, b, pa, pb, pc, pd)
--struct mesh *m;
--struct behavior *b;
--vertex pa;
--vertex pb;
--vertex pc;
--vertex pd;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  REAL adx, bdx, cdx, ady, bdy, cdy;
--  REAL bdxcdy, cdxbdy, cdxady, adxcdy, adxbdy, bdxady;
--  REAL alift, blift, clift;
--  REAL det;
--  REAL permanent, errbound;
--
--  m->incirclecount++;
--
--  adx = pa[0] - pd[0];
--  bdx = pb[0] - pd[0];
--  cdx = pc[0] - pd[0];
--  ady = pa[1] - pd[1];
--  bdy = pb[1] - pd[1];
--  cdy = pc[1] - pd[1];
--
--  bdxcdy = bdx * cdy;
--  cdxbdy = cdx * bdy;
--  alift = adx * adx + ady * ady;
--
--  cdxady = cdx * ady;
--  adxcdy = adx * cdy;
--  blift = bdx * bdx + bdy * bdy;
--
--  adxbdy = adx * bdy;
--  bdxady = bdx * ady;
--  clift = cdx * cdx + cdy * cdy;
--
--  det = alift * (bdxcdy - cdxbdy)
--      + blift * (cdxady - adxcdy)
--      + clift * (adxbdy - bdxady);
--
--  if (b->noexact) {
--    return det;
--  }
--
--  permanent = (Absolute(bdxcdy) + Absolute(cdxbdy)) * alift
--            + (Absolute(cdxady) + Absolute(adxcdy)) * blift
--            + (Absolute(adxbdy) + Absolute(bdxady)) * clift;
--  errbound = iccerrboundA * permanent;
--  if ((det > errbound) || (-det > errbound)) {
--    return det;
--  }
--
--  return incircleadapt(pa, pb, pc, pd, permanent);
--}
--
--/*****************************************************************************/
--/*                                                                           */
--/*  orient3d()   Return a positive value if the point pd lies below the      */
--/*               plane passing through pa, pb, and pc; "below" is defined so */
--/*               that pa, pb, and pc appear in counterclockwise order when   */
--/*               viewed from above the plane.  Returns a negative value if   */
--/*               pd lies above the plane.  Returns zero if the points are    */
--/*               coplanar.  The result is also a rough approximation of six  */
--/*               times the signed volume of the tetrahedron defined by the   */
--/*               four points.                                                */
--/*                                                                           */
--/*  Uses exact arithmetic if necessary to ensure a correct answer.  The      */
--/*  result returned is the determinant of a matrix.  This determinant is     */
--/*  computed adaptively, in the sense that exact arithmetic is used only to  */
--/*  the degree it is needed to ensure that the returned value has the        */
--/*  correct sign.  Hence, this function is usually quite fast, but will run  */
--/*  more slowly when the input points are coplanar or nearly so.             */
--/*                                                                           */
--/*  See my Robust Predicates paper for details.                              */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifdef ANSI_DECLARATORS
--REAL orient3dadapt(vertex pa, vertex pb, vertex pc, vertex pd,
--                   REAL aheight, REAL bheight, REAL cheight, REAL dheight,
--                   REAL permanent)
--#else /* not ANSI_DECLARATORS */
--REAL orient3dadapt(pa, pb, pc, pd,
--                   aheight, bheight, cheight, dheight, permanent)
--vertex pa;
--vertex pb;
--vertex pc;
--vertex pd;
--REAL aheight;
--REAL bheight;
--REAL cheight;
--REAL dheight;
--REAL permanent;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  INEXACT REAL adx, bdx, cdx, ady, bdy, cdy, adheight, bdheight, cdheight;
--  REAL det, errbound;
--
--  INEXACT REAL bdxcdy1, cdxbdy1, cdxady1, adxcdy1, adxbdy1, bdxady1;
--  REAL bdxcdy0, cdxbdy0, cdxady0, adxcdy0, adxbdy0, bdxady0;
--  REAL bc[4], ca[4], ab[4];
--  INEXACT REAL bc3, ca3, ab3;
--  REAL adet[8]={0.}, bdet[8]={0.}, cdet[8]={0.};
--  int alen, blen, clen;
--  REAL abdet[16]={0.};
--  int ablen;
--  REAL *finnow, *finother, *finswap;
--  REAL fin1[192], fin2[192];
--  int finlength;
--
--  REAL adxtail, bdxtail, cdxtail;
--  REAL adytail, bdytail, cdytail;
--  REAL adheighttail, bdheighttail, cdheighttail;
--  INEXACT REAL at_blarge, at_clarge;
--  INEXACT REAL bt_clarge, bt_alarge;
--  INEXACT REAL ct_alarge, ct_blarge;
--  REAL at_b[4]={0.}, at_c[4]={0.}, bt_c[4]={0.}, bt_a[4]={0.}, ct_a[4]={0.}, ct_b[4]={0.};
--  int at_blen, at_clen, bt_clen, bt_alen, ct_alen, ct_blen;
--  INEXACT REAL bdxt_cdy1, cdxt_bdy1, cdxt_ady1;
--  INEXACT REAL adxt_cdy1, adxt_bdy1, bdxt_ady1;
--  REAL bdxt_cdy0, cdxt_bdy0, cdxt_ady0;
--  REAL adxt_cdy0, adxt_bdy0, bdxt_ady0;
--  INEXACT REAL bdyt_cdx1, cdyt_bdx1, cdyt_adx1;
--  INEXACT REAL adyt_cdx1, adyt_bdx1, bdyt_adx1;
--  REAL bdyt_cdx0, cdyt_bdx0, cdyt_adx0;
--  REAL adyt_cdx0, adyt_bdx0, bdyt_adx0;
--  REAL bct[8], cat[8], abt[8];
--  int bctlen, catlen, abtlen;
--  INEXACT REAL bdxt_cdyt1, cdxt_bdyt1, cdxt_adyt1;
--  INEXACT REAL adxt_cdyt1, adxt_bdyt1, bdxt_adyt1;
--  REAL bdxt_cdyt0, cdxt_bdyt0, cdxt_adyt0;
--  REAL adxt_cdyt0, adxt_bdyt0, bdxt_adyt0;
--  REAL u[4]={0.}, v[12]={0.}, w[16]={0.};
--  INEXACT REAL u3;
--  int vlength, wlength;
--  REAL negate;
--
--  INEXACT REAL bvirt;
--  REAL avirt, bround, around;
--  INEXACT REAL c;
--  INEXACT REAL abig;
--  REAL ahi, alo, bhi, blo;
--  REAL err1, err2, err3;
--  INEXACT REAL _i, _j, _k;
--  REAL _0;
--
--  adx = (REAL) (pa[0] - pd[0]);
--  bdx = (REAL) (pb[0] - pd[0]);
--  cdx = (REAL) (pc[0] - pd[0]);
--  ady = (REAL) (pa[1] - pd[1]);
--  bdy = (REAL) (pb[1] - pd[1]);
--  cdy = (REAL) (pc[1] - pd[1]);
--  adheight = (REAL) (aheight - dheight);
--  bdheight = (REAL) (bheight - dheight);
--  cdheight = (REAL) (cheight - dheight);
--
--  Two_Product(bdx, cdy, bdxcdy1, bdxcdy0);
--  Two_Product(cdx, bdy, cdxbdy1, cdxbdy0);
--  Two_Two_Diff(bdxcdy1, bdxcdy0, cdxbdy1, cdxbdy0, bc3, bc[2], bc[1], bc[0]);
--  bc[3] = bc3;
--  alen = scale_expansion_zeroelim(4, bc, adheight, adet);
--
--  Two_Product(cdx, ady, cdxady1, cdxady0);
--  Two_Product(adx, cdy, adxcdy1, adxcdy0);
--  Two_Two_Diff(cdxady1, cdxady0, adxcdy1, adxcdy0, ca3, ca[2], ca[1], ca[0]);
--  ca[3] = ca3;
--  blen = scale_expansion_zeroelim(4, ca, bdheight, bdet);
--
--  Two_Product(adx, bdy, adxbdy1, adxbdy0);
--  Two_Product(bdx, ady, bdxady1, bdxady0);
--  Two_Two_Diff(adxbdy1, adxbdy0, bdxady1, bdxady0, ab3, ab[2], ab[1], ab[0]);
--  ab[3] = ab3;
--  clen = scale_expansion_zeroelim(4, ab, cdheight, cdet);
--
--  ablen = fast_expansion_sum_zeroelim(alen, adet, blen, bdet, abdet);
--  finlength = fast_expansion_sum_zeroelim(ablen, abdet, clen, cdet, fin1);
--
--  det = estimate(finlength, fin1);
--  errbound = o3derrboundB * permanent;
--  if ((det >= errbound) || (-det >= errbound)) {
--    return det;
--  }
--
--  Two_Diff_Tail(pa[0], pd[0], adx, adxtail);
--  Two_Diff_Tail(pb[0], pd[0], bdx, bdxtail);
--  Two_Diff_Tail(pc[0], pd[0], cdx, cdxtail);
--  Two_Diff_Tail(pa[1], pd[1], ady, adytail);
--  Two_Diff_Tail(pb[1], pd[1], bdy, bdytail);
--  Two_Diff_Tail(pc[1], pd[1], cdy, cdytail);
--  Two_Diff_Tail(aheight, dheight, adheight, adheighttail);
--  Two_Diff_Tail(bheight, dheight, bdheight, bdheighttail);
--  Two_Diff_Tail(cheight, dheight, cdheight, cdheighttail);
--
--  if ((adxtail == 0.0) && (bdxtail == 0.0) && (cdxtail == 0.0) &&
--      (adytail == 0.0) && (bdytail == 0.0) && (cdytail == 0.0) &&
--      (adheighttail == 0.0) &&
--      (bdheighttail == 0.0) &&
--      (cdheighttail == 0.0)) {
--    return det;
--  }
--
--  errbound = o3derrboundC * permanent + resulterrbound * Absolute(det);
--  det += (adheight * ((bdx * cdytail + cdy * bdxtail) -
--                      (bdy * cdxtail + cdx * bdytail)) +
--          adheighttail * (bdx * cdy - bdy * cdx)) +
--         (bdheight * ((cdx * adytail + ady * cdxtail) -
--                      (cdy * adxtail + adx * cdytail)) +
--          bdheighttail * (cdx * ady - cdy * adx)) +
--         (cdheight * ((adx * bdytail + bdy * adxtail) -
--                      (ady * bdxtail + bdx * adytail)) +
--          cdheighttail * (adx * bdy - ady * bdx));
--  if ((det >= errbound) || (-det >= errbound)) {
--    return det;
--  }
--
--  finnow = fin1;
--  finother = fin2;
--
--  if (adxtail == 0.0) {
--    if (adytail == 0.0) {
--      at_b[0] = 0.0;
--      at_blen = 1;
--      at_c[0] = 0.0;
--      at_clen = 1;
--    } else {
--      negate = -adytail;
--      Two_Product(negate, bdx, at_blarge, at_b[0]);
--      at_b[1] = at_blarge;
--      at_blen = 2;
--      Two_Product(adytail, cdx, at_clarge, at_c[0]);
--      at_c[1] = at_clarge;
--      at_clen = 2;
--    }
--  } else {
--    if (adytail == 0.0) {
--      Two_Product(adxtail, bdy, at_blarge, at_b[0]);
--      at_b[1] = at_blarge;
--      at_blen = 2;
--      negate = -adxtail;
--      Two_Product(negate, cdy, at_clarge, at_c[0]);
--      at_c[1] = at_clarge;
--      at_clen = 2;
--    } else {
--      Two_Product(adxtail, bdy, adxt_bdy1, adxt_bdy0);
--      Two_Product(adytail, bdx, adyt_bdx1, adyt_bdx0);
--      Two_Two_Diff(adxt_bdy1, adxt_bdy0, adyt_bdx1, adyt_bdx0,
--                   at_blarge, at_b[2], at_b[1], at_b[0]);
--      at_b[3] = at_blarge;
--      at_blen = 4;
--      Two_Product(adytail, cdx, adyt_cdx1, adyt_cdx0);
--      Two_Product(adxtail, cdy, adxt_cdy1, adxt_cdy0);
--      Two_Two_Diff(adyt_cdx1, adyt_cdx0, adxt_cdy1, adxt_cdy0,
--                   at_clarge, at_c[2], at_c[1], at_c[0]);
--      at_c[3] = at_clarge;
--      at_clen = 4;
--    }
--  }
--  if (bdxtail == 0.0) {
--    if (bdytail == 0.0) {
--      bt_c[0] = 0.0;
--      bt_clen = 1;
--      bt_a[0] = 0.0;
--      bt_alen = 1;
--    } else {
--      negate = -bdytail;
--      Two_Product(negate, cdx, bt_clarge, bt_c[0]);
--      bt_c[1] = bt_clarge;
--      bt_clen = 2;
--      Two_Product(bdytail, adx, bt_alarge, bt_a[0]);
--      bt_a[1] = bt_alarge;
--      bt_alen = 2;
--    }
--  } else {
--    if (bdytail == 0.0) {
--      Two_Product(bdxtail, cdy, bt_clarge, bt_c[0]);
--      bt_c[1] = bt_clarge;
--      bt_clen = 2;
--      negate = -bdxtail;
--      Two_Product(negate, ady, bt_alarge, bt_a[0]);
--      bt_a[1] = bt_alarge;
--      bt_alen = 2;
--    } else {
--      Two_Product(bdxtail, cdy, bdxt_cdy1, bdxt_cdy0);
--      Two_Product(bdytail, cdx, bdyt_cdx1, bdyt_cdx0);
--      Two_Two_Diff(bdxt_cdy1, bdxt_cdy0, bdyt_cdx1, bdyt_cdx0,
--                   bt_clarge, bt_c[2], bt_c[1], bt_c[0]);
--      bt_c[3] = bt_clarge;
--      bt_clen = 4;
--      Two_Product(bdytail, adx, bdyt_adx1, bdyt_adx0);
--      Two_Product(bdxtail, ady, bdxt_ady1, bdxt_ady0);
--      Two_Two_Diff(bdyt_adx1, bdyt_adx0, bdxt_ady1, bdxt_ady0,
--                  bt_alarge, bt_a[2], bt_a[1], bt_a[0]);
--      bt_a[3] = bt_alarge;
--      bt_alen = 4;
--    }
--  }
--  if (cdxtail == 0.0) {
--    if (cdytail == 0.0) {
--      ct_a[0] = 0.0;
--      ct_alen = 1;
--      ct_b[0] = 0.0;
--      ct_blen = 1;
--    } else {
--      negate = -cdytail;
--      Two_Product(negate, adx, ct_alarge, ct_a[0]);
--      ct_a[1] = ct_alarge;
--      ct_alen = 2;
--      Two_Product(cdytail, bdx, ct_blarge, ct_b[0]);
--      ct_b[1] = ct_blarge;
--      ct_blen = 2;
--    }
--  } else {
--    if (cdytail == 0.0) {
--      Two_Product(cdxtail, ady, ct_alarge, ct_a[0]);
--      ct_a[1] = ct_alarge;
--      ct_alen = 2;
--      negate = -cdxtail;
--      Two_Product(negate, bdy, ct_blarge, ct_b[0]);
--      ct_b[1] = ct_blarge;
--      ct_blen = 2;
--    } else {
--      Two_Product(cdxtail, ady, cdxt_ady1, cdxt_ady0);
--      Two_Product(cdytail, adx, cdyt_adx1, cdyt_adx0);
--      Two_Two_Diff(cdxt_ady1, cdxt_ady0, cdyt_adx1, cdyt_adx0,
--                   ct_alarge, ct_a[2], ct_a[1], ct_a[0]);
--      ct_a[3] = ct_alarge;
--      ct_alen = 4;
--      Two_Product(cdytail, bdx, cdyt_bdx1, cdyt_bdx0);
--      Two_Product(cdxtail, bdy, cdxt_bdy1, cdxt_bdy0);
--      Two_Two_Diff(cdyt_bdx1, cdyt_bdx0, cdxt_bdy1, cdxt_bdy0,
--                   ct_blarge, ct_b[2], ct_b[1], ct_b[0]);
--      ct_b[3] = ct_blarge;
--      ct_blen = 4;
--    }
--  }
--
--  bctlen = fast_expansion_sum_zeroelim(bt_clen, bt_c, ct_blen, ct_b, bct);
--  wlength = scale_expansion_zeroelim(bctlen, bct, adheight, w);
--  finlength = fast_expansion_sum_zeroelim(finlength, finnow, wlength, w,
--                                          finother);
--  finswap = finnow; finnow = finother; finother = finswap;
--
--  catlen = fast_expansion_sum_zeroelim(ct_alen, ct_a, at_clen, at_c, cat);
--  wlength = scale_expansion_zeroelim(catlen, cat, bdheight, w);
--  finlength = fast_expansion_sum_zeroelim(finlength, finnow, wlength, w,
--                                          finother);
--  finswap = finnow; finnow = finother; finother = finswap;
--
--  abtlen = fast_expansion_sum_zeroelim(at_blen, at_b, bt_alen, bt_a, abt);
--  wlength = scale_expansion_zeroelim(abtlen, abt, cdheight, w);
--  finlength = fast_expansion_sum_zeroelim(finlength, finnow, wlength, w,
--                                          finother);
--  finswap = finnow; finnow = finother; finother = finswap;
--
--  if (adheighttail != 0.0) {
--    vlength = scale_expansion_zeroelim(4, bc, adheighttail, v);
--    finlength = fast_expansion_sum_zeroelim(finlength, finnow, vlength, v,
--                                            finother);
--    finswap = finnow; finnow = finother; finother = finswap;
--  }
--  if (bdheighttail != 0.0) {
--    vlength = scale_expansion_zeroelim(4, ca, bdheighttail, v);
--    finlength = fast_expansion_sum_zeroelim(finlength, finnow, vlength, v,
--                                            finother);
--    finswap = finnow; finnow = finother; finother = finswap;
--  }
--  if (cdheighttail != 0.0) {
--    vlength = scale_expansion_zeroelim(4, ab, cdheighttail, v);
--    finlength = fast_expansion_sum_zeroelim(finlength, finnow, vlength, v,
--                                            finother);
--    finswap = finnow; finnow = finother; finother = finswap;
--  }
--
--  if (adxtail != 0.0) {
--    if (bdytail != 0.0) {
--      Two_Product(adxtail, bdytail, adxt_bdyt1, adxt_bdyt0);
--      Two_One_Product(adxt_bdyt1, adxt_bdyt0, cdheight, u3, u[2], u[1], u[0]);
--      u[3] = u3;
--      finlength = fast_expansion_sum_zeroelim(finlength, finnow, 4, u,
--                                              finother);
--      finswap = finnow; finnow = finother; finother = finswap;
--      if (cdheighttail != 0.0) {
--        Two_One_Product(adxt_bdyt1, adxt_bdyt0, cdheighttail,
--                        u3, u[2], u[1], u[0]);
--        u[3] = u3;
--        finlength = fast_expansion_sum_zeroelim(finlength, finnow, 4, u,
--                                                finother);
--        finswap = finnow; finnow = finother; finother = finswap;
--      }
--    }
--    if (cdytail != 0.0) {
--      negate = -adxtail;
--      Two_Product(negate, cdytail, adxt_cdyt1, adxt_cdyt0);
--      Two_One_Product(adxt_cdyt1, adxt_cdyt0, bdheight, u3, u[2], u[1], u[0]);
--      u[3] = u3;
--      finlength = fast_expansion_sum_zeroelim(finlength, finnow, 4, u,
--                                              finother);
--      finswap = finnow; finnow = finother; finother = finswap;
--      if (bdheighttail != 0.0) {
--        Two_One_Product(adxt_cdyt1, adxt_cdyt0, bdheighttail,
--                        u3, u[2], u[1], u[0]);
--        u[3] = u3;
--        finlength = fast_expansion_sum_zeroelim(finlength, finnow, 4, u,
--                                                finother);
--        finswap = finnow; finnow = finother; finother = finswap;
--      }
--    }
--  }
--  if (bdxtail != 0.0) {
--    if (cdytail != 0.0) {
--      Two_Product(bdxtail, cdytail, bdxt_cdyt1, bdxt_cdyt0);
--      Two_One_Product(bdxt_cdyt1, bdxt_cdyt0, adheight, u3, u[2], u[1], u[0]);
--      u[3] = u3;
--      finlength = fast_expansion_sum_zeroelim(finlength, finnow, 4, u,
--                                              finother);
--      finswap = finnow; finnow = finother; finother = finswap;
--      if (adheighttail != 0.0) {
--        Two_One_Product(bdxt_cdyt1, bdxt_cdyt0, adheighttail,
--                        u3, u[2], u[1], u[0]);
--        u[3] = u3;
--        finlength = fast_expansion_sum_zeroelim(finlength, finnow, 4, u,
--                                                finother);
--        finswap = finnow; finnow = finother; finother = finswap;
--      }
--    }
--    if (adytail != 0.0) {
--      negate = -bdxtail;
--      Two_Product(negate, adytail, bdxt_adyt1, bdxt_adyt0);
--      Two_One_Product(bdxt_adyt1, bdxt_adyt0, cdheight, u3, u[2], u[1], u[0]);
--      u[3] = u3;
--      finlength = fast_expansion_sum_zeroelim(finlength, finnow, 4, u,
--                                              finother);
--      finswap = finnow; finnow = finother; finother = finswap;
--      if (cdheighttail != 0.0) {
--        Two_One_Product(bdxt_adyt1, bdxt_adyt0, cdheighttail,
--                        u3, u[2], u[1], u[0]);
--        u[3] = u3;
--        finlength = fast_expansion_sum_zeroelim(finlength, finnow, 4, u,
--                                                finother);
--        finswap = finnow; finnow = finother; finother = finswap;
--      }
--    }
--  }
--  if (cdxtail != 0.0) {
--    if (adytail != 0.0) {
--      Two_Product(cdxtail, adytail, cdxt_adyt1, cdxt_adyt0);
--      Two_One_Product(cdxt_adyt1, cdxt_adyt0, bdheight, u3, u[2], u[1], u[0]);
--      u[3] = u3;
--      finlength = fast_expansion_sum_zeroelim(finlength, finnow, 4, u,
--                                              finother);
--      finswap = finnow; finnow = finother; finother = finswap;
--      if (bdheighttail != 0.0) {
--        Two_One_Product(cdxt_adyt1, cdxt_adyt0, bdheighttail,
--                        u3, u[2], u[1], u[0]);
--        u[3] = u3;
--        finlength = fast_expansion_sum_zeroelim(finlength, finnow, 4, u,
--                                                finother);
--        finswap = finnow; finnow = finother; finother = finswap;
--      }
--    }
--    if (bdytail != 0.0) {
--      negate = -cdxtail;
--      Two_Product(negate, bdytail, cdxt_bdyt1, cdxt_bdyt0);
--      Two_One_Product(cdxt_bdyt1, cdxt_bdyt0, adheight, u3, u[2], u[1], u[0]);
--      u[3] = u3;
--      finlength = fast_expansion_sum_zeroelim(finlength, finnow, 4, u,
--                                              finother);
--      finswap = finnow; finnow = finother; finother = finswap;
--      if (adheighttail != 0.0) {
--        Two_One_Product(cdxt_bdyt1, cdxt_bdyt0, adheighttail,
--                        u3, u[2], u[1], u[0]);
--        u[3] = u3;
--        finlength = fast_expansion_sum_zeroelim(finlength, finnow, 4, u,
--                                                finother);
--        finswap = finnow; finnow = finother; finother = finswap;
--      }
--    }
--  }
--
--  if (adheighttail != 0.0) {
--    wlength = scale_expansion_zeroelim(bctlen, bct, adheighttail, w);
--    finlength = fast_expansion_sum_zeroelim(finlength, finnow, wlength, w,
--                                            finother);
--    finswap = finnow; finnow = finother; finother = finswap;
--  }
--  if (bdheighttail != 0.0) {
--    wlength = scale_expansion_zeroelim(catlen, cat, bdheighttail, w);
--    finlength = fast_expansion_sum_zeroelim(finlength, finnow, wlength, w,
--                                            finother);
--    finswap = finnow; finnow = finother; finother = finswap;
--  }
--  if (cdheighttail != 0.0) {
--    wlength = scale_expansion_zeroelim(abtlen, abt, cdheighttail, w);
--    finlength = fast_expansion_sum_zeroelim(finlength, finnow, wlength, w,
--                                            finother);
--    finnow = finother;
--  }
--
--  return finnow[finlength - 1];
--}
--
--#ifdef ANSI_DECLARATORS
--REAL orient3d(struct mesh *m, struct behavior *b,
--              vertex pa, vertex pb, vertex pc, vertex pd,
--              REAL aheight, REAL bheight, REAL cheight, REAL dheight)
--#else /* not ANSI_DECLARATORS */
--REAL orient3d(m, b, pa, pb, pc, pd, aheight, bheight, cheight, dheight)
--struct mesh *m;
--struct behavior *b;
--vertex pa;
--vertex pb;
--vertex pc;
--vertex pd;
--REAL aheight;
--REAL bheight;
--REAL cheight;
--REAL dheight;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  REAL adx, bdx, cdx, ady, bdy, cdy, adheight, bdheight, cdheight;
--  REAL bdxcdy, cdxbdy, cdxady, adxcdy, adxbdy, bdxady;
--  REAL det;
--  REAL permanent, errbound;
--
--  m->orient3dcount++;
--
--  adx = pa[0] - pd[0];
--  bdx = pb[0] - pd[0];
--  cdx = pc[0] - pd[0];
--  ady = pa[1] - pd[1];
--  bdy = pb[1] - pd[1];
--  cdy = pc[1] - pd[1];
--  adheight = aheight - dheight;
--  bdheight = bheight - dheight;
--  cdheight = cheight - dheight;
--
--  bdxcdy = bdx * cdy;
--  cdxbdy = cdx * bdy;
--
--  cdxady = cdx * ady;
--  adxcdy = adx * cdy;
--
--  adxbdy = adx * bdy;
--  bdxady = bdx * ady;
--
--  det = adheight * (bdxcdy - cdxbdy)
--      + bdheight * (cdxady - adxcdy)
--      + cdheight * (adxbdy - bdxady);
--
--  if (b->noexact) {
--    return det;
--  }
--
--  permanent = (Absolute(bdxcdy) + Absolute(cdxbdy)) * Absolute(adheight)
--            + (Absolute(cdxady) + Absolute(adxcdy)) * Absolute(bdheight)
--            + (Absolute(adxbdy) + Absolute(bdxady)) * Absolute(cdheight);
--  errbound = o3derrboundA * permanent;
--  if ((det > errbound) || (-det > errbound)) {
--    return det;
--  }
--
--  return orient3dadapt(pa, pb, pc, pd, aheight, bheight, cheight, dheight,
--                       permanent);
--}
--
--/*****************************************************************************/
--/*                                                                           */
--/*  nonregular()   Return a positive value if the point pd is incompatible   */
--/*                 with the circle or plane passing through pa, pb, and pc   */
--/*                 (meaning that pd is inside the circle or below the        */
--/*                 plane); a negative value if it is compatible; and zero if */
--/*                 the four points are cocircular/coplanar.  The points pa,  */
--/*                 pb, and pc must be in counterclockwise order, or the sign */
--/*                 of the result will be reversed.                           */
--/*                                                                           */
--/*  If the -w switch is used, the points are lifted onto the parabolic       */
--/*  lifting map, then they are dropped according to their weights, then the  */
--/*  3D orientation test is applied.  If the -W switch is used, the points'   */
--/*  heights are already provided, so the 3D orientation test is applied      */
--/*  directly.  If neither switch is used, the incircle test is applied.      */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifdef ANSI_DECLARATORS
--REAL nonregular(struct mesh *m, struct behavior *b,
--                vertex pa, vertex pb, vertex pc, vertex pd)
--#else /* not ANSI_DECLARATORS */
--REAL nonregular(m, b, pa, pb, pc, pd)
--struct mesh *m;
--struct behavior *b;
--vertex pa;
--vertex pb;
--vertex pc;
--vertex pd;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  if (b->weighted == 0) {
--    return incircle(m, b, pa, pb, pc, pd);
--  } else if (b->weighted == 1) {
--    return orient3d(m, b, pa, pb, pc, pd,
--                    pa[0] * pa[0] + pa[1] * pa[1] - pa[2],
--                    pb[0] * pb[0] + pb[1] * pb[1] - pb[2],
--                    pc[0] * pc[0] + pc[1] * pc[1] - pc[2],
--                    pd[0] * pd[0] + pd[1] * pd[1] - pd[2]);
--  } else {
--    return orient3d(m, b, pa, pb, pc, pd, pa[2], pb[2], pc[2], pd[2]);
--  }
--}
--
--/*****************************************************************************/
--/*                                                                           */
--/*  findcircumcenter()   Find the circumcenter of a triangle.                */
--/*                                                                           */
--/*  The result is returned both in terms of x-y coordinates and xi-eta       */
--/*  (barycentric) coordinates.  The xi-eta coordinate system is defined in   */
--/*  terms of the triangle:  the origin of the triangle is the origin of the  */
--/*  coordinate system; the destination of the triangle is one unit along the */
--/*  xi axis; and the apex of the triangle is one unit along the eta axis.    */
--/*  This procedure also returns the square of the length of the triangle's   */
--/*  shortest edge.                                                           */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifdef ANSI_DECLARATORS
--void findcircumcenter(struct mesh *m, struct behavior *b,
--                      vertex torg, vertex tdest, vertex tapex,
--                      vertex circumcenter, REAL *xi, REAL *eta, int offcenter)
--#else /* not ANSI_DECLARATORS */
--void findcircumcenter(m, b, torg, tdest, tapex, circumcenter, xi, eta,
--                      offcenter)
--struct mesh *m;
--struct behavior *b;
--vertex torg;
--vertex tdest;
--vertex tapex;
--vertex circumcenter;
--REAL *xi;
--REAL *eta;
--int offcenter;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  REAL xdo, ydo, xao, yao;
--  REAL dodist, aodist, dadist;
--  REAL denominator;
--  REAL dx, dy, dxoff, dyoff;
--
--  m->circumcentercount++;
--
--  /* Compute the circumcenter of the triangle. */
--  xdo = tdest[0] - torg[0];
--  ydo = tdest[1] - torg[1];
--  xao = tapex[0] - torg[0];
--  yao = tapex[1] - torg[1];
--  dodist = xdo * xdo + ydo * ydo;
--  aodist = xao * xao + yao * yao;
--  dadist = (tdest[0] - tapex[0]) * (tdest[0] - tapex[0]) +
--           (tdest[1] - tapex[1]) * (tdest[1] - tapex[1]);
--  if (b->noexact) {
--    denominator = 0.5 / (xdo * yao - xao * ydo);
--  } else {
--    /* Use the counterclockwise() routine to ensure a positive (and */
--    /*   reasonably accurate) result, avoiding any possibility of   */
--    /*   division by zero.                                          */
--    denominator = 0.5 / counterclockwise(m, b, tdest, tapex, torg);
--    /* Don't count the above as an orientation test. */
--    m->counterclockcount--;
--  }
--  dx = (yao * dodist - ydo * aodist) * denominator;
--  dy = (xdo * aodist - xao * dodist) * denominator;
--
--  /* Find the (squared) length of the triangle's shortest edge.  This   */
--  /*   serves as a conservative estimate of the insertion radius of the */
--  /*   circumcenter's parent.  The estimate is used to ensure that      */
--  /*   the algorithm terminates even if very small angles appear in     */
--  /*   the input PSLG.                                                  */
--  if ((dodist < aodist) && (dodist < dadist)) {
--    if (offcenter && (b->offconstant > 0.0)) {
--      /* Find the position of the off-center, as described by Alper Ungor. */
--      dxoff = 0.5 * xdo - b->offconstant * ydo;
--      dyoff = 0.5 * ydo + b->offconstant * xdo;
--      /* If the off-center is closer to the origin than the */
--      /*   circumcenter, use the off-center instead.        */
--      if (dxoff * dxoff + dyoff * dyoff < dx * dx + dy * dy) {
--        dx = dxoff;
--        dy = dyoff;
--      }
--    }
--  } else if (aodist < dadist) {
--    if (offcenter && (b->offconstant > 0.0)) {
--      dxoff = 0.5 * xao + b->offconstant * yao;
--      dyoff = 0.5 * yao - b->offconstant * xao;
--      /* If the off-center is closer to the origin than the */
--      /*   circumcenter, use the off-center instead.        */
--      if (dxoff * dxoff + dyoff * dyoff < dx * dx + dy * dy) {
--        dx = dxoff;
--        dy = dyoff;
--      }
--    }
--  } else {
--    if (offcenter && (b->offconstant > 0.0)) {
--      dxoff = 0.5 * (tapex[0] - tdest[0]) -
--              b->offconstant * (tapex[1] - tdest[1]);
--      dyoff = 0.5 * (tapex[1] - tdest[1]) +
--              b->offconstant * (tapex[0] - tdest[0]);
--      /* If the off-center is closer to the destination than the */
--      /*   circumcenter, use the off-center instead.             */
--      if (dxoff * dxoff + dyoff * dyoff <
--          (dx - xdo) * (dx - xdo) + (dy - ydo) * (dy - ydo)) {
--        dx = xdo + dxoff;
--        dy = ydo + dyoff;
--      }
--    }
--  }
--
--  circumcenter[0] = torg[0] + dx;
--  circumcenter[1] = torg[1] + dy;
--
--  /* To interpolate vertex attributes for the new vertex inserted at */
--  /*   the circumcenter, define a coordinate system with a xi-axis,  */
--  /*   directed from the triangle's origin to its destination, and   */
--  /*   an eta-axis, directed from its origin to its apex.            */
--  /*   Calculate the xi and eta coordinates of the circumcenter.     */
--  *xi = (yao * dx - xao * dy) * (2.0 * denominator);
--  *eta = (xdo * dy - ydo * dx) * (2.0 * denominator);
--}
--
--/**                                                                         **/
--/**                                                                         **/
--/********* Geometric primitives end here                             *********/
--
--/*****************************************************************************/
--/*                                                                           */
--/*  triangleinit()   Initialize some variables.                              */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifdef ANSI_DECLARATORS
--void triangleinit(struct mesh *m)
--#else /* not ANSI_DECLARATORS */
--void triangleinit(m)
--struct mesh *m;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  poolzero(&m->vertices);
--  poolzero(&m->triangles);
--  poolzero(&m->subsegs);
--  poolzero(&m->viri);
--  poolzero(&m->badsubsegs);
--  poolzero(&m->badtriangles);
--  poolzero(&m->flipstackers);
--  poolzero(&m->splaynodes);
--
--  m->recenttri.tri = (triangle *) NULL; /* No triangle has been visited yet. */
--  m->undeads = 0;                       /* No eliminated input vertices yet. */
--  m->samples = 1;         /* Point location should take at least one sample. */
--  m->checksegments = 0;   /* There are no segments in the triangulation yet. */
--  m->checkquality = 0;     /* The quality triangulation stage has not begun. */
--  m->incirclecount = m->counterclockcount = m->orient3dcount = 0;
--  m->hyperbolacount = m->circletopcount = m->circumcentercount = 0;
--  randomseed = 1;
--
--  exactinit();                     /* Initialize exact arithmetic constants. */
--}
--
--/*****************************************************************************/
--/*                                                                           */
--/*  randomnation()   Generate a random number between 0 and `choices' - 1.   */
--/*                                                                           */
--/*  This is a simple linear congruential random number generator.  Hence, it */
--/*  is a bad random number generator, but good enough for most randomized    */
--/*  geometric algorithms.                                                    */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifdef ANSI_DECLARATORS
--TRIANGLE_PTRINT randomnation(unsigned int choices)
--#else /* not ANSI_DECLARATORS */
--TRIANGLE_PTRINT randomnation(choices)
--unsigned int choices;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  randomseed = (randomseed * 1366l + 150889l) % 714025l;
--  return ( randomseed * (choices + 1 ) )/ 714025l;
--}
--
--/********* Mesh quality testing routines begin here                  *********/
--/**                                                                         **/
--/**                                                                         **/
--
--/*****************************************************************************/
--/*                                                                           */
--/*  checkmesh()   Test the mesh for topological consistency.                 */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifndef REDUCED
--
--#ifdef ANSI_DECLARATORS
--void checkmesh(struct mesh *m, struct behavior *b)
--#else /* not ANSI_DECLARATORS */
--void checkmesh(m, b)
--struct mesh *m;
--struct behavior *b;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  struct otri triangleloop;
--  struct otri oppotri, oppooppotri;
--  vertex triorg, tridest, triapex;
--  vertex oppoorg, oppodest;
--  int horrors;
--  int saveexact;
--  triangle ptr;                         /* Temporary variable used by sym(). */
--
--  /* Temporarily turn on exact arithmetic if it's off. */
--  saveexact = b->noexact;
--  b->noexact = 0;
--  if (!b->quiet) {
--    printf("  Checking consistency of mesh...\n");
--  }
--  horrors = 0;
--  /* Run through the list of triangles, checking each one. */
--  traversalinit(&m->triangles);
--  triangleloop.tri = triangletraverse(m);
--  while (triangleloop.tri != (triangle *) NULL) {
--    /* Check all three edges of the triangle. */
--    for (triangleloop.orient = 0; triangleloop.orient < 3;
--         triangleloop.orient++) {
--      org(triangleloop, triorg);
--      dest(triangleloop, tridest);
--      if (triangleloop.orient == 0) {       /* Only test for inversion once. */
--        /* Test if the triangle is flat or inverted. */
--        apex(triangleloop, triapex);
--        if (counterclockwise(m, b, triorg, tridest, triapex) <= 0.0) {
--          printf("  !! !! Inverted ");
--          printtriangle(m, b, &triangleloop);
--          horrors++;
--        }
--      }
--      /* Find the neighboring triangle on this edge. */
--      sym(triangleloop, oppotri);
--      if (oppotri.tri != m->dummytri) {
--        /* Check that the triangle's neighbor knows it's a neighbor. */
--        sym(oppotri, oppooppotri);
--        if ((triangleloop.tri != oppooppotri.tri)
--            || (triangleloop.orient != oppooppotri.orient)) {
--          printf("  !! !! Asymmetric triangle-triangle bond:\n");
--          if (triangleloop.tri == oppooppotri.tri) {
--            printf("   (Right triangle, wrong orientation)\n");
--          }
--          printf("    First ");
--          printtriangle(m, b, &triangleloop);
--          printf("    Second (nonreciprocating) ");
--          printtriangle(m, b, &oppotri);
--          horrors++;
--        }
--        /* Check that both triangles agree on the identities */
--        /*   of their shared vertices.                       */
--        org(oppotri, oppoorg);
--        dest(oppotri, oppodest);
--        if ((triorg != oppodest) || (tridest != oppoorg)) {
--          printf("  !! !! Mismatched edge coordinates between two triangles:\n"
--                 );
--          printf("    First mismatched ");
--          printtriangle(m, b, &triangleloop);
--          printf("    Second mismatched ");
--          printtriangle(m, b, &oppotri);
--          horrors++;
--        }
--      }
--    }
--    triangleloop.tri = triangletraverse(m);
--  }
--  if (horrors == 0) {
--    if (!b->quiet) {
--      printf("  In my studied opinion, the mesh appears to be consistent.\n");
--    }
--  } else if (horrors == 1) {
--    printf("  !! !! !! !! Precisely one festering wound discovered.\n");
--  } else {
--    printf("  !! !! !! !! %d abominations witnessed.\n", horrors);
--  }
--  /* Restore the status of exact arithmetic. */
--  b->noexact = saveexact;
--}
--
--#endif /* not REDUCED */
--
--/*****************************************************************************/
--/*                                                                           */
--/*  checkdelaunay()   Ensure that the mesh is (constrained) Delaunay.        */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifndef REDUCED
--
--#ifdef ANSI_DECLARATORS
--void checkdelaunay(struct mesh *m, struct behavior *b)
--#else /* not ANSI_DECLARATORS */
--void checkdelaunay(m, b)
--struct mesh *m;
--struct behavior *b;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  struct otri triangleloop;
--  struct otri oppotri;
--  struct osub opposubseg;
--  vertex triorg, tridest, triapex;
--  vertex oppoapex;
--  int shouldbedelaunay;
--  int horrors;
--  int saveexact;
--  triangle ptr;                         /* Temporary variable used by sym(). */
--  subseg sptr;                      /* Temporary variable used by tspivot(). */
--
--  /* Temporarily turn on exact arithmetic if it's off. */
--  saveexact = b->noexact;
--  b->noexact = 0;
--  if (!b->quiet) {
--    printf("  Checking Delaunay property of mesh...\n");
--  }
--  horrors = 0;
--  /* Run through the list of triangles, checking each one. */
--  traversalinit(&m->triangles);
--  triangleloop.tri = triangletraverse(m);
--  while (triangleloop.tri != (triangle *) NULL) {
--    /* Check all three edges of the triangle. */
--    for (triangleloop.orient = 0; triangleloop.orient < 3;
--         triangleloop.orient++) {
--      org(triangleloop, triorg);
--      dest(triangleloop, tridest);
--      apex(triangleloop, triapex);
--      sym(triangleloop, oppotri);
--      apex(oppotri, oppoapex);
--      /* Only test that the edge is locally Delaunay if there is an   */
--      /*   adjoining triangle whose pointer is larger (to ensure that */
--      /*   each pair isn't tested twice).                             */
--      shouldbedelaunay = (oppotri.tri != m->dummytri) &&
--            !deadtri(oppotri.tri) && (triangleloop.tri < oppotri.tri) &&
--            (triorg != m->infvertex1) && (triorg != m->infvertex2) &&
--            (triorg != m->infvertex3) &&
--            (tridest != m->infvertex1) && (tridest != m->infvertex2) &&
--            (tridest != m->infvertex3) &&
--            (triapex != m->infvertex1) && (triapex != m->infvertex2) &&
--            (triapex != m->infvertex3) &&
--            (oppoapex != m->infvertex1) && (oppoapex != m->infvertex2) &&
--            (oppoapex != m->infvertex3);
--      if (m->checksegments && shouldbedelaunay) {
--        /* If a subsegment separates the triangles, then the edge is */
--        /*   constrained, so no local Delaunay test should be done.  */
--        tspivot(triangleloop, opposubseg);
--        if (opposubseg.ss != m->dummysub){
--          shouldbedelaunay = 0;
--        }
--      }
--      if (shouldbedelaunay) {
--        if (nonregular(m, b, triorg, tridest, triapex, oppoapex) > 0.0) {
--          if (!b->weighted) {
--            printf("  !! !! Non-Delaunay pair of triangles:\n");
--            printf("    First non-Delaunay ");
--            printtriangle(m, b, &triangleloop);
--            printf("    Second non-Delaunay ");
--          } else {
--            printf("  !! !! Non-regular pair of triangles:\n");
--            printf("    First non-regular ");
--            printtriangle(m, b, &triangleloop);
--            printf("    Second non-regular ");
--          }
--          printtriangle(m, b, &oppotri);
--          horrors++;
--        }
--      }
--    }
--    triangleloop.tri = triangletraverse(m);
--  }
--  if (horrors == 0) {
--    if (!b->quiet) {
--      printf(
--  "  By virtue of my perceptive intelligence, I declare the mesh Delaunay.\n");
--    }
--  } else if (horrors == 1) {
--    printf(
--         "  !! !! !! !! Precisely one terrifying transgression identified.\n");
--  } else {
--    printf("  !! !! !! !! %d obscenities viewed with horror.\n", horrors);
--  }
--  /* Restore the status of exact arithmetic. */
--  b->noexact = saveexact;
--}
--
--#endif /* not REDUCED */
--
--/*****************************************************************************/
--/*                                                                           */
--/*  enqueuebadtriang()   Add a bad triangle data structure to the end of a   */
--/*                       queue.                                              */
--/*                                                                           */
--/*  The queue is actually a set of 4096 queues.  I use multiple queues to    */
--/*  give priority to smaller angles.  I originally implemented a heap, but   */
--/*  the queues are faster by a larger margin than I'd suspected.             */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifndef CDT_ONLY
--
--#ifdef ANSI_DECLARATORS
--void enqueuebadtriang(struct mesh *m, struct behavior *b,
--                      struct badtriang *badtri)
--#else /* not ANSI_DECLARATORS */
--void enqueuebadtriang(m, b, badtri)
--struct mesh *m;
--struct behavior *b;
--struct badtriang *badtri;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  REAL length, multiplier;
--  int exponent, expincrement;
--  int queuenumber;
--  int posexponent;
--  int i;
--
--  if (b->verbose > 2) {
--    printf("  Queueing bad triangle:\n");
--    printf("    (%.12g, %.12g) (%.12g, %.12g) (%.12g, %.12g)\n",
--           badtri->triangorg[0], badtri->triangorg[1],
--           badtri->triangdest[0], badtri->triangdest[1],
--           badtri->triangapex[0], badtri->triangapex[1]);
--  }
--
--  /* Determine the appropriate queue to put the bad triangle into.    */
--  /*   Recall that the key is the square of its shortest edge length. */
--  if (badtri->key >= 1.0) {
--    length = badtri->key;
--    posexponent = 1;
--  } else {
--    /* `badtri->key' is 2.0 to a negative exponent, so we'll record that */
--    /*   fact and use the reciprocal of `badtri->key', which is > 1.0.   */
--    length = 1.0 / badtri->key;
--    posexponent = 0;
--  }
--  /* `length' is approximately 2.0 to what exponent?  The following code */
--  /*   determines the answer in time logarithmic in the exponent.        */
--  exponent = 0;
--  while (length > 2.0) {
--    /* Find an approximation by repeated squaring of two. */
--    expincrement = 1;
--    multiplier = 0.5;
--    while (length * multiplier * multiplier > 1.0) {
--      expincrement *= 2;
--      multiplier *= multiplier;
--    }
--    /* Reduce the value of `length', then iterate if necessary. */
--    exponent += expincrement;
--    length *= multiplier;
--  }
--  /* `length' is approximately squareroot(2.0) to what exponent? */
--  exponent = (int) ( 2.0 * exponent + (length > SQUAREROOTTWO) );
--  /* `exponent' is now in the range 0...2047 for IEEE double precision.   */
--  /*   Choose a queue in the range 0...4095.  The shortest edges have the */
--  /*   highest priority (queue 4095).                                     */
--  if (posexponent) {
--    queuenumber = 2047 - exponent;
--  } else {
--    queuenumber = 2048 + exponent;
--  }
--
--  /* Are we inserting into an empty queue? */
--  if (m->queuefront[queuenumber] == (struct badtriang *) NULL) {
--    /* Yes, we are inserting into an empty queue.     */
--    /*   Will this become the highest-priority queue? */
--    if (queuenumber > m->firstnonemptyq) {
--      /* Yes, this is the highest-priority queue. */
--      m->nextnonemptyq[queuenumber] = m->firstnonemptyq;
--      m->firstnonemptyq = queuenumber;
--    } else {
--      /* No, this is not the highest-priority queue. */
--      /*   Find the queue with next higher priority. */
--      i = queuenumber + 1;
--      while (m->queuefront[i] == (struct badtriang *) NULL) {
--        i++;
--      }
--      /* Mark the newly nonempty queue as following a higher-priority queue. */
--      m->nextnonemptyq[queuenumber] = m->nextnonemptyq[i];
--      m->nextnonemptyq[i] = queuenumber;
--    }
--    /* Put the bad triangle at the beginning of the (empty) queue. */
--    m->queuefront[queuenumber] = badtri;
--  } else {
--    /* Add the bad triangle to the end of an already nonempty queue. */
--    m->queuetail[queuenumber]->nexttriang = badtri;
--  }
--  /* Maintain a pointer to the last triangle of the queue. */
--  m->queuetail[queuenumber] = badtri;
--  /* Newly enqueued bad triangle has no successor in the queue. */
--  badtri->nexttriang = (struct badtriang *) NULL;
--}
--
--#endif /* not CDT_ONLY */
--
--/*****************************************************************************/
--/*                                                                           */
--/*  enqueuebadtri()   Add a bad triangle to the end of a queue.              */
--/*                                                                           */
--/*  Allocates a badtriang data structure for the triangle, then passes it to */
--/*  enqueuebadtriang().                                                      */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifndef CDT_ONLY
--
--#ifdef ANSI_DECLARATORS
--void enqueuebadtri(struct mesh *m, struct behavior *b, struct otri *enqtri,
--                   REAL minedge, vertex enqapex, vertex enqorg, vertex enqdest)
--#else /* not ANSI_DECLARATORS */
--void enqueuebadtri(m, b, enqtri, minedge, enqapex, enqorg, enqdest)
--struct mesh *m;
--struct behavior *b;
--struct otri *enqtri;
--REAL minedge;
--vertex enqapex;
--vertex enqorg;
--vertex enqdest;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  struct badtriang *newbad;
--
--  /* Allocate space for the bad triangle. */
--  newbad = (struct badtriang *) poolalloc(&m->badtriangles);
--  newbad->poortri = encode(*enqtri);
--  newbad->key = minedge;
--  newbad->triangapex = enqapex;
--  newbad->triangorg = enqorg;
--  newbad->triangdest = enqdest;
--  enqueuebadtriang(m, b, newbad);
--}
--
--#endif /* not CDT_ONLY */
--
--/*****************************************************************************/
--/*                                                                           */
--/*  dequeuebadtriang()   Remove a triangle from the front of the queue.      */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifndef CDT_ONLY
--
--#ifdef ANSI_DECLARATORS
--struct badtriang *dequeuebadtriang(struct mesh *m)
--#else /* not ANSI_DECLARATORS */
--struct badtriang *dequeuebadtriang(m)
--struct mesh *m;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  struct badtriang *result;
--
--  /* If no queues are nonempty, return NULL. */
--  if (m->firstnonemptyq < 0) {
--    return (struct badtriang *) NULL;
--  }
--  /* Find the first triangle of the highest-priority queue. */
--  result = m->queuefront[m->firstnonemptyq];
--  /* Remove the triangle from the queue. */
--  m->queuefront[m->firstnonemptyq] = result->nexttriang;
--  /* If this queue is now empty, note the new highest-priority */
--  /*   nonempty queue.                                         */
--  if (result == m->queuetail[m->firstnonemptyq]) {
--    m->firstnonemptyq = m->nextnonemptyq[m->firstnonemptyq];
--  }
--  return result;
--}
--
--#endif /* not CDT_ONLY */
--
--/*****************************************************************************/
--/*                                                                           */
--/*  checkseg4encroach()   Check a subsegment to see if it is encroached; add */
--/*                        it to the list if it is.                           */
--/*                                                                           */
--/*  A subsegment is encroached if there is a vertex in its diametral lens.   */
--/*  For Ruppert's algorithm (-D switch), the "diametral lens" is the         */
--/*  diametral circle.  For Chew's algorithm (default), the diametral lens is */
--/*  just big enough to enclose two isosceles triangles whose bases are the   */
--/*  subsegment.  Each of the two isosceles triangles has two angles equal    */
--/*  to `b->minangle'.                                                        */
--/*                                                                           */
--/*  Chew's algorithm does not require diametral lenses at all--but they save */
--/*  time.  Any vertex inside a subsegment's diametral lens implies that the  */
--/*  triangle adjoining the subsegment will be too skinny, so it's only a     */
--/*  matter of time before the encroaching vertex is deleted by Chew's        */
--/*  algorithm.  It's faster to simply not insert the doomed vertex in the    */
--/*  first place, which is why I use diametral lenses with Chew's algorithm.  */
--/*                                                                           */
--/*  Returns a nonzero value if the subsegment is encroached.                 */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifndef CDT_ONLY
--
--#ifdef ANSI_DECLARATORS
--int checkseg4encroach(struct mesh *m, struct behavior *b,
--                      struct osub *testsubseg)
--#else /* not ANSI_DECLARATORS */
--int checkseg4encroach(m, b, testsubseg)
--struct mesh *m;
--struct behavior *b;
--struct osub *testsubseg;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  struct otri neighbortri;
--  struct osub testsym;
--  struct badsubseg *encroachedseg;
--  REAL dotproduct;
--  int encroached;
--  int sides;
--  vertex eorg, edest, eapex;
--  triangle ptr;                     /* Temporary variable used by stpivot(). */
--
--  encroached = 0;
--  sides = 0;
--
--  sorg(*testsubseg, eorg);
--  sdest(*testsubseg, edest);
--  /* Check one neighbor of the subsegment. */
--  stpivot(*testsubseg, neighbortri);
--  /* Does the neighbor exist, or is this a boundary edge? */
--  if (neighbortri.tri != m->dummytri) {
--    sides++;
--    /* Find a vertex opposite this subsegment. */
--    apex(neighbortri, eapex);
--    /* Check whether the apex is in the diametral lens of the subsegment */
--    /*   (the diametral circle if `conformdel' is set).  A dot product   */
--    /*   of two sides of the triangle is used to check whether the angle */
--    /*   at the apex is greater than (180 - 2 `minangle') degrees (for   */
--    /*   lenses; 90 degrees for diametral circles).                      */
--    dotproduct = (eorg[0] - eapex[0]) * (edest[0] - eapex[0]) +
--                 (eorg[1] - eapex[1]) * (edest[1] - eapex[1]);
--    if (dotproduct < 0.0) {
--      if (b->conformdel ||
--          (dotproduct * dotproduct >=
--           (2.0 * b->goodangle - 1.0) * (2.0 * b->goodangle - 1.0) *
--           ((eorg[0] - eapex[0]) * (eorg[0] - eapex[0]) +
--            (eorg[1] - eapex[1]) * (eorg[1] - eapex[1])) *
--           ((edest[0] - eapex[0]) * (edest[0] - eapex[0]) +
--            (edest[1] - eapex[1]) * (edest[1] - eapex[1])))) {
--        encroached = 1;
--      }
--    }
--  }
--  /* Check the other neighbor of the subsegment. */
--  ssym(*testsubseg, testsym);
--  stpivot(testsym, neighbortri);
--  /* Does the neighbor exist, or is this a boundary edge? */
--  if (neighbortri.tri != m->dummytri) {
--    sides++;
--    /* Find the other vertex opposite this subsegment. */
--    apex(neighbortri, eapex);
--    /* Check whether the apex is in the diametral lens of the subsegment */
--    /*   (or the diametral circle, if `conformdel' is set).              */
--    dotproduct = (eorg[0] - eapex[0]) * (edest[0] - eapex[0]) +
--                 (eorg[1] - eapex[1]) * (edest[1] - eapex[1]);
--    if (dotproduct < 0.0) {
--      if (b->conformdel ||
--          (dotproduct * dotproduct >=
--           (2.0 * b->goodangle - 1.0) * (2.0 * b->goodangle - 1.0) *
--           ((eorg[0] - eapex[0]) * (eorg[0] - eapex[0]) +
--            (eorg[1] - eapex[1]) * (eorg[1] - eapex[1])) *
--           ((edest[0] - eapex[0]) * (edest[0] - eapex[0]) +
--            (edest[1] - eapex[1]) * (edest[1] - eapex[1])))) {
--        encroached += 2;
--      }
--    }
--  }
--
--  if (encroached && (!b->nobisect || ((b->nobisect == 1) && (sides == 2)))) {
--    if (b->verbose > 2) {
--      printf(
--        "  Queueing encroached subsegment (%.12g, %.12g) (%.12g, %.12g).\n",
--        eorg[0], eorg[1], edest[0], edest[1]);
--    }
--    /* Add the subsegment to the list of encroached subsegments. */
--    /*   Be sure to get the orientation right.                   */
--    encroachedseg = (struct badsubseg *) poolalloc(&m->badsubsegs);
--    if (encroached == 1) {
--      encroachedseg->encsubseg = sencode(*testsubseg);
--      encroachedseg->subsegorg = eorg;
--      encroachedseg->subsegdest = edest;
--    } else {
--      encroachedseg->encsubseg = sencode(testsym);
--      encroachedseg->subsegorg = edest;
--      encroachedseg->subsegdest = eorg;
--    }
--  }
--
--  return encroached;
--}
--
--#endif /* not CDT_ONLY */
--
--/*****************************************************************************/
--/*                                                                           */
--/*  testtriangle()   Test a triangle for quality and size.                   */
--/*                                                                           */
--/*  Tests a triangle to see if it satisfies the minimum angle condition and  */
--/*  the maximum area condition.  Triangles that aren't up to spec are added  */
--/*  to the bad triangle queue.                                               */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifndef CDT_ONLY
--
--#ifdef ANSI_DECLARATORS
--void testtriangle(struct mesh *m, struct behavior *b, struct otri *testtri)
--#else /* not ANSI_DECLARATORS */
--void testtriangle(m, b, testtri)
--struct mesh *m;
--struct behavior *b;
--struct otri *testtri;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  struct otri tri1, tri2;
--  struct osub testsub;
--  vertex torg, tdest, tapex;
--  vertex base1, base2;
--  vertex org1, dest1, org2, dest2;
--  vertex joinvertex;
--  REAL dxod, dyod, dxda, dyda, dxao, dyao;
--  REAL dxod2, dyod2, dxda2, dyda2, dxao2, dyao2;
--  REAL apexlen, orglen, destlen, minedge;
--  REAL angle;
--  REAL area;
--  REAL dist1, dist2;
--  subseg sptr;                      /* Temporary variable used by tspivot(). */
--  triangle ptr;           /* Temporary variable used by oprev() and dnext(). */
--
--  org(*testtri, torg);
--  dest(*testtri, tdest);
--  apex(*testtri, tapex);
--  dxod = torg[0] - tdest[0];
--  dyod = torg[1] - tdest[1];
--  dxda = tdest[0] - tapex[0];
--  dyda = tdest[1] - tapex[1];
--  dxao = tapex[0] - torg[0];
--  dyao = tapex[1] - torg[1];
--  dxod2 = dxod * dxod;
--  dyod2 = dyod * dyod;
--  dxda2 = dxda * dxda;
--  dyda2 = dyda * dyda;
--  dxao2 = dxao * dxao;
--  dyao2 = dyao * dyao;
--  /* Find the lengths of the triangle's three edges. */
--  apexlen = dxod2 + dyod2;
--  orglen = dxda2 + dyda2;
--  destlen = dxao2 + dyao2;
--
--  if ((apexlen < orglen) && (apexlen < destlen)) {
--    /* The edge opposite the apex is shortest. */
--    minedge = apexlen;
--    /* Find the square of the cosine of the angle at the apex. */
--    angle = dxda * dxao + dyda * dyao;
--    angle = angle * angle / (orglen * destlen);
--    base1 = torg;
--    base2 = tdest;
--    otricopy(*testtri, tri1);
--  } else if (orglen < destlen) {
--    /* The edge opposite the origin is shortest. */
--    minedge = orglen;
--    /* Find the square of the cosine of the angle at the origin. */
--    angle = dxod * dxao + dyod * dyao;
--    angle = angle * angle / (apexlen * destlen);
--    base1 = tdest;
--    base2 = tapex;
--    lnext(*testtri, tri1);
--  } else {
--    /* The edge opposite the destination is shortest. */
--    minedge = destlen;
--    /* Find the square of the cosine of the angle at the destination. */
--    angle = dxod * dxda + dyod * dyda;
--    angle = angle * angle / (apexlen * orglen);
--    base1 = tapex;
--    base2 = torg;
--    lprev(*testtri, tri1);
--  }
--
--  if (b->vararea || b->fixedarea || b->usertest) {
--    /* Check whether the area is larger than permitted. */
--    area = 0.5 * (dxod * dyda - dyod * dxda);
--    if (b->fixedarea && (area > b->maxarea)) {
--      /* Add this triangle to the list of bad triangles. */
--      enqueuebadtri(m, b, testtri, minedge, tapex, torg, tdest);
--      return;
--    }
--
--    /* Nonpositive area constraints are treated as unconstrained. */
--    if ((b->vararea) && (area > areabound(*testtri)) &&
--        (areabound(*testtri) > 0.0)) {
--      /* Add this triangle to the list of bad triangles. */
--      enqueuebadtri(m, b, testtri, minedge, tapex, torg, tdest);
--      return;
--    }
--
--    if (b->usertest) {
--      /* Check whether the user thinks this triangle is too large. */
--      if (triunsuitable(torg, tdest, tapex, area)) {
--        enqueuebadtri(m, b, testtri, minedge, tapex, torg, tdest);
--        return;
--      }
--    }
--  }
--
--  /* Check whether the angle is smaller than permitted. */
--  if (angle > b->goodangle) {
--    /* Use the rules of Miller, Pav, and Walkington to decide that certain */
--    /*   triangles should not be split, even if they have bad angles.      */
--    /*   A skinny triangle is not split if its shortest edge subtends a    */
--    /*   small input angle, and both endpoints of the edge lie on a        */
--    /*   concentric circular shell.  For convenience, I make a small       */
--    /*   adjustment to that rule:  I check if the endpoints of the edge    */
--    /*   both lie in segment interiors, equidistant from the apex where    */
--    /*   the two segments meet.                                            */
--    /* First, check if both points lie in segment interiors.               */
--    if ((vertextype(base1) == SEGMENTVERTEX) &&
--        (vertextype(base2) == SEGMENTVERTEX)) {
--      /* Check if both points lie in a common segment.  If they do, the */
--      /*   skinny triangle is enqueued to be split as usual.            */
--      tspivot(tri1, testsub);
--      if (testsub.ss == m->dummysub) {
--        /* No common segment.  Find a subsegment that contains `torg'. */
--        otricopy(tri1, tri2);
--        do {
--          oprevself(tri1);
--          tspivot(tri1, testsub);
--        } while (testsub.ss == m->dummysub);
--        /* Find the endpoints of the containing segment. */
--        segorg(testsub, org1);
--        segdest(testsub, dest1);
--        /* Find a subsegment that contains `tdest'. */
--        do {
--          dnextself(tri2);
--          tspivot(tri2, testsub);
--        } while (testsub.ss == m->dummysub);
--        /* Find the endpoints of the containing segment. */
--        segorg(testsub, org2);
--        segdest(testsub, dest2);
--        /* Check if the two containing segments have an endpoint in common. */
--        joinvertex = (vertex) NULL;
--        if ((dest1[0] == org2[0]) && (dest1[1] == org2[1])) {
--          joinvertex = dest1;
--        } else if ((org1[0] == dest2[0]) && (org1[1] == dest2[1])) {
--          joinvertex = org1;
--        }
--        if (joinvertex != (vertex) NULL) {
--          /* Compute the distance from the common endpoint (of the two  */
--          /*   segments) to each of the endpoints of the shortest edge. */
--          dist1 = ((base1[0] - joinvertex[0]) * (base1[0] - joinvertex[0]) +
--                   (base1[1] - joinvertex[1]) * (base1[1] - joinvertex[1]));
--          dist2 = ((base2[0] - joinvertex[0]) * (base2[0] - joinvertex[0]) +
--                   (base2[1] - joinvertex[1]) * (base2[1] - joinvertex[1]));
--          /* If the two distances are equal, don't split the triangle. */
--          if ((dist1 < 1.001 * dist2) && (dist1 > 0.999 * dist2)) {
--            /* Return now to avoid enqueueing the bad triangle. */
--            return;
--          }
--        }
--      }
--    }
--
--    /* Add this triangle to the list of bad triangles. */
--    enqueuebadtri(m, b, testtri, minedge, tapex, torg, tdest);
--  }
--}
--
--#endif /* not CDT_ONLY */
--
--/**                                                                         **/
--/**                                                                         **/
--/********* Mesh quality testing routines end here                    *********/
--
--/********* Point location routines begin here                        *********/
--/**                                                                         **/
--/**                                                                         **/
--
--/*****************************************************************************/
--/*                                                                           */
--/*  makevertexmap()   Construct a mapping from vertices to triangles to      */
--/*                    improve the speed of point location for segment        */
--/*                    insertion.                                             */
--/*                                                                           */
--/*  Traverses all the triangles, and provides each corner of each triangle   */
--/*  with a pointer to that triangle.  Of course, pointers will be            */
--/*  overwritten by other pointers because (almost) each vertex is a corner   */
--/*  of several triangles, but in the end every vertex will point to some     */
--/*  triangle that contains it.                                               */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifdef ANSI_DECLARATORS
--void makevertexmap(struct mesh *m, struct behavior *b)
--#else /* not ANSI_DECLARATORS */
--void makevertexmap(m, b)
--struct mesh *m;
--struct behavior *b;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  struct otri triangleloop;
--  vertex triorg;
--
--  if (b->verbose) {
--    printf("    Constructing mapping from vertices to triangles.\n");
--  }
--  traversalinit(&m->triangles);
--  triangleloop.tri = triangletraverse(m);
--  while (triangleloop.tri != (triangle *) NULL) {
--    /* Check all three vertices of the triangle. */
--    for (triangleloop.orient = 0; triangleloop.orient < 3;
--         triangleloop.orient++) {
--      org(triangleloop, triorg);
--      setvertex2tri(triorg, encode(triangleloop));
--    }
--    triangleloop.tri = triangletraverse(m);
--  }
--}
--
--/*****************************************************************************/
--/*                                                                           */
--/*  preciselocate()   Find a triangle or edge containing a given point.      */
--/*                                                                           */
--/*  Begins its search from `searchtri'.  It is important that `searchtri'    */
--/*  be a handle with the property that `searchpoint' is strictly to the left */
--/*  of the edge denoted by `searchtri', or is collinear with that edge and   */
--/*  does not intersect that edge.  (In particular, `searchpoint' should not  */
--/*  be the origin or destination of that edge.)                              */
--/*                                                                           */
--/*  These conditions are imposed because preciselocate() is normally used in */
--/*  one of two situations:                                                   */
--/*                                                                           */
--/*  (1)  To try to find the location to insert a new point.  Normally, we    */
--/*       know an edge that the point is strictly to the left of.  In the     */
--/*       incremental Delaunay algorithm, that edge is a bounding box edge.   */
--/*       In Ruppert's Delaunay refinement algorithm for quality meshing,     */
--/*       that edge is the shortest edge of the triangle whose circumcenter   */
--/*       is being inserted.                                                  */
--/*                                                                           */
--/*  (2)  To try to find an existing point.  In this case, any edge on the    */
--/*       convex hull is a good starting edge.  You must screen out the       */
--/*       possibility that the vertex sought is an endpoint of the starting   */
--/*       edge before you call preciselocate().                               */
--/*                                                                           */
--/*  On completion, `searchtri' is a triangle that contains `searchpoint'.    */
--/*                                                                           */
--/*  This implementation differs from that given by Guibas and Stolfi.  It    */
--/*  walks from triangle to triangle, crossing an edge only if `searchpoint'  */
--/*  is on the other side of the line containing that edge.  After entering   */
--/*  a triangle, there are two edges by which one can leave that triangle.    */
--/*  If both edges are valid (`searchpoint' is on the other side of both      */
--/*  edges), one of the two is chosen by drawing a line perpendicular to      */
--/*  the entry edge (whose endpoints are `forg' and `fdest') passing through  */
--/*  `fapex'.  Depending on which side of this perpendicular `searchpoint'    */
--/*  falls on, an exit edge is chosen.                                        */
--/*                                                                           */
--/*  This implementation is empirically faster than the Guibas and Stolfi     */
--/*  point location routine (which I originally used), which tends to spiral  */
--/*  in toward its target.                                                    */
--/*                                                                           */
--/*  Returns ONVERTEX if the point lies on an existing vertex.  `searchtri'   */
--/*  is a handle whose origin is the existing vertex.                         */
--/*                                                                           */
--/*  Returns ONEDGE if the point lies on a mesh edge.  `searchtri' is a       */
--/*  handle whose primary edge is the edge on which the point lies.           */
--/*                                                                           */
--/*  Returns INTRIANGLE if the point lies strictly within a triangle.         */
--/*  `searchtri' is a handle on the triangle that contains the point.         */
--/*                                                                           */
--/*  Returns OUTSIDE if the point lies outside the mesh.  `searchtri' is a    */
--/*  handle whose primary edge the point is to the right of.  This might      */
--/*  occur when the circumcenter of a triangle falls just slightly outside    */
--/*  the mesh due to floating-point roundoff error.  It also occurs when      */
--/*  seeking a hole or region point that a foolish user has placed outside    */
--/*  the mesh.                                                                */
--/*                                                                           */
--/*  If `stopatsubsegment' is nonzero, the search will stop if it tries to    */
--/*  walk through a subsegment, and will return OUTSIDE.                      */
--/*                                                                           */
--/*  WARNING:  This routine is designed for convex triangulations, and will   */
--/*  not generally work after the holes and concavities have been carved.     */
--/*  However, it can still be used to find the circumcenter of a triangle, as */
--/*  long as the search is begun from the triangle in question.               */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifdef ANSI_DECLARATORS
--enum locateresult preciselocate(struct mesh *m, struct behavior *b,
--                                vertex searchpoint, struct otri *searchtri,
--                                int stopatsubsegment)
--#else /* not ANSI_DECLARATORS */
--enum locateresult preciselocate(m, b, searchpoint, searchtri, stopatsubsegment)
--struct mesh *m;
--struct behavior *b;
--vertex searchpoint;
--struct otri *searchtri;
--int stopatsubsegment;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  struct otri backtracktri;
--  struct osub checkedge;
--  vertex forg, fdest, fapex;
--  REAL orgorient, destorient;
--  int moveleft;
--  triangle ptr;                         /* Temporary variable used by sym(). */
--  subseg sptr;                      /* Temporary variable used by tspivot(). */
--
--  if (b->verbose > 2) {
--    printf("  Searching for point (%.12g, %.12g).\n",
--           searchpoint[0], searchpoint[1]);
--  }
--  /* Where are we? */
--  org(*searchtri, forg);
--  dest(*searchtri, fdest);
--  apex(*searchtri, fapex);
--  while (1) {
--    if (b->verbose > 2) {
--      printf("    At (%.12g, %.12g) (%.12g, %.12g) (%.12g, %.12g)\n",
--             forg[0], forg[1], fdest[0], fdest[1], fapex[0], fapex[1]);
--    }
--    /* Check whether the apex is the point we seek. */
--    if ((fapex[0] == searchpoint[0]) && (fapex[1] == searchpoint[1])) {
--      lprevself(*searchtri);
--      return ONVERTEX;
--    }
--    /* Does the point lie on the other side of the line defined by the */
--    /*   triangle edge opposite the triangle's destination?            */
--    destorient = counterclockwise(m, b, forg, fapex, searchpoint);
--    /* Does the point lie on the other side of the line defined by the */
--    /*   triangle edge opposite the triangle's origin?                 */
--    orgorient = counterclockwise(m, b, fapex, fdest, searchpoint);
--    if (destorient > 0.0) {
--      if (orgorient > 0.0) {
--        /* Move left if the inner product of (fapex - searchpoint) and  */
--        /*   (fdest - forg) is positive.  This is equivalent to drawing */
--        /*   a line perpendicular to the line (forg, fdest) and passing */
--        /*   through `fapex', and determining which side of this line   */
--        /*   `searchpoint' falls on.                                    */
--        moveleft = (fapex[0] - searchpoint[0]) * (fdest[0] - forg[0]) +
--                   (fapex[1] - searchpoint[1]) * (fdest[1] - forg[1]) > 0.0;
--      } else {
--        moveleft = 1;
--      }
--    } else {
--      if (orgorient > 0.0) {
--        moveleft = 0;
--      } else {
--        /* The point we seek must be on the boundary of or inside this */
--        /*   triangle.                                                 */
--        if (destorient == 0.0) {
--          lprevself(*searchtri);
--          return ONEDGE;
--        }
--        if (orgorient == 0.0) {
--          lnextself(*searchtri);
--          return ONEDGE;
--        }
--        return INTRIANGLE;
--      }
--    }
--
--    /* Move to another triangle.  Leave a trace `backtracktri' in case */
--    /*   floating-point roundoff or some such bogey causes us to walk  */
--    /*   off a boundary of the triangulation.                          */
--    if (moveleft) {
--      lprev(*searchtri, backtracktri);
--      fdest = fapex;
--    } else {
--      lnext(*searchtri, backtracktri);
--      forg = fapex;
--    }
--    sym(backtracktri, *searchtri);
--
--    if (m->checksegments && stopatsubsegment) {
--      /* Check for walking through a subsegment. */
--      tspivot(backtracktri, checkedge);
--      if (checkedge.ss != m->dummysub) {
--        /* Go back to the last triangle. */
--        otricopy(backtracktri, *searchtri);
--        return OUTSIDE;
--      }
--    }
--    /* Check for walking right out of the triangulation. */
--    if (searchtri->tri == m->dummytri) {
--      /* Go back to the last triangle. */
--      otricopy(backtracktri, *searchtri);
--      return OUTSIDE;
--    }
--
--    apex(*searchtri, fapex);
--  }
--}
--
--/*****************************************************************************/
--/*                                                                           */
--/*  locate()   Find a triangle or edge containing a given point.             */
--/*                                                                           */
--/*  Searching begins from one of:  the input `searchtri', a recently         */
--/*  encountered triangle `recenttri', or from a triangle chosen from a       */
--/*  random sample.  The choice is made by determining which triangle's       */
--/*  origin is closest to the point we are searching for.  Normally,          */
--/*  `searchtri' should be a handle on the convex hull of the triangulation.  */
--/*                                                                           */
--/*  Details on the random sampling method can be found in the Mucke, Saias,  */
--/*  and Zhu paper cited in the header of this code.                          */
--/*                                                                           */
--/*  On completion, `searchtri' is a triangle that contains `searchpoint'.    */
--/*                                                                           */
--/*  Returns ONVERTEX if the point lies on an existing vertex.  `searchtri'   */
--/*  is a handle whose origin is the existing vertex.                         */
--/*                                                                           */
--/*  Returns ONEDGE if the point lies on a mesh edge.  `searchtri' is a       */
--/*  handle whose primary edge is the edge on which the point lies.           */
--/*                                                                           */
--/*  Returns INTRIANGLE if the point lies strictly within a triangle.         */
--/*  `searchtri' is a handle on the triangle that contains the point.         */
--/*                                                                           */
--/*  Returns OUTSIDE if the point lies outside the mesh.  `searchtri' is a    */
--/*  handle whose primary edge the point is to the right of.  This might      */
--/*  occur when the circumcenter of a triangle falls just slightly outside    */
--/*  the mesh due to floating-point roundoff error.  It also occurs when      */
--/*  seeking a hole or region point that a foolish user has placed outside    */
--/*  the mesh.                                                                */
--/*                                                                           */
--/*  WARNING:  This routine is designed for convex triangulations, and will   */
--/*  not generally work after the holes and concavities have been carved.     */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifdef ANSI_DECLARATORS
--enum locateresult locate(struct mesh *m, struct behavior *b,
--                         vertex searchpoint, struct otri *searchtri)
--#else /* not ANSI_DECLARATORS */
--enum locateresult locate(m, b, searchpoint, searchtri)
--struct mesh *m;
--struct behavior *b;
--vertex searchpoint;
--struct otri *searchtri;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  void **sampleblock;
--  char *firsttri;
--  struct otri sampletri;
--  vertex torg, tdest;
--  TRIANGLE_PTRINT alignptr;
--  REAL searchdist, dist;
--  REAL ahead;
--  long samplesperblock, totalsamplesleft, samplesleft;
--  long population, totalpopulation;
--  triangle ptr;                         /* Temporary variable used by sym(). */
--
--  if (b->verbose > 2) {
--    printf("  Randomly sampling for a triangle near point (%.12g, %.12g).\n",
--           searchpoint[0], searchpoint[1]);
--  }
--  /* Record the distance from the suggested starting triangle to the */
--  /*   point we seek.                                                */
--  org(*searchtri, torg);
--  searchdist = (searchpoint[0] - torg[0]) * (searchpoint[0] - torg[0]) +
--               (searchpoint[1] - torg[1]) * (searchpoint[1] - torg[1]);
--  if (b->verbose > 2) {
--    printf("    Boundary triangle has origin (%.12g, %.12g).\n",
--           torg[0], torg[1]);
--  }
--
--  /* If a recently encountered triangle has been recorded and has not been */
--  /*   deallocated, test it as a good starting point.                      */
--  if (m->recenttri.tri != (triangle *) NULL) {
--    if (!deadtri(m->recenttri.tri)) {
--      org(m->recenttri, torg);
--      if ((torg[0] == searchpoint[0]) && (torg[1] == searchpoint[1])) {
--        otricopy(m->recenttri, *searchtri);
--        return ONVERTEX;
--      }
--      dist = (searchpoint[0] - torg[0]) * (searchpoint[0] - torg[0]) +
--             (searchpoint[1] - torg[1]) * (searchpoint[1] - torg[1]);
--      if (dist < searchdist) {
--        otricopy(m->recenttri, *searchtri);
--        searchdist = dist;
--        if (b->verbose > 2) {
--          printf("    Choosing recent triangle with origin (%.12g, %.12g).\n",
--                 torg[0], torg[1]);
--        }
--      }
--    }
--  }
--
--  /* The number of random samples taken is proportional to the cube root of */
--  /*   the number of triangles in the mesh.  The next bit of code assumes   */
--  /*   that the number of triangles increases monotonically (or at least    */
--  /*   doesn't decrease enough to matter).                                  */
--  while (SAMPLEFACTOR * m->samples * m->samples * m->samples <
--         m->triangles.items) {
--    m->samples++;
--  }
--
--  /* We'll draw ceiling(samples * TRIPERBLOCK / maxitems) random samples  */
--  /*   from each block of triangles (except the first)--until we meet the */
--  /*   sample quota.  The ceiling means that blocks at the end might be   */
--  /*   neglected, but I don't care.                                       */
--  samplesperblock = (m->samples * TRIPERBLOCK - 1) / m->triangles.maxitems + 1;
--  /* We'll draw ceiling(samples * itemsfirstblock / maxitems) random samples */
--  /*   from the first block of triangles.                                    */
--  samplesleft = (m->samples * m->triangles.itemsfirstblock - 1) /
--                m->triangles.maxitems + 1;
--  totalsamplesleft = m->samples;
--  population = m->triangles.itemsfirstblock;
--  totalpopulation = m->triangles.maxitems;
--  sampleblock = m->triangles.firstblock;
--  sampletri.orient = 0;
--  while (totalsamplesleft > 0) {
--    /* If we're in the last block, `population' needs to be corrected. */
--    if (population > totalpopulation) {
--      population = totalpopulation;
--    }
--    /* Find a pointer to the first triangle in the block. */
--    alignptr = (TRIANGLE_PTRINT) (sampleblock + 1);
--    firsttri = (char *) (alignptr +
--                         (TRIANGLE_PTRINT) m->triangles.alignbytes -
--                         (alignptr %
--                          (TRIANGLE_PTRINT) m->triangles.alignbytes));
--
--    /* Choose `samplesleft' randomly sampled triangles in this block. */
--    do {
--      sampletri.tri = (triangle *) (firsttri +
--                                    (randomnation((unsigned int) population) *
--                                     m->triangles.itembytes));
--      if (!deadtri(sampletri.tri)) {
--        org(sampletri, torg);
--        dist = (searchpoint[0] - torg[0]) * (searchpoint[0] - torg[0]) +
--               (searchpoint[1] - torg[1]) * (searchpoint[1] - torg[1]);
--        if (dist < searchdist) {
--          otricopy(sampletri, *searchtri);
--          searchdist = dist;
--          if (b->verbose > 2) {
--            printf("    Choosing triangle with origin (%.12g, %.12g).\n",
--                   torg[0], torg[1]);
--          }
--        }
--      }
--
--      samplesleft--;
--      totalsamplesleft--;
--    } while ((samplesleft > 0) && (totalsamplesleft > 0));
--
--    if (totalsamplesleft > 0) {
--      sampleblock = (void **) *sampleblock;
--      samplesleft = samplesperblock;
--      totalpopulation -= population;
--      population = TRIPERBLOCK;
--    }
--  }
--
--  /* Where are we? */
--  org(*searchtri, torg);
--  dest(*searchtri, tdest);
--  /* Check the starting triangle's vertices. */
--  if ((torg[0] == searchpoint[0]) && (torg[1] == searchpoint[1])) {
--    return ONVERTEX;
--  }
--  if ((tdest[0] == searchpoint[0]) && (tdest[1] == searchpoint[1])) {
--    lnextself(*searchtri);
--    return ONVERTEX;
--  }
--  /* Orient `searchtri' to fit the preconditions of calling preciselocate(). */
--  ahead = counterclockwise(m, b, torg, tdest, searchpoint);
--  if (ahead < 0.0) {
--    /* Turn around so that `searchpoint' is to the left of the */
--    /*   edge specified by `searchtri'.                        */
--    symself(*searchtri);
--  } else if (ahead == 0.0) {
--    /* Check if `searchpoint' is between `torg' and `tdest'. */
--    if (((torg[0] < searchpoint[0]) == (searchpoint[0] < tdest[0])) &&
--        ((torg[1] < searchpoint[1]) == (searchpoint[1] < tdest[1]))) {
--      return ONEDGE;
--    }
--  }
--  return preciselocate(m, b, searchpoint, searchtri, 0);
--}
--
--/**                                                                         **/
--/**                                                                         **/
--/********* Point location routines end here                          *********/
--
--/********* Mesh transformation routines begin here                   *********/
--/**                                                                         **/
--/**                                                                         **/
--
--/*****************************************************************************/
--/*                                                                           */
--/*  insertsubseg()   Create a new subsegment and insert it between two       */
--/*                   triangles.                                              */
--/*                                                                           */
--/*  The new subsegment is inserted at the edge described by the handle       */
--/*  `tri'.  Its vertices are properly initialized.  The marker `subsegmark'  */
--/*  is applied to the subsegment and, if appropriate, its vertices.          */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifdef ANSI_DECLARATORS
--void insertsubseg(struct mesh *m, struct behavior *b, struct otri *tri,
--                  int subsegmark)
--#else /* not ANSI_DECLARATORS */
--void insertsubseg(m, b, tri, subsegmark)
--struct mesh *m;
--struct behavior *b;
--struct otri *tri;             /* Edge at which to insert the new subsegment. */
--int subsegmark;                            /* Marker for the new subsegment. */
--#endif /* not ANSI_DECLARATORS */
--
--{
--  struct otri oppotri;
--  struct osub newsubseg;
--  vertex triorg, tridest;
--  triangle ptr;                         /* Temporary variable used by sym(). */
--  subseg sptr;                      /* Temporary variable used by tspivot(). */
--
--  org(*tri, triorg);
--  dest(*tri, tridest);
--  /* Mark vertices if possible. */
--  if (vertexmark(triorg) == 0) {
--    setvertexmark(triorg, subsegmark);
--  }
--  if (vertexmark(tridest) == 0) {
--    setvertexmark(tridest, subsegmark);
--  }
--  /* Check if there's already a subsegment here. */
--  tspivot(*tri, newsubseg);
--  if (newsubseg.ss == m->dummysub) {
--    /* Make new subsegment and initialize its vertices. */
--    makesubseg(m, &newsubseg);
--    setsorg(newsubseg, tridest);
--    setsdest(newsubseg, triorg);
--    setsegorg(newsubseg, tridest);
--    setsegdest(newsubseg, triorg);
--    /* Bond new subsegment to the two triangles it is sandwiched between. */
--    /*   Note that the facing triangle `oppotri' might be equal to        */
--    /*   `dummytri' (outer space), but the new subsegment is bonded to it */
--    /*   all the same.                                                    */
--    tsbond(*tri, newsubseg);
--    sym(*tri, oppotri);
--    ssymself(newsubseg);
--    tsbond(oppotri, newsubseg);
--    setmark(newsubseg, subsegmark);
--    if (b->verbose > 2) {
--      printf("  Inserting new ");
--      printsubseg(m, b, &newsubseg);
--    }
--  } else {
--    if (mark(newsubseg) == 0) {
--      setmark(newsubseg, subsegmark);
--    }
--  }
--}
--
--/*****************************************************************************/
--/*                                                                           */
--/*  Terminology                                                              */
--/*                                                                           */
--/*  A "local transformation" replaces a small set of triangles with another  */
--/*  set of triangles.  This may or may not involve inserting or deleting a   */
--/*  vertex.                                                                  */
--/*                                                                           */
--/*  The term "casing" is used to describe the set of triangles that are      */
--/*  attached to the triangles being transformed, but are not transformed     */
--/*  themselves.  Think of the casing as a fixed hollow structure inside      */
--/*  which all the action happens.  A "casing" is only defined relative to    */
--/*  a single transformation; each occurrence of a transformation will        */
--/*  involve a different casing.                                              */
--/*                                                                           */
--/*****************************************************************************/
--
--/*****************************************************************************/
--/*                                                                           */
--/*  flip()   Transform two triangles to two different triangles by flipping  */
--/*           an edge counterclockwise within a quadrilateral.                */
--/*                                                                           */
--/*  Imagine the original triangles, abc and bad, oriented so that the        */
--/*  shared edge ab lies in a horizontal plane, with the vertex b on the left */
--/*  and the vertex a on the right.  The vertex c lies below the edge, and    */
--/*  the vertex d lies above the edge.  The `flipedge' handle holds the edge  */
--/*  ab of triangle abc, and is directed left, from vertex a to vertex b.     */
--/*                                                                           */
--/*  The triangles abc and bad are deleted and replaced by the triangles cdb  */
--/*  and dca.  The triangles that represent abc and bad are NOT deallocated;  */
--/*  they are reused for dca and cdb, respectively.  Hence, any handles that  */
--/*  may have held the original triangles are still valid, although not       */
--/*  directed as they were before.                                            */
--/*                                                                           */
--/*  Upon completion of this routine, the `flipedge' handle holds the edge    */
--/*  dc of triangle dca, and is directed down, from vertex d to vertex c.     */
--/*  (Hence, the two triangles have rotated counterclockwise.)                */
--/*                                                                           */
--/*  WARNING:  This transformation is geometrically valid only if the         */
--/*  quadrilateral adbc is convex.  Furthermore, this transformation is       */
--/*  valid only if there is not a subsegment between the triangles abc and    */
--/*  bad.  This routine does not check either of these preconditions, and     */
--/*  it is the responsibility of the calling routine to ensure that they are  */
--/*  met.  If they are not, the streets shall be filled with wailing and      */
--/*  gnashing of teeth.                                                       */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifdef ANSI_DECLARATORS
--void flip(struct mesh *m, struct behavior *b, struct otri *flipedge)
--#else /* not ANSI_DECLARATORS */
--void flip(m, b, flipedge)
--struct mesh *m;
--struct behavior *b;
--struct otri *flipedge;                    /* Handle for the triangle abc. */
--#endif /* not ANSI_DECLARATORS */
--
--{
--  struct otri botleft, botright;
--  struct otri topleft, topright;
--  struct otri top;
--  struct otri botlcasing, botrcasing;
--  struct otri toplcasing, toprcasing;
--  struct osub botlsubseg, botrsubseg;
--  struct osub toplsubseg, toprsubseg;
--  vertex leftvertex, rightvertex, botvertex;
--  vertex farvertex;
--  triangle ptr;                         /* Temporary variable used by sym(). */
--  subseg sptr;                      /* Temporary variable used by tspivot(). */
--
--  /* Identify the vertices of the quadrilateral. */
--  org(*flipedge, rightvertex);
--  dest(*flipedge, leftvertex);
--  apex(*flipedge, botvertex);
--  sym(*flipedge, top);
--#ifdef SELF_CHECK
--  if (top.tri == m->dummytri) {
--    printf("Internal error in flip():  Attempt to flip on boundary.\n");
--    lnextself(*flipedge);
--    return;
--  }
--  if (m->checksegments) {
--    tspivot(*flipedge, toplsubseg);
--    if (toplsubseg.ss != m->dummysub) {
--      printf("Internal error in flip():  Attempt to flip a segment.\n");
--      lnextself(*flipedge);
--      return;
--    }
--  }
--#endif /* SELF_CHECK */
--  apex(top, farvertex);
--
--  /* Identify the casing of the quadrilateral. */
--  lprev(top, topleft);
--  sym(topleft, toplcasing);
--  lnext(top, topright);
--  sym(topright, toprcasing);
--  lnext(*flipedge, botleft);
--  sym(botleft, botlcasing);
--  lprev(*flipedge, botright);
--  sym(botright, botrcasing);
--  /* Rotate the quadrilateral one-quarter turn counterclockwise. */
--  bond(topleft, botlcasing);
--  bond(botleft, botrcasing);
--  bond(botright, toprcasing);
--  bond(topright, toplcasing);
--
--  if (m->checksegments) {
--    /* Check for subsegments and rebond them to the quadrilateral. */
--    tspivot(topleft, toplsubseg);
--    tspivot(botleft, botlsubseg);
--    tspivot(botright, botrsubseg);
--    tspivot(topright, toprsubseg);
--    if (toplsubseg.ss == m->dummysub) {
--      tsdissolve(topright);
--    } else {
--      tsbond(topright, toplsubseg);
--    }
--    if (botlsubseg.ss == m->dummysub) {
--      tsdissolve(topleft);
--    } else {
--      tsbond(topleft, botlsubseg);
--    }
--    if (botrsubseg.ss == m->dummysub) {
--      tsdissolve(botleft);
--    } else {
--      tsbond(botleft, botrsubseg);
--    }
--    if (toprsubseg.ss == m->dummysub) {
--      tsdissolve(botright);
--    } else {
--      tsbond(botright, toprsubseg);
--    }
--  }
--
--  /* New vertex assignments for the rotated quadrilateral. */
--  setorg(*flipedge, farvertex);
--  setdest(*flipedge, botvertex);
--  setapex(*flipedge, rightvertex);
--  setorg(top, botvertex);
--  setdest(top, farvertex);
--  setapex(top, leftvertex);
--  if (b->verbose > 2) {
--    printf("  Edge flip results in left ");
--    printtriangle(m, b, &top);
--    printf("  and right ");
--    printtriangle(m, b, flipedge);
--  }
--}
--
--/*****************************************************************************/
--/*                                                                           */
--/*  unflip()   Transform two triangles to two different triangles by         */
--/*             flipping an edge clockwise within a quadrilateral.  Reverses  */
--/*             the flip() operation so that the data structures representing */
--/*             the triangles are back where they were before the flip().     */
--/*                                                                           */
--/*  Imagine the original triangles, abc and bad, oriented so that the        */
--/*  shared edge ab lies in a horizontal plane, with the vertex b on the left */
--/*  and the vertex a on the right.  The vertex c lies below the edge, and    */
--/*  the vertex d lies above the edge.  The `flipedge' handle holds the edge  */
--/*  ab of triangle abc, and is directed left, from vertex a to vertex b.     */
--/*                                                                           */
--/*  The triangles abc and bad are deleted and replaced by the triangles cdb  */
--/*  and dca.  The triangles that represent abc and bad are NOT deallocated;  */
--/*  they are reused for cdb and dca, respectively.  Hence, any handles that  */
--/*  may have held the original triangles are still valid, although not       */
--/*  directed as they were before.                                            */
--/*                                                                           */
--/*  Upon completion of this routine, the `flipedge' handle holds the edge    */
--/*  cd of triangle cdb, and is directed up, from vertex c to vertex d.       */
--/*  (Hence, the two triangles have rotated clockwise.)                       */
--/*                                                                           */
--/*  WARNING:  This transformation is geometrically valid only if the         */
--/*  quadrilateral adbc is convex.  Furthermore, this transformation is       */
--/*  valid only if there is not a subsegment between the triangles abc and    */
--/*  bad.  This routine does not check either of these preconditions, and     */
--/*  it is the responsibility of the calling routine to ensure that they are  */
--/*  met.  If they are not, the streets shall be filled with wailing and      */
--/*  gnashing of teeth.                                                       */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifdef ANSI_DECLARATORS
--void unflip(struct mesh *m, struct behavior *b, struct otri *flipedge)
--#else /* not ANSI_DECLARATORS */
--void unflip(m, b, flipedge)
--struct mesh *m;
--struct behavior *b;
--struct otri *flipedge;                    /* Handle for the triangle abc. */
--#endif /* not ANSI_DECLARATORS */
--
--{
--  struct otri botleft, botright;
--  struct otri topleft, topright;
--  struct otri top;
--  struct otri botlcasing, botrcasing;
--  struct otri toplcasing, toprcasing;
--  struct osub botlsubseg, botrsubseg;
--  struct osub toplsubseg, toprsubseg;
--  vertex leftvertex, rightvertex, botvertex;
--  vertex farvertex;
--  triangle ptr;                         /* Temporary variable used by sym(). */
--  subseg sptr;                      /* Temporary variable used by tspivot(). */
--
--  /* Identify the vertices of the quadrilateral. */
--  org(*flipedge, rightvertex);
--  dest(*flipedge, leftvertex);
--  apex(*flipedge, botvertex);
--  sym(*flipedge, top);
--#ifdef SELF_CHECK
--  if (top.tri == m->dummytri) {
--    printf("Internal error in unflip():  Attempt to flip on boundary.\n");
--    lnextself(*flipedge);
--    return;
--  }
--  if (m->checksegments) {
--    tspivot(*flipedge, toplsubseg);
--    if (toplsubseg.ss != m->dummysub) {
--      printf("Internal error in unflip():  Attempt to flip a subsegment.\n");
--      lnextself(*flipedge);
--      return;
--    }
--  }
--#endif /* SELF_CHECK */
--  apex(top, farvertex);
--
--  /* Identify the casing of the quadrilateral. */
--  lprev(top, topleft);
--  sym(topleft, toplcasing);
--  lnext(top, topright);
--  sym(topright, toprcasing);
--  lnext(*flipedge, botleft);
--  sym(botleft, botlcasing);
--  lprev(*flipedge, botright);
--  sym(botright, botrcasing);
--  /* Rotate the quadrilateral one-quarter turn clockwise. */
--  bond(topleft, toprcasing);
--  bond(botleft, toplcasing);
--  bond(botright, botlcasing);
--  bond(topright, botrcasing);
--
--  if (m->checksegments) {
--    /* Check for subsegments and rebond them to the quadrilateral. */
--    tspivot(topleft, toplsubseg);
--    tspivot(botleft, botlsubseg);
--    tspivot(botright, botrsubseg);
--    tspivot(topright, toprsubseg);
--    if (toplsubseg.ss == m->dummysub) {
--      tsdissolve(botleft);
--    } else {
--      tsbond(botleft, toplsubseg);
--    }
--    if (botlsubseg.ss == m->dummysub) {
--      tsdissolve(botright);
--    } else {
--      tsbond(botright, botlsubseg);
--    }
--    if (botrsubseg.ss == m->dummysub) {
--      tsdissolve(topright);
--    } else {
--      tsbond(topright, botrsubseg);
--    }
--    if (toprsubseg.ss == m->dummysub) {
--      tsdissolve(topleft);
--    } else {
--      tsbond(topleft, toprsubseg);
--    }
--  }
--
--  /* New vertex assignments for the rotated quadrilateral. */
--  setorg(*flipedge, botvertex);
--  setdest(*flipedge, farvertex);
--  setapex(*flipedge, leftvertex);
--  setorg(top, farvertex);
--  setdest(top, botvertex);
--  setapex(top, rightvertex);
--  if (b->verbose > 2) {
--    printf("  Edge unflip results in left ");
--    printtriangle(m, b, flipedge);
--    printf("  and right ");
--    printtriangle(m, b, &top);
--  }
--}
--
--/*****************************************************************************/
--/*                                                                           */
--/*  insertvertex()   Insert a vertex into a Delaunay triangulation,          */
--/*                   performing flips as necessary to maintain the Delaunay  */
--/*                   property.                                               */
--/*                                                                           */
--/*  The point `insertvertex' is located.  If `searchtri.tri' is not NULL,    */
--/*  the search for the containing triangle begins from `searchtri'.  If      */
--/*  `searchtri.tri' is NULL, a full point location procedure is called.      */
--/*  If `insertvertex' is found inside a triangle, the triangle is split into */
--/*  three; if `insertvertex' lies on an edge, the edge is split in two,      */
--/*  thereby splitting the two adjacent triangles into four.  Edge flips are  */
--/*  used to restore the Delaunay property.  If `insertvertex' lies on an     */
--/*  existing vertex, no action is taken, and the value DUPLICATEVERTEX is    */
--/*  returned.  On return, `searchtri' is set to a handle whose origin is the */
--/*  existing vertex.                                                         */
--/*                                                                           */
--/*  Normally, the parameter `splitseg' is set to NULL, implying that no      */
--/*  subsegment should be split.  In this case, if `insertvertex' is found to */
--/*  lie on a segment, no action is taken, and the value VIOLATINGVERTEX is   */
--/*  returned.  On return, `searchtri' is set to a handle whose primary edge  */
--/*  is the violated subsegment.                                              */
--/*                                                                           */
--/*  If the calling routine wishes to split a subsegment by inserting a       */
--/*  vertex in it, the parameter `splitseg' should be that subsegment.  In    */
--/*  this case, `searchtri' MUST be the triangle handle reached by pivoting   */
--/*  from that subsegment; no point location is done.                         */
--/*                                                                           */
--/*  `segmentflaws' and `triflaws' are flags that indicate whether or not     */
--/*  there should be checks for the creation of encroached subsegments or bad */
--/*  quality triangles.  If a newly inserted vertex encroaches upon           */
--/*  subsegments, these subsegments are added to the list of subsegments to   */
--/*  be split if `segmentflaws' is set.  If bad triangles are created, these  */
--/*  are added to the queue if `triflaws' is set.                             */
--/*                                                                           */
--/*  If a duplicate vertex or violated segment does not prevent the vertex    */
--/*  from being inserted, the return value will be ENCROACHINGVERTEX if the   */
--/*  vertex encroaches upon a subsegment (and checking is enabled), or        */
--/*  SUCCESSFULVERTEX otherwise.  In either case, `searchtri' is set to a     */
--/*  handle whose origin is the newly inserted vertex.                        */
--/*                                                                           */
--/*  insertvertex() does not use flip() for reasons of speed; some            */
--/*  information can be reused from edge flip to edge flip, like the          */
--/*  locations of subsegments.                                                */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifdef ANSI_DECLARATORS
--enum insertvertexresult insertvertex(struct mesh *m, struct behavior *b,
--                                     vertex newvertex, struct otri *searchtri,
--                                     struct osub *splitseg,
--                                     int segmentflaws, int triflaws)
--#else /* not ANSI_DECLARATORS */
--enum insertvertexresult insertvertex(m, b, newvertex, searchtri, splitseg,
--                                     segmentflaws, triflaws)
--struct mesh *m;
--struct behavior *b;
--vertex newvertex;
--struct otri *searchtri;
--struct osub *splitseg;
--int segmentflaws;
--int triflaws;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  struct otri horiz;
--  struct otri top;
--  struct otri botleft, botright;
--  struct otri topleft, topright;
--  struct otri newbotleft, newbotright;
--  struct otri newtopright;
--  struct otri botlcasing, botrcasing;
--  struct otri toplcasing, toprcasing;
--  struct otri testtri;
--  struct osub botlsubseg, botrsubseg;
--  struct osub toplsubseg, toprsubseg;
--  struct osub brokensubseg;
--  struct osub checksubseg;
--  struct osub rightsubseg;
--  struct osub newsubseg;
--  struct badsubseg *encroached;
--  struct flipstacker *newflip;
--  vertex first;
--  vertex leftvertex, rightvertex, botvertex, topvertex, farvertex;
--  vertex segmentorg, segmentdest;
--  REAL attrib;
--  REAL area;
--  enum insertvertexresult success;
--  enum locateresult intersect;
--  int doflip;
--  int mirrorflag;
--  int enq;
--  int i;
--  triangle ptr;                         /* Temporary variable used by sym(). */
--  subseg sptr;         /* Temporary variable used by spivot() and tspivot(). */
--
--  if (b->verbose > 1) {
--    printf("  Inserting (%.12g, %.12g).\n", newvertex[0], newvertex[1]);
--  }
--
--  if (splitseg == (struct osub *) NULL) {
--    /* Find the location of the vertex to be inserted.  Check if a good */
--    /*   starting triangle has already been provided by the caller.     */
--    if (searchtri->tri == m->dummytri) {
--      /* Find a boundary triangle. */
--      horiz.tri = m->dummytri;
--      horiz.orient = 0;
--      symself(horiz);
--      /* Search for a triangle containing `newvertex'. */
--      intersect = locate(m, b, newvertex, &horiz);
--    } else {
--      /* Start searching from the triangle provided by the caller. */
--      otricopy(*searchtri, horiz);
--      intersect = preciselocate(m, b, newvertex, &horiz, 1);
--    }
--  } else {
--    /* The calling routine provides the subsegment in which */
--    /*   the vertex is inserted.                             */
--    otricopy(*searchtri, horiz);
--    intersect = ONEDGE;
--  }
--
--  if (intersect == ONVERTEX) {
--    /* There's already a vertex there.  Return in `searchtri' a triangle */
--    /*   whose origin is the existing vertex.                            */
--    otricopy(horiz, *searchtri);
--    otricopy(horiz, m->recenttri);
--    return DUPLICATEVERTEX;
--  }
--  if ((intersect == ONEDGE) || (intersect == OUTSIDE)) {
--    /* The vertex falls on an edge or boundary. */
--    if (m->checksegments && (splitseg == (struct osub *) NULL)) {
--      /* Check whether the vertex falls on a subsegment. */
--      tspivot(horiz, brokensubseg);
--      if (brokensubseg.ss != m->dummysub) {
--        /* The vertex falls on a subsegment, and hence will not be inserted. */
--        if (segmentflaws) {
--          enq = b->nobisect != 2;
--          if (enq && (b->nobisect == 1)) {
--            /* This subsegment may be split only if it is an */
--            /*   internal boundary.                          */
--            sym(horiz, testtri);
--            enq = testtri.tri != m->dummytri;
--          }
--          if (enq) {
--            /* Add the subsegment to the list of encroached subsegments. */
--            encroached = (struct badsubseg *) poolalloc(&m->badsubsegs);
--            encroached->encsubseg = sencode(brokensubseg);
--            sorg(brokensubseg, encroached->subsegorg);
--            sdest(brokensubseg, encroached->subsegdest);
--            if (b->verbose > 2) {
--              printf(
--          "  Queueing encroached subsegment (%.12g, %.12g) (%.12g, %.12g).\n",
--                     encroached->subsegorg[0], encroached->subsegorg[1],
--                     encroached->subsegdest[0], encroached->subsegdest[1]);
--            }
--          }
--        }
--        /* Return a handle whose primary edge contains the vertex, */
--        /*   which has not been inserted.                          */
--        otricopy(horiz, *searchtri);
--        otricopy(horiz, m->recenttri);
--        return VIOLATINGVERTEX;
--      }
--    }
--
--    /* Insert the vertex on an edge, dividing one triangle into two (if */
--    /*   the edge lies on a boundary) or two triangles into four.       */
--    lprev(horiz, botright);
--    sym(botright, botrcasing);
--    sym(horiz, topright);
--    /* Is there a second triangle?  (Or does this edge lie on a boundary?) */
--    mirrorflag = topright.tri != m->dummytri;
--    if (mirrorflag) {
--      lnextself(topright);
--      sym(topright, toprcasing);
--      maketriangle(m, b, &newtopright);
--    } else {
--      /* Splitting a boundary edge increases the number of boundary edges. */
--      m->hullsize++;
--    }
--    maketriangle(m, b, &newbotright);
--
--    /* Set the vertices of changed and new triangles. */
--    org(horiz, rightvertex);
--    dest(horiz, leftvertex);
--    apex(horiz, botvertex);
--    setorg(newbotright, botvertex);
--    setdest(newbotright, rightvertex);
--    setapex(newbotright, newvertex);
--    setorg(horiz, newvertex);
--    for (i = 0; i < m->eextras; i++) {
--      /* Set the element attributes of a new triangle. */
--      setelemattribute(newbotright, i, elemattribute(botright, i));
--    }
--    if (b->vararea) {
--      /* Set the area constraint of a new triangle. */
--      setareabound(newbotright, areabound(botright));
--    }
--    if (mirrorflag) {
--      dest(topright, topvertex);
--      setorg(newtopright, rightvertex);
--      setdest(newtopright, topvertex);
--      setapex(newtopright, newvertex);
--      setorg(topright, newvertex);
--      for (i = 0; i < m->eextras; i++) {
--        /* Set the element attributes of another new triangle. */
--        setelemattribute(newtopright, i, elemattribute(topright, i));
--      }
--      if (b->vararea) {
--        /* Set the area constraint of another new triangle. */
--        setareabound(newtopright, areabound(topright));
--      }
--    }
--
--    /* There may be subsegments that need to be bonded */
--    /*   to the new triangle(s).                       */
--    if (m->checksegments) {
--      tspivot(botright, botrsubseg);
--      if (botrsubseg.ss != m->dummysub) {
--        tsdissolve(botright);
--        tsbond(newbotright, botrsubseg);
--      }
--      if (mirrorflag) {
--        tspivot(topright, toprsubseg);
--        if (toprsubseg.ss != m->dummysub) {
--          tsdissolve(topright);
--          tsbond(newtopright, toprsubseg);
--        }
--      }
--    }
--
--    /* Bond the new triangle(s) to the surrounding triangles. */
--    bond(newbotright, botrcasing);
--    lprevself(newbotright);
--    bond(newbotright, botright);
--    lprevself(newbotright);
--    if (mirrorflag) {
--      bond(newtopright, toprcasing);
--      lnextself(newtopright);
--      bond(newtopright, topright);
--      lnextself(newtopright);
--      bond(newtopright, newbotright);
--    }
--
--    if (splitseg != (struct osub *) NULL) {
--      /* Split the subsegment into two. */
--      setsdest(*splitseg, newvertex);
--      segorg(*splitseg, segmentorg);
--      segdest(*splitseg, segmentdest);
--      ssymself(*splitseg);
--      spivot(*splitseg, rightsubseg);
--      insertsubseg(m, b, &newbotright, mark(*splitseg));
--      tspivot(newbotright, newsubseg);
--      setsegorg(newsubseg, segmentorg);
--      setsegdest(newsubseg, segmentdest);
--      sbond(*splitseg, newsubseg);
--      ssymself(newsubseg);
--      sbond(newsubseg, rightsubseg);
--      ssymself(*splitseg);
--      /* Transfer the subsegment's boundary marker to the vertex */
--      /*   if required.                                          */
--      if (vertexmark(newvertex) == 0) {
--        setvertexmark(newvertex, mark(*splitseg));
--      }
--    }
--
--    if (m->checkquality) {
--      poolrestart(&m->flipstackers);
--      m->lastflip = (struct flipstacker *) poolalloc(&m->flipstackers);
--      m->lastflip->flippedtri = encode(horiz);
--      m->lastflip->prevflip = (struct flipstacker *) &insertvertex;
--    }
--
--#ifdef SELF_CHECK
--    if (counterclockwise(m, b, rightvertex, leftvertex, botvertex) < 0.0) {
--      printf("Internal error in insertvertex():\n");
--      printf(
--            "  Clockwise triangle prior to edge vertex insertion (bottom).\n");
--    }
--    if (mirrorflag) {
--      if (counterclockwise(m, b, leftvertex, rightvertex, topvertex) < 0.0) {
--        printf("Internal error in insertvertex():\n");
--        printf("  Clockwise triangle prior to edge vertex insertion (top).\n");
--      }
--      if (counterclockwise(m, b, rightvertex, topvertex, newvertex) < 0.0) {
--        printf("Internal error in insertvertex():\n");
--        printf(
--            "  Clockwise triangle after edge vertex insertion (top right).\n");
--      }
--      if (counterclockwise(m, b, topvertex, leftvertex, newvertex) < 0.0) {
--        printf("Internal error in insertvertex():\n");
--        printf(
--            "  Clockwise triangle after edge vertex insertion (top left).\n");
--      }
--    }
--    if (counterclockwise(m, b, leftvertex, botvertex, newvertex) < 0.0) {
--      printf("Internal error in insertvertex():\n");
--      printf(
--          "  Clockwise triangle after edge vertex insertion (bottom left).\n");
--    }
--    if (counterclockwise(m, b, botvertex, rightvertex, newvertex) < 0.0) {
--      printf("Internal error in insertvertex():\n");
--      printf(
--        "  Clockwise triangle after edge vertex insertion (bottom right).\n");
--    }
--#endif /* SELF_CHECK */
--    if (b->verbose > 2) {
--      printf("  Updating bottom left ");
--      printtriangle(m, b, &botright);
--      if (mirrorflag) {
--        printf("  Updating top left ");
--        printtriangle(m, b, &topright);
--        printf("  Creating top right ");
--        printtriangle(m, b, &newtopright);
--      }
--      printf("  Creating bottom right ");
--      printtriangle(m, b, &newbotright);
--    }
--
--    /* Position `horiz' on the first edge to check for */
--    /*   the Delaunay property.                        */
--    lnextself(horiz);
--  } else {
--    /* Insert the vertex in a triangle, splitting it into three. */
--    lnext(horiz, botleft);
--    lprev(horiz, botright);
--    sym(botleft, botlcasing);
--    sym(botright, botrcasing);
--    maketriangle(m, b, &newbotleft);
--    maketriangle(m, b, &newbotright);
--
--    /* Set the vertices of changed and new triangles. */
--    org(horiz, rightvertex);
--    dest(horiz, leftvertex);
--    apex(horiz, botvertex);
--    setorg(newbotleft, leftvertex);
--    setdest(newbotleft, botvertex);
--    setapex(newbotleft, newvertex);
--    setorg(newbotright, botvertex);
--    setdest(newbotright, rightvertex);
--    setapex(newbotright, newvertex);
--    setapex(horiz, newvertex);
--    for (i = 0; i < m->eextras; i++) {
--      /* Set the element attributes of the new triangles. */
--      attrib = elemattribute(horiz, i);
--      setelemattribute(newbotleft, i, attrib);
--      setelemattribute(newbotright, i, attrib);
--    }
--    if (b->vararea) {
--      /* Set the area constraint of the new triangles. */
--      area = areabound(horiz);
--      setareabound(newbotleft, area);
--      setareabound(newbotright, area);
--    }
--
--    /* There may be subsegments that need to be bonded */
--    /*   to the new triangles.                         */
--    if (m->checksegments) {
--      tspivot(botleft, botlsubseg);
--      if (botlsubseg.ss != m->dummysub) {
--        tsdissolve(botleft);
--        tsbond(newbotleft, botlsubseg);
--      }
--      tspivot(botright, botrsubseg);
--      if (botrsubseg.ss != m->dummysub) {
--        tsdissolve(botright);
--        tsbond(newbotright, botrsubseg);
--      }
--    }
--
--    /* Bond the new triangles to the surrounding triangles. */
--    bond(newbotleft, botlcasing);
--    bond(newbotright, botrcasing);
--    lnextself(newbotleft);
--    lprevself(newbotright);
--    bond(newbotleft, newbotright);
--    lnextself(newbotleft);
--    bond(botleft, newbotleft);
--    lprevself(newbotright);
--    bond(botright, newbotright);
--
--    if (m->checkquality) {
--      poolrestart(&m->flipstackers);
--      m->lastflip = (struct flipstacker *) poolalloc(&m->flipstackers);
--      m->lastflip->flippedtri = encode(horiz);
--      m->lastflip->prevflip = (struct flipstacker *) NULL;
--    }
--
--#ifdef SELF_CHECK
--    if (counterclockwise(m, b, rightvertex, leftvertex, botvertex) < 0.0) {
--      printf("Internal error in insertvertex():\n");
--      printf("  Clockwise triangle prior to vertex insertion.\n");
--    }
--    if (counterclockwise(m, b, rightvertex, leftvertex, newvertex) < 0.0) {
--      printf("Internal error in insertvertex():\n");
--      printf("  Clockwise triangle after vertex insertion (top).\n");
--    }
--    if (counterclockwise(m, b, leftvertex, botvertex, newvertex) < 0.0) {
--      printf("Internal error in insertvertex():\n");
--      printf("  Clockwise triangle after vertex insertion (left).\n");
--    }
--    if (counterclockwise(m, b, botvertex, rightvertex, newvertex) < 0.0) {
--      printf("Internal error in insertvertex():\n");
--      printf("  Clockwise triangle after vertex insertion (right).\n");
--    }
--#endif /* SELF_CHECK */
--    if (b->verbose > 2) {
--      printf("  Updating top ");
--      printtriangle(m, b, &horiz);
--      printf("  Creating left ");
--      printtriangle(m, b, &newbotleft);
--      printf("  Creating right ");
--      printtriangle(m, b, &newbotright);
--    }
--  }
--
--  /* The insertion is successful by default, unless an encroached */
--  /*   subsegment is found.                                       */
--  success = SUCCESSFULVERTEX;
--  /* Circle around the newly inserted vertex, checking each edge opposite */
--  /*   it for the Delaunay property.  Non-Delaunay edges are flipped.     */
--  /*   `horiz' is always the edge being checked.  `first' marks where to  */
--  /*   stop circling.                                                     */
--  org(horiz, first);
--  rightvertex = first;
--  dest(horiz, leftvertex);
--  /* Circle until finished. */
--  while (1) {
--    /* By default, the edge will be flipped. */
--    doflip = 1;
--
--    if (m->checksegments) {
--      /* Check for a subsegment, which cannot be flipped. */
--      tspivot(horiz, checksubseg);
--      if (checksubseg.ss != m->dummysub) {
--        /* The edge is a subsegment and cannot be flipped. */
--        doflip = 0;
--#ifndef CDT_ONLY
--        if (segmentflaws) {
--          /* Does the new vertex encroach upon this subsegment? */
--          if (checkseg4encroach(m, b, &checksubseg)) {
--            success = ENCROACHINGVERTEX;
--          }
--        }
--#endif /* not CDT_ONLY */
--      }
--    }
--
--    if (doflip) {
--      /* Check if the edge is a boundary edge. */
--      sym(horiz, top);
--      if (top.tri == m->dummytri) {
--        /* The edge is a boundary edge and cannot be flipped. */
--        doflip = 0;
--      } else {
--        /* Find the vertex on the other side of the edge. */
--        apex(top, farvertex);
--        /* In the incremental Delaunay triangulation algorithm, any of      */
--        /*   `leftvertex', `rightvertex', and `farvertex' could be vertices */
--        /*   of the triangular bounding box.  These vertices must be        */
--        /*   treated as if they are infinitely distant, even though their   */
--        /*   "coordinates" are not.                                         */
--        if ((leftvertex == m->infvertex1) || (leftvertex == m->infvertex2) ||
--            (leftvertex == m->infvertex3)) {
--          /* `leftvertex' is infinitely distant.  Check the convexity of  */
--          /*   the boundary of the triangulation.  'farvertex' might be   */
--          /*   infinite as well, but trust me, this same condition should */
--          /*   be applied.                                                */
--          doflip = counterclockwise(m, b, newvertex, rightvertex, farvertex)
--                   > 0.0;
--        } else if ((rightvertex == m->infvertex1) ||
--                   (rightvertex == m->infvertex2) ||
--                   (rightvertex == m->infvertex3)) {
--          /* `rightvertex' is infinitely distant.  Check the convexity of */
--          /*   the boundary of the triangulation.  'farvertex' might be   */
--          /*   infinite as well, but trust me, this same condition should */
--          /*   be applied.                                                */
--          doflip = counterclockwise(m, b, farvertex, leftvertex, newvertex)
--                   > 0.0;
--        } else if ((farvertex == m->infvertex1) ||
--                   (farvertex == m->infvertex2) ||
--                   (farvertex == m->infvertex3)) {
--          /* `farvertex' is infinitely distant and cannot be inside */
--          /*   the circumcircle of the triangle `horiz'.            */
--          doflip = 0;
--        } else {
--          /* Test whether the edge is locally Delaunay. */
--          doflip = incircle(m, b, leftvertex, newvertex, rightvertex,
--                            farvertex) > 0.0;
--        }
--        if (doflip) {
--          /* We made it!  Flip the edge `horiz' by rotating its containing */
--          /*   quadrilateral (the two triangles adjacent to `horiz').      */
--          /* Identify the casing of the quadrilateral. */
--          lprev(top, topleft);
--          sym(topleft, toplcasing);
--          lnext(top, topright);
--          sym(topright, toprcasing);
--          lnext(horiz, botleft);
--          sym(botleft, botlcasing);
--          lprev(horiz, botright);
--          sym(botright, botrcasing);
--          /* Rotate the quadrilateral one-quarter turn counterclockwise. */
--          bond(topleft, botlcasing);
--          bond(botleft, botrcasing);
--          bond(botright, toprcasing);
--          bond(topright, toplcasing);
--          if (m->checksegments) {
--            /* Check for subsegments and rebond them to the quadrilateral. */
--            tspivot(topleft, toplsubseg);
--            tspivot(botleft, botlsubseg);
--            tspivot(botright, botrsubseg);
--            tspivot(topright, toprsubseg);
--            if (toplsubseg.ss == m->dummysub) {
--              tsdissolve(topright);
--            } else {
--              tsbond(topright, toplsubseg);
--            }
--            if (botlsubseg.ss == m->dummysub) {
--              tsdissolve(topleft);
--            } else {
--              tsbond(topleft, botlsubseg);
--            }
--            if (botrsubseg.ss == m->dummysub) {
--              tsdissolve(botleft);
--            } else {
--              tsbond(botleft, botrsubseg);
--            }
--            if (toprsubseg.ss == m->dummysub) {
--              tsdissolve(botright);
--            } else {
--              tsbond(botright, toprsubseg);
--            }
--          }
--          /* New vertex assignments for the rotated quadrilateral. */
--          setorg(horiz, farvertex);
--          setdest(horiz, newvertex);
--          setapex(horiz, rightvertex);
--          setorg(top, newvertex);
--          setdest(top, farvertex);
--          setapex(top, leftvertex);
--          for (i = 0; i < m->eextras; i++) {
--            /* Take the average of the two triangles' attributes. */
--            attrib = 0.5 * (elemattribute(top, i) + elemattribute(horiz, i));
--            setelemattribute(top, i, attrib);
--            setelemattribute(horiz, i, attrib);
--          }
--          if (b->vararea) {
--            if ((areabound(top) <= 0.0) || (areabound(horiz) <= 0.0)) {
--              area = -1.0;
--            } else {
--              /* Take the average of the two triangles' area constraints.    */
--              /*   This prevents small area constraints from migrating a     */
--              /*   long, long way from their original location due to flips. */
--              area = 0.5 * (areabound(top) + areabound(horiz));
--            }
--            setareabound(top, area);
--            setareabound(horiz, area);
--          }
--
--          if (m->checkquality) {
--            newflip = (struct flipstacker *) poolalloc(&m->flipstackers);
--            newflip->flippedtri = encode(horiz);
--            newflip->prevflip = m->lastflip;
--            m->lastflip = newflip;
--          }
--
--#ifdef SELF_CHECK
--          if (newvertex != (vertex) NULL) {
--            if (counterclockwise(m, b, leftvertex, newvertex, rightvertex) <
--                0.0) {
--              printf("Internal error in insertvertex():\n");
--              printf("  Clockwise triangle prior to edge flip (bottom).\n");
--            }
--            /* The following test has been removed because constrainededge() */
--            /*   sometimes generates inverted triangles that insertvertex()  */
--            /*   removes.                                                    */
--/*
--            if (counterclockwise(m, b, rightvertex, farvertex, leftvertex) <
--                0.0) {
--              printf("Internal error in insertvertex():\n");
--              printf("  Clockwise triangle prior to edge flip (top).\n");
--            }
--*/
--            if (counterclockwise(m, b, farvertex, leftvertex, newvertex) <
--                0.0) {
--              printf("Internal error in insertvertex():\n");
--              printf("  Clockwise triangle after edge flip (left).\n");
--            }
--            if (counterclockwise(m, b, newvertex, rightvertex, farvertex) <
--                0.0) {
--              printf("Internal error in insertvertex():\n");
--              printf("  Clockwise triangle after edge flip (right).\n");
--            }
--          }
--#endif /* SELF_CHECK */
--          if (b->verbose > 2) {
--            printf("  Edge flip results in left ");
--            lnextself(topleft);
--            printtriangle(m, b, &topleft);
--            printf("  and right ");
--            printtriangle(m, b, &horiz);
--          }
--          /* On the next iterations, consider the two edges that were  */
--          /*   exposed (this is, are now visible to the newly inserted */
--          /*   vertex) by the edge flip.                               */
--          lprevself(horiz);
--          leftvertex = farvertex;
--        }
--      }
--    }
--    if (!doflip) {
--      /* The handle `horiz' is accepted as locally Delaunay. */
--#ifndef CDT_ONLY
--      if (triflaws) {
--        /* Check the triangle `horiz' for quality. */
--        testtriangle(m, b, &horiz);
--      }
--#endif /* not CDT_ONLY */
--      /* Look for the next edge around the newly inserted vertex. */
--      lnextself(horiz);
--      sym(horiz, testtri);
--      /* Check for finishing a complete revolution about the new vertex, or */
--      /*   falling outside  of the triangulation.  The latter will happen   */
--      /*   when a vertex is inserted at a boundary.                         */
--      if ((leftvertex == first) || (testtri.tri == m->dummytri)) {
--        /* We're done.  Return a triangle whose origin is the new vertex. */
--        lnext(horiz, *searchtri);
--        lnext(horiz, m->recenttri);
--        return success;
--      }
--      /* Finish finding the next edge around the newly inserted vertex. */
--      lnext(testtri, horiz);
--      rightvertex = leftvertex;
--      dest(horiz, leftvertex);
--    }
--  }
--}
--
--/*****************************************************************************/
--/*                                                                           */
--/*  triangulatepolygon()   Find the Delaunay triangulation of a polygon that */
--/*                         has a certain "nice" shape.  This includes the    */
--/*                         polygons that result from deletion of a vertex or */
--/*                         insertion of a segment.                           */
--/*                                                                           */
--/*  This is a conceptually difficult routine.  The starting assumption is    */
--/*  that we have a polygon with n sides.  n - 1 of these sides are currently */
--/*  represented as edges in the mesh.  One side, called the "base", need not */
--/*  be.                                                                      */
--/*                                                                           */
--/*  Inside the polygon is a structure I call a "fan", consisting of n - 1    */
--/*  triangles that share a common origin.  For each of these triangles, the  */
--/*  edge opposite the origin is one of the sides of the polygon.  The        */
--/*  primary edge of each triangle is the edge directed from the origin to    */
--/*  the destination; note that this is not the same edge that is a side of   */
--/*  the polygon.  `firstedge' is the primary edge of the first triangle.     */
--/*  From there, the triangles follow in counterclockwise order about the     */
--/*  polygon, until `lastedge', the primary edge of the last triangle.        */
--/*  `firstedge' and `lastedge' are probably connected to other triangles     */
--/*  beyond the extremes of the fan, but their identity is not important, as  */
--/*  long as the fan remains connected to them.                               */
--/*                                                                           */
--/*  Imagine the polygon oriented so that its base is at the bottom.  This    */
--/*  puts `firstedge' on the far right, and `lastedge' on the far left.       */
--/*  The right vertex of the base is the destination of `firstedge', and the  */
--/*  left vertex of the base is the apex of `lastedge'.                       */
--/*                                                                           */
--/*  The challenge now is to find the right sequence of edge flips to         */
--/*  transform the fan into a Delaunay triangulation of the polygon.  Each    */
--/*  edge flip effectively removes one triangle from the fan, committing it   */
--/*  to the polygon.  The resulting polygon has one fewer edge.  If `doflip'  */
--/*  is set, the final flip will be performed, resulting in a fan of one      */
--/*  (useless?) triangle.  If `doflip' is not set, the final flip is not      */
--/*  performed, resulting in a fan of two triangles, and an unfinished        */
--/*  triangular polygon that is not yet filled out with a single triangle.    */
--/*  On completion of the routine, `lastedge' is the last remaining triangle, */
--/*  or the leftmost of the last two.                                         */
--/*                                                                           */
--/*  Although the flips are performed in the order described above, the       */
--/*  decisions about what flips to perform are made in precisely the reverse  */
--/*  order.  The recursive triangulatepolygon() procedure makes a decision,   */
--/*  uses up to two recursive calls to triangulate the "subproblems"          */
--/*  (polygons with fewer edges), and then performs an edge flip.             */
--/*                                                                           */
--/*  The "decision" it makes is which vertex of the polygon should be         */
--/*  connected to the base.  This decision is made by testing every possible  */
--/*  vertex.  Once the best vertex is found, the two edges that connect this  */
--/*  vertex to the base become the bases for two smaller polygons.  These     */
--/*  are triangulated recursively.  Unfortunately, this approach can take     */
--/*  O(n^2) time not only in the worst case, but in many common cases.  It's  */
--/*  rarely a big deal for vertex deletion, where n is rarely larger than     */
--/*  ten, but it could be a big deal for segment insertion, especially if     */
--/*  there's a lot of long segments that each cut many triangles.  I ought to */
--/*  code a faster algorithm some day.                                        */
--/*                                                                           */
--/*  The `edgecount' parameter is the number of sides of the polygon,         */
--/*  including its base.  `triflaws' is a flag that determines whether the    */
--/*  new triangles should be tested for quality, and enqueued if they are     */
--/*  bad.                                                                     */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifdef ANSI_DECLARATORS
--void triangulatepolygon(struct mesh *m, struct behavior *b,
--                        struct otri *firstedge, struct otri *lastedge,
--                        int edgecount, int doflip, int triflaws)
--#else /* not ANSI_DECLARATORS */
--void triangulatepolygon(m, b, firstedge, lastedge, edgecount, doflip, triflaws)
--struct mesh *m;
--struct behavior *b;
--struct otri *firstedge;
--struct otri *lastedge;
--int edgecount;
--int doflip;
--int triflaws;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  struct otri testtri;
--  struct otri besttri;
--  struct otri tempedge;
--  vertex leftbasevertex, rightbasevertex;
--  vertex testvertex;
--  vertex bestvertex;
--  int bestnumber;
--  int i;
--  triangle ptr;   /* Temporary variable used by sym(), onext(), and oprev(). */
--
--  /* Identify the base vertices. */
--  apex(*lastedge, leftbasevertex);
--  dest(*firstedge, rightbasevertex);
--  if (b->verbose > 2) {
--    printf("  Triangulating interior polygon at edge\n");
--    printf("    (%.12g, %.12g) (%.12g, %.12g)\n", leftbasevertex[0],
--           leftbasevertex[1], rightbasevertex[0], rightbasevertex[1]);
--  }
--  /* Find the best vertex to connect the base to. */
--  onext(*firstedge, besttri);
--  dest(besttri, bestvertex);
--  otricopy(besttri, testtri);
--  bestnumber = 1;
--  for (i = 2; i <= edgecount - 2; i++) {
--    onextself(testtri);
--    dest(testtri, testvertex);
--    /* Is this a better vertex? */
--    if (incircle(m, b, leftbasevertex, rightbasevertex, bestvertex,
--                 testvertex) > 0.0) {
--      otricopy(testtri, besttri);
--      bestvertex = testvertex;
--      bestnumber = i;
--    }
--  }
--  if (b->verbose > 2) {
--    printf("    Connecting edge to (%.12g, %.12g)\n", bestvertex[0],
--           bestvertex[1]);
--  }
--  if (bestnumber > 1) {
--    /* Recursively triangulate the smaller polygon on the right. */
--    oprev(besttri, tempedge);
--    triangulatepolygon(m, b, firstedge, &tempedge, bestnumber + 1, 1,
--                       triflaws);
--  }
--  if (bestnumber < edgecount - 2) {
--    /* Recursively triangulate the smaller polygon on the left. */
--    sym(besttri, tempedge);
--    triangulatepolygon(m, b, &besttri, lastedge, edgecount - bestnumber, 1,
--                       triflaws);
--    /* Find `besttri' again; it may have been lost to edge flips. */
--    sym(tempedge, besttri);
--  }
--  if (doflip) {
--    /* Do one final edge flip. */
--    flip(m, b, &besttri);
--#ifndef CDT_ONLY
--    if (triflaws) {
--      /* Check the quality of the newly committed triangle. */
--      sym(besttri, testtri);
--      testtriangle(m, b, &testtri);
--    }
--#endif /* not CDT_ONLY */
--  }
--  /* Return the base triangle. */
--  otricopy(besttri, *lastedge);
--}
--
--/*****************************************************************************/
--/*                                                                           */
--/*  deletevertex()   Delete a vertex from a Delaunay triangulation, ensuring */
--/*                   that the triangulation remains Delaunay.                */
--/*                                                                           */
--/*  The origin of `deltri' is deleted.  The union of the triangles adjacent  */
--/*  to this vertex is a polygon, for which the Delaunay triangulation is     */
--/*  found.  Two triangles are removed from the mesh.                         */
--/*                                                                           */
--/*  Only interior vertices that do not lie on segments or boundaries may be  */
--/*  deleted.                                                                 */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifndef CDT_ONLY
--
--#ifdef ANSI_DECLARATORS
--void deletevertex(struct mesh *m, struct behavior *b, struct otri *deltri)
--#else /* not ANSI_DECLARATORS */
--void deletevertex(m, b, deltri)
--struct mesh *m;
--struct behavior *b;
--struct otri *deltri;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  struct otri countingtri;
--  struct otri firstedge, lastedge;
--  struct otri deltriright;
--  struct otri lefttri, righttri;
--  struct otri leftcasing, rightcasing;
--  struct osub leftsubseg, rightsubseg;
--  vertex delvertex;
--  vertex neworg;
--  int edgecount;
--  triangle ptr;   /* Temporary variable used by sym(), onext(), and oprev(). */
--  subseg sptr;                      /* Temporary variable used by tspivot(). */
--
--  org(*deltri, delvertex);
--  if (b->verbose > 1) {
--    printf("  Deleting (%.12g, %.12g).\n", delvertex[0], delvertex[1]);
--  }
--  vertexdealloc(m, delvertex);
--
--  /* Count the degree of the vertex being deleted. */
--  onext(*deltri, countingtri);
--  edgecount = 1;
--  while (!otriequal(*deltri, countingtri)) {
--#ifdef SELF_CHECK
--    if (countingtri.tri == m->dummytri) {
--      printf("Internal error in deletevertex():\n");
--      printf("  Attempt to delete boundary vertex.\n");
--      internalerror();
--    }
--#endif /* SELF_CHECK */
--    edgecount++;
--    onextself(countingtri);
--  }
--
--#ifdef SELF_CHECK
--  if (edgecount < 3) {
--    printf("Internal error in deletevertex():\n  Vertex has degree %d.\n",
--           edgecount);
--    internalerror();
--  }
--#endif /* SELF_CHECK */
--  if (edgecount > 3) {
--    /* Triangulate the polygon defined by the union of all triangles */
--    /*   adjacent to the vertex being deleted.  Check the quality of */
--    /*   the resulting triangles.                                    */
--    onext(*deltri, firstedge);
--    oprev(*deltri, lastedge);
--    triangulatepolygon(m, b, &firstedge, &lastedge, edgecount, 0,
--                       !b->nobisect);
--  }
--  /* Splice out two triangles. */
--  lprev(*deltri, deltriright);
--  dnext(*deltri, lefttri);
--  sym(lefttri, leftcasing);
--  oprev(deltriright, righttri);
--  sym(righttri, rightcasing);
--  bond(*deltri, leftcasing);
--  bond(deltriright, rightcasing);
--  tspivot(lefttri, leftsubseg);
--  if (leftsubseg.ss != m->dummysub) {
--    tsbond(*deltri, leftsubseg);
--  }
--  tspivot(righttri, rightsubseg);
--  if (rightsubseg.ss != m->dummysub) {
--    tsbond(deltriright, rightsubseg);
--  }
--
--  /* Set the new origin of `deltri' and check its quality. */
--  org(lefttri, neworg);
--  setorg(*deltri, neworg);
--  if (!b->nobisect) {
--    testtriangle(m, b, deltri);
--  }
--
--  /* Delete the two spliced-out triangles. */
--  triangledealloc(m, lefttri.tri);
--  triangledealloc(m, righttri.tri);
--}
--
--#endif /* not CDT_ONLY */
--
--/*****************************************************************************/
--/*                                                                           */
--/*  undovertex()   Undo the most recent vertex insertion.                    */
--/*                                                                           */
--/*  Walks through the list of transformations (flips and a vertex insertion) */
--/*  in the reverse of the order in which they were done, and undoes them.    */
--/*  The inserted vertex is removed from the triangulation and deallocated.   */
--/*  Two triangles (possibly just one) are also deallocated.                  */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifndef CDT_ONLY
--
--#ifdef ANSI_DECLARATORS
--void undovertex(struct mesh *m, struct behavior *b)
--#else /* not ANSI_DECLARATORS */
--void undovertex(m, b)
--struct mesh *m;
--struct behavior *b;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  struct otri fliptri;
--  struct otri botleft, botright, topright;
--  struct otri botlcasing, botrcasing, toprcasing;
--  struct otri gluetri;
--  struct osub botlsubseg, botrsubseg, toprsubseg;
--  vertex botvertex, rightvertex;
--  triangle ptr;                         /* Temporary variable used by sym(). */
--  subseg sptr;                      /* Temporary variable used by tspivot(). */
--
--  /* Walk through the list of transformations (flips and a vertex insertion) */
--  /*   in the reverse of the order in which they were done, and undo them.   */
--  while (m->lastflip != (struct flipstacker *) NULL) {
--    /* Find a triangle involved in the last unreversed transformation. */
--    decode(m->lastflip->flippedtri, fliptri);
--
--    /* We are reversing one of three transformations:  a trisection of one */
--    /*   triangle into three (by inserting a vertex in the triangle), a    */
--    /*   bisection of two triangles into four (by inserting a vertex in an */
--    /*   edge), or an edge flip.                                           */
--    if (m->lastflip->prevflip == (struct flipstacker *) NULL) {
--      /* Restore a triangle that was split into three triangles, */
--      /*   so it is again one triangle.                          */
--      dprev(fliptri, botleft);
--      lnextself(botleft);
--      onext(fliptri, botright);
--      lprevself(botright);
--      sym(botleft, botlcasing);
--      sym(botright, botrcasing);
--      dest(botleft, botvertex);
--
--      setapex(fliptri, botvertex);
--      lnextself(fliptri);
--      bond(fliptri, botlcasing);
--      tspivot(botleft, botlsubseg);
--      tsbond(fliptri, botlsubseg);
--      lnextself(fliptri);
--      bond(fliptri, botrcasing);
--      tspivot(botright, botrsubseg);
--      tsbond(fliptri, botrsubseg);
--
--      /* Delete the two spliced-out triangles. */
--      triangledealloc(m, botleft.tri);
--      triangledealloc(m, botright.tri);
--    } else if (m->lastflip->prevflip == (struct flipstacker *) &insertvertex) {
--      /* Restore two triangles that were split into four triangles, */
--      /*   so they are again two triangles.                         */
--      lprev(fliptri, gluetri);
--      sym(gluetri, botright);
--      lnextself(botright);
--      sym(botright, botrcasing);
--      dest(botright, rightvertex);
--
--      setorg(fliptri, rightvertex);
--      bond(gluetri, botrcasing);
--      tspivot(botright, botrsubseg);
--      tsbond(gluetri, botrsubseg);
--
--      /* Delete the spliced-out triangle. */
--      triangledealloc(m, botright.tri);
--
--      sym(fliptri, gluetri);
--      if (gluetri.tri != m->dummytri) {
--        lnextself(gluetri);
--        dnext(gluetri, topright);
--        sym(topright, toprcasing);
--
--        setorg(gluetri, rightvertex);
--        bond(gluetri, toprcasing);
--        tspivot(topright, toprsubseg);
--        tsbond(gluetri, toprsubseg);
--
--        /* Delete the spliced-out triangle. */
--        triangledealloc(m, topright.tri);
--      }
--
--      /* This is the end of the list, sneakily encoded. */
--      m->lastflip->prevflip = (struct flipstacker *) NULL;
--    } else {
--      /* Undo an edge flip. */
--      unflip(m, b, &fliptri);
--    }
--
--    /* Go on and process the next transformation. */
--    m->lastflip = m->lastflip->prevflip;
--  }
--}
--
--#endif /* not CDT_ONLY */
--
--/**                                                                         **/
--/**                                                                         **/
--/********* Mesh transformation routines end here                     *********/
--
--/********* Divide-and-conquer Delaunay triangulation begins here     *********/
--/**                                                                         **/
--/**                                                                         **/
--
--/*****************************************************************************/
--/*                                                                           */
--/*  The divide-and-conquer bounding box                                      */
--/*                                                                           */
--/*  I originally implemented the divide-and-conquer and incremental Delaunay */
--/*  triangulations using the edge-based data structure presented by Guibas   */
--/*  and Stolfi.  Switching to a triangle-based data structure doubled the    */
--/*  speed.  However, I had to think of a few extra tricks to maintain the    */
--/*  elegance of the original algorithms.                                     */
--/*                                                                           */
--/*  The "bounding box" used by my variant of the divide-and-conquer          */
--/*  algorithm uses one triangle for each edge of the convex hull of the      */
--/*  triangulation.  These bounding triangles all share a common apical       */
--/*  vertex, which is represented by NULL and which represents nothing.       */
--/*  The bounding triangles are linked in a circular fan about this NULL      */
--/*  vertex, and the edges on the convex hull of the triangulation appear     */
--/*  opposite the NULL vertex.  You might find it easiest to imagine that     */
--/*  the NULL vertex is a point in 3D space behind the center of the          */
--/*  triangulation, and that the bounding triangles form a sort of cone.      */
--/*                                                                           */
--/*  This bounding box makes it easy to represent degenerate cases.  For      */
--/*  instance, the triangulation of two vertices is a single edge.  This edge */
--/*  is represented by two bounding box triangles, one on each "side" of the  */
--/*  edge.  These triangles are also linked together in a fan about the NULL  */
--/*  vertex.                                                                  */
--/*                                                                           */
--/*  The bounding box also makes it easy to traverse the convex hull, as the  */
--/*  divide-and-conquer algorithm needs to do.                                */
--/*                                                                           */
--/*****************************************************************************/
--
--/*****************************************************************************/
--/*                                                                           */
--/*  vertexsort()   Sort an array of vertices by x-coordinate, using the      */
--/*                 y-coordinate as a secondary key.                          */
--/*                                                                           */
--/*  Uses quicksort.  Randomized O(n log n) time.  No, I did not make any of  */
--/*  the usual quicksort mistakes.                                            */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifdef ANSI_DECLARATORS
--void vertexsort(vertex *sortarray, int arraysize)
--#else /* not ANSI_DECLARATORS */
--void vertexsort(sortarray, arraysize)
--vertex *sortarray;
--int arraysize;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  int left, right;
--  int pivot;
--  REAL pivotx, pivoty;
--  vertex temp;
--
--  if (arraysize == 2) {
--    /* Recursive base case. */
--    if ((sortarray[0][0] > sortarray[1][0]) ||
--        ((sortarray[0][0] == sortarray[1][0]) &&
--         (sortarray[0][1] > sortarray[1][1]))) {
--      temp = sortarray[1];
--      sortarray[1] = sortarray[0];
--      sortarray[0] = temp;
--    }
--    return;
--  }
--  /* Choose a random pivot to split the array. */
--  pivot = (int) randomnation((unsigned int) arraysize);
--  if (pivot == arraysize)//JLM without this test, pivot can equal arraysize and segfault
--	  pivot--;
--  pivotx = sortarray[pivot][0];
--  pivoty = sortarray[pivot][1];
--  /* Split the array. */
--  left = -1;
--  right = arraysize;
--  while (left < right) {
--    /* Search for a vertex whose x-coordinate is too large for the left. */
--    do {
--      left++;
--    } while ((left <= right) && ((sortarray[left][0] < pivotx) ||
--                                 ((sortarray[left][0] == pivotx) &&
--                                  (sortarray[left][1] < pivoty))));
--    /* Search for a vertex whose x-coordinate is too small for the right. */
--    do {
--      right--;
--    } while ((left <= right) && ((sortarray[right][0] > pivotx) ||
--                                 ((sortarray[right][0] == pivotx) &&
--                                  (sortarray[right][1] > pivoty))));
--    if (left < right) {
--      /* Swap the left and right vertices. */
--      temp = sortarray[left];
--      sortarray[left] = sortarray[right];
--      sortarray[right] = temp;
--    }
--  }
--  if (left > 1) {
--    /* Recursively sort the left subset. */
--    vertexsort(sortarray, left);
--  }
--  if (right < arraysize - 2) {
--    /* Recursively sort the right subset. */
--    vertexsort(&sortarray[right + 1], arraysize - right - 1);
--  }
--}
--
--/*****************************************************************************/
--/*                                                                           */
--/*  vertexmedian()   An order statistic algorithm, almost.  Shuffles an      */
--/*                   array of vertices so that the first `median' vertices   */
--/*                   occur lexicographically before the remaining vertices.  */
--/*                                                                           */
--/*  Uses the x-coordinate as the primary key if axis == 0; the y-coordinate  */
--/*  if axis == 1.  Very similar to the vertexsort() procedure, but runs in   */
--/*  randomized linear time.                                                  */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifdef ANSI_DECLARATORS
--void vertexmedian(vertex *sortarray, int arraysize, int median, int axis)
--#else /* not ANSI_DECLARATORS */
--void vertexmedian(sortarray, arraysize, median, axis)
--vertex *sortarray;
--int arraysize;
--int median;
--int axis;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  int left, right;
--  int pivot;
--  REAL pivot1, pivot2;
--  vertex temp;
--
--  if (arraysize == 2) {
--    /* Recursive base case. */
--    if ((sortarray[0][axis] > sortarray[1][axis]) ||
--        ((sortarray[0][axis] == sortarray[1][axis]) &&
--         (sortarray[0][1 - axis] > sortarray[1][1 - axis]))) {
--      temp = sortarray[1];
--      sortarray[1] = sortarray[0];
--      sortarray[0] = temp;
--    }
--    return;
--  }
--  /* Choose a random pivot to split the array. */
--  pivot = (int) randomnation((unsigned int) arraysize);
--  if (pivot == arraysize)//JLM/SES without this test, pivot can equal arraysize and segfault
--	  pivot--;
--  pivot1 = sortarray[pivot][axis];
--  pivot2 = sortarray[pivot][1 - axis];
--  /* Split the array. */
--  left = -1;
--  right = arraysize;
--  while (left < right) {
--    /* Search for a vertex whose x-coordinate is too large for the left. */
--    do {
--      left++;
--    } while ((left <= right) && ((sortarray[left][axis] < pivot1) ||
--                                 ((sortarray[left][axis] == pivot1) &&
--                                  (sortarray[left][1 - axis] < pivot2))));
--    /* Search for a vertex whose x-coordinate is too small for the right. */
--    do {
--      right--;
--    } while ((left <= right) && ((sortarray[right][axis] > pivot1) ||
--                                 ((sortarray[right][axis] == pivot1) &&
--                                  (sortarray[right][1 - axis] > pivot2))));
--    if (left < right) {
--      /* Swap the left and right vertices. */
--      temp = sortarray[left];
--      sortarray[left] = sortarray[right];
--      sortarray[right] = temp;
--    }
--  }
--  /* Unlike in vertexsort(), at most one of the following */
--  /*   conditionals is true.                             */
--  if (left > median) {
--    /* Recursively shuffle the left subset. */
--    vertexmedian(sortarray, left, median, axis);
--  }
--  if (right < median - 1) {
--    /* Recursively shuffle the right subset. */
--    vertexmedian(&sortarray[right + 1], arraysize - right - 1,
--                 median - right - 1, axis);
--  }
--}
--
--/*****************************************************************************/
--/*                                                                           */
--/*  alternateaxes()   Sorts the vertices as appropriate for the divide-and-  */
--/*                    conquer algorithm with alternating cuts.               */
--/*                                                                           */
--/*  Partitions by x-coordinate if axis == 0; by y-coordinate if axis == 1.   */
--/*  For the base case, subsets containing only two or three vertices are     */
--/*  always sorted by x-coordinate.                                           */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifdef ANSI_DECLARATORS
--void alternateaxes(vertex *sortarray, int arraysize, int axis)
--#else /* not ANSI_DECLARATORS */
--void alternateaxes(sortarray, arraysize, axis)
--vertex *sortarray;
--int arraysize;
--int axis;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  int divider;
--
--  divider = arraysize >> 1;
--  if (arraysize <= 3) {
--    /* Recursive base case:  subsets of two or three vertices will be    */
--    /*   handled specially, and should always be sorted by x-coordinate. */
--    axis = 0;
--  }
--  /* Partition with a horizontal or vertical cut. */
--  vertexmedian(sortarray, arraysize, divider, axis);
--  /* Recursively partition the subsets with a cross cut. */
--  if (arraysize - divider >= 2) {
--    if (divider >= 2) {
--      alternateaxes(sortarray, divider, 1 - axis);
--    }
--    alternateaxes(&sortarray[divider], arraysize - divider, 1 - axis);
--  }
--}
--
--/*****************************************************************************/
--/*                                                                           */
--/*  mergehulls()   Merge two adjacent Delaunay triangulations into a         */
--/*                 single Delaunay triangulation.                            */
--/*                                                                           */
--/*  This is similar to the algorithm given by Guibas and Stolfi, but uses    */
--/*  a triangle-based, rather than edge-based, data structure.                */
--/*                                                                           */
--/*  The algorithm walks up the gap between the two triangulations, knitting  */
--/*  them together.  As they are merged, some of their bounding triangles     */
--/*  are converted into real triangles of the triangulation.  The procedure   */
--/*  pulls each hull's bounding triangles apart, then knits them together     */
--/*  like the teeth of two gears.  The Delaunay property determines, at each  */
--/*  step, whether the next "tooth" is a bounding triangle of the left hull   */
--/*  or the right.  When a bounding triangle becomes real, its apex is        */
--/*  changed from NULL to a real vertex.                                      */
--/*                                                                           */
--/*  Only two new triangles need to be allocated.  These become new bounding  */
--/*  triangles at the top and bottom of the seam.  They are used to connect   */
--/*  the remaining bounding triangles (those that have not been converted     */
--/*  into real triangles) into a single fan.                                  */
--/*                                                                           */
--/*  On entry, `farleft' and `innerleft' are bounding triangles of the left   */
--/*  triangulation.  The origin of `farleft' is the leftmost vertex, and      */
--/*  the destination of `innerleft' is the rightmost vertex of the            */
--/*  triangulation.  Similarly, `innerright' and `farright' are bounding      */
--/*  triangles of the right triangulation.  The origin of `innerright' and    */
--/*  destination of `farright' are the leftmost and rightmost vertices.       */
--/*                                                                           */
--/*  On completion, the origin of `farleft' is the leftmost vertex of the     */
--/*  merged triangulation, and the destination of `farright' is the rightmost */
--/*  vertex.                                                                  */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifdef ANSI_DECLARATORS
--void mergehulls(struct mesh *m, struct behavior *b, struct otri *farleft,
--                struct otri *innerleft, struct otri *innerright,
--                struct otri *farright, int axis)
--#else /* not ANSI_DECLARATORS */
--void mergehulls(m, b, farleft, innerleft, innerright, farright, axis)
--struct mesh *m;
--struct behavior *b;
--struct otri *farleft;
--struct otri *innerleft;
--struct otri *innerright;
--struct otri *farright;
--int axis;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  struct otri leftcand, rightcand;
--  struct otri baseedge;
--  struct otri nextedge;
--  struct otri sidecasing, topcasing, outercasing;
--  struct otri checkedge;
--  vertex innerleftdest;
--  vertex innerrightorg;
--  vertex innerleftapex, innerrightapex;
--  vertex farleftpt, farrightpt;
--  vertex farleftapex, farrightapex;
--  vertex lowerleft, lowerright;
--  vertex upperleft, upperright;
--  vertex nextapex;
--  vertex checkvertex;
--  int changemade;
--  int badedge;
--  int leftfinished, rightfinished;
--  triangle ptr;                         /* Temporary variable used by sym(). */
--
--  dest(*innerleft, innerleftdest);
--  apex(*innerleft, innerleftapex);
--  org(*innerright, innerrightorg);
--  apex(*innerright, innerrightapex);
--  /* Special treatment for horizontal cuts. */
--  if (b->dwyer && (axis == 1)) {
--    org(*farleft, farleftpt);
--    apex(*farleft, farleftapex);
--    dest(*farright, farrightpt);
--    apex(*farright, farrightapex);
--    /* The pointers to the extremal vertices are shifted to point to the */
--    /*   topmost and bottommost vertex of each hull, rather than the     */
--    /*   leftmost and rightmost vertices.                                */
--    while (farleftapex[1] < farleftpt[1]) {
--      lnextself(*farleft);
--      symself(*farleft);
--      farleftpt = farleftapex;
--      apex(*farleft, farleftapex);
--    }
--    sym(*innerleft, checkedge);
--    apex(checkedge, checkvertex);
--    while (checkvertex[1] > innerleftdest[1]) {
--      lnext(checkedge, *innerleft);
--      innerleftapex = innerleftdest;
--      innerleftdest = checkvertex;
--      sym(*innerleft, checkedge);
--      apex(checkedge, checkvertex);
--    }
--    while (innerrightapex[1] < innerrightorg[1]) {
--      lnextself(*innerright);
--      symself(*innerright);
--      innerrightorg = innerrightapex;
--      apex(*innerright, innerrightapex);
--    }
--    sym(*farright, checkedge);
--    apex(checkedge, checkvertex);
--    while (checkvertex[1] > farrightpt[1]) {
--      lnext(checkedge, *farright);
--      farrightpt = checkvertex;
--      sym(*farright, checkedge);
--      apex(checkedge, checkvertex);
--    }
--  }
--  /* Find a line tangent to and below both hulls. */
--  do {
--    changemade = 0;
--    /* Make innerleftdest the "bottommost" vertex of the left hull. */
--    if (counterclockwise(m, b, innerleftdest, innerleftapex, innerrightorg) >
--        0.0) {
--      lprevself(*innerleft);
--      symself(*innerleft);
--      innerleftdest = innerleftapex;
--      apex(*innerleft, innerleftapex);
--      changemade = 1;
--    }
--    /* Make innerrightorg the "bottommost" vertex of the right hull. */
--    if (counterclockwise(m, b, innerrightapex, innerrightorg, innerleftdest) >
--        0.0) {
--      lnextself(*innerright);
--      symself(*innerright);
--      innerrightorg = innerrightapex;
--      apex(*innerright, innerrightapex);
--      changemade = 1;
--    }
--  } while (changemade);
--  /* Find the two candidates to be the next "gear tooth." */
--  sym(*innerleft, leftcand);
--  sym(*innerright, rightcand);
--  /* Create the bottom new bounding triangle. */
--  maketriangle(m, b, &baseedge);
--  /* Connect it to the bounding boxes of the left and right triangulations. */
--  bond(baseedge, *innerleft);
--  lnextself(baseedge);
--  bond(baseedge, *innerright);
--  lnextself(baseedge);
--  setorg(baseedge, innerrightorg);
--  setdest(baseedge, innerleftdest);
--  /* Apex is intentionally left NULL. */
--  if (b->verbose > 2) {
--    printf("  Creating base bounding ");
--    printtriangle(m, b, &baseedge);
--  }
--  /* Fix the extreme triangles if necessary. */
--  org(*farleft, farleftpt);
--  if (innerleftdest == farleftpt) {
--    lnext(baseedge, *farleft);
--  }
--  dest(*farright, farrightpt);
--  if (innerrightorg == farrightpt) {
--    lprev(baseedge, *farright);
--  }
--  /* The vertices of the current knitting edge. */
--  lowerleft = innerleftdest;
--  lowerright = innerrightorg;
--  /* The candidate vertices for knitting. */
--  apex(leftcand, upperleft);
--  apex(rightcand, upperright);
--  /* Walk up the gap between the two triangulations, knitting them together. */
--  while (1) {
--    /* Have we reached the top?  (This isn't quite the right question,       */
--    /*   because even though the left triangulation might seem finished now, */
--    /*   moving up on the right triangulation might reveal a new vertex of   */
--    /*   the left triangulation.  And vice-versa.)                           */
--    leftfinished = counterclockwise(m, b, upperleft, lowerleft, lowerright) <=
--                   0.0;
--    rightfinished = counterclockwise(m, b, upperright, lowerleft, lowerright)
--                 <= 0.0;
--    if (leftfinished && rightfinished) {
--      /* Create the top new bounding triangle. */
--      maketriangle(m, b, &nextedge);
--      setorg(nextedge, lowerleft);
--      setdest(nextedge, lowerright);
--      /* Apex is intentionally left NULL. */
--      /* Connect it to the bounding boxes of the two triangulations. */
--      bond(nextedge, baseedge);
--      lnextself(nextedge);
--      bond(nextedge, rightcand);
--      lnextself(nextedge);
--      bond(nextedge, leftcand);
--      if (b->verbose > 2) {
--        printf("  Creating top bounding ");
--        printtriangle(m, b, &nextedge);
--      }
--      /* Special treatment for horizontal cuts. */
--      if (b->dwyer && (axis == 1)) {
--        org(*farleft, farleftpt);
--        apex(*farleft, farleftapex);
--        dest(*farright, farrightpt);
--        apex(*farright, farrightapex);
--        sym(*farleft, checkedge);
--        apex(checkedge, checkvertex);
--        /* The pointers to the extremal vertices are restored to the  */
--        /*   leftmost and rightmost vertices (rather than topmost and */
--        /*   bottommost).                                             */
--        while (checkvertex[0] < farleftpt[0]) {
--          lprev(checkedge, *farleft);
--          farleftpt = checkvertex;
--          sym(*farleft, checkedge);
--          apex(checkedge, checkvertex);
--        }
--        while (farrightapex[0] > farrightpt[0]) {
--          lprevself(*farright);
--          symself(*farright);
--          farrightpt = farrightapex;
--          apex(*farright, farrightapex);
--        }
--      }
--      return;
--    }
--    /* Consider eliminating edges from the left triangulation. */
--    if (!leftfinished) {
--      /* What vertex would be exposed if an edge were deleted? */
--      lprev(leftcand, nextedge);
--      symself(nextedge);
--      apex(nextedge, nextapex);
--      /* If nextapex is NULL, then no vertex would be exposed; the */
--      /*   triangulation would have been eaten right through.      */
--      if (nextapex != (vertex) NULL) {
--        /* Check whether the edge is Delaunay. */
--        badedge = incircle(m, b, lowerleft, lowerright, upperleft, nextapex) >
--                  0.0;
--        while (badedge) {
--          /* Eliminate the edge with an edge flip.  As a result, the    */
--          /*   left triangulation will have one more boundary triangle. */
--          lnextself(nextedge);
--          sym(nextedge, topcasing);
--          lnextself(nextedge);
--          sym(nextedge, sidecasing);
--          bond(nextedge, topcasing);
--          bond(leftcand, sidecasing);
--          lnextself(leftcand);
--          sym(leftcand, outercasing);
--          lprevself(nextedge);
--          bond(nextedge, outercasing);
--          /* Correct the vertices to reflect the edge flip. */
--          setorg(leftcand, lowerleft);
--          setdest(leftcand, NULL);
--          setapex(leftcand, nextapex);
--          setorg(nextedge, NULL);
--          setdest(nextedge, upperleft);
--          setapex(nextedge, nextapex);
--          /* Consider the newly exposed vertex. */
--          upperleft = nextapex;
--          /* What vertex would be exposed if another edge were deleted? */
--          otricopy(sidecasing, nextedge);
--          apex(nextedge, nextapex);
--          if (nextapex != (vertex) NULL) {
--            /* Check whether the edge is Delaunay. */
--            badedge = incircle(m, b, lowerleft, lowerright, upperleft,
--                               nextapex) > 0.0;
--          } else {
--            /* Avoid eating right through the triangulation. */
--            badedge = 0;
--          }
--        }
--      }
--    }
--    /* Consider eliminating edges from the right triangulation. */
--    if (!rightfinished) {
--      /* What vertex would be exposed if an edge were deleted? */
--      lnext(rightcand, nextedge);
--      symself(nextedge);
--      apex(nextedge, nextapex);
--      /* If nextapex is NULL, then no vertex would be exposed; the */
--      /*   triangulation would have been eaten right through.      */
--      if (nextapex != (vertex) NULL) {
--        /* Check whether the edge is Delaunay. */
--        badedge = incircle(m, b, lowerleft, lowerright, upperright, nextapex) >
--                  0.0;
--        while (badedge) {
--          /* Eliminate the edge with an edge flip.  As a result, the     */
--          /*   right triangulation will have one more boundary triangle. */
--          lprevself(nextedge);
--          sym(nextedge, topcasing);
--          lprevself(nextedge);
--          sym(nextedge, sidecasing);
--          bond(nextedge, topcasing);
--          bond(rightcand, sidecasing);
--          lprevself(rightcand);
--          sym(rightcand, outercasing);
--          lnextself(nextedge);
--          bond(nextedge, outercasing);
--          /* Correct the vertices to reflect the edge flip. */
--          setorg(rightcand, NULL);
--          setdest(rightcand, lowerright);
--          setapex(rightcand, nextapex);
--          setorg(nextedge, upperright);
--          setdest(nextedge, NULL);
--          setapex(nextedge, nextapex);
--          /* Consider the newly exposed vertex. */
--          upperright = nextapex;
--          /* What vertex would be exposed if another edge were deleted? */
--          otricopy(sidecasing, nextedge);
--          apex(nextedge, nextapex);
--          if (nextapex != (vertex) NULL) {
--            /* Check whether the edge is Delaunay. */
--            badedge = incircle(m, b, lowerleft, lowerright, upperright,
--                               nextapex) > 0.0;
--          } else {
--            /* Avoid eating right through the triangulation. */
--            badedge = 0;
--          }
--        }
--      }
--    }
--    if (leftfinished || (!rightfinished &&
--           (incircle(m, b, upperleft, lowerleft, lowerright, upperright) >
--            0.0))) {
--      /* Knit the triangulations, adding an edge from `lowerleft' */
--      /*   to `upperright'.                                       */
--      bond(baseedge, rightcand);
--      lprev(rightcand, baseedge);
--      setdest(baseedge, lowerleft);
--      lowerright = upperright;
--      sym(baseedge, rightcand);
--      apex(rightcand, upperright);
--    } else {
--      /* Knit the triangulations, adding an edge from `upperleft' */
--      /*   to `lowerright'.                                       */
--      bond(baseedge, leftcand);
--      lnext(leftcand, baseedge);
--      setorg(baseedge, lowerright);
--      lowerleft = upperleft;
--      sym(baseedge, leftcand);
--      apex(leftcand, upperleft);
--    }
--    if (b->verbose > 2) {
--      printf("  Connecting ");
--      printtriangle(m, b, &baseedge);
--    }
--  }
--}
--
--/*****************************************************************************/
--/*                                                                           */
--/*  divconqrecurse()   Recursively form a Delaunay triangulation by the      */
--/*                     divide-and-conquer method.                            */
--/*                                                                           */
--/*  Recursively breaks down the problem into smaller pieces, which are       */
--/*  knitted together by mergehulls().  The base cases (problems of two or    */
--/*  three vertices) are handled specially here.                              */
--/*                                                                           */
--/*  On completion, `farleft' and `farright' are bounding triangles such that */
--/*  the origin of `farleft' is the leftmost vertex (breaking ties by         */
--/*  choosing the highest leftmost vertex), and the destination of            */
--/*  `farright' is the rightmost vertex (breaking ties by choosing the        */
--/*  lowest rightmost vertex).                                                */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifdef ANSI_DECLARATORS
--void divconqrecurse(struct mesh *m, struct behavior *b, vertex *sortarray,
--                    int vertices, int axis,
--                    struct otri *farleft, struct otri *farright)
--#else /* not ANSI_DECLARATORS */
--void divconqrecurse(m, b, sortarray, vertices, axis, farleft, farright)
--struct mesh *m;
--struct behavior *b;
--vertex *sortarray;
--int vertices;
--int axis;
--struct otri *farleft;
--struct otri *farright;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  struct otri midtri, tri1, tri2, tri3;
--  struct otri innerleft, innerright;
--  REAL area;
--  int divider;
--
--  if (b->verbose > 2) {
--    printf("  Triangulating %d vertices.\n", vertices);
--  }
--  if (vertices == 2) {
--    /* The triangulation of two vertices is an edge.  An edge is */
--    /*   represented by two bounding triangles.                  */
--    maketriangle(m, b, farleft);
--    setorg(*farleft, sortarray[0]);
--    setdest(*farleft, sortarray[1]);
--    /* The apex is intentionally left NULL. */
--    maketriangle(m, b, farright);
--    setorg(*farright, sortarray[1]);
--    setdest(*farright, sortarray[0]);
--    /* The apex is intentionally left NULL. */
--    bond(*farleft, *farright);
--    lprevself(*farleft);
--    lnextself(*farright);
--    bond(*farleft, *farright);
--    lprevself(*farleft);
--    lnextself(*farright);
--    bond(*farleft, *farright);
--    if (b->verbose > 2) {
--      printf("  Creating ");
--      printtriangle(m, b, farleft);
--      printf("  Creating ");
--      printtriangle(m, b, farright);
--    }
--    /* Ensure that the origin of `farleft' is sortarray[0]. */
--    lprev(*farright, *farleft);
--    return;
--  } else if (vertices == 3) {
--    /* The triangulation of three vertices is either a triangle (with */
--    /*   three bounding triangles) or two edges (with four bounding   */
--    /*   triangles).  In either case, four triangles are created.     */
--    maketriangle(m, b, &midtri);
--    maketriangle(m, b, &tri1);
--    maketriangle(m, b, &tri2);
--    maketriangle(m, b, &tri3);
--    area = counterclockwise(m, b, sortarray[0], sortarray[1], sortarray[2]);
--    if (area == 0.0) {
--      /* Three collinear vertices; the triangulation is two edges. */
--      setorg(midtri, sortarray[0]);
--      setdest(midtri, sortarray[1]);
--      setorg(tri1, sortarray[1]);
--      setdest(tri1, sortarray[0]);
--      setorg(tri2, sortarray[2]);
--      setdest(tri2, sortarray[1]);
--      setorg(tri3, sortarray[1]);
--      setdest(tri3, sortarray[2]);
--      /* All apices are intentionally left NULL. */
--      bond(midtri, tri1);
--      bond(tri2, tri3);
--      lnextself(midtri);
--      lprevself(tri1);
--      lnextself(tri2);
--      lprevself(tri3);
--      bond(midtri, tri3);
--      bond(tri1, tri2);
--      lnextself(midtri);
--      lprevself(tri1);
--      lnextself(tri2);
--      lprevself(tri3);
--      bond(midtri, tri1);
--      bond(tri2, tri3);
--      /* Ensure that the origin of `farleft' is sortarray[0]. */
--      otricopy(tri1, *farleft);
--      /* Ensure that the destination of `farright' is sortarray[2]. */
--      otricopy(tri2, *farright);
--    } else {
--      /* The three vertices are not collinear; the triangulation is one */
--      /*   triangle, namely `midtri'.                                   */
--      setorg(midtri, sortarray[0]);
--      setdest(tri1, sortarray[0]);
--      setorg(tri3, sortarray[0]);
--      /* Apices of tri1, tri2, and tri3 are left NULL. */
--      if (area > 0.0) {
--        /* The vertices are in counterclockwise order. */
--        setdest(midtri, sortarray[1]);
--        setorg(tri1, sortarray[1]);
--        setdest(tri2, sortarray[1]);
--        setapex(midtri, sortarray[2]);
--        setorg(tri2, sortarray[2]);
--        setdest(tri3, sortarray[2]);
--      } else {
--        /* The vertices are in clockwise order. */
--        setdest(midtri, sortarray[2]);
--        setorg(tri1, sortarray[2]);
--        setdest(tri2, sortarray[2]);
--        setapex(midtri, sortarray[1]);
--        setorg(tri2, sortarray[1]);
--        setdest(tri3, sortarray[1]);
--      }
--      /* The topology does not depend on how the vertices are ordered. */
--      bond(midtri, tri1);
--      lnextself(midtri);
--      bond(midtri, tri2);
--      lnextself(midtri);
--      bond(midtri, tri3);
--      lprevself(tri1);
--      lnextself(tri2);
--      bond(tri1, tri2);
--      lprevself(tri1);
--      lprevself(tri3);
--      bond(tri1, tri3);
--      lnextself(tri2);
--      lprevself(tri3);
--      bond(tri2, tri3);
--      /* Ensure that the origin of `farleft' is sortarray[0]. */
--      otricopy(tri1, *farleft);
--      /* Ensure that the destination of `farright' is sortarray[2]. */
--      if (area > 0.0) {
--        otricopy(tri2, *farright);
--      } else {
--        lnext(*farleft, *farright);
--      }
--    }
--    if (b->verbose > 2) {
--      printf("  Creating ");
--      printtriangle(m, b, &midtri);
--      printf("  Creating ");
--      printtriangle(m, b, &tri1);
--      printf("  Creating ");
--      printtriangle(m, b, &tri2);
--      printf("  Creating ");
--      printtriangle(m, b, &tri3);
--    }
--    return;
--  } else {
--    /* Split the vertices in half. */
--    divider = vertices >> 1;
--    /* Recursively triangulate each half. */
--    divconqrecurse(m, b, sortarray, divider, 1 - axis, farleft, &innerleft);
--    divconqrecurse(m, b, &sortarray[divider], vertices - divider, 1 - axis,
--                   &innerright, farright);
--    if (b->verbose > 1) {
--      printf("  Joining triangulations with %d and %d vertices.\n", divider,
--             vertices - divider);
--    }
--    /* Merge the two triangulations into one. */
--    mergehulls(m, b, farleft, &innerleft, &innerright, farright, axis);
--  }
--}
--
--#ifdef ANSI_DECLARATORS
--long removeghosts(struct mesh *m, struct behavior *b, struct otri *startghost)
--#else /* not ANSI_DECLARATORS */
--long removeghosts(m, b, startghost)
--struct mesh *m;
--struct behavior *b;
--struct otri *startghost;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  struct otri searchedge;
--  struct otri dissolveedge;
--  struct otri deadtriangle;
--  vertex markorg;
--  long hullsize;
--  triangle ptr;                         /* Temporary variable used by sym(). */
--
--  if (b->verbose) {
--    printf("  Removing ghost triangles.\n");
--  }
--  /* Find an edge on the convex hull to start point location from. */
--  lprev(*startghost, searchedge);
--  symself(searchedge);
--  m->dummytri[0] = encode(searchedge);
--  /* Remove the bounding box and count the convex hull edges. */
--  otricopy(*startghost, dissolveedge);
--  hullsize = 0;
--  do {
--    hullsize++;
--    lnext(dissolveedge, deadtriangle);
--    lprevself(dissolveedge);
--    symself(dissolveedge);
--    /* If no PSLG is involved, set the boundary markers of all the vertices */
--    /*   on the convex hull.  If a PSLG is used, this step is done later.   */
--    if (!b->poly) {
--      /* Watch out for the case where all the input vertices are collinear. */
--      if (dissolveedge.tri != m->dummytri) {
--        org(dissolveedge, markorg);
--        if (vertexmark(markorg) == 0) {
--          setvertexmark(markorg, 1);
--        }
--      }
--    }
--    /* Remove a bounding triangle from a convex hull triangle. */
--    dissolve(dissolveedge);
--    /* Find the next bounding triangle. */
--    sym(deadtriangle, dissolveedge);
--    /* Delete the bounding triangle. */
--    triangledealloc(m, deadtriangle.tri);
--  } while (!otriequal(dissolveedge, *startghost));
--  return hullsize;
--}
--
--/*****************************************************************************/
--/*                                                                           */
--/*  divconqdelaunay()   Form a Delaunay triangulation by the divide-and-     */
--/*                      conquer method.                                      */
--/*                                                                           */
--/*  Sorts the vertices, calls a recursive procedure to triangulate them, and */
--/*  removes the bounding box, setting boundary markers as appropriate.       */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifdef ANSI_DECLARATORS
--long divconqdelaunay(struct mesh *m, struct behavior *b)
--#else /* not ANSI_DECLARATORS */
--long divconqdelaunay(m, b)
--struct mesh *m;
--struct behavior *b;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  vertex *sortarray;
--  struct otri hullleft, hullright;
--  int divider;
--  int i, j;
--
--  if (b->verbose) {
--    printf("  Sorting vertices.\n");
--  }
--
--  /* Allocate an array of pointers to vertices for sorting. */
--  sortarray = (vertex *) trimalloc(m->invertices * (int) sizeof(vertex));
--  traversalinit(&m->vertices);
--  for (i = 0; i < m->invertices; i++) {
--    sortarray[i] = vertextraverse(m);
--  }
--  /* Sort the vertices. */
--  vertexsort(sortarray, m->invertices);
--  /* Discard duplicate vertices, which can really mess up the algorithm. */
--  i = 0;
--  for (j = 1; j < m->invertices; j++) {
--    if ((sortarray[i][0] == sortarray[j][0])
--        && (sortarray[i][1] == sortarray[j][1])) {
--      if (!b->quiet) {
--        printf(
--"Warning:  A duplicate vertex at (%.12g, %.12g) appeared and was ignored.\n",
--               sortarray[j][0], sortarray[j][1]);
--      }
--      setvertextype(sortarray[j], UNDEADVERTEX);
--      m->undeads++;
--    } else {
--      i++;
--      sortarray[i] = sortarray[j];
--    }
--  }
--  i++;
--  if (b->dwyer) {
--    /* Re-sort the array of vertices to accommodate alternating cuts. */
--    divider = i >> 1;
--    if (i - divider >= 2) {
--      if (divider >= 2) {
--        alternateaxes(sortarray, divider, 1);
--      }
--      alternateaxes(&sortarray[divider], i - divider, 1);
--    }
--  }
--
--  if (b->verbose) {
--    printf("  Forming triangulation.\n");
--  }
--
--  /* Form the Delaunay triangulation. */
--  divconqrecurse(m, b, sortarray, i, 0, &hullleft, &hullright);
--  trifree((void *) sortarray);
--
--  return removeghosts(m, b, &hullleft);
--}
--
--/**                                                                         **/
--/**                                                                         **/
--/********* Divide-and-conquer Delaunay triangulation ends here       *********/
--
--/********* Incremental Delaunay triangulation begins here            *********/
--/**                                                                         **/
--/**                                                                         **/
--
--/*****************************************************************************/
--/*                                                                           */
--/*  boundingbox()   Form an "infinite" bounding triangle to insert vertices  */
--/*                  into.                                                    */
--/*                                                                           */
--/*  The vertices at "infinity" are assigned finite coordinates, which are    */
--/*  used by the point location routines, but (mostly) ignored by the         */
--/*  Delaunay edge flip routines.                                             */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifndef REDUCED
--
--#ifdef ANSI_DECLARATORS
--void boundingbox(struct mesh *m, struct behavior *b)
--#else /* not ANSI_DECLARATORS */
--void boundingbox(m, b)
--struct mesh *m;
--struct behavior *b;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  struct otri inftri;          /* Handle for the triangular bounding box. */
--  REAL width;
--
--  if (b->verbose) {
--    printf("  Creating triangular bounding box.\n");
--  }
--  /* Find the width (or height, whichever is larger) of the triangulation. */
--  width = m->xmax - m->xmin;
--  if (m->ymax - m->ymin > width) {
--    width = m->ymax - m->ymin;
--  }
--  if (width == 0.0) {
--    width = 1.0;
--  }
--  /* Create the vertices of the bounding box. */
--  m->infvertex1 = (vertex) trimalloc(m->vertices.itembytes);
--  m->infvertex2 = (vertex) trimalloc(m->vertices.itembytes);
--  m->infvertex3 = (vertex) trimalloc(m->vertices.itembytes);
--  m->infvertex1[0] = m->xmin - 50.0 * width;
--  m->infvertex1[1] = m->ymin - 40.0 * width;
--  m->infvertex2[0] = m->xmax + 50.0 * width;
--  m->infvertex2[1] = m->ymin - 40.0 * width;
--  m->infvertex3[0] = 0.5 * (m->xmin + m->xmax);
--  m->infvertex3[1] = m->ymax + 60.0 * width;
--
--  /* Create the bounding box. */
--  maketriangle(m, b, &inftri);
--  setorg(inftri, m->infvertex1);
--  setdest(inftri, m->infvertex2);
--  setapex(inftri, m->infvertex3);
--  /* Link dummytri to the bounding box so we can always find an */
--  /*   edge to begin searching (point location) from.           */
--  m->dummytri[0] = (triangle) inftri.tri;
--  if (b->verbose > 2) {
--    printf("  Creating ");
--    printtriangle(m, b, &inftri);
--  }
--}
--
--#endif /* not REDUCED */
--
--/*****************************************************************************/
--/*                                                                           */
--/*  removebox()   Remove the "infinite" bounding triangle, setting boundary  */
--/*                markers as appropriate.                                    */
--/*                                                                           */
--/*  The triangular bounding box has three boundary triangles (one for each   */
--/*  side of the bounding box), and a bunch of triangles fanning out from     */
--/*  the three bounding box vertices (one triangle for each edge of the       */
--/*  convex hull of the inner mesh).  This routine removes these triangles.   */
--/*                                                                           */
--/*  Returns the number of edges on the convex hull of the triangulation.     */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifndef REDUCED
--
--#ifdef ANSI_DECLARATORS
--long removebox(struct mesh *m, struct behavior *b)
--#else /* not ANSI_DECLARATORS */
--long removebox(m, b)
--struct mesh *m;
--struct behavior *b;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  struct otri deadtriangle;
--  struct otri searchedge;
--  struct otri checkedge;
--  struct otri nextedge, finaledge, dissolveedge;
--  vertex markorg;
--  long hullsize;
--  triangle ptr;                         /* Temporary variable used by sym(). */
--
--  if (b->verbose) {
--    printf("  Removing triangular bounding box.\n");
--  }
--  /* Find a boundary triangle. */
--  nextedge.tri = m->dummytri;
--  nextedge.orient = 0;
--  symself(nextedge);
--  /* Mark a place to stop. */
--  lprev(nextedge, finaledge);
--  lnextself(nextedge);
--  symself(nextedge);
--  /* Find a triangle (on the boundary of the vertex set) that isn't */
--  /*   a bounding box triangle.                                     */
--  lprev(nextedge, searchedge);
--  symself(searchedge);
--  /* Check whether nextedge is another boundary triangle */
--  /*   adjacent to the first one.                        */
--  lnext(nextedge, checkedge);
--  symself(checkedge);
--  if (checkedge.tri == m->dummytri) {
--    /* Go on to the next triangle.  There are only three boundary   */
--    /*   triangles, and this next triangle cannot be the third one, */
--    /*   so it's safe to stop here.                                 */
--    lprevself(searchedge);
--    symself(searchedge);
--  }
--  /* Find a new boundary edge to search from, as the current search */
--  /*   edge lies on a bounding box triangle and will be deleted.    */
--  m->dummytri[0] = encode(searchedge);
--  hullsize = -2l;
--  while (!otriequal(nextedge, finaledge)) {
--    hullsize++;
--    lprev(nextedge, dissolveedge);
--    symself(dissolveedge);
--    /* If not using a PSLG, the vertices should be marked now. */
--    /*   (If using a PSLG, markhull() will do the job.)        */
--    if (!b->poly) {
--      /* Be careful!  One must check for the case where all the input     */
--      /*   vertices are collinear, and thus all the triangles are part of */
--      /*   the bounding box.  Otherwise, the setvertexmark() call below   */
--      /*   will cause a bad pointer reference.                            */
--      if (dissolveedge.tri != m->dummytri) {
--        org(dissolveedge, markorg);
--        if (vertexmark(markorg) == 0) {
--          setvertexmark(markorg, 1);
--        }
--      }
--    }
--    /* Disconnect the bounding box triangle from the mesh triangle. */
--    dissolve(dissolveedge);
--    lnext(nextedge, deadtriangle);
--    sym(deadtriangle, nextedge);
--    /* Get rid of the bounding box triangle. */
--    triangledealloc(m, deadtriangle.tri);
--    /* Do we need to turn the corner? */
--    if (nextedge.tri == m->dummytri) {
--      /* Turn the corner. */
--      otricopy(dissolveedge, nextedge);
--    }
--  }
--  triangledealloc(m, finaledge.tri);
--
--  trifree((void *) m->infvertex1);  /* Deallocate the bounding box vertices. */
--  trifree((void *) m->infvertex2);
--  trifree((void *) m->infvertex3);
--
--  return hullsize;
--}
--
--#endif /* not REDUCED */
--
--/*****************************************************************************/
--/*                                                                           */
--/*  incrementaldelaunay()   Form a Delaunay triangulation by incrementally   */
--/*                          inserting vertices.                              */
--/*                                                                           */
--/*  Returns the number of edges on the convex hull of the triangulation.     */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifndef REDUCED
--
--#ifdef ANSI_DECLARATORS
--long incrementaldelaunay(struct mesh *m, struct behavior *b)
--#else /* not ANSI_DECLARATORS */
--long incrementaldelaunay(m, b)
--struct mesh *m;
--struct behavior *b;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  struct otri starttri;
--  vertex vertexloop;
--
--  /* Create a triangular bounding box. */
--  boundingbox(m, b);
--  if (b->verbose) {
--    printf("  Incrementally inserting vertices.\n");
--  }
--  traversalinit(&m->vertices);
--  vertexloop = vertextraverse(m);
--  while (vertexloop != (vertex) NULL) {
--    starttri.tri = m->dummytri;
--    if (insertvertex(m, b, vertexloop, &starttri, (struct osub *) NULL, 0, 0)
--        == DUPLICATEVERTEX) {
--      if (!b->quiet) {
--        printf(
--"Warning:  A duplicate vertex at (%.12g, %.12g) appeared and was ignored.\n",
--               vertexloop[0], vertexloop[1]);
--      }
--      setvertextype(vertexloop, UNDEADVERTEX);
--      m->undeads++;
--    }
--    vertexloop = vertextraverse(m);
--  }
--  /* Remove the bounding box. */
--  return removebox(m, b);
--}
--
--#endif /* not REDUCED */
--
--/**                                                                         **/
--/**                                                                         **/
--/********* Incremental Delaunay triangulation ends here              *********/
--
--/********* Sweepline Delaunay triangulation begins here              *********/
--/**                                                                         **/
--/**                                                                         **/
--
--#ifndef REDUCED
--
--#ifdef ANSI_DECLARATORS
--void eventheapinsert(struct event **heap, int heapsize, struct event *newevent)
--#else /* not ANSI_DECLARATORS */
--void eventheapinsert(heap, heapsize, newevent)
--struct event **heap;
--int heapsize;
--struct event *newevent;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  REAL eventx, eventy;
--  int eventnum;
--  int parent;
--  int notdone;
--
--  eventx = newevent->xkey;
--  eventy = newevent->ykey;
--  eventnum = heapsize;
--  notdone = eventnum > 0;
--  while (notdone) {
--    parent = (eventnum - 1) >> 1;
--    if ((heap[parent]->ykey < eventy) ||
--        ((heap[parent]->ykey == eventy)
--         && (heap[parent]->xkey <= eventx))) {
--      notdone = 0;
--    } else {
--      heap[eventnum] = heap[parent];
--      heap[eventnum]->heapposition = eventnum;
--
--      eventnum = parent;
--      notdone = eventnum > 0;
--    }
--  }
--  heap[eventnum] = newevent;
--  newevent->heapposition = eventnum;
--}
--
--#endif /* not REDUCED */
--
--#ifndef REDUCED
--
--#ifdef ANSI_DECLARATORS
--void eventheapify(struct event **heap, int heapsize, int eventnum)
--#else /* not ANSI_DECLARATORS */
--void eventheapify(heap, heapsize, eventnum)
--struct event **heap;
--int heapsize;
--int eventnum;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  struct event *thisevent;
--  REAL eventx, eventy;
--  int leftchild, rightchild;
--  int smallest;
--  int notdone;
--
--  thisevent = heap[eventnum];
--  eventx = thisevent->xkey;
--  eventy = thisevent->ykey;
--  leftchild = 2 * eventnum + 1;
--  notdone = leftchild < heapsize;
--  while (notdone) {
--    if ((heap[leftchild]->ykey < eventy) ||
--        ((heap[leftchild]->ykey == eventy)
--         && (heap[leftchild]->xkey < eventx))) {
--      smallest = leftchild;
--    } else {
--      smallest = eventnum;
--    }
--    rightchild = leftchild + 1;
--    if (rightchild < heapsize) {
--      if ((heap[rightchild]->ykey < heap[smallest]->ykey) ||
--          ((heap[rightchild]->ykey == heap[smallest]->ykey)
--           && (heap[rightchild]->xkey < heap[smallest]->xkey))) {
--        smallest = rightchild;
--      }
--    }
--    if (smallest == eventnum) {
--      notdone = 0;
--    } else {
--      heap[eventnum] = heap[smallest];
--      heap[eventnum]->heapposition = eventnum;
--      heap[smallest] = thisevent;
--      thisevent->heapposition = smallest;
--
--      eventnum = smallest;
--      leftchild = 2 * eventnum + 1;
--      notdone = leftchild < heapsize;
--    }
--  }
--}
--
--#endif /* not REDUCED */
--
--#ifndef REDUCED
--
--#ifdef ANSI_DECLARATORS
--void eventheapdelete(struct event **heap, int heapsize, int eventnum)
--#else /* not ANSI_DECLARATORS */
--void eventheapdelete(heap, heapsize, eventnum)
--struct event **heap;
--int heapsize;
--int eventnum;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  struct event *moveevent;
--  REAL eventx, eventy;
--  int parent;
--  int notdone;
--
--  moveevent = heap[heapsize - 1];
--  if (eventnum > 0) {
--    eventx = moveevent->xkey;
--    eventy = moveevent->ykey;
--    do {
--      parent = (eventnum - 1) >> 1;
--      if ((heap[parent]->ykey < eventy) ||
--          ((heap[parent]->ykey == eventy)
--           && (heap[parent]->xkey <= eventx))) {
--        notdone = 0;
--      } else {
--        heap[eventnum] = heap[parent];
--        heap[eventnum]->heapposition = eventnum;
--
--        eventnum = parent;
--        notdone = eventnum > 0;
--      }
--    } while (notdone);
--  }
--  heap[eventnum] = moveevent;
--  moveevent->heapposition = eventnum;
--  eventheapify(heap, heapsize - 1, eventnum);
--}
--
--#endif /* not REDUCED */
--
--#ifndef REDUCED
--
--#ifdef ANSI_DECLARATORS
--void createeventheap(struct mesh *m, struct event ***eventheap,
--                     struct event **events, struct event **freeevents)
--#else /* not ANSI_DECLARATORS */
--void createeventheap(m, eventheap, events, freeevents)
--struct mesh *m;
--struct event ***eventheap;
--struct event **events;
--struct event **freeevents;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  vertex thisvertex;
--  int maxevents;
--  int i;
--
--  maxevents = (3 * m->invertices) / 2;
--  *eventheap = (struct event **) trimalloc(maxevents *
--                                           (int) sizeof(struct event *));
--  *events = (struct event *) trimalloc(maxevents * (int) sizeof(struct event));
--  traversalinit(&m->vertices);
--  for (i = 0; i < m->invertices; i++) {
--    thisvertex = vertextraverse(m);
--    (*events)[i].eventptr = (void *) thisvertex;
--    (*events)[i].xkey = thisvertex[0];
--    (*events)[i].ykey = thisvertex[1];
--    eventheapinsert(*eventheap, i, *events + i);
--  }
--  *freeevents = (struct event *) NULL;
--  for (i = maxevents - 1; i >= m->invertices; i--) {
--    (*events)[i].eventptr = (void *) *freeevents;
--    *freeevents = *events + i;
--  }
--}
--
--#endif /* not REDUCED */
--
--#ifndef REDUCED
--
--#ifdef ANSI_DECLARATORS
--int rightofhyperbola(struct mesh *m, struct otri *fronttri, vertex newsite)
--#else /* not ANSI_DECLARATORS */
--int rightofhyperbola(m, fronttri, newsite)
--struct mesh *m;
--struct otri *fronttri;
--vertex newsite;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  vertex leftvertex, rightvertex;
--  REAL dxa, dya, dxb, dyb;
--
--  m->hyperbolacount++;
--
--  dest(*fronttri, leftvertex);
--  apex(*fronttri, rightvertex);
--  if ((leftvertex[1] < rightvertex[1]) ||
--      ((leftvertex[1] == rightvertex[1]) &&
--       (leftvertex[0] < rightvertex[0]))) {
--    if (newsite[0] >= rightvertex[0]) {
--      return 1;
--    }
--  } else {
--    if (newsite[0] <= leftvertex[0]) {
--      return 0;
--    }
--  }
--  dxa = leftvertex[0] - newsite[0];
--  dya = leftvertex[1] - newsite[1];
--  dxb = rightvertex[0] - newsite[0];
--  dyb = rightvertex[1] - newsite[1];
--  return dya * (dxb * dxb + dyb * dyb) > dyb * (dxa * dxa + dya * dya);
--}
--
--#endif /* not REDUCED */
--
--#ifndef REDUCED
--
--#ifdef ANSI_DECLARATORS
--REAL circletop(struct mesh *m, vertex pa, vertex pb, vertex pc, REAL ccwabc)
--#else /* not ANSI_DECLARATORS */
--REAL circletop(m, pa, pb, pc, ccwabc)
--struct mesh *m;
--vertex pa;
--vertex pb;
--vertex pc;
--REAL ccwabc;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  REAL xac, yac, xbc, ybc, xab, yab;
--  REAL aclen2, bclen2, ablen2;
--
--  m->circletopcount++;
--
--  xac = pa[0] - pc[0];
--  yac = pa[1] - pc[1];
--  xbc = pb[0] - pc[0];
--  ybc = pb[1] - pc[1];
--  xab = pa[0] - pb[0];
--  yab = pa[1] - pb[1];
--  aclen2 = xac * xac + yac * yac;
--  bclen2 = xbc * xbc + ybc * ybc;
--  ablen2 = xab * xab + yab * yab;
--  return pc[1] + (xac * bclen2 - xbc * aclen2 + sqrt(aclen2 * bclen2 * ablen2))
--               / (2.0 * ccwabc);
--}
--
--#endif /* not REDUCED */
--
--#ifndef REDUCED
--
--#ifdef ANSI_DECLARATORS
--void check4deadevent(struct otri *checktri, struct event **freeevents,
--                     struct event **eventheap, int *heapsize)
--#else /* not ANSI_DECLARATORS */
--void check4deadevent(checktri, freeevents, eventheap, heapsize)
--struct otri *checktri;
--struct event **freeevents;
--struct event **eventheap;
--int *heapsize;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  struct event *deadevent;
--  vertex eventvertex;
--  int eventnum;
--
--  org(*checktri, eventvertex);
--  if (eventvertex != (vertex) NULL) {
--    deadevent = (struct event *) eventvertex;
--    eventnum = deadevent->heapposition;
--    deadevent->eventptr = (void *) *freeevents;
--    *freeevents = deadevent;
--    eventheapdelete(eventheap, *heapsize, eventnum);
--    (*heapsize)--;
--    setorg(*checktri, NULL);
--  }
--}
--
--#endif /* not REDUCED */
--
--#ifndef REDUCED
--
--#ifdef ANSI_DECLARATORS
--struct splaynode *splay(struct mesh *m, struct splaynode *splaytree,
--                        vertex searchpoint, struct otri *searchtri)
--#else /* not ANSI_DECLARATORS */
--struct splaynode *splay(m, splaytree, searchpoint, searchtri)
--struct mesh *m;
--struct splaynode *splaytree;
--vertex searchpoint;
--struct otri *searchtri;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  struct splaynode *child, *grandchild;
--  struct splaynode *lefttree, *righttree;
--  struct splaynode *leftright;
--  vertex checkvertex;
--  int rightofroot, rightofchild;
--
--  if (splaytree == (struct splaynode *) NULL) {
--    return (struct splaynode *) NULL;
--  }
--  dest(splaytree->keyedge, checkvertex);
--  if (checkvertex == splaytree->keydest) {
--    rightofroot = rightofhyperbola(m, &splaytree->keyedge, searchpoint);
--    if (rightofroot) {
--      otricopy(splaytree->keyedge, *searchtri);
--      child = splaytree->rchild;
--    } else {
--      child = splaytree->lchild;
--    }
--    if (child == (struct splaynode *) NULL) {
--      return splaytree;
--    }
--    dest(child->keyedge, checkvertex);
--    if (checkvertex != child->keydest) {
--      child = splay(m, child, searchpoint, searchtri);
--      if (child == (struct splaynode *) NULL) {
--        if (rightofroot) {
--          splaytree->rchild = (struct splaynode *) NULL;
--        } else {
--          splaytree->lchild = (struct splaynode *) NULL;
--        }
--        return splaytree;
--      }
--    }
--    rightofchild = rightofhyperbola(m, &child->keyedge, searchpoint);
--    if (rightofchild) {
--      otricopy(child->keyedge, *searchtri);
--      grandchild = splay(m, child->rchild, searchpoint, searchtri);
--      child->rchild = grandchild;
--    } else {
--      grandchild = splay(m, child->lchild, searchpoint, searchtri);
--      child->lchild = grandchild;
--    }
--    if (grandchild == (struct splaynode *) NULL) {
--      if (rightofroot) {
--        splaytree->rchild = child->lchild;
--        child->lchild = splaytree;
--      } else {
--        splaytree->lchild = child->rchild;
--        child->rchild = splaytree;
--      }
--      return child;
--    }
--    if (rightofchild) {
--      if (rightofroot) {
--        splaytree->rchild = child->lchild;
--        child->lchild = splaytree;
--      } else {
--        splaytree->lchild = grandchild->rchild;
--        grandchild->rchild = splaytree;
--      }
--      child->rchild = grandchild->lchild;
--      grandchild->lchild = child;
--    } else {
--      if (rightofroot) {
--        splaytree->rchild = grandchild->lchild;
--        grandchild->lchild = splaytree;
--      } else {
--        splaytree->lchild = child->rchild;
--        child->rchild = splaytree;
--      }
--      child->lchild = grandchild->rchild;
--      grandchild->rchild = child;
--    }
--    return grandchild;
--  } else {
--    lefttree = splay(m, splaytree->lchild, searchpoint, searchtri);
--    righttree = splay(m, splaytree->rchild, searchpoint, searchtri);
--
--    pooldealloc(&m->splaynodes, (void *) splaytree);
--    if (lefttree == (struct splaynode *) NULL) {
--      return righttree;
--    } else if (righttree == (struct splaynode *) NULL) {
--      return lefttree;
--    } else if (lefttree->rchild == (struct splaynode *) NULL) {
--      lefttree->rchild = righttree->lchild;
--      righttree->lchild = lefttree;
--      return righttree;
--    } else if (righttree->lchild == (struct splaynode *) NULL) {
--      righttree->lchild = lefttree->rchild;
--      lefttree->rchild = righttree;
--      return lefttree;
--    } else {
--/*      printf("Holy Toledo!!!\n"); */
--      leftright = lefttree->rchild;
--      while (leftright->rchild != (struct splaynode *) NULL) {
--        leftright = leftright->rchild;
--      }
--      leftright->rchild = righttree;
--      return lefttree;
--    }
--  }
--}
--
--#endif /* not REDUCED */
--
--#ifndef REDUCED
--
--#ifdef ANSI_DECLARATORS
--struct splaynode *splayinsert(struct mesh *m, struct splaynode *splayroot,
--                              struct otri *newkey, vertex searchpoint)
--#else /* not ANSI_DECLARATORS */
--struct splaynode *splayinsert(m, splayroot, newkey, searchpoint)
--struct mesh *m;
--struct splaynode *splayroot;
--struct otri *newkey;
--vertex searchpoint;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  struct splaynode *newsplaynode;
--
--  newsplaynode = (struct splaynode *) poolalloc(&m->splaynodes);
--  otricopy(*newkey, newsplaynode->keyedge);
--  dest(*newkey, newsplaynode->keydest);
--  if (splayroot == (struct splaynode *) NULL) {
--    newsplaynode->lchild = (struct splaynode *) NULL;
--    newsplaynode->rchild = (struct splaynode *) NULL;
--  } else if (rightofhyperbola(m, &splayroot->keyedge, searchpoint)) {
--    newsplaynode->lchild = splayroot;
--    newsplaynode->rchild = splayroot->rchild;
--    splayroot->rchild = (struct splaynode *) NULL;
--  } else {
--    newsplaynode->lchild = splayroot->lchild;
--    newsplaynode->rchild = splayroot;
--    splayroot->lchild = (struct splaynode *) NULL;
--  }
--  return newsplaynode;
--}
--
--#endif /* not REDUCED */
--
--#ifndef REDUCED
--
--#ifdef ANSI_DECLARATORS
--struct splaynode *circletopinsert(struct mesh *m, struct behavior *b,
--                                  struct splaynode *splayroot,
--                                  struct otri *newkey,
--                                  vertex pa, vertex pb, vertex pc, REAL topy)
--#else /* not ANSI_DECLARATORS */
--struct splaynode *circletopinsert(m, b, splayroot, newkey, pa, pb, pc, topy)
--struct mesh *m;
--struct behavior *b;
--struct splaynode *splayroot;
--struct otri *newkey;
--vertex pa;
--vertex pb;
--vertex pc;
--REAL topy;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  REAL ccwabc;
--  REAL xac, yac, xbc, ybc;
--  REAL aclen2, bclen2;
--  REAL searchpoint[2];
--  struct otri dummytri;
--
--  ccwabc = counterclockwise(m, b, pa, pb, pc);
--  xac = pa[0] - pc[0];
--  yac = pa[1] - pc[1];
--  xbc = pb[0] - pc[0];
--  ybc = pb[1] - pc[1];
--  aclen2 = xac * xac + yac * yac;
--  bclen2 = xbc * xbc + ybc * ybc;
--  searchpoint[0] = pc[0] - (yac * bclen2 - ybc * aclen2) / (2.0 * ccwabc);
--  searchpoint[1] = topy;
--  return splayinsert(m, splay(m, splayroot, (vertex) searchpoint, &dummytri),
--                     newkey, (vertex) searchpoint);
--}
--
--#endif /* not REDUCED */
--
--#ifndef REDUCED
--
--#ifdef ANSI_DECLARATORS
--struct splaynode *frontlocate(struct mesh *m, struct splaynode *splayroot,
--                              struct otri *bottommost, vertex searchvertex,
--                              struct otri *searchtri, int *farright)
--#else /* not ANSI_DECLARATORS */
--struct splaynode *frontlocate(m, splayroot, bottommost, searchvertex,
--                              searchtri, farright)
--struct mesh *m;
--struct splaynode *splayroot;
--struct otri *bottommost;
--vertex searchvertex;
--struct otri *searchtri;
--int *farright;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  int farrightflag;
--  triangle ptr;                       /* Temporary variable used by onext(). */
--
--  otricopy(*bottommost, *searchtri);
--  splayroot = splay(m, splayroot, searchvertex, searchtri);
--
--  farrightflag = 0;
--  while (!farrightflag && rightofhyperbola(m, searchtri, searchvertex)) {
--    onextself(*searchtri);
--    farrightflag = otriequal(*searchtri, *bottommost);
--  }
--  *farright = farrightflag;
--  return splayroot;
--}
--
--#endif /* not REDUCED */
--
--#ifndef REDUCED
--
--#ifdef ANSI_DECLARATORS
--long sweeplinedelaunay(struct mesh *m, struct behavior *b)
--#else /* not ANSI_DECLARATORS */
--long sweeplinedelaunay(m, b)
--struct mesh *m;
--struct behavior *b;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  struct event **eventheap;
--  struct event *events;
--  struct event *freeevents;
--  struct event *nextevent;
--  struct event *newevent;
--  struct splaynode *splayroot;
--  struct otri bottommost;
--  struct otri searchtri;
--  struct otri fliptri;
--  struct otri lefttri, righttri, farlefttri, farrighttri;
--  struct otri inserttri;
--  vertex firstvertex, secondvertex;
--  vertex nextvertex, lastvertex;
--  vertex connectvertex;
--  vertex leftvertex, midvertex, rightvertex;
--  REAL lefttest, righttest;
--  int heapsize;
--  int check4events, farrightflag;
--  triangle ptr;   /* Temporary variable used by sym(), onext(), and oprev(). */
--
--  poolinit(&m->splaynodes, sizeof(struct splaynode), SPLAYNODEPERBLOCK,
--           SPLAYNODEPERBLOCK, 0);
--  splayroot = (struct splaynode *) NULL;
--
--  if (b->verbose) {
--    printf("  Placing vertices in event heap.\n");
--  }
--  createeventheap(m, &eventheap, &events, &freeevents);
--  heapsize = m->invertices;
--
--  if (b->verbose) {
--    printf("  Forming triangulation.\n");
--  }
--  maketriangle(m, b, &lefttri);
--  maketriangle(m, b, &righttri);
--  bond(lefttri, righttri);
--  lnextself(lefttri);
--  lprevself(righttri);
--  bond(lefttri, righttri);
--  lnextself(lefttri);
--  lprevself(righttri);
--  bond(lefttri, righttri);
--  firstvertex = (vertex) eventheap[0]->eventptr;
--  eventheap[0]->eventptr = (void *) freeevents;
--  freeevents = eventheap[0];
--  eventheapdelete(eventheap, heapsize, 0);
--  heapsize--;
--  do {
--    if (heapsize == 0) {
--      printf("Error:  Input vertices are all identical.\n");
--      triexit(1);
--    }
--    secondvertex = (vertex) eventheap[0]->eventptr;
--    eventheap[0]->eventptr = (void *) freeevents;
--    freeevents = eventheap[0];
--    eventheapdelete(eventheap, heapsize, 0);
--    heapsize--;
--    if ((firstvertex[0] == secondvertex[0]) &&
--        (firstvertex[1] == secondvertex[1])) {
--      if (!b->quiet) {
--        printf(
--"Warning:  A duplicate vertex at (%.12g, %.12g) appeared and was ignored.\n",
--               secondvertex[0], secondvertex[1]);
--      }
--      setvertextype(secondvertex, UNDEADVERTEX);
--      m->undeads++;
--    }
--  } while ((firstvertex[0] == secondvertex[0]) &&
--           (firstvertex[1] == secondvertex[1]));
--  setorg(lefttri, firstvertex);
--  setdest(lefttri, secondvertex);
--  setorg(righttri, secondvertex);
--  setdest(righttri, firstvertex);
--  lprev(lefttri, bottommost);
--  lastvertex = secondvertex;
--  while (heapsize > 0) {
--    nextevent = eventheap[0];
--    eventheapdelete(eventheap, heapsize, 0);
--    heapsize--;
--    check4events = 1;
--    if (nextevent->xkey < m->xmin) {
--      decode(nextevent->eventptr, fliptri);
--      oprev(fliptri, farlefttri);
--      check4deadevent(&farlefttri, &freeevents, eventheap, &heapsize);
--      onext(fliptri, farrighttri);
--      check4deadevent(&farrighttri, &freeevents, eventheap, &heapsize);
--
--      if (otriequal(farlefttri, bottommost)) {
--        lprev(fliptri, bottommost);
--      }
--      flip(m, b, &fliptri);
--      setapex(fliptri, NULL);
--      lprev(fliptri, lefttri);
--      lnext(fliptri, righttri);
--      sym(lefttri, farlefttri);
--
--      if (randomnation(SAMPLERATE) == 0) {
--        symself(fliptri);
--        dest(fliptri, leftvertex);
--        apex(fliptri, midvertex);
--        org(fliptri, rightvertex);
--        splayroot = circletopinsert(m, b, splayroot, &lefttri, leftvertex,
--                                    midvertex, rightvertex, nextevent->ykey);
--      }
--    } else {
--      nextvertex = (vertex) nextevent->eventptr;
--      if ((nextvertex[0] == lastvertex[0]) &&
--          (nextvertex[1] == lastvertex[1])) {
--        if (!b->quiet) {
--          printf(
--"Warning:  A duplicate vertex at (%.12g, %.12g) appeared and was ignored.\n",
--                 nextvertex[0], nextvertex[1]);
--        }
--        setvertextype(nextvertex, UNDEADVERTEX);
--        m->undeads++;
--        check4events = 0;
--      } else {
--        lastvertex = nextvertex;
--
--        splayroot = frontlocate(m, splayroot, &bottommost, nextvertex,
--                                &searchtri, &farrightflag);
--/*
--        otricopy(bottommost, searchtri);
--        farrightflag = 0;
--        while (!farrightflag && rightofhyperbola(m, &searchtri, nextvertex)) {
--          onextself(searchtri);
--          farrightflag = otriequal(searchtri, bottommost);
--        }
--*/
--
--        check4deadevent(&searchtri, &freeevents, eventheap, &heapsize);
--
--        otricopy(searchtri, farrighttri);
--        sym(searchtri, farlefttri);
--        maketriangle(m, b, &lefttri);
--        maketriangle(m, b, &righttri);
--        dest(farrighttri, connectvertex);
--        setorg(lefttri, connectvertex);
--        setdest(lefttri, nextvertex);
--        setorg(righttri, nextvertex);
--        setdest(righttri, connectvertex);
--        bond(lefttri, righttri);
--        lnextself(lefttri);
--        lprevself(righttri);
--        bond(lefttri, righttri);
--        lnextself(lefttri);
--        lprevself(righttri);
--        bond(lefttri, farlefttri);
--        bond(righttri, farrighttri);
--        if (!farrightflag && otriequal(farrighttri, bottommost)) {
--          otricopy(lefttri, bottommost);
--        }
--
--        if (randomnation(SAMPLERATE) == 0) {
--          splayroot = splayinsert(m, splayroot, &lefttri, nextvertex);
--        } else if (randomnation(SAMPLERATE) == 0) {
--          lnext(righttri, inserttri);
--          splayroot = splayinsert(m, splayroot, &inserttri, nextvertex);
--        }
--      }
--    }
--    nextevent->eventptr = (void *) freeevents;
--    freeevents = nextevent;
--
--    if (check4events) {
--      apex(farlefttri, leftvertex);
--      dest(lefttri, midvertex);
--      apex(lefttri, rightvertex);
--      lefttest = counterclockwise(m, b, leftvertex, midvertex, rightvertex);
--      if (lefttest > 0.0) {
--        newevent = freeevents;
--        freeevents = (struct event *) freeevents->eventptr;
--        newevent->xkey = m->xminextreme;
--        newevent->ykey = circletop(m, leftvertex, midvertex, rightvertex,
--                                   lefttest);
--        newevent->eventptr = (void *) encode(lefttri);
--        eventheapinsert(eventheap, heapsize, newevent);
--        heapsize++;
--        setorg(lefttri, newevent);
--      }
--      apex(righttri, leftvertex);
--      org(righttri, midvertex);
--      apex(farrighttri, rightvertex);
--      righttest = counterclockwise(m, b, leftvertex, midvertex, rightvertex);
--      if (righttest > 0.0) {
--        newevent = freeevents;
--        freeevents = (struct event *) freeevents->eventptr;
--        newevent->xkey = m->xminextreme;
--        newevent->ykey = circletop(m, leftvertex, midvertex, rightvertex,
--                                   righttest);
--        newevent->eventptr = (void *) encode(farrighttri);
--        eventheapinsert(eventheap, heapsize, newevent);
--        heapsize++;
--        setorg(farrighttri, newevent);
--      }
--    }
--  }
--
--  pooldeinit(&m->splaynodes);
--  lprevself(bottommost);
--  return removeghosts(m, b, &bottommost);
--}
--
--#endif /* not REDUCED */
--
--/**                                                                         **/
--/**                                                                         **/
--/********* Sweepline Delaunay triangulation ends here                *********/
--
--/********* General mesh construction routines begin here             *********/
--/**                                                                         **/
--/**                                                                         **/
--
--/*****************************************************************************/
--/*                                                                           */
--/*  delaunay()   Form a Delaunay triangulation.                              */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifdef ANSI_DECLARATORS
--long delaunay(struct mesh *m, struct behavior *b)
--#else /* not ANSI_DECLARATORS */
--long delaunay(m, b)
--struct mesh *m;
--struct behavior *b;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  long hulledges;
--
--  m->eextras = 0;
--  initializetrisubpools(m, b);
--
--#ifdef REDUCED
--  if (!b->quiet) {
--    printf(
--      "Constructing Delaunay triangulation by divide-and-conquer method.\n");
--  }
--  hulledges = divconqdelaunay(m, b);
--#else /* not REDUCED */
--  if (!b->quiet) {
--    printf("Constructing Delaunay triangulation ");
--    if (b->incremental) {
--      printf("by incremental method.\n");
--    } else if (b->sweepline) {
--      printf("by sweepline method.\n");
--    } else {
--      printf("by divide-and-conquer method.\n");
--    }
--  }
--  if (b->incremental) {
--    hulledges = incrementaldelaunay(m, b);
--  } else if (b->sweepline) {
--    hulledges = sweeplinedelaunay(m, b);
--  } else {
--    hulledges = divconqdelaunay(m, b);
--  }
--#endif /* not REDUCED */
--
--  if (m->triangles.items == 0) {
--    /* The input vertices were all collinear, so there are no triangles. */
--    return 0l;
--  } else {
--    return hulledges;
--  }
--}
--
--/*****************************************************************************/
--/*                                                                           */
--/*  reconstruct()   Reconstruct a triangulation from its .ele (and possibly  */
--/*                  .poly) file.  Used when the -r switch is used.           */
--/*                                                                           */
--/*  Reads an .ele file and reconstructs the original mesh.  If the -p switch */
--/*  is used, this procedure will also read a .poly file and reconstruct the  */
--/*  subsegments of the original mesh.  If the -a switch is used, this        */
--/*  procedure will also read an .area file and set a maximum area constraint */
--/*  on each triangle.                                                        */
--/*                                                                           */
--/*  Vertices that are not corners of triangles, such as nodes on edges of    */
--/*  subparametric elements, are discarded.                                   */
--/*                                                                           */
--/*  This routine finds the adjacencies between triangles (and subsegments)   */
--/*  by forming one stack of triangles for each vertex.  Each triangle is on  */
--/*  three different stacks simultaneously.  Each triangle's subsegment       */
--/*  pointers are used to link the items in each stack.  This memory-saving   */
--/*  feature makes the code harder to read.  The most important thing to keep */
--/*  in mind is that each triangle is removed from a stack precisely when     */
--/*  the corresponding pointer is adjusted to refer to a subsegment rather    */
--/*  than the next triangle of the stack.                                     */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifndef CDT_ONLY
--
--#ifdef TRILIBRARY
--
--#ifdef ANSI_DECLARATORS
--int reconstruct(struct mesh *m, struct behavior *b, int *trianglelist,
--                REAL *triangleattriblist, REAL *trianglearealist,
--                int elements, int corners, int attribs,
--                int *segmentlist,int *segmentmarkerlist, int numberofsegments)
--#else /* not ANSI_DECLARATORS */
--int reconstruct(m, b, trianglelist, triangleattriblist, trianglearealist,
--                elements, corners, attribs, segmentlist, segmentmarkerlist,
--                numberofsegments)
--struct mesh *m;
--struct behavior *b;
--int *trianglelist;
--REAL *triangleattriblist;
--REAL *trianglearealist;
--int elements;
--int corners;
--int attribs;
--int *segmentlist;
--int *segmentmarkerlist;
--int numberofsegments;
--#endif /* not ANSI_DECLARATORS */
--
--#else /* not TRILIBRARY */
--
--#ifdef ANSI_DECLARATORS
--long reconstruct(struct mesh *m, struct behavior *b, char *elefilename,
--                 char *areafilename, char *polyfilename, FILE *polyfile)
--#else /* not ANSI_DECLARATORS */
--long reconstruct(m, b, elefilename, areafilename, polyfilename, polyfile)
--struct mesh *m;
--struct behavior *b;
--char *elefilename;
--char *areafilename;
--char *polyfilename;
--FILE *polyfile;
--#endif /* not ANSI_DECLARATORS */
--
--#endif /* not TRILIBRARY */
--
--{
--#ifdef TRILIBRARY
--  int vertexindex;
--  int attribindex;
--#else /* not TRILIBRARY */
--  FILE *elefile;
--  FILE *areafile;
--  char inputline[INPUTLINESIZE];
--  char *stringptr;
--  int areaelements;
--#endif /* not TRILIBRARY */
--  struct otri triangleloop;
--  struct otri triangleleft;
--  struct otri checktri;
--  struct otri checkleft;
--  struct otri checkneighbor;
--  struct osub subsegloop;
--  triangle *vertexarray;
--  triangle *prevlink;
--  triangle nexttri;
--  vertex tdest, tapex;
--  vertex checkdest, checkapex;
--  vertex shorg;
--  vertex killvertex;
--  vertex segmentorg, segmentdest;
--  REAL area;
--  int corner[3];
--  int end[2];
--  int killvertexindex;
--  int incorners;
--  int segmentmarkers;
--  int boundmarker;
--  int aroundvertex;
--  long hullsize;
--  int notfound;
--  long elementnumber, segmentnumber;
--  int i, j;
--  triangle ptr;                         /* Temporary variable used by sym(). */
--
--#ifdef TRILIBRARY
--  m->inelements = elements;
--  incorners = corners;
--  if (incorners < 3) {
--    printf("Error:  Triangles must have at least 3 vertices.\n");
--    triexit(1);
--  }
--  m->eextras = attribs;
--#else /* not TRILIBRARY */
--  /* Read the triangles from an .ele file. */
--  if (!b->quiet) {
--    printf("Opening %s.\n", elefilename);
--  }
--  elefile = fopen(elefilename, "r");
--  if (elefile == (FILE *) NULL) {
--    printf("  Error:  Cannot access file %s.\n", elefilename);
--    triexit(1);
--  }
--  /* Read number of triangles, number of vertices per triangle, and */
--  /*   number of triangle attributes from .ele file.                */
--  stringptr = readline(inputline, elefile, elefilename);
--  m->inelements = (int) strtol(stringptr, &stringptr, 0);
--  stringptr = findfield(stringptr);
--  if (*stringptr == '\0') {
--    incorners = 3;
--  } else {
--    incorners = (int) strtol(stringptr, &stringptr, 0);
--    if (incorners < 3) {
--      printf("Error:  Triangles in %s must have at least 3 vertices.\n",
--             elefilename);
--      triexit(1);
--    }
--  }
--  stringptr = findfield(stringptr);
--  if (*stringptr == '\0') {
--    m->eextras = 0;
--  } else {
--    m->eextras = (int) strtol(stringptr, &stringptr, 0);
--  }
--#endif /* not TRILIBRARY */
--
--  initializetrisubpools(m, b);
--
--  /* Create the triangles. */
--  for (elementnumber = 1; elementnumber <= m->inelements; elementnumber++) {
--    maketriangle(m, b, &triangleloop);
--    /* Mark the triangle as living. */
--    triangleloop.tri[3] = (triangle) triangleloop.tri;
--  }
--
--  segmentmarkers = 0;
--  if (b->poly) {
--#ifdef TRILIBRARY
--    m->insegments = numberofsegments;
--    segmentmarkers = segmentmarkerlist != (int *) NULL;
--#else /* not TRILIBRARY */
--    /* Read number of segments and number of segment */
--    /*   boundary markers from .poly file.           */
--    stringptr = readline(inputline, polyfile, b->inpolyfilename);
--    m->insegments = (int) strtol(stringptr, &stringptr, 0);
--    stringptr = findfield(stringptr);
--    if (*stringptr != '\0') {
--      segmentmarkers = (int) strtol(stringptr, &stringptr, 0);
--    }
--#endif /* not TRILIBRARY */
--
--    /* Create the subsegments. */
--    for (segmentnumber = 1; segmentnumber <= m->insegments; segmentnumber++) {
--      makesubseg(m, &subsegloop);
--      /* Mark the subsegment as living. */
--      subsegloop.ss[2] = (subseg) subsegloop.ss;
--    }
--  }
--
--#ifdef TRILIBRARY
--  vertexindex = 0;
--  attribindex = 0;
--#else /* not TRILIBRARY */
--  if (b->vararea) {
--    /* Open an .area file, check for consistency with the .ele file. */
--    if (!b->quiet) {
--      printf("Opening %s.\n", areafilename);
--    }
--    areafile = fopen(areafilename, "r");
--    if (areafile == (FILE *) NULL) {
--      printf("  Error:  Cannot access file %s.\n", areafilename);
--      triexit(1);
--    }
--    stringptr = readline(inputline, areafile, areafilename);
--    areaelements = (int) strtol(stringptr, &stringptr, 0);
--    if (areaelements != m->inelements) {
--      printf("Error:  %s and %s disagree on number of triangles.\n",
--             elefilename, areafilename);
--      triexit(1);
--    }
--  }
--#endif /* not TRILIBRARY */
--
--  if (!b->quiet) {
--    printf("Reconstructing mesh.\n");
--  }
--  /* Allocate a temporary array that maps each vertex to some adjacent */
--  /*   triangle.  I took care to allocate all the permanent memory for */
--  /*   triangles and subsegments first.                                */
--  vertexarray = (triangle *) trimalloc(m->vertices.items *
--                                       (int) sizeof(triangle));
--  /* Each vertex is initially unrepresented. */
--  for (i = 0; i < m->vertices.items; i++) {
--    vertexarray[i] = (triangle) m->dummytri;
--  }
--
--  if (b->verbose) {
--    printf("  Assembling triangles.\n");
--  }
--  /* Read the triangles from the .ele file, and link */
--  /*   together those that share an edge.            */
--  traversalinit(&m->triangles);
--  triangleloop.tri = triangletraverse(m);
--  elementnumber = b->firstnumber;
--  while (triangleloop.tri != (triangle *) NULL) {
--#ifdef TRILIBRARY
--    /* Copy the triangle's three corners. */
--    for (j = 0; j < 3; j++) {
--      corner[j] = trianglelist[vertexindex++];
--      if ((corner[j] < b->firstnumber) ||
--          (corner[j] >= b->firstnumber + m->invertices)) {
--        printf("Error:  Triangle %ld has an invalid vertex index.\n",
--               elementnumber);
--        triexit(1);
--      }
--    }
--#else /* not TRILIBRARY */
--    /* Read triangle number and the triangle's three corners. */
--    stringptr = readline(inputline, elefile, elefilename);
--    for (j = 0; j < 3; j++) {
--      stringptr = findfield(stringptr);
--      if (*stringptr == '\0') {
--        printf("Error:  Triangle %ld is missing vertex %d in %s.\n",
--               elementnumber, j + 1, elefilename);
--        triexit(1);
--      } else {
--        corner[j] = (int) strtol(stringptr, &stringptr, 0);
--        if ((corner[j] < b->firstnumber) ||
--            (corner[j] >= b->firstnumber + m->invertices)) {
--          printf("Error:  Triangle %ld has an invalid vertex index.\n",
--                 elementnumber);
--          triexit(1);
--        }
--      }
--    }
--#endif /* not TRILIBRARY */
--
--    /* Find out about (and throw away) extra nodes. */
--    for (j = 3; j < incorners; j++) {
--#ifdef TRILIBRARY
--      killvertexindex = trianglelist[vertexindex++];
--#else /* not TRILIBRARY */
--      stringptr = findfield(stringptr);
--      if (*stringptr != '\0') {
--        killvertexindex = (int) strtol(stringptr, &stringptr, 0);
--#endif /* not TRILIBRARY */
--        if ((killvertexindex >= b->firstnumber) &&
--            (killvertexindex < b->firstnumber + m->invertices)) {
--          /* Delete the non-corner vertex if it's not already deleted. */
--          killvertex = getvertex(m, b, killvertexindex);
--          if (vertextype(killvertex) != DEADVERTEX) {
--            vertexdealloc(m, killvertex);
--          }
--        }
--#ifndef TRILIBRARY
--      }
--#endif /* not TRILIBRARY */
--    }
--
--    /* Read the triangle's attributes. */
--    for (j = 0; j < m->eextras; j++) {
--#ifdef TRILIBRARY
--      setelemattribute(triangleloop, j, triangleattriblist[attribindex++]);
--#else /* not TRILIBRARY */
--      stringptr = findfield(stringptr);
--      if (*stringptr == '\0') {
--        setelemattribute(triangleloop, j, 0);
--      } else {
--        setelemattribute(triangleloop, j,
--                         (REAL) strtod(stringptr, &stringptr));
--      }
--#endif /* not TRILIBRARY */
--    }
--
--    if (b->vararea) {
--#ifdef TRILIBRARY
--      area = trianglearealist[elementnumber - b->firstnumber];
--#else /* not TRILIBRARY */
--      /* Read an area constraint from the .area file. */
--      stringptr = readline(inputline, areafile, areafilename);
--      stringptr = findfield(stringptr);
--      if (*stringptr == '\0') {
--        area = -1.0;                      /* No constraint on this triangle. */
--      } else {
--        area = (REAL) strtod(stringptr, &stringptr);
--      }
--#endif /* not TRILIBRARY */
--      setareabound(triangleloop, area);
--    }
--
--    /* Set the triangle's vertices. */
--    triangleloop.orient = 0;
--    setorg(triangleloop, getvertex(m, b, corner[0]));
--    setdest(triangleloop, getvertex(m, b, corner[1]));
--    setapex(triangleloop, getvertex(m, b, corner[2]));
--    /* Try linking the triangle to others that share these vertices. */
--    for (triangleloop.orient = 0; triangleloop.orient < 3;
--         triangleloop.orient++) {
--      /* Take the number for the origin of triangleloop. */
--      aroundvertex = corner[triangleloop.orient];
--      /* Look for other triangles having this vertex. */
--      nexttri = vertexarray[aroundvertex - b->firstnumber];
--      /* Link the current triangle to the next one in the stack. */
--      triangleloop.tri[6 + triangleloop.orient] = nexttri;
--      /* Push the current triangle onto the stack. */
--      vertexarray[aroundvertex - b->firstnumber] = encode(triangleloop);
--      decode(nexttri, checktri);
--      if (checktri.tri != m->dummytri) {
--        dest(triangleloop, tdest);
--        apex(triangleloop, tapex);
--        /* Look for other triangles that share an edge. */
--        do {
--          dest(checktri, checkdest);
--          apex(checktri, checkapex);
--          if (tapex == checkdest) {
--            /* The two triangles share an edge; bond them together. */
--            lprev(triangleloop, triangleleft);
--            bond(triangleleft, checktri);
--          }
--          if (tdest == checkapex) {
--            /* The two triangles share an edge; bond them together. */
--            lprev(checktri, checkleft);
--            bond(triangleloop, checkleft);
--          }
--          /* Find the next triangle in the stack. */
--          nexttri = checktri.tri[6 + checktri.orient];
--          decode(nexttri, checktri);
--        } while (checktri.tri != m->dummytri);
--      }
--    }
--    triangleloop.tri = triangletraverse(m);
--    elementnumber++;
--  }
--
--#ifdef TRILIBRARY
--  vertexindex = 0;
--#else /* not TRILIBRARY */
--  fclose(elefile);
--  if (b->vararea) {
--    fclose(areafile);
--  }
--#endif /* not TRILIBRARY */
--
--  hullsize = 0;                      /* Prepare to count the boundary edges. */
--  if (b->poly) {
--    if (b->verbose) {
--      printf("  Marking segments in triangulation.\n");
--    }
--    /* Read the segments from the .poly file, and link them */
--    /*   to their neighboring triangles.                    */
--    boundmarker = 0;
--    traversalinit(&m->subsegs);
--    subsegloop.ss = subsegtraverse(m);
--    segmentnumber = b->firstnumber;
--    while (subsegloop.ss != (subseg *) NULL) {
--#ifdef TRILIBRARY
--      end[0] = segmentlist[vertexindex++];
--      end[1] = segmentlist[vertexindex++];
--      if (segmentmarkers) {
--        boundmarker = segmentmarkerlist[segmentnumber - b->firstnumber];
--      }
--#else /* not TRILIBRARY */
--      /* Read the endpoints of each segment, and possibly a boundary marker. */
--      stringptr = readline(inputline, polyfile, b->inpolyfilename);
--      /* Skip the first (segment number) field. */
--      stringptr = findfield(stringptr);
--      if (*stringptr == '\0') {
--        printf("Error:  Segment %ld has no endpoints in %s.\n", segmentnumber,
--               polyfilename);
--        triexit(1);
--      } else {
--        end[0] = (int) strtol(stringptr, &stringptr, 0);
--      }
--      stringptr = findfield(stringptr);
--      if (*stringptr == '\0') {
--        printf("Error:  Segment %ld is missing its second endpoint in %s.\n",
--               segmentnumber, polyfilename);
--        triexit(1);
--      } else {
--        end[1] = (int) strtol(stringptr, &stringptr, 0);
--      }
--      if (segmentmarkers) {
--        stringptr = findfield(stringptr);
--        if (*stringptr == '\0') {
--          boundmarker = 0;
--        } else {
--          boundmarker = (int) strtol(stringptr, &stringptr, 0);
--        }
--      }
--#endif /* not TRILIBRARY */
--      for (j = 0; j < 2; j++) {
--        if ((end[j] < b->firstnumber) ||
--            (end[j] >= b->firstnumber + m->invertices)) {
--          printf("Error:  Segment %ld has an invalid vertex index.\n",
--                 segmentnumber);
--          triexit(1);
--        }
--      }
--
--      /* set the subsegment's vertices. */
--      subsegloop.ssorient = 0;
--      segmentorg = getvertex(m, b, end[0]);
--      segmentdest = getvertex(m, b, end[1]);
--      setsorg(subsegloop, segmentorg);
--      setsdest(subsegloop, segmentdest);
--      setsegorg(subsegloop, segmentorg);
--      setsegdest(subsegloop, segmentdest);
--      setmark(subsegloop, boundmarker);
--      /* Try linking the subsegment to triangles that share these vertices. */
--      for (subsegloop.ssorient = 0; subsegloop.ssorient < 2;
--           subsegloop.ssorient++) {
--        /* Take the number for the destination of subsegloop. */
--        aroundvertex = end[1 - subsegloop.ssorient];
--        /* Look for triangles having this vertex. */
--        prevlink = &vertexarray[aroundvertex - b->firstnumber];
--        nexttri = vertexarray[aroundvertex - b->firstnumber];
--        decode(nexttri, checktri);
--        sorg(subsegloop, shorg);
--        notfound = 1;
--        /* Look for triangles having this edge.  Note that I'm only       */
--        /*   comparing each triangle's destination with the subsegment;   */
--        /*   each triangle's apex is handled through a different vertex.  */
--        /*   Because each triangle appears on three vertices' lists, each */
--        /*   occurrence of a triangle on a list can (and does) represent  */
--        /*   an edge.  In this way, most edges are represented twice, and */
--        /*   every triangle-subsegment bond is represented once.          */
--        while (notfound && (checktri.tri != m->dummytri)) {
--          dest(checktri, checkdest);
--          if (shorg == checkdest) {
--            /* We have a match.  Remove this triangle from the list. */
--            *prevlink = checktri.tri[6 + checktri.orient];
--            /* Bond the subsegment to the triangle. */
--            tsbond(checktri, subsegloop);
--            /* Check if this is a boundary edge. */
--            sym(checktri, checkneighbor);
--            if (checkneighbor.tri == m->dummytri) {
--              /* The next line doesn't insert a subsegment (because there's */
--              /*   already one there), but it sets the boundary markers of  */
--              /*   the existing subsegment and its vertices.                */
--              insertsubseg(m, b, &checktri, 1);
--              hullsize++;
--            }
--            notfound = 0;
--          }
--          /* Find the next triangle in the stack. */
--          prevlink = &checktri.tri[6 + checktri.orient];
--          nexttri = checktri.tri[6 + checktri.orient];
--          decode(nexttri, checktri);
--        }
--      }
--      subsegloop.ss = subsegtraverse(m);
--      segmentnumber++;
--    }
--  }
--
--  /* Mark the remaining edges as not being attached to any subsegment. */
--  /* Also, count the (yet uncounted) boundary edges.                   */
--  for (i = 0; i < m->vertices.items; i++) {
--    /* Search the stack of triangles adjacent to a vertex. */
--    nexttri = vertexarray[i];
--    decode(nexttri, checktri);
--    while (checktri.tri != m->dummytri) {
--      /* Find the next triangle in the stack before this */
--      /*   information gets overwritten.                 */
--      nexttri = checktri.tri[6 + checktri.orient];
--      /* No adjacent subsegment.  (This overwrites the stack info.) */
--      tsdissolve(checktri);
--      sym(checktri, checkneighbor);
--      if (checkneighbor.tri == m->dummytri) {
--        insertsubseg(m, b, &checktri, 1);
--        hullsize++;
--      }
--      decode(nexttri, checktri);
--    }
--  }
--
--  trifree((void *) vertexarray);
--  return hullsize;
--}
--
--#endif /* not CDT_ONLY */
--
--/**                                                                         **/
--/**                                                                         **/
--/********* General mesh construction routines end here               *********/
--
--/********* Segment insertion begins here                             *********/
--/**                                                                         **/
--/**                                                                         **/
--
--/*****************************************************************************/
--/*                                                                           */
--/*  finddirection()   Find the first triangle on the path from one point     */
--/*                    to another.                                            */
--/*                                                                           */
--/*  Finds the triangle that intersects a line segment drawn from the         */
--/*  origin of `searchtri' to the point `searchpoint', and returns the result */
--/*  in `searchtri'.  The origin of `searchtri' does not change, even though  */
--/*  the triangle returned may differ from the one passed in.  This routine   */
--/*  is used to find the direction to move in to get from one point to        */
--/*  another.                                                                 */
--/*                                                                           */
--/*  The return value notes whether the destination or apex of the found      */
--/*  triangle is collinear with the two points in question.                   */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifdef ANSI_DECLARATORS
--enum finddirectionresult finddirection(struct mesh *m, struct behavior *b,
--                                       struct otri *searchtri,
--                                       vertex searchpoint)
--#else /* not ANSI_DECLARATORS */
--enum finddirectionresult finddirection(m, b, searchtri, searchpoint)
--struct mesh *m;
--struct behavior *b;
--struct otri *searchtri;
--vertex searchpoint;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  struct otri checktri;
--  vertex startvertex;
--  vertex leftvertex, rightvertex;
--  REAL leftccw, rightccw;
--  int leftflag, rightflag;
--  triangle ptr;           /* Temporary variable used by onext() and oprev(). */
--
--  org(*searchtri, startvertex);
--  dest(*searchtri, rightvertex);
--  apex(*searchtri, leftvertex);
--  /* Is `searchpoint' to the left? */
--  leftccw = counterclockwise(m, b, searchpoint, startvertex, leftvertex);
--  leftflag = leftccw > 0.0;
--  /* Is `searchpoint' to the right? */
--  rightccw = counterclockwise(m, b, startvertex, searchpoint, rightvertex);
--  rightflag = rightccw > 0.0;
--  if (leftflag && rightflag) {
--    /* `searchtri' faces directly away from `searchpoint'.  We could go left */
--    /*   or right.  Ask whether it's a triangle or a boundary on the left.   */
--    onext(*searchtri, checktri);
--    if (checktri.tri == m->dummytri) {
--      leftflag = 0;
--    } else {
--      rightflag = 0;
--    }
--  }
--  while (leftflag) {
--    /* Turn left until satisfied. */
--    onextself(*searchtri);
--    if (searchtri->tri == m->dummytri) {
--      printf("Internal error in finddirection():  Unable to find a\n");
--      printf("  triangle leading from (%.12g, %.12g) to", startvertex[0],
--             startvertex[1]);
--      printf("  (%.12g, %.12g).\n", searchpoint[0], searchpoint[1]);
--      internalerror();
--    }
--    apex(*searchtri, leftvertex);
--    rightccw = leftccw;
--    leftccw = counterclockwise(m, b, searchpoint, startvertex, leftvertex);
--    leftflag = leftccw > 0.0;
--  }
--  while (rightflag) {
--    /* Turn right until satisfied. */
--    oprevself(*searchtri);
--    if (searchtri->tri == m->dummytri) {
--      printf("Internal error in finddirection():  Unable to find a\n");
--      printf("  triangle leading from (%.12g, %.12g) to", startvertex[0],
--             startvertex[1]);
--      printf("  (%.12g, %.12g).\n", searchpoint[0], searchpoint[1]);
--      internalerror();
--    }
--    dest(*searchtri, rightvertex);
--    leftccw = rightccw;
--    rightccw = counterclockwise(m, b, startvertex, searchpoint, rightvertex);
--    rightflag = rightccw > 0.0;
--  }
--  if (leftccw == 0.0) {
--    return LEFTCOLLINEAR;
--  } else if (rightccw == 0.0) {
--    return RIGHTCOLLINEAR;
--  } else {
--    return WITHIN;
--  }
--}
--
--/*****************************************************************************/
--/*                                                                           */
--/*  segmentintersection()   Find the intersection of an existing segment     */
--/*                          and a segment that is being inserted.  Insert    */
--/*                          a vertex at the intersection, splitting an       */
--/*                          existing subsegment.                             */
--/*                                                                           */
--/*  The segment being inserted connects the apex of splittri to endpoint2.   */
--/*  splitsubseg is the subsegment being split, and MUST adjoin splittri.     */
--/*  Hence, endpoints of the subsegment being split are the origin and        */
--/*  destination of splittri.                                                 */
--/*                                                                           */
--/*  On completion, splittri is a handle having the newly inserted            */
--/*  intersection point as its origin, and endpoint1 as its destination.      */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifdef ANSI_DECLARATORS
--void segmentintersection(struct mesh *m, struct behavior *b,
--                         struct otri *splittri, struct osub *splitsubseg,
--                         vertex endpoint2)
--#else /* not ANSI_DECLARATORS */
--void segmentintersection(m, b, splittri, splitsubseg, endpoint2)
--struct mesh *m;
--struct behavior *b;
--struct otri *splittri;
--struct osub *splitsubseg;
--vertex endpoint2;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  struct osub opposubseg;
--  vertex endpoint1;
--  vertex torg, tdest;
--  vertex leftvertex, rightvertex;
--  vertex newvertex;
--  enum insertvertexresult success;
--  REAL ex, ey;
--  REAL tx, ty;
--  REAL etx, ety;
--  REAL split, denom;
--  int i;
--  triangle ptr;                       /* Temporary variable used by onext(). */
--  subseg sptr;                        /* Temporary variable used by snext(). */
--
--  /* Find the other three segment endpoints. */
--  apex(*splittri, endpoint1);
--  org(*splittri, torg);
--  dest(*splittri, tdest);
--  /* Segment intersection formulae; see the Antonio reference. */
--  tx = tdest[0] - torg[0];
--  ty = tdest[1] - torg[1];
--  ex = endpoint2[0] - endpoint1[0];
--  ey = endpoint2[1] - endpoint1[1];
--  etx = torg[0] - endpoint2[0];
--  ety = torg[1] - endpoint2[1];
--  denom = ty * ex - tx * ey;
--  if (denom == 0.0) {
--    printf("Internal error in segmentintersection():");
--    printf("  Attempt to find intersection of parallel segments.\n");
--    internalerror();
--  }
--  split = (ey * etx - ex * ety) / denom;
--  /* Create the new vertex. */
--  newvertex = (vertex) poolalloc(&m->vertices);
--  /* Interpolate its coordinate and attributes. */
--  for (i = 0; i < 2 + m->nextras; i++) {
--    newvertex[i] = torg[i] + split * (tdest[i] - torg[i]);
--  }
--  setvertexmark(newvertex, mark(*splitsubseg));
--  setvertextype(newvertex, INPUTVERTEX);
--  if (b->verbose > 1) {
--    printf(
--  "  Splitting subsegment (%.12g, %.12g) (%.12g, %.12g) at (%.12g, %.12g).\n",
--           torg[0], torg[1], tdest[0], tdest[1], newvertex[0], newvertex[1]);
--  }
--  /* Insert the intersection vertex.  This should always succeed. */
--  success = insertvertex(m, b, newvertex, splittri, splitsubseg, 0, 0);
--  if (success != SUCCESSFULVERTEX) {
--    printf("Internal error in segmentintersection():\n");
--    printf("  Failure to split a segment.\n");
--    internalerror();
--  }
--  /* Record a triangle whose origin is the new vertex. */
--  setvertex2tri(newvertex, encode(*splittri));
--  if (m->steinerleft > 0) {
--    m->steinerleft--;
--  }
--
--  /* Divide the segment into two, and correct the segment endpoints. */
--  ssymself(*splitsubseg);
--  spivot(*splitsubseg, opposubseg);
--  sdissolve(*splitsubseg);
--  sdissolve(opposubseg);
--  do {
--    setsegorg(*splitsubseg, newvertex);
--    snextself(*splitsubseg);
--  } while (splitsubseg->ss != m->dummysub);
--  do {
--    setsegorg(opposubseg, newvertex);
--    snextself(opposubseg);
--  } while (opposubseg.ss != m->dummysub);
--
--  /* Inserting the vertex may have caused edge flips.  We wish to rediscover */
--  /*   the edge connecting endpoint1 to the new intersection vertex.         */
--  finddirection(m, b, splittri, endpoint1);
--  dest(*splittri, rightvertex);
--  apex(*splittri, leftvertex);
--  if ((leftvertex[0] == endpoint1[0]) && (leftvertex[1] == endpoint1[1])) {
--    onextself(*splittri);
--  } else if ((rightvertex[0] != endpoint1[0]) ||
--             (rightvertex[1] != endpoint1[1])) {
--    printf("Internal error in segmentintersection():\n");
--    printf("  Topological inconsistency after splitting a segment.\n");
--    internalerror();
--  }
--  /* `splittri' should have destination endpoint1. */
--}
--
--/*****************************************************************************/
--/*                                                                           */
--/*  scoutsegment()   Scout the first triangle on the path from one endpoint  */
--/*                   to another, and check for completion (reaching the      */
--/*                   second endpoint), a collinear vertex, or the            */
--/*                   intersection of two segments.                           */
--/*                                                                           */
--/*  Returns one if the entire segment is successfully inserted, and zero if  */
--/*  the job must be finished by conformingedge() or constrainededge().       */
--/*                                                                           */
--/*  If the first triangle on the path has the second endpoint as its         */
--/*  destination or apex, a subsegment is inserted and the job is done.       */
--/*                                                                           */
--/*  If the first triangle on the path has a destination or apex that lies on */
--/*  the segment, a subsegment is inserted connecting the first endpoint to   */
--/*  the collinear vertex, and the search is continued from the collinear     */
--/*  vertex.                                                                  */
--/*                                                                           */
--/*  If the first triangle on the path has a subsegment opposite its origin,  */
--/*  then there is a segment that intersects the segment being inserted.      */
--/*  Their intersection vertex is inserted, splitting the subsegment.         */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifdef ANSI_DECLARATORS
--int scoutsegment(struct mesh *m, struct behavior *b, struct otri *searchtri,
--                 vertex endpoint2, int newmark)
--#else /* not ANSI_DECLARATORS */
--int scoutsegment(m, b, searchtri, endpoint2, newmark)
--struct mesh *m;
--struct behavior *b;
--struct otri *searchtri;
--vertex endpoint2;
--int newmark;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  struct otri crosstri;
--  struct osub crosssubseg;
--  vertex leftvertex, rightvertex;
--  enum finddirectionresult collinear;
--  subseg sptr;                      /* Temporary variable used by tspivot(). */
--
--  collinear = finddirection(m, b, searchtri, endpoint2);
--  dest(*searchtri, rightvertex);
--  apex(*searchtri, leftvertex);
--  if (((leftvertex[0] == endpoint2[0]) && (leftvertex[1] == endpoint2[1])) ||
--      ((rightvertex[0] == endpoint2[0]) && (rightvertex[1] == endpoint2[1]))) {
--    /* The segment is already an edge in the mesh. */
--    if ((leftvertex[0] == endpoint2[0]) && (leftvertex[1] == endpoint2[1])) {
--      lprevself(*searchtri);
--    }
--    /* Insert a subsegment, if there isn't already one there. */
--    insertsubseg(m, b, searchtri, newmark);
--    return 1;
--  } else if (collinear == LEFTCOLLINEAR) {
--    /* We've collided with a vertex between the segment's endpoints. */
--    /* Make the collinear vertex be the triangle's origin. */
--    lprevself(*searchtri);
--    insertsubseg(m, b, searchtri, newmark);
--    /* Insert the remainder of the segment. */
--    return scoutsegment(m, b, searchtri, endpoint2, newmark);
--  } else if (collinear == RIGHTCOLLINEAR) {
--    /* We've collided with a vertex between the segment's endpoints. */
--    insertsubseg(m, b, searchtri, newmark);
--    /* Make the collinear vertex be the triangle's origin. */
--    lnextself(*searchtri);
--    /* Insert the remainder of the segment. */
--    return scoutsegment(m, b, searchtri, endpoint2, newmark);
--  } else {
--    lnext(*searchtri, crosstri);
--    tspivot(crosstri, crosssubseg);
--    /* Check for a crossing segment. */
--    if (crosssubseg.ss == m->dummysub) {
--      return 0;
--    } else {
--      /* Insert a vertex at the intersection. */
--      segmentintersection(m, b, &crosstri, &crosssubseg, endpoint2);
--      otricopy(crosstri, *searchtri);
--      insertsubseg(m, b, searchtri, newmark);
--      /* Insert the remainder of the segment. */
--      return scoutsegment(m, b, searchtri, endpoint2, newmark);
--    }
--  }
--}
--
--/*****************************************************************************/
--/*                                                                           */
--/*  conformingedge()   Force a segment into a conforming Delaunay            */
--/*                     triangulation by inserting a vertex at its midpoint,  */
--/*                     and recursively forcing in the two half-segments if   */
--/*                     necessary.                                            */
--/*                                                                           */
--/*  Generates a sequence of subsegments connecting `endpoint1' to            */
--/*  `endpoint2'.  `newmark' is the boundary marker of the segment, assigned  */
--/*  to each new splitting vertex and subsegment.                             */
--/*                                                                           */
--/*  Note that conformingedge() does not always maintain the conforming       */
--/*  Delaunay property.  Once inserted, segments are locked into place;       */
--/*  vertices inserted later (to force other segments in) may render these    */
--/*  fixed segments non-Delaunay.  The conforming Delaunay property will be   */
--/*  restored by enforcequality() by splitting encroached subsegments.        */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifndef REDUCED
--#ifndef CDT_ONLY
--
--#ifdef ANSI_DECLARATORS
--void conformingedge(struct mesh *m, struct behavior *b,
--                    vertex endpoint1, vertex endpoint2, int newmark)
--#else /* not ANSI_DECLARATORS */
--void conformingedge(m, b, endpoint1, endpoint2, newmark)
--struct mesh *m;
--struct behavior *b;
--vertex endpoint1;
--vertex endpoint2;
--int newmark;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  struct otri searchtri1, searchtri2;
--  struct osub brokensubseg;
--  vertex newvertex;
--  vertex midvertex1, midvertex2;
--  enum insertvertexresult success;
--  int i;
--  subseg sptr;                      /* Temporary variable used by tspivot(). */
--
--  if (b->verbose > 2) {
--    printf("Forcing segment into triangulation by recursive splitting:\n");
--    printf("  (%.12g, %.12g) (%.12g, %.12g)\n", endpoint1[0], endpoint1[1],
--           endpoint2[0], endpoint2[1]);
--  }
--  /* Create a new vertex to insert in the middle of the segment. */
--  newvertex = (vertex) poolalloc(&m->vertices);
--  /* Interpolate coordinates and attributes. */
--  for (i = 0; i < 2 + m->nextras; i++) {
--    newvertex[i] = 0.5 * (endpoint1[i] + endpoint2[i]);
--  }
--  setvertexmark(newvertex, newmark);
--  setvertextype(newvertex, SEGMENTVERTEX);
--  /* No known triangle to search from. */
--  searchtri1.tri = m->dummytri;
--  /* Attempt to insert the new vertex. */
--  success = insertvertex(m, b, newvertex, &searchtri1, (struct osub *) NULL,
--                         0, 0);
--  if (success == DUPLICATEVERTEX) {
--    if (b->verbose > 2) {
--      printf("  Segment intersects existing vertex (%.12g, %.12g).\n",
--             newvertex[0], newvertex[1]);
--    }
--    /* Use the vertex that's already there. */
--    vertexdealloc(m, newvertex);
--    org(searchtri1, newvertex);
--  } else {
--    if (success == VIOLATINGVERTEX) {
--      if (b->verbose > 2) {
--        printf("  Two segments intersect at (%.12g, %.12g).\n",
--               newvertex[0], newvertex[1]);
--      }
--      /* By fluke, we've landed right on another segment.  Split it. */
--      tspivot(searchtri1, brokensubseg);
--      success = insertvertex(m, b, newvertex, &searchtri1, &brokensubseg,
--                             0, 0);
--      if (success != SUCCESSFULVERTEX) {
--        printf("Internal error in conformingedge():\n");
--        printf("  Failure to split a segment.\n");
--        internalerror();
--      }
--    }
--    /* The vertex has been inserted successfully. */
--    if (m->steinerleft > 0) {
--      m->steinerleft--;
--    }
--  }
--  otricopy(searchtri1, searchtri2);
--  /* `searchtri1' and `searchtri2' are fastened at their origins to         */
--  /*   `newvertex', and will be directed toward `endpoint1' and `endpoint2' */
--  /*   respectively.  First, we must get `searchtri2' out of the way so it  */
--  /*   won't be invalidated during the insertion of the first half of the   */
--  /*   segment.                                                             */
--  finddirection(m, b, &searchtri2, endpoint2);
--  if (!scoutsegment(m, b, &searchtri1, endpoint1, newmark)) {
--    /* The origin of searchtri1 may have changed if a collision with an */
--    /*   intervening vertex on the segment occurred.                    */
--    org(searchtri1, midvertex1);
--    conformingedge(m, b, midvertex1, endpoint1, newmark);
--  }
--  if (!scoutsegment(m, b, &searchtri2, endpoint2, newmark)) {
--    /* The origin of searchtri2 may have changed if a collision with an */
--    /*   intervening vertex on the segment occurred.                    */
--    org(searchtri2, midvertex2);
--    conformingedge(m, b, midvertex2, endpoint2, newmark);
--  }
--}
--
--#endif /* not CDT_ONLY */
--#endif /* not REDUCED */
--
--/*****************************************************************************/
--/*                                                                           */
--/*  delaunayfixup()   Enforce the Delaunay condition at an edge, fanning out */
--/*                    recursively from an existing vertex.  Pay special      */
--/*                    attention to stacking inverted triangles.              */
--/*                                                                           */
--/*  This is a support routine for inserting segments into a constrained      */
--/*  Delaunay triangulation.                                                  */
--/*                                                                           */
--/*  The origin of fixuptri is treated as if it has just been inserted, and   */
--/*  the local Delaunay condition needs to be enforced.  It is only enforced  */
--/*  in one sector, however, that being the angular range defined by          */
--/*  fixuptri.                                                                */
--/*                                                                           */
--/*  This routine also needs to make decisions regarding the "stacking" of    */
--/*  triangles.  (Read the description of constrainededge() below before      */
--/*  reading on here, so you understand the algorithm.)  If the position of   */
--/*  the new vertex (the origin of fixuptri) indicates that the vertex before */
--/*  it on the polygon is a reflex vertex, then "stack" the triangle by       */
--/*  doing nothing.  (fixuptri is an inverted triangle, which is how stacked  */
--/*  triangles are identified.)                                               */
--/*                                                                           */
--/*  Otherwise, check whether the vertex before that was a reflex vertex.     */
--/*  If so, perform an edge flip, thereby eliminating an inverted triangle    */
--/*  (popping it off the stack).  The edge flip may result in the creation    */
--/*  of a new inverted triangle, depending on whether or not the new vertex   */
--/*  is visible to the vertex three edges behind on the polygon.              */
--/*                                                                           */
--/*  If neither of the two vertices behind the new vertex are reflex          */
--/*  vertices, fixuptri and fartri, the triangle opposite it, are not         */
--/*  inverted; hence, ensure that the edge between them is locally Delaunay.  */
--/*                                                                           */
--/*  `leftside' indicates whether or not fixuptri is to the left of the       */
--/*  segment being inserted.  (Imagine that the segment is pointing up from   */
--/*  endpoint1 to endpoint2.)                                                 */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifdef ANSI_DECLARATORS
--void delaunayfixup(struct mesh *m, struct behavior *b,
--                   struct otri *fixuptri, int leftside)
--#else /* not ANSI_DECLARATORS */
--void delaunayfixup(m, b, fixuptri, leftside)
--struct mesh *m;
--struct behavior *b;
--struct otri *fixuptri;
--int leftside;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  struct otri neartri;
--  struct otri fartri;
--  struct osub faredge;
--  vertex nearvertex, leftvertex, rightvertex, farvertex;
--  triangle ptr;                         /* Temporary variable used by sym(). */
--  subseg sptr;                      /* Temporary variable used by tspivot(). */
--
--  lnext(*fixuptri, neartri);
--  sym(neartri, fartri);
--  /* Check if the edge opposite the origin of fixuptri can be flipped. */
--  if (fartri.tri == m->dummytri) {
--    return;
--  }
--  tspivot(neartri, faredge);
--  if (faredge.ss != m->dummysub) {
--    return;
--  }
--  /* Find all the relevant vertices. */
--  apex(neartri, nearvertex);
--  org(neartri, leftvertex);
--  dest(neartri, rightvertex);
--  apex(fartri, farvertex);
--  /* Check whether the previous polygon vertex is a reflex vertex. */
--  if (leftside) {
--    if (counterclockwise(m, b, nearvertex, leftvertex, farvertex) <= 0.0) {
--      /* leftvertex is a reflex vertex too.  Nothing can */
--      /*   be done until a convex section is found.      */
--      return;
--    }
--  } else {
--    if (counterclockwise(m, b, farvertex, rightvertex, nearvertex) <= 0.0) {
--      /* rightvertex is a reflex vertex too.  Nothing can */
--      /*   be done until a convex section is found.       */
--      return;
--    }
--  }
--  if (counterclockwise(m, b, rightvertex, leftvertex, farvertex) > 0.0) {
--    /* fartri is not an inverted triangle, and farvertex is not a reflex */
--    /*   vertex.  As there are no reflex vertices, fixuptri isn't an     */
--    /*   inverted triangle, either.  Hence, test the edge between the    */
--    /*   triangles to ensure it is locally Delaunay.                     */
--    if (incircle(m, b, leftvertex, farvertex, rightvertex, nearvertex) <=
--        0.0) {
--      return;
--    }
--    /* Not locally Delaunay; go on to an edge flip. */
--  }        /* else fartri is inverted; remove it from the stack by flipping. */
--  flip(m, b, &neartri);
--  lprevself(*fixuptri);    /* Restore the origin of fixuptri after the flip. */
--  /* Recursively process the two triangles that result from the flip. */
--  delaunayfixup(m, b, fixuptri, leftside);
--  delaunayfixup(m, b, &fartri, leftside);
--}
--
--/*****************************************************************************/
--/*                                                                           */
--/*  constrainededge()   Force a segment into a constrained Delaunay          */
--/*                      triangulation by deleting the triangles it           */
--/*                      intersects, and triangulating the polygons that      */
--/*                      form on each side of it.                             */
--/*                                                                           */
--/*  Generates a single subsegment connecting `endpoint1' to `endpoint2'.     */
--/*  The triangle `starttri' has `endpoint1' as its origin.  `newmark' is the */
--/*  boundary marker of the segment.                                          */
--/*                                                                           */
--/*  To insert a segment, every triangle whose interior intersects the        */
--/*  segment is deleted.  The union of these deleted triangles is a polygon   */
--/*  (which is not necessarily monotone, but is close enough), which is       */
--/*  divided into two polygons by the new segment.  This routine's task is    */
--/*  to generate the Delaunay triangulation of these two polygons.            */
--/*                                                                           */
--/*  You might think of this routine's behavior as a two-step process.  The   */
--/*  first step is to walk from endpoint1 to endpoint2, flipping each edge    */
--/*  encountered.  This step creates a fan of edges connected to endpoint1,   */
--/*  including the desired edge to endpoint2.  The second step enforces the   */
--/*  Delaunay condition on each side of the segment in an incremental manner: */
--/*  proceeding along the polygon from endpoint1 to endpoint2 (this is done   */
--/*  independently on each side of the segment), each vertex is "enforced"    */
--/*  as if it had just been inserted, but affecting only the previous         */
--/*  vertices.  The result is the same as if the vertices had been inserted   */
--/*  in the order they appear on the polygon, so the result is Delaunay.      */
--/*                                                                           */
--/*  In truth, constrainededge() interleaves these two steps.  The procedure  */
--/*  walks from endpoint1 to endpoint2, and each time an edge is encountered  */
--/*  and flipped, the newly exposed vertex (at the far end of the flipped     */
--/*  edge) is "enforced" upon the previously flipped edges, usually affecting */
--/*  only one side of the polygon (depending upon which side of the segment   */
--/*  the vertex falls on).                                                    */
--/*                                                                           */
--/*  The algorithm is complicated by the need to handle polygons that are not */
--/*  convex.  Although the polygon is not necessarily monotone, it can be     */
--/*  triangulated in a manner similar to the stack-based algorithms for       */
--/*  monotone polygons.  For each reflex vertex (local concavity) of the      */
--/*  polygon, there will be an inverted triangle formed by one of the edge    */
--/*  flips.  (An inverted triangle is one with negative area - that is, its   */
--/*  vertices are arranged in clockwise order - and is best thought of as a   */
--/*  wrinkle in the fabric of the mesh.)  Each inverted triangle can be       */
--/*  thought of as a reflex vertex pushed on the stack, waiting to be fixed   */
--/*  later.                                                                   */
--/*                                                                           */
--/*  A reflex vertex is popped from the stack when a vertex is inserted that  */
--/*  is visible to the reflex vertex.  (However, if the vertex behind the     */
--/*  reflex vertex is not visible to the reflex vertex, a new inverted        */
--/*  triangle will take its place on the stack.)  These details are handled   */
--/*  by the delaunayfixup() routine above.                                    */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifdef ANSI_DECLARATORS
--void constrainededge(struct mesh *m, struct behavior *b,
--                     struct otri *starttri, vertex endpoint2, int newmark)
--#else /* not ANSI_DECLARATORS */
--void constrainededge(m, b, starttri, endpoint2, newmark)
--struct mesh *m;
--struct behavior *b;
--struct otri *starttri;
--vertex endpoint2;
--int newmark;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  struct otri fixuptri, fixuptri2;
--  struct osub crosssubseg;
--  vertex endpoint1;
--  vertex farvertex;
--  REAL area;
--  int collision;
--  int done;
--  triangle ptr;             /* Temporary variable used by sym() and oprev(). */
--  subseg sptr;                      /* Temporary variable used by tspivot(). */
--
--  org(*starttri, endpoint1);
--  lnext(*starttri, fixuptri);
--  flip(m, b, &fixuptri);
--  /* `collision' indicates whether we have found a vertex directly */
--  /*   between endpoint1 and endpoint2.                            */
--  collision = 0;
--  done = 0;
--  do {
--    org(fixuptri, farvertex);
--    /* `farvertex' is the extreme point of the polygon we are "digging" */
--    /*   to get from endpoint1 to endpoint2.                           */
--    if ((farvertex[0] == endpoint2[0]) && (farvertex[1] == endpoint2[1])) {
--      oprev(fixuptri, fixuptri2);
--      /* Enforce the Delaunay condition around endpoint2. */
--      delaunayfixup(m, b, &fixuptri, 0);
--      delaunayfixup(m, b, &fixuptri2, 1);
--      done = 1;
--    } else {
--      /* Check whether farvertex is to the left or right of the segment */
--      /*   being inserted, to decide which edge of fixuptri to dig      */
--      /*   through next.                                                */
--      area = counterclockwise(m, b, endpoint1, endpoint2, farvertex);
--      if (area == 0.0) {
--        /* We've collided with a vertex between endpoint1 and endpoint2. */
--        collision = 1;
--        oprev(fixuptri, fixuptri2);
--        /* Enforce the Delaunay condition around farvertex. */
--        delaunayfixup(m, b, &fixuptri, 0);
--        delaunayfixup(m, b, &fixuptri2, 1);
--        done = 1;
--      } else {
--        if (area > 0.0) {        /* farvertex is to the left of the segment. */
--          oprev(fixuptri, fixuptri2);
--          /* Enforce the Delaunay condition around farvertex, on the */
--          /*   left side of the segment only.                        */
--          delaunayfixup(m, b, &fixuptri2, 1);
--          /* Flip the edge that crosses the segment.  After the edge is */
--          /*   flipped, one of its endpoints is the fan vertex, and the */
--          /*   destination of fixuptri is the fan vertex.               */
--          lprevself(fixuptri);
--        } else {                /* farvertex is to the right of the segment. */
--          delaunayfixup(m, b, &fixuptri, 0);
--          /* Flip the edge that crosses the segment.  After the edge is */
--          /*   flipped, one of its endpoints is the fan vertex, and the */
--          /*   destination of fixuptri is the fan vertex.               */
--          oprevself(fixuptri);
--        }
--        /* Check for two intersecting segments. */
--        tspivot(fixuptri, crosssubseg);
--        if (crosssubseg.ss == m->dummysub) {
--          flip(m, b, &fixuptri);    /* May create inverted triangle at left. */
--        } else {
--          /* We've collided with a segment between endpoint1 and endpoint2. */
--          collision = 1;
--          /* Insert a vertex at the intersection. */
--          segmentintersection(m, b, &fixuptri, &crosssubseg, endpoint2);
--          done = 1;
--        }
--      }
--    }
--  } while (!done);
--  /* Insert a subsegment to make the segment permanent. */
--  insertsubseg(m, b, &fixuptri, newmark);
--  /* If there was a collision with an interceding vertex, install another */
--  /*   segment connecting that vertex with endpoint2.                     */
--  if (collision) {
--    /* Insert the remainder of the segment. */
--    if (!scoutsegment(m, b, &fixuptri, endpoint2, newmark)) {
--      constrainededge(m, b, &fixuptri, endpoint2, newmark);
--    }
--  }
--}
--
--/*****************************************************************************/
--/*                                                                           */
--/*  insertsegment()   Insert a PSLG segment into a triangulation.            */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifdef ANSI_DECLARATORS
--void insertsegment(struct mesh *m, struct behavior *b,
--                   vertex endpoint1, vertex endpoint2, int newmark)
--#else /* not ANSI_DECLARATORS */
--void insertsegment(m, b, endpoint1, endpoint2, newmark)
--struct mesh *m;
--struct behavior *b;
--vertex endpoint1;
--vertex endpoint2;
--int newmark;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  struct otri searchtri1, searchtri2;
--  triangle encodedtri;
--  vertex checkvertex;
--  triangle ptr;                         /* Temporary variable used by sym(). */
--
--  if (b->verbose > 1) {
--    printf("  Connecting (%.12g, %.12g) to (%.12g, %.12g).\n",
--           endpoint1[0], endpoint1[1], endpoint2[0], endpoint2[1]);
--  }
--
--  /* Find a triangle whose origin is the segment's first endpoint. */
--  checkvertex = (vertex) NULL;
--  encodedtri = vertex2tri(endpoint1);
--  if (encodedtri != (triangle) NULL) {
--    decode(encodedtri, searchtri1);
--    org(searchtri1, checkvertex);
--  }
--  if (checkvertex != endpoint1) {
--    /* Find a boundary triangle to search from. */
--    searchtri1.tri = m->dummytri;
--    searchtri1.orient = 0;
--    symself(searchtri1);
--    /* Search for the segment's first endpoint by point location. */
--    if (locate(m, b, endpoint1, &searchtri1) != ONVERTEX) {
--      printf(
--        "Internal error in insertsegment():  Unable to locate PSLG vertex\n");
--      printf("  (%.12g, %.12g) in triangulation.\n",
--             endpoint1[0], endpoint1[1]);
--      internalerror();
--    }
--  }
--  /* Remember this triangle to improve subsequent point location. */
--  otricopy(searchtri1, m->recenttri);
--  /* Scout the beginnings of a path from the first endpoint */
--  /*   toward the second.                                   */
--  if (scoutsegment(m, b, &searchtri1, endpoint2, newmark)) {
--    /* The segment was easily inserted. */
--    return;
--  }
--  /* The first endpoint may have changed if a collision with an intervening */
--  /*   vertex on the segment occurred.                                      */
--  org(searchtri1, endpoint1);
--
--  /* Find a triangle whose origin is the segment's second endpoint. */
--  checkvertex = (vertex) NULL;
--  encodedtri = vertex2tri(endpoint2);
--  if (encodedtri != (triangle) NULL) {
--    decode(encodedtri, searchtri2);
--    org(searchtri2, checkvertex);
--  }
--  if (checkvertex != endpoint2) {
--    /* Find a boundary triangle to search from. */
--    searchtri2.tri = m->dummytri;
--    searchtri2.orient = 0;
--    symself(searchtri2);
--    /* Search for the segment's second endpoint by point location. */
--    if (locate(m, b, endpoint2, &searchtri2) != ONVERTEX) {
--      printf(
--        "Internal error in insertsegment():  Unable to locate PSLG vertex\n");
--      printf("  (%.12g, %.12g) in triangulation.\n",
--             endpoint2[0], endpoint2[1]);
--      internalerror();
--    }
--  }
--  /* Remember this triangle to improve subsequent point location. */
--  otricopy(searchtri2, m->recenttri);
--  /* Scout the beginnings of a path from the second endpoint */
--  /*   toward the first.                                     */
--  if (scoutsegment(m, b, &searchtri2, endpoint1, newmark)) {
--    /* The segment was easily inserted. */
--    return;
--  }
--  /* The second endpoint may have changed if a collision with an intervening */
--  /*   vertex on the segment occurred.                                       */
--  org(searchtri2, endpoint2);
--
--#ifndef REDUCED
--#ifndef CDT_ONLY
--  if (b->splitseg) {
--    /* Insert vertices to force the segment into the triangulation. */
--    conformingedge(m, b, endpoint1, endpoint2, newmark);
--  } else {
--#endif /* not CDT_ONLY */
--#endif /* not REDUCED */
--    /* Insert the segment directly into the triangulation. */
--    constrainededge(m, b, &searchtri1, endpoint2, newmark);
--#ifndef REDUCED
--#ifndef CDT_ONLY
--  }
--#endif /* not CDT_ONLY */
--#endif /* not REDUCED */
--}
--
--/*****************************************************************************/
--/*                                                                           */
--/*  markhull()   Cover the convex hull of a triangulation with subsegments.  */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifdef ANSI_DECLARATORS
--void markhull(struct mesh *m, struct behavior *b)
--#else /* not ANSI_DECLARATORS */
--void markhull(m, b)
--struct mesh *m;
--struct behavior *b;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  struct otri hulltri;
--  struct otri nexttri;
--  struct otri starttri;
--  triangle ptr;             /* Temporary variable used by sym() and oprev(). */
--
--  /* Find a triangle handle on the hull. */
--  hulltri.tri = m->dummytri;
--  hulltri.orient = 0;
--  symself(hulltri);
--  /* Remember where we started so we know when to stop. */
--  otricopy(hulltri, starttri);
--  /* Go once counterclockwise around the convex hull. */
--  do {
--    /* Create a subsegment if there isn't already one here. */
--    insertsubseg(m, b, &hulltri, 1);
--    /* To find the next hull edge, go clockwise around the next vertex. */
--    lnextself(hulltri);
--    oprev(hulltri, nexttri);
--    while (nexttri.tri != m->dummytri) {
--      otricopy(nexttri, hulltri);
--      oprev(hulltri, nexttri);
--    }
--  } while (!otriequal(hulltri, starttri));
--}
--
--/*****************************************************************************/
--/*                                                                           */
--/*  formskeleton()   Create the segments of a triangulation, including PSLG  */
--/*                   segments and edges on the convex hull.                  */
--/*                                                                           */
--/*  The PSLG segments are read from a .poly file.  The return value is the   */
--/*  number of segments in the file.                                          */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifdef TRILIBRARY
--
--#ifdef ANSI_DECLARATORS
--void formskeleton(struct mesh *m, struct behavior *b, int *segmentlist,
--                  int *segmentmarkerlist, int numberofsegments)
--#else /* not ANSI_DECLARATORS */
--void formskeleton(m, b, segmentlist, segmentmarkerlist, numberofsegments)
--struct mesh *m;
--struct behavior *b;
--int *segmentlist;
--int *segmentmarkerlist;
--int numberofsegments;
--#endif /* not ANSI_DECLARATORS */
--
--#else /* not TRILIBRARY */
--
--#ifdef ANSI_DECLARATORS
--void formskeleton(struct mesh *m, struct behavior *b,
--                  FILE *polyfile, char *polyfilename)
--#else /* not ANSI_DECLARATORS */
--void formskeleton(m, b, polyfile, polyfilename)
--struct mesh *m;
--struct behavior *b;
--FILE *polyfile;
--char *polyfilename;
--#endif /* not ANSI_DECLARATORS */
--
--#endif /* not TRILIBRARY */
--
--{
--#ifdef TRILIBRARY
--  char polyfilename[6];
--  int index;
--#else /* not TRILIBRARY */
--  char inputline[INPUTLINESIZE];
--  char *stringptr;
--#endif /* not TRILIBRARY */
--  vertex endpoint1, endpoint2;
--  int segmentmarkers;
--  int end1, end2;
--  int boundmarker;
--  int i;
--
--  if (b->poly) {
--    if (!b->quiet) {
--      printf("Recovering segments in Delaunay triangulation.\n");
--    }
--#ifdef TRILIBRARY
--    strcpy(polyfilename, "input");
--    m->insegments = numberofsegments;
--    segmentmarkers = segmentmarkerlist != (int *) NULL;
--    index = 0;
--#else /* not TRILIBRARY */
--    /* Read the segments from a .poly file. */
--    /* Read number of segments and number of boundary markers. */
--    stringptr = readline(inputline, polyfile, polyfilename);
--    m->insegments = (int) strtol(stringptr, &stringptr, 0);
--    stringptr = findfield(stringptr);
--    if (*stringptr == '\0') {
--      segmentmarkers = 0;
--    } else {
--      segmentmarkers = (int) strtol(stringptr, &stringptr, 0);
--    }
--#endif /* not TRILIBRARY */
--    /* If the input vertices are collinear, there is no triangulation, */
--    /*   so don't try to insert segments.                              */
--    if (m->triangles.items == 0) {
--      return;
--    }
--
--    /* If segments are to be inserted, compute a mapping */
--    /*   from vertices to triangles.                     */
--    if (m->insegments > 0) {
--      makevertexmap(m, b);
--      if (b->verbose) {
--        printf("  Recovering PSLG segments.\n");
--      }
--    }
--
--    boundmarker = 0;
--    /* Read and insert the segments. */
--    for (i = 0; i < m->insegments; i++) {
--#ifdef TRILIBRARY
--      end1 = segmentlist[index++];
--      end2 = segmentlist[index++];
--      if (segmentmarkers) {
--        boundmarker = segmentmarkerlist[i];
--      }
--#else /* not TRILIBRARY */
--      stringptr = readline(inputline, polyfile, b->inpolyfilename);
--      stringptr = findfield(stringptr);
--      if (*stringptr == '\0') {
--        printf("Error:  Segment %d has no endpoints in %s.\n",
--               b->firstnumber + i, polyfilename);
--        triexit(1);
--      } else {
--        end1 = (int) strtol(stringptr, &stringptr, 0);
--      }
--      stringptr = findfield(stringptr);
--      if (*stringptr == '\0') {
--        printf("Error:  Segment %d is missing its second endpoint in %s.\n",
--               b->firstnumber + i, polyfilename);
--        triexit(1);
--      } else {
--        end2 = (int) strtol(stringptr, &stringptr, 0);
--      }
--      if (segmentmarkers) {
--        stringptr = findfield(stringptr);
--        if (*stringptr == '\0') {
--          boundmarker = 0;
--        } else {
--          boundmarker = (int) strtol(stringptr, &stringptr, 0);
--        }
--      }
--#endif /* not TRILIBRARY */
--      if ((end1 < b->firstnumber) ||
--          (end1 >= b->firstnumber + m->invertices)) {
--        if (!b->quiet) {
--          printf("Warning:  Invalid first endpoint of segment %d in %s.\n",
--                 b->firstnumber + i, polyfilename);
--        }
--      } else if ((end2 < b->firstnumber) ||
--                 (end2 >= b->firstnumber + m->invertices)) {
--        if (!b->quiet) {
--          printf("Warning:  Invalid second endpoint of segment %d in %s.\n",
--                 b->firstnumber + i, polyfilename);
--        }
--      } else {
--        /* Find the vertices numbered `end1' and `end2'. */
--        endpoint1 = getvertex(m, b, end1);
--        endpoint2 = getvertex(m, b, end2);
--        if ((endpoint1[0] == endpoint2[0]) && (endpoint1[1] == endpoint2[1])) {
--          if (!b->quiet) {
--            printf("Warning:  Endpoints of segment %d are coincident in %s.\n",
--                   b->firstnumber + i, polyfilename);
--          }
--        } else {
--          insertsegment(m, b, endpoint1, endpoint2, boundmarker);
--        }
--      }
--    }
--  } else {
--    m->insegments = 0;
--  }
--  if (b->convex || !b->poly) {
--    /* Enclose the convex hull with subsegments. */
--    if (b->verbose) {
--      printf("  Enclosing convex hull with segments.\n");
--    }
--    markhull(m, b);
--  }
--}
--
--/**                                                                         **/
--/**                                                                         **/
--/********* Segment insertion ends here                               *********/
--
--/********* Carving out holes and concavities begins here             *********/
--/**                                                                         **/
--/**                                                                         **/
--
--/*****************************************************************************/
--/*                                                                           */
--/*  infecthull()   Virally infect all of the triangles of the convex hull    */
--/*                 that are not protected by subsegments.  Where there are   */
--/*                 subsegments, set boundary markers as appropriate.         */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifdef ANSI_DECLARATORS
--void infecthull(struct mesh *m, struct behavior *b)
--#else /* not ANSI_DECLARATORS */
--void infecthull(m, b)
--struct mesh *m;
--struct behavior *b;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  struct otri hulltri;
--  struct otri nexttri;
--  struct otri starttri;
--  struct osub hullsubseg;
--  triangle **deadtriangle;
--  vertex horg, hdest;
--  triangle ptr;                         /* Temporary variable used by sym(). */
--  subseg sptr;                      /* Temporary variable used by tspivot(). */
--
--  if (b->verbose) {
--    printf("  Marking concavities (external triangles) for elimination.\n");
--  }
--  /* Find a triangle handle on the hull. */
--  hulltri.tri = m->dummytri;
--  hulltri.orient = 0;
--  symself(hulltri);
--  /* Remember where we started so we know when to stop. */
--  otricopy(hulltri, starttri);
--  /* Go once counterclockwise around the convex hull. */
--  do {
--    /* Ignore triangles that are already infected. */
--    if (!infected(hulltri)) {
--      /* Is the triangle protected by a subsegment? */
--      tspivot(hulltri, hullsubseg);
--      if (hullsubseg.ss == m->dummysub) {
--        /* The triangle is not protected; infect it. */
--        if (!infected(hulltri)) {
--          infect(hulltri);
--          deadtriangle = (triangle **) poolalloc(&m->viri);
--          *deadtriangle = hulltri.tri;
--        }
--      } else {
--        /* The triangle is protected; set boundary markers if appropriate. */
--        if (mark(hullsubseg) == 0) {
--          setmark(hullsubseg, 1);
--          org(hulltri, horg);
--          dest(hulltri, hdest);
--          if (vertexmark(horg) == 0) {
--            setvertexmark(horg, 1);
--          }
--          if (vertexmark(hdest) == 0) {
--            setvertexmark(hdest, 1);
--          }
--        }
--      }
--    }
--    /* To find the next hull edge, go clockwise around the next vertex. */
--    lnextself(hulltri);
--    oprev(hulltri, nexttri);
--    while (nexttri.tri != m->dummytri) {
--      otricopy(nexttri, hulltri);
--      oprev(hulltri, nexttri);
--    }
--  } while (!otriequal(hulltri, starttri));
--}
--
--/*****************************************************************************/
--/*                                                                           */
--/*  plague()   Spread the virus from all infected triangles to any neighbors */
--/*             not protected by subsegments.  Delete all infected triangles. */
--/*                                                                           */
--/*  This is the procedure that actually creates holes and concavities.       */
--/*                                                                           */
--/*  This procedure operates in two phases.  The first phase identifies all   */
--/*  the triangles that will die, and marks them as infected.  They are       */
--/*  marked to ensure that each triangle is added to the virus pool only      */
--/*  once, so the procedure will terminate.                                   */
--/*                                                                           */
--/*  The second phase actually eliminates the infected triangles.  It also    */
--/*  eliminates orphaned vertices.                                            */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifdef ANSI_DECLARATORS
--void plague(struct mesh *m, struct behavior *b)
--#else /* not ANSI_DECLARATORS */
--void plague(m, b)
--struct mesh *m;
--struct behavior *b;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  struct otri testtri;
--  struct otri neighbor;
--  triangle **virusloop;
--  triangle **deadtriangle;
--  struct osub neighborsubseg;
--  vertex testvertex;
--  vertex norg, ndest;
--  vertex deadorg, deaddest, deadapex;
--  int killorg;
--  triangle ptr;             /* Temporary variable used by sym() and onext(). */
--  subseg sptr;                      /* Temporary variable used by tspivot(). */
--
--  if (b->verbose) {
--    printf("  Marking neighbors of marked triangles.\n");
--  }
--  /* Loop through all the infected triangles, spreading the virus to */
--  /*   their neighbors, then to their neighbors' neighbors.          */
--  traversalinit(&m->viri);
--  virusloop = (triangle **) traverse(&m->viri);
--  while (virusloop != (triangle **) NULL) {
--    testtri.tri = *virusloop;
--    /* A triangle is marked as infected by messing with one of its pointers */
--    /*   to subsegments, setting it to an illegal value.  Hence, we have to */
--    /*   temporarily uninfect this triangle so that we can examine its      */
--    /*   adjacent subsegments.                                              */
--    uninfect(testtri);
--    if (b->verbose > 2) {
--      /* Assign the triangle an orientation for convenience in */
--      /*   checking its vertices.                              */
--      testtri.orient = 0;
--      org(testtri, deadorg);
--      dest(testtri, deaddest);
--      apex(testtri, deadapex);
--      printf("    Checking (%.12g, %.12g) (%.12g, %.12g) (%.12g, %.12g)\n",
--             deadorg[0], deadorg[1], deaddest[0], deaddest[1],
--             deadapex[0], deadapex[1]);
--    }
--    /* Check each of the triangle's three neighbors. */
--    for (testtri.orient = 0; testtri.orient < 3; testtri.orient++) {
--      /* Find the neighbor. */
--      sym(testtri, neighbor);
--      /* Check for a subsegment between the triangle and its neighbor. */
--      tspivot(testtri, neighborsubseg);
--      /* Check if the neighbor is nonexistent or already infected. */
--      if ((neighbor.tri == m->dummytri) || infected(neighbor)) {
--        if (neighborsubseg.ss != m->dummysub) {
--          /* There is a subsegment separating the triangle from its      */
--          /*   neighbor, but both triangles are dying, so the subsegment */
--          /*   dies too.                                                 */
--          subsegdealloc(m, neighborsubseg.ss);
--          if (neighbor.tri != m->dummytri) {
--            /* Make sure the subsegment doesn't get deallocated again */
--            /*   later when the infected neighbor is visited.         */
--            uninfect(neighbor);
--            tsdissolve(neighbor);
--            infect(neighbor);
--          }
--        }
--      } else {                   /* The neighbor exists and is not infected. */
--        if (neighborsubseg.ss == m->dummysub) {
--          /* There is no subsegment protecting the neighbor, so */
--          /*   the neighbor becomes infected.                   */
--          if (b->verbose > 2) {
--            org(neighbor, deadorg);
--            dest(neighbor, deaddest);
--            apex(neighbor, deadapex);
--            printf(
--              "    Marking (%.12g, %.12g) (%.12g, %.12g) (%.12g, %.12g)\n",
--                   deadorg[0], deadorg[1], deaddest[0], deaddest[1],
--                   deadapex[0], deadapex[1]);
--          }
--          infect(neighbor);
--          /* Ensure that the neighbor's neighbors will be infected. */
--          deadtriangle = (triangle **) poolalloc(&m->viri);
--          *deadtriangle = neighbor.tri;
--        } else {               /* The neighbor is protected by a subsegment. */
--          /* Remove this triangle from the subsegment. */
--          stdissolve(neighborsubseg);
--          /* The subsegment becomes a boundary.  Set markers accordingly. */
--          if (mark(neighborsubseg) == 0) {
--            setmark(neighborsubseg, 1);
--          }
--          org(neighbor, norg);
--          dest(neighbor, ndest);
--          if (vertexmark(norg) == 0) {
--            setvertexmark(norg, 1);
--          }
--          if (vertexmark(ndest) == 0) {
--            setvertexmark(ndest, 1);
--          }
--        }
--      }
--    }
--    /* Remark the triangle as infected, so it doesn't get added to the */
--    /*   virus pool again.                                             */
--    infect(testtri);
--    virusloop = (triangle **) traverse(&m->viri);
--  }
--
--  if (b->verbose) {
--    printf("  Deleting marked triangles.\n");
--  }
--
--  traversalinit(&m->viri);
--  virusloop = (triangle **) traverse(&m->viri);
--  while (virusloop != (triangle **) NULL) {
--    testtri.tri = *virusloop;
--
--    /* Check each of the three corners of the triangle for elimination. */
--    /*   This is done by walking around each vertex, checking if it is  */
--    /*   still connected to at least one live triangle.                 */
--    for (testtri.orient = 0; testtri.orient < 3; testtri.orient++) {
--      org(testtri, testvertex);
--      /* Check if the vertex has already been tested. */
--      if (testvertex != (vertex) NULL) {
--        killorg = 1;
--        /* Mark the corner of the triangle as having been tested. */
--        setorg(testtri, NULL);
--        /* Walk counterclockwise about the vertex. */
--        onext(testtri, neighbor);
--        /* Stop upon reaching a boundary or the starting triangle. */
--        while ((neighbor.tri != m->dummytri) &&
--               (!otriequal(neighbor, testtri))) {
--          if (infected(neighbor)) {
--            /* Mark the corner of this triangle as having been tested. */
--            setorg(neighbor, NULL);
--          } else {
--            /* A live triangle.  The vertex survives. */
--            killorg = 0;
--          }
--          /* Walk counterclockwise about the vertex. */
--          onextself(neighbor);
--        }
--        /* If we reached a boundary, we must walk clockwise as well. */
--        if (neighbor.tri == m->dummytri) {
--          /* Walk clockwise about the vertex. */
--          oprev(testtri, neighbor);
--          /* Stop upon reaching a boundary. */
--          while (neighbor.tri != m->dummytri) {
--            if (infected(neighbor)) {
--            /* Mark the corner of this triangle as having been tested. */
--              setorg(neighbor, NULL);
--            } else {
--              /* A live triangle.  The vertex survives. */
--              killorg = 0;
--            }
--            /* Walk clockwise about the vertex. */
--            oprevself(neighbor);
--          }
--        }
--        if (killorg) {
--          if (b->verbose > 1) {
--            printf("    Deleting vertex (%.12g, %.12g)\n",
--                   testvertex[0], testvertex[1]);
--          }
--          setvertextype(testvertex, UNDEADVERTEX);
--          m->undeads++;
--        }
--      }
--    }
--
--    /* Record changes in the number of boundary edges, and disconnect */
--    /*   dead triangles from their neighbors.                         */
--    for (testtri.orient = 0; testtri.orient < 3; testtri.orient++) {
--      sym(testtri, neighbor);
--      if (neighbor.tri == m->dummytri) {
--        /* There is no neighboring triangle on this edge, so this edge    */
--        /*   is a boundary edge.  This triangle is being deleted, so this */
--        /*   boundary edge is deleted.                                    */
--        m->hullsize--;
--      } else {
--        /* Disconnect the triangle from its neighbor. */
--        dissolve(neighbor);
--        /* There is a neighboring triangle on this edge, so this edge */
--        /*   becomes a boundary edge when this triangle is deleted.   */
--        m->hullsize++;
--      }
--    }
--    /* Return the dead triangle to the pool of triangles. */
--    triangledealloc(m, testtri.tri);
--    virusloop = (triangle **) traverse(&m->viri);
--  }
--  /* Empty the virus pool. */
--  poolrestart(&m->viri);
--}
--
--/*****************************************************************************/
--/*                                                                           */
--/*  regionplague()   Spread regional attributes and/or area constraints      */
--/*                   (from a .poly file) throughout the mesh.                */
--/*                                                                           */
--/*  This procedure operates in two phases.  The first phase spreads an       */
--/*  attribute and/or an area constraint through a (segment-bounded) region.  */
--/*  The triangles are marked to ensure that each triangle is added to the    */
--/*  virus pool only once, so the procedure will terminate.                   */
--/*                                                                           */
--/*  The second phase uninfects all infected triangles, returning them to     */
--/*  normal.                                                                  */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifdef ANSI_DECLARATORS
--void regionplague(struct mesh *m, struct behavior *b,
--                  REAL attribute, REAL area)
--#else /* not ANSI_DECLARATORS */
--void regionplague(m, b, attribute, area)
--struct mesh *m;
--struct behavior *b;
--REAL attribute;
--REAL area;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  struct otri testtri;
--  struct otri neighbor;
--  triangle **virusloop;
--  triangle **regiontri;
--  struct osub neighborsubseg;
--  vertex regionorg, regiondest, regionapex;
--  triangle ptr;             /* Temporary variable used by sym() and onext(). */
--  subseg sptr;                      /* Temporary variable used by tspivot(). */
--
--  if (b->verbose > 1) {
--    printf("  Marking neighbors of marked triangles.\n");
--  }
--  /* Loop through all the infected triangles, spreading the attribute      */
--  /*   and/or area constraint to their neighbors, then to their neighbors' */
--  /*   neighbors.                                                          */
--  traversalinit(&m->viri);
--  virusloop = (triangle **) traverse(&m->viri);
--  while (virusloop != (triangle **) NULL) {
--    testtri.tri = *virusloop;
--    /* A triangle is marked as infected by messing with one of its pointers */
--    /*   to subsegments, setting it to an illegal value.  Hence, we have to */
--    /*   temporarily uninfect this triangle so that we can examine its      */
--    /*   adjacent subsegments.                                              */
--    uninfect(testtri);
--    if (b->regionattrib) {
--      /* Set an attribute. */
--      setelemattribute(testtri, m->eextras, attribute);
--    }
--    if (b->vararea) {
--      /* Set an area constraint. */
--      setareabound(testtri, area);
--    }
--    if (b->verbose > 2) {
--      /* Assign the triangle an orientation for convenience in */
--      /*   checking its vertices.                              */
--      testtri.orient = 0;
--      org(testtri, regionorg);
--      dest(testtri, regiondest);
--      apex(testtri, regionapex);
--      printf("    Checking (%.12g, %.12g) (%.12g, %.12g) (%.12g, %.12g)\n",
--             regionorg[0], regionorg[1], regiondest[0], regiondest[1],
--             regionapex[0], regionapex[1]);
--    }
--    /* Check each of the triangle's three neighbors. */
--    for (testtri.orient = 0; testtri.orient < 3; testtri.orient++) {
--      /* Find the neighbor. */
--      sym(testtri, neighbor);
--      /* Check for a subsegment between the triangle and its neighbor. */
--      tspivot(testtri, neighborsubseg);
--      /* Make sure the neighbor exists, is not already infected, and */
--      /*   isn't protected by a subsegment.                          */
--      if ((neighbor.tri != m->dummytri) && !infected(neighbor)
--          && (neighborsubseg.ss == m->dummysub)) {
--        if (b->verbose > 2) {
--          org(neighbor, regionorg);
--          dest(neighbor, regiondest);
--          apex(neighbor, regionapex);
--          printf("    Marking (%.12g, %.12g) (%.12g, %.12g) (%.12g, %.12g)\n",
--                 regionorg[0], regionorg[1], regiondest[0], regiondest[1],
--                 regionapex[0], regionapex[1]);
--        }
--        /* Infect the neighbor. */
--        infect(neighbor);
--        /* Ensure that the neighbor's neighbors will be infected. */
--        regiontri = (triangle **) poolalloc(&m->viri);
--        *regiontri = neighbor.tri;
--      }
--    }
--    /* Remark the triangle as infected, so it doesn't get added to the */
--    /*   virus pool again.                                             */
--    infect(testtri);
--    virusloop = (triangle **) traverse(&m->viri);
--  }
--
--  /* Uninfect all triangles. */
--  if (b->verbose > 1) {
--    printf("  Unmarking marked triangles.\n");
--  }
--  traversalinit(&m->viri);
--  virusloop = (triangle **) traverse(&m->viri);
--  while (virusloop != (triangle **) NULL) {
--    testtri.tri = *virusloop;
--    uninfect(testtri);
--    virusloop = (triangle **) traverse(&m->viri);
--  }
--  /* Empty the virus pool. */
--  poolrestart(&m->viri);
--}
--
--/*****************************************************************************/
--/*                                                                           */
--/*  carveholes()   Find the holes and infect them.  Find the area            */
--/*                 constraints and infect them.  Infect the convex hull.     */
--/*                 Spread the infection and kill triangles.  Spread the      */
--/*                 area constraints.                                         */
--/*                                                                           */
--/*  This routine mainly calls other routines to carry out all these          */
--/*  functions.                                                               */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifdef ANSI_DECLARATORS
--void carveholes(struct mesh *m, struct behavior *b, REAL *holelist, int holes,
--                REAL *regionlist, int regions)
--#else /* not ANSI_DECLARATORS */
--void carveholes(m, b, holelist, holes, regionlist, regions)
--struct mesh *m;
--struct behavior *b;
--REAL *holelist;
--int holes;
--REAL *regionlist;
--int regions;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  struct otri searchtri;
--  struct otri triangleloop;
--  struct otri *regiontris;
--  triangle **holetri;
--  triangle **regiontri;
--  vertex searchorg, searchdest;
--  enum locateresult intersect;
--  int i;
--  triangle ptr;                         /* Temporary variable used by sym(). */
--
--  if (!(b->quiet || (b->noholes && b->convex))) {
--    printf("Removing unwanted triangles.\n");
--    if (b->verbose && (holes > 0)) {
--      printf("  Marking holes for elimination.\n");
--    }
--  }
--
--  if (regions > 0) {
--    /* Allocate storage for the triangles in which region points fall. */
--    regiontris = (struct otri *) trimalloc(regions *
--                                           (int) sizeof(struct otri));
--  } else {
--    regiontris = (struct otri *) NULL;
--  }
--
--  if (((holes > 0) && !b->noholes) || !b->convex || (regions > 0)) {
--    /* Initialize a pool of viri to be used for holes, concavities, */
--    /*   regional attributes, and/or regional area constraints.     */
--    poolinit(&m->viri, sizeof(triangle *), VIRUSPERBLOCK, VIRUSPERBLOCK, 0);
--  }
--
--  if (!b->convex) {
--    /* Mark as infected any unprotected triangles on the boundary. */
--    /*   This is one way by which concavities are created.         */
--    infecthull(m, b);
--  }
--
--  if ((holes > 0) && !b->noholes) {
--    /* Infect each triangle in which a hole lies. */
--    for (i = 0; i < 2 * holes; i += 2) {
--      /* Ignore holes that aren't within the bounds of the mesh. */
--      if ((holelist[i] >= m->xmin) && (holelist[i] <= m->xmax)
--          && (holelist[i + 1] >= m->ymin) && (holelist[i + 1] <= m->ymax)) {
--        /* Start searching from some triangle on the outer boundary. */
--        searchtri.tri = m->dummytri;
--        searchtri.orient = 0;
--        symself(searchtri);
--        /* Ensure that the hole is to the left of this boundary edge; */
--        /*   otherwise, locate() will falsely report that the hole    */
--        /*   falls within the starting triangle.                      */
--        org(searchtri, searchorg);
--        dest(searchtri, searchdest);
--        if (counterclockwise(m, b, searchorg, searchdest, &holelist[i]) >
--            0.0) {
--          /* Find a triangle that contains the hole. */
--          intersect = locate(m, b, &holelist[i], &searchtri);
--          if ((intersect != OUTSIDE) && (!infected(searchtri))) {
--            /* Infect the triangle.  This is done by marking the triangle  */
--            /*   as infected and including the triangle in the virus pool. */
--            infect(searchtri);
--            holetri = (triangle **) poolalloc(&m->viri);
--            *holetri = searchtri.tri;
--          }
--        }
--      }
--    }
--  }
--
--  /* Now, we have to find all the regions BEFORE we carve the holes, because */
--  /*   locate() won't work when the triangulation is no longer convex.       */
--  /*   (Incidentally, this is the reason why regional attributes and area    */
--  /*   constraints can't be used when refining a preexisting mesh, which     */
--  /*   might not be convex; they can only be used with a freshly             */
--  /*   triangulated PSLG.)                                                   */
--  if (regions > 0) {
--    /* Find the starting triangle for each region. */
--    for (i = 0; i < regions; i++) {
--      regiontris[i].tri = m->dummytri;
--      /* Ignore region points that aren't within the bounds of the mesh. */
--      if ((regionlist[4 * i] >= m->xmin) && (regionlist[4 * i] <= m->xmax) &&
--          (regionlist[4 * i + 1] >= m->ymin) &&
--          (regionlist[4 * i + 1] <= m->ymax)) {
--        /* Start searching from some triangle on the outer boundary. */
--        searchtri.tri = m->dummytri;
--        searchtri.orient = 0;
--        symself(searchtri);
--        /* Ensure that the region point is to the left of this boundary */
--        /*   edge; otherwise, locate() will falsely report that the     */
--        /*   region point falls within the starting triangle.           */
--        org(searchtri, searchorg);
--        dest(searchtri, searchdest);
--        if (counterclockwise(m, b, searchorg, searchdest, &regionlist[4 * i]) >
--            0.0) {
--          /* Find a triangle that contains the region point. */
--          intersect = locate(m, b, &regionlist[4 * i], &searchtri);
--          if ((intersect != OUTSIDE) && (!infected(searchtri))) {
--            /* Record the triangle for processing after the */
--            /*   holes have been carved.                    */
--            otricopy(searchtri, regiontris[i]);
--          }
--        }
--      }
--    }
--  }
--
--  if (m->viri.items > 0) {
--    /* Carve the holes and concavities. */
--    plague(m, b);
--  }
--  /* The virus pool should be empty now. */
--
--  if (regions > 0) {
--    if (!b->quiet) {
--      if (b->regionattrib) {
--        if (b->vararea) {
--          printf("Spreading regional attributes and area constraints.\n");
--        } else {
--          printf("Spreading regional attributes.\n");
--        }
--      } else {
--        printf("Spreading regional area constraints.\n");
--      }
--    }
--    if (b->regionattrib && !b->refine) {
--      /* Assign every triangle a regional attribute of zero. */
--      traversalinit(&m->triangles);
--      triangleloop.orient = 0;
--      triangleloop.tri = triangletraverse(m);
--      while (triangleloop.tri != (triangle *) NULL) {
--        setelemattribute(triangleloop, m->eextras, 0.0);
--        triangleloop.tri = triangletraverse(m);
--      }
--    }
--    for (i = 0; i < regions; i++) {
--      if (regiontris[i].tri != m->dummytri) {
--        /* Make sure the triangle under consideration still exists. */
--        /*   It may have been eaten by the virus.                   */
--        if (!deadtri(regiontris[i].tri)) {
--          /* Put one triangle in the virus pool. */
--          infect(regiontris[i]);
--          regiontri = (triangle **) poolalloc(&m->viri);
--          *regiontri = regiontris[i].tri;
--          /* Apply one region's attribute and/or area constraint. */
--          regionplague(m, b, regionlist[4 * i + 2], regionlist[4 * i + 3]);
--          /* The virus pool should be empty now. */
--        }
--      }
--    }
--    if (b->regionattrib && !b->refine) {
--      /* Note the fact that each triangle has an additional attribute. */
--      m->eextras++;
--    }
--  }
--
--  /* Free up memory. */
--  if (((holes > 0) && !b->noholes) || !b->convex || (regions > 0)) {
--    pooldeinit(&m->viri);
--  }
--  if (regions > 0) {
--    trifree((void *) regiontris);
--  }
--}
--
--/**                                                                         **/
--/**                                                                         **/
--/********* Carving out holes and concavities ends here               *********/
--
--/********* Mesh quality maintenance begins here                      *********/
--/**                                                                         **/
--/**                                                                         **/
--
--/*****************************************************************************/
--/*                                                                           */
--/*  tallyencs()   Traverse the entire list of subsegments, and check each    */
--/*                to see if it is encroached.  If so, add it to the list.    */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifndef CDT_ONLY
--
--#ifdef ANSI_DECLARATORS
--void tallyencs(struct mesh *m, struct behavior *b)
--#else /* not ANSI_DECLARATORS */
--void tallyencs(m, b)
--struct mesh *m;
--struct behavior *b;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  struct osub subsegloop;
--
--  traversalinit(&m->subsegs);
--  subsegloop.ssorient = 0;
--  subsegloop.ss = subsegtraverse(m);
--  while (subsegloop.ss != (subseg *) NULL) {
--    /* If the segment is encroached, add it to the list. */
--    checkseg4encroach(m, b, &subsegloop);
--    subsegloop.ss = subsegtraverse(m);
--  }
--}
--
--#endif /* not CDT_ONLY */
--
--/*****************************************************************************/
--/*                                                                           */
--/*  precisionerror()  Print an error message for precision problems.         */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifndef CDT_ONLY
--
--void precisionerror()
--{
--  printf("Try increasing the area criterion and/or reducing the minimum\n");
--  printf("  allowable angle so that tiny triangles are not created.\n");
--#ifdef SINGLE
--  printf("Alternatively, try recompiling me with double precision\n");
--  printf("  arithmetic (by removing \"#define SINGLE\" from the\n");
--  printf("  source file or \"-DSINGLE\" from the makefile).\n");
--#endif /* SINGLE */
--}
--
--#endif /* not CDT_ONLY */
--
--/*****************************************************************************/
--/*                                                                           */
--/*  splitencsegs()   Split all the encroached subsegments.                   */
--/*                                                                           */
--/*  Each encroached subsegment is repaired by splitting it - inserting a     */
--/*  vertex at or near its midpoint.  Newly inserted vertices may encroach    */
--/*  upon other subsegments; these are also repaired.                         */
--/*                                                                           */
--/*  `triflaws' is a flag that specifies whether one should take note of new  */
--/*  bad triangles that result from inserting vertices to repair encroached   */
--/*  subsegments.                                                             */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifndef CDT_ONLY
--
--#ifdef ANSI_DECLARATORS
--void splitencsegs(struct mesh *m, struct behavior *b, int triflaws)
--#else /* not ANSI_DECLARATORS */
--void splitencsegs(m, b, triflaws)
--struct mesh *m;
--struct behavior *b;
--int triflaws;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  struct otri enctri;
--  struct otri testtri;
--  struct osub testsh;
--  struct osub currentenc;
--  struct badsubseg *encloop;
--  vertex eorg, edest, eapex;
--  vertex newvertex;
--  enum insertvertexresult success;
--  REAL segmentlength, nearestpoweroftwo;
--  REAL split;
--  REAL multiplier, divisor;
--  int acuteorg, acuteorg2, acutedest, acutedest2;
--  int i;
--  triangle ptr;                     /* Temporary variable used by stpivot(). */
--  subseg sptr;                        /* Temporary variable used by snext(). */
--
--  /* Note that steinerleft == -1 if an unlimited number */
--  /*   of Steiner points is allowed.                    */
--  while ((m->badsubsegs.items > 0) && (m->steinerleft != 0)) {
--    traversalinit(&m->badsubsegs);
--    encloop = badsubsegtraverse(m);
--    while ((encloop != (struct badsubseg *) NULL) && (m->steinerleft != 0)) {
--      sdecode(encloop->encsubseg, currentenc);
--      sorg(currentenc, eorg);
--      sdest(currentenc, edest);
--      /* Make sure that this segment is still the same segment it was   */
--      /*   when it was determined to be encroached.  If the segment was */
--      /*   enqueued multiple times (because several newly inserted      */
--      /*   vertices encroached it), it may have already been split.     */
--      if (!deadsubseg(currentenc.ss) &&
--          (eorg == encloop->subsegorg) && (edest == encloop->subsegdest)) {
--        /* To decide where to split a segment, we need to know if the   */
--        /*   segment shares an endpoint with an adjacent segment.       */
--        /*   The concern is that, if we simply split every encroached   */
--        /*   segment in its center, two adjacent segments with a small  */
--        /*   angle between them might lead to an infinite loop; each    */
--        /*   vertex added to split one segment will encroach upon the   */
--        /*   other segment, which must then be split with a vertex that */
--        /*   will encroach upon the first segment, and so on forever.   */
--        /* To avoid this, imagine a set of concentric circles, whose    */
--        /*   radii are powers of two, about each segment endpoint.      */
--        /*   These concentric circles determine where the segment is    */
--        /*   split.  (If both endpoints are shared with adjacent        */
--        /*   segments, split the segment in the middle, and apply the   */
--        /*   concentric circles for later splittings.)                  */
--
--        /* Is the origin shared with another segment? */
--        stpivot(currentenc, enctri);
--        lnext(enctri, testtri);
--        tspivot(testtri, testsh);
--        acuteorg = testsh.ss != m->dummysub;
--        /* Is the destination shared with another segment? */
--        lnextself(testtri);
--        tspivot(testtri, testsh);
--        acutedest = testsh.ss != m->dummysub;
--
--        /* If we're using Chew's algorithm (rather than Ruppert's) */
--        /*   to define encroachment, delete free vertices from the */
--        /*   subsegment's diametral circle.                        */
--        if (!b->conformdel && !acuteorg && !acutedest) {
--          apex(enctri, eapex);
--          while ((vertextype(eapex) == FREEVERTEX) &&
--                 ((eorg[0] - eapex[0]) * (edest[0] - eapex[0]) +
--                  (eorg[1] - eapex[1]) * (edest[1] - eapex[1]) < 0.0)) {
--            deletevertex(m, b, &testtri);
--            stpivot(currentenc, enctri);
--            apex(enctri, eapex);
--            lprev(enctri, testtri);
--          }
--        }
--
--        /* Now, check the other side of the segment, if there's a triangle */
--        /*   there.                                                        */
--        sym(enctri, testtri);
--        if (testtri.tri != m->dummytri) {
--          /* Is the destination shared with another segment? */
--          lnextself(testtri);
--          tspivot(testtri, testsh);
--          acutedest2 = testsh.ss != m->dummysub;
--          acutedest = acutedest || acutedest2;
--          /* Is the origin shared with another segment? */
--          lnextself(testtri);
--          tspivot(testtri, testsh);
--          acuteorg2 = testsh.ss != m->dummysub;
--          acuteorg = acuteorg || acuteorg2;
--
--          /* Delete free vertices from the subsegment's diametral circle. */
--          if (!b->conformdel && !acuteorg2 && !acutedest2) {
--            org(testtri, eapex);
--            while ((vertextype(eapex) == FREEVERTEX) &&
--                   ((eorg[0] - eapex[0]) * (edest[0] - eapex[0]) +
--                    (eorg[1] - eapex[1]) * (edest[1] - eapex[1]) < 0.0)) {
--              deletevertex(m, b, &testtri);
--              sym(enctri, testtri);
--              apex(testtri, eapex);
--              lprevself(testtri);
--            }
--          }
--        }
--
--        /* Use the concentric circles if exactly one endpoint is shared */
--        /*   with another adjacent segment.                             */
--        if (acuteorg || acutedest) {
--          segmentlength = sqrt((edest[0] - eorg[0]) * (edest[0] - eorg[0]) +
--                               (edest[1] - eorg[1]) * (edest[1] - eorg[1]));
--          /* Find the power of two that most evenly splits the segment.  */
--          /*   The worst case is a 2:1 ratio between subsegment lengths. */
--          nearestpoweroftwo = 1.0;
--          while (segmentlength > 3.0 * nearestpoweroftwo) {
--            nearestpoweroftwo *= 2.0;
--          }
--          while (segmentlength < 1.5 * nearestpoweroftwo) {
--            nearestpoweroftwo *= 0.5;
--          }
--          /* Where do we split the segment? */
--          split = nearestpoweroftwo / segmentlength;
--          if (acutedest) {
--            split = 1.0 - split;
--          }
--        } else {
--          /* If we're not worried about adjacent segments, split */
--          /*   this segment in the middle.                       */
--          split = 0.5;
--        }
--
--        /* Create the new vertex. */
--        newvertex = (vertex) poolalloc(&m->vertices);
--        /* Interpolate its coordinate and attributes. */
--        for (i = 0; i < 2 + m->nextras; i++) {
--          newvertex[i] = eorg[i] + split * (edest[i] - eorg[i]);
--        }
--
--        if (!b->noexact) {
--          /* Roundoff in the above calculation may yield a `newvertex'   */
--          /*   that is not precisely collinear with `eorg' and `edest'.  */
--          /*   Improve collinearity by one step of iterative refinement. */
--          multiplier = counterclockwise(m, b, eorg, edest, newvertex);
--          divisor = ((eorg[0] - edest[0]) * (eorg[0] - edest[0]) +
--                     (eorg[1] - edest[1]) * (eorg[1] - edest[1]));
--          if ((multiplier != 0.0) && (divisor != 0.0)) {
--            multiplier = multiplier / divisor;
--            /* Watch out for NANs. */
--            if (multiplier == multiplier) {
--              newvertex[0] += multiplier * (edest[1] - eorg[1]);
--              newvertex[1] += multiplier * (eorg[0] - edest[0]);
--            }
--          }
--        }
--
--        setvertexmark(newvertex, mark(currentenc));
--        setvertextype(newvertex, SEGMENTVERTEX);
--        if (b->verbose > 1) {
--          printf(
--  "  Splitting subsegment (%.12g, %.12g) (%.12g, %.12g) at (%.12g, %.12g).\n",
--                 eorg[0], eorg[1], edest[0], edest[1],
--                 newvertex[0], newvertex[1]);
--        }
--        /* Check whether the new vertex lies on an endpoint. */
--        if (((newvertex[0] == eorg[0]) && (newvertex[1] == eorg[1])) ||
--            ((newvertex[0] == edest[0]) && (newvertex[1] == edest[1]))) {
--          printf("Error:  Ran out of precision at (%.12g, %.12g).\n",
--                 newvertex[0], newvertex[1]);
--          printf("I attempted to split a segment to a smaller size than\n");
--          printf("  can be accommodated by the finite precision of\n");
--          printf("  floating point arithmetic.\n");
--          precisionerror();
--          triexit(1);
--        }
--        /* Insert the splitting vertex.  This should always succeed. */
--        success = insertvertex(m, b, newvertex, &enctri, &currentenc,
--                               1, triflaws);
--        if ((success != SUCCESSFULVERTEX) && (success != ENCROACHINGVERTEX)) {
--          printf("Internal error in splitencsegs():\n");
--          printf("  Failure to split a segment.\n");
--          internalerror();
--        }
--        if (m->steinerleft > 0) {
--          m->steinerleft--;
--        }
--        /* Check the two new subsegments to see if they're encroached. */
--        checkseg4encroach(m, b, &currentenc);
--        snextself(currentenc);
--        checkseg4encroach(m, b, &currentenc);
--      }
--
--      badsubsegdealloc(m, encloop);
--      encloop = badsubsegtraverse(m);
--    }
--  }
--}
--
--#endif /* not CDT_ONLY */
--
--/*****************************************************************************/
--/*                                                                           */
--/*  tallyfaces()   Test every triangle in the mesh for quality measures.     */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifndef CDT_ONLY
--
--#ifdef ANSI_DECLARATORS
--void tallyfaces(struct mesh *m, struct behavior *b)
--#else /* not ANSI_DECLARATORS */
--void tallyfaces(m, b)
--struct mesh *m;
--struct behavior *b;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  struct otri triangleloop;
--
--  if (b->verbose) {
--    printf("  Making a list of bad triangles.\n");
--  }
--  traversalinit(&m->triangles);
--  triangleloop.orient = 0;
--  triangleloop.tri = triangletraverse(m);
--  while (triangleloop.tri != (triangle *) NULL) {
--    /* If the triangle is bad, enqueue it. */
--    testtriangle(m, b, &triangleloop);
--    triangleloop.tri = triangletraverse(m);
--  }
--}
--
--#endif /* not CDT_ONLY */
--
--/*****************************************************************************/
--/*                                                                           */
--/*  splittriangle()   Inserts a vertex at the circumcenter of a triangle.    */
--/*                    Deletes the newly inserted vertex if it encroaches     */
--/*                    upon a segment.                                        */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifndef CDT_ONLY
--
--#ifdef ANSI_DECLARATORS
--void splittriangle(struct mesh *m, struct behavior *b,
--                   struct badtriang *badtri)
--#else /* not ANSI_DECLARATORS */
--void splittriangle(m, b, badtri)
--struct mesh *m;
--struct behavior *b;
--struct badtriang *badtri;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  struct otri badotri;
--  vertex borg, bdest, bapex;
--  vertex newvertex;
--  REAL xi, eta;
--  enum insertvertexresult success;
--  int errorflag;
--  int i;
--
--  decode(badtri->poortri, badotri);
--  org(badotri, borg);
--  dest(badotri, bdest);
--  apex(badotri, bapex);
--  /* Make sure that this triangle is still the same triangle it was      */
--  /*   when it was tested and determined to be of bad quality.           */
--  /*   Subsequent transformations may have made it a different triangle. */
--  if (!deadtri(badotri.tri) && (borg == badtri->triangorg) &&
--      (bdest == badtri->triangdest) && (bapex == badtri->triangapex)) {
--    if (b->verbose > 1) {
--      printf("  Splitting this triangle at its circumcenter:\n");
--      printf("    (%.12g, %.12g) (%.12g, %.12g) (%.12g, %.12g)\n", borg[0],
--             borg[1], bdest[0], bdest[1], bapex[0], bapex[1]);
--    }
--
--    errorflag = 0;
--    /* Create a new vertex at the triangle's circumcenter. */
--    newvertex = (vertex) poolalloc(&m->vertices);
--    findcircumcenter(m, b, borg, bdest, bapex, newvertex, &xi, &eta, 1);
--
--    /* Check whether the new vertex lies on a triangle vertex. */
--    if (((newvertex[0] == borg[0]) && (newvertex[1] == borg[1])) ||
--        ((newvertex[0] == bdest[0]) && (newvertex[1] == bdest[1])) ||
--        ((newvertex[0] == bapex[0]) && (newvertex[1] == bapex[1]))) {
--      if (!b->quiet) {
--        printf(
--             "Warning:  New vertex (%.12g, %.12g) falls on existing vertex.\n",
--               newvertex[0], newvertex[1]);
--        errorflag = 1;
--      }
--      vertexdealloc(m, newvertex);
--    } else {
--      for (i = 2; i < 2 + m->nextras; i++) {
--        /* Interpolate the vertex attributes at the circumcenter. */
--        newvertex[i] = borg[i] + xi * (bdest[i] - borg[i])
--                              + eta * (bapex[i] - borg[i]);
--      }
--      /* The new vertex must be in the interior, and therefore is a */
--      /*   free vertex with a marker of zero.                       */
--      setvertexmark(newvertex, 0);
--      setvertextype(newvertex, FREEVERTEX);
--
--      /* Ensure that the handle `badotri' does not represent the longest  */
--      /*   edge of the triangle.  This ensures that the circumcenter must */
--      /*   fall to the left of this edge, so point location will work.    */
--      /*   (If the angle org-apex-dest exceeds 90 degrees, then the       */
--      /*   circumcenter lies outside the org-dest edge, and eta is        */
--      /*   negative.  Roundoff error might prevent eta from being         */
--      /*   negative when it should be, so I test eta against xi.)         */
--      if (eta < xi) {
--        lprevself(badotri);
--      }
--
--      /* Insert the circumcenter, searching from the edge of the triangle, */
--      /*   and maintain the Delaunay property of the triangulation.        */
--      success = insertvertex(m, b, newvertex, &badotri, (struct osub *) NULL,
--                             1, 1);
--      if (success == SUCCESSFULVERTEX) {
--        if (m->steinerleft > 0) {
--          m->steinerleft--;
--        }
--      } else if (success == ENCROACHINGVERTEX) {
--        /* If the newly inserted vertex encroaches upon a subsegment, */
--        /*   delete the new vertex.                                   */
--        undovertex(m, b);
--        if (b->verbose > 1) {
--          printf("  Rejecting (%.12g, %.12g).\n", newvertex[0], newvertex[1]);
--        }
--        vertexdealloc(m, newvertex);
--      } else if (success == VIOLATINGVERTEX) {
--        /* Failed to insert the new vertex, but some subsegment was */
--        /*   marked as being encroached.                            */
--        vertexdealloc(m, newvertex);
--      } else {                                 /* success == DUPLICATEVERTEX */
--        /* Couldn't insert the new vertex because a vertex is already there. */
--        if (!b->quiet) {
--          printf(
--            "Warning:  New vertex (%.12g, %.12g) falls on existing vertex.\n",
--                 newvertex[0], newvertex[1]);
--          errorflag = 1;
--        }
--        vertexdealloc(m, newvertex);
--      }
--    }
--    if (errorflag) {
--      if (b->verbose) {
--        printf("  The new vertex is at the circumcenter of triangle\n");
--        printf("    (%.12g, %.12g) (%.12g, %.12g) (%.12g, %.12g)\n",
--               borg[0], borg[1], bdest[0], bdest[1], bapex[0], bapex[1]);
--      }
--      printf("This probably means that I am trying to refine triangles\n");
--      printf("  to a smaller size than can be accommodated by the finite\n");
--      printf("  precision of floating point arithmetic.  (You can be\n");
--      printf("  sure of this if I fail to terminate.)\n");
--      precisionerror();
--    }
--  }
--}
--
--#endif /* not CDT_ONLY */
--
--/*****************************************************************************/
--/*                                                                           */
--/*  enforcequality()   Remove all the encroached subsegments and bad         */
--/*                     triangles from the triangulation.                     */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifndef CDT_ONLY
--
--#ifdef ANSI_DECLARATORS
--void enforcequality(struct mesh *m, struct behavior *b)
--#else /* not ANSI_DECLARATORS */
--void enforcequality(m, b)
--struct mesh *m;
--struct behavior *b;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  struct badtriang *badtri;
--  int i;
--
--  if (!b->quiet) {
--    printf("Adding Steiner points to enforce quality.\n");
--  }
--  /* Initialize the pool of encroached subsegments. */
--  poolinit(&m->badsubsegs, sizeof(struct badsubseg), BADSUBSEGPERBLOCK,
--           BADSUBSEGPERBLOCK, 0);
--  if (b->verbose) {
--    printf("  Looking for encroached subsegments.\n");
--  }
--  /* Test all segments to see if they're encroached. */
--  tallyencs(m, b);
--  if (b->verbose && (m->badsubsegs.items > 0)) {
--    printf("  Splitting encroached subsegments.\n");
--  }
--  /* Fix encroached subsegments without noting bad triangles. */
--  splitencsegs(m, b, 0);
--  /* At this point, if we haven't run out of Steiner points, the */
--  /*   triangulation should be (conforming) Delaunay.            */
--
--  /* Next, we worry about enforcing triangle quality. */
--  if ((b->minangle > 0.0) || b->vararea || b->fixedarea || b->usertest) {
--    /* Initialize the pool of bad triangles. */
--    poolinit(&m->badtriangles, sizeof(struct badtriang), BADTRIPERBLOCK,
--             BADTRIPERBLOCK, 0);
--    /* Initialize the queues of bad triangles. */
--    for (i = 0; i < 4096; i++) {
--      m->queuefront[i] = (struct badtriang *) NULL;
--    }
--    m->firstnonemptyq = -1;
--    /* Test all triangles to see if they're bad. */
--    tallyfaces(m, b);
--    /* Initialize the pool of recently flipped triangles. */
--    poolinit(&m->flipstackers, sizeof(struct flipstacker), FLIPSTACKERPERBLOCK,
--             FLIPSTACKERPERBLOCK, 0);
--    m->checkquality = 1;
--    if (b->verbose) {
--      printf("  Splitting bad triangles.\n");
--    }
--    while ((m->badtriangles.items > 0) && (m->steinerleft != 0)) {
--      /* Fix one bad triangle by inserting a vertex at its circumcenter. */
--      badtri = dequeuebadtriang(m);
--      splittriangle(m, b, badtri);
--      if (m->badsubsegs.items > 0) {
--        /* Put bad triangle back in queue for another try later. */
--        enqueuebadtriang(m, b, badtri);
--        /* Fix any encroached subsegments that resulted. */
--        /*   Record any new bad triangles that result.   */
--        splitencsegs(m, b, 1);
--      } else {
--        /* Return the bad triangle to the pool. */
--        pooldealloc(&m->badtriangles, (void *) badtri);
--      }
--    }
--  }
--  /* At this point, if the "-D" switch was selected and we haven't run out  */
--  /*   of Steiner points, the triangulation should be (conforming) Delaunay */
--  /*   and have no low-quality triangles.                                   */
--
--  /* Might we have run out of Steiner points too soon? */
--  if (!b->quiet && b->conformdel && (m->badsubsegs.items > 0) &&
--      (m->steinerleft == 0)) {
--    printf("\nWarning:  I ran out of Steiner points, but the mesh has\n");
--    if (m->badsubsegs.items == 1) {
--      printf("  one encroached subsegment, and therefore might not be truly\n"
--             );
--    } else {
--      printf("  %ld encroached subsegments, and therefore might not be truly\n"
--             , m->badsubsegs.items);
--    }
--    printf("  Delaunay.  If the Delaunay property is important to you,\n");
--    printf("  try increasing the number of Steiner points (controlled by\n");
--    printf("  the -S switch) slightly and try again.\n\n");
--  }
--}
--
--#endif /* not CDT_ONLY */
--
--/**                                                                         **/
--/**                                                                         **/
--/********* Mesh quality maintenance ends here                        *********/
--
--/*****************************************************************************/
--/*                                                                           */
--/*  highorder()   Create extra nodes for quadratic subparametric elements.   */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifdef ANSI_DECLARATORS
--void highorder(struct mesh *m, struct behavior *b)
--#else /* not ANSI_DECLARATORS */
--void highorder(m, b)
--struct mesh *m;
--struct behavior *b;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  struct otri triangleloop, trisym;
--  struct osub checkmark;
--  vertex newvertex;
--  vertex torg, tdest;
--  int i;
--  triangle ptr;                         /* Temporary variable used by sym(). */
--  subseg sptr;                      /* Temporary variable used by tspivot(). */
--
--  if (!b->quiet) {
--    printf("Adding vertices for second-order triangles.\n");
--  }
--  /* The following line ensures that dead items in the pool of nodes    */
--  /*   cannot be allocated for the extra nodes associated with high     */
--  /*   order elements.  This ensures that the primary nodes (at the     */
--  /*   corners of elements) will occur earlier in the output files, and */
--  /*   have lower indices, than the extra nodes.                        */
--  m->vertices.deaditemstack = (void *) NULL;
--
--  traversalinit(&m->triangles);
--  triangleloop.tri = triangletraverse(m);
--  /* To loop over the set of edges, loop over all triangles, and look at   */
--  /*   the three edges of each triangle.  If there isn't another triangle  */
--  /*   adjacent to the edge, operate on the edge.  If there is another     */
--  /*   adjacent triangle, operate on the edge only if the current triangle */
--  /*   has a smaller pointer than its neighbor.  This way, each edge is    */
--  /*   considered only once.                                               */
--  while (triangleloop.tri != (triangle *) NULL) {
--    for (triangleloop.orient = 0; triangleloop.orient < 3;
--         triangleloop.orient++) {
--      sym(triangleloop, trisym);
--      if ((triangleloop.tri < trisym.tri) || (trisym.tri == m->dummytri)) {
--        org(triangleloop, torg);
--        dest(triangleloop, tdest);
--        /* Create a new node in the middle of the edge.  Interpolate */
--        /*   its attributes.                                         */
--        newvertex = (vertex) poolalloc(&m->vertices);
--        for (i = 0; i < 2 + m->nextras; i++) {
--          newvertex[i] = 0.5 * (torg[i] + tdest[i]);
--        }
--        /* Set the new node's marker to zero or one, depending on */
--        /*   whether it lies on a boundary.                       */
--        setvertexmark(newvertex, trisym.tri == m->dummytri);
--        setvertextype(newvertex,
--                      trisym.tri == m->dummytri ? FREEVERTEX : SEGMENTVERTEX);
--        if (b->usesegments) {
--          tspivot(triangleloop, checkmark);
--          /* If this edge is a segment, transfer the marker to the new node. */
--          if (checkmark.ss != m->dummysub) {
--            setvertexmark(newvertex, mark(checkmark));
--            setvertextype(newvertex, SEGMENTVERTEX);
--          }
--        }
--        if (b->verbose > 1) {
--          printf("  Creating (%.12g, %.12g).\n", newvertex[0], newvertex[1]);
--        }
--        /* Record the new node in the (one or two) adjacent elements. */
--        triangleloop.tri[m->highorderindex + triangleloop.orient] =
--                (triangle) newvertex;
--        if (trisym.tri != m->dummytri) {
--          trisym.tri[m->highorderindex + trisym.orient] = (triangle) newvertex;
--        }
--      }
--    }
--    triangleloop.tri = triangletraverse(m);
--  }
--}
--
--/********* File I/O routines begin here                              *********/
--/**                                                                         **/
--/**                                                                         **/
--
--/*****************************************************************************/
--/*                                                                           */
--/*  readline()   Read a nonempty line from a file.                           */
--/*                                                                           */
--/*  A line is considered "nonempty" if it contains something that looks like */
--/*  a number.  Comments (prefaced by `#') are ignored.                       */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifndef TRILIBRARY
--
--#ifdef ANSI_DECLARATORS
--char *readline(char *string, FILE *infile, char *infilename)
--#else /* not ANSI_DECLARATORS */
--char *readline(string, infile, infilename)
--char *string;
--FILE *infile;
--char *infilename;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  char *result;
--
--  /* Search for something that looks like a number. */
--  do {
--    result = fgets(string, INPUTLINESIZE, infile);
--    if (result == (char *) NULL) {
--      printf("  Error:  Unexpected end of file in %s.\n", infilename);
--      triexit(1);
--    }
--    /* Skip anything that doesn't look like a number, a comment, */
--    /*   or the end of a line.                                   */
--    while ((*result != '\0') && (*result != '#')
--           && (*result != '.') && (*result != '+') && (*result != '-')
--           && ((*result < '0') || (*result > '9'))) {
--      result++;
--    }
--  /* If it's a comment or end of line, read another line and try again. */
--  } while ((*result == '#') || (*result == '\0'));
--  return result;
--}
--
--#endif /* not TRILIBRARY */
--
--/*****************************************************************************/
--/*                                                                           */
--/*  findfield()   Find the next field of a string.                           */
--/*                                                                           */
--/*  Jumps past the current field by searching for whitespace, then jumps     */
--/*  past the whitespace to find the next field.                              */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifndef TRILIBRARY
--
--#ifdef ANSI_DECLARATORS
--char *findfield(char *string)
--#else /* not ANSI_DECLARATORS */
--char *findfield(string)
--char *string;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  char *result;
--
--  result = string;
--  /* Skip the current field.  Stop upon reaching whitespace. */
--  while ((*result != '\0') && (*result != '#')
--         && (*result != ' ') && (*result != '\t')) {
--    result++;
--  }
--  /* Now skip the whitespace and anything else that doesn't look like a */
--  /*   number, a comment, or the end of a line.                         */
--  while ((*result != '\0') && (*result != '#')
--         && (*result != '.') && (*result != '+') && (*result != '-')
--         && ((*result < '0') || (*result > '9'))) {
--    result++;
--  }
--  /* Check for a comment (prefixed with `#'). */
--  if (*result == '#') {
--    *result = '\0';
--  }
--  return result;
--}
--
--#endif /* not TRILIBRARY */
--
--/*****************************************************************************/
--/*                                                                           */
--/*  readnodes()   Read the vertices from a file, which may be a .node or     */
--/*                .poly file.                                                */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifndef TRILIBRARY
--
--#ifdef ANSI_DECLARATORS
--void readnodes(struct mesh *m, struct behavior *b, char *nodefilename,
--               char *polyfilename, FILE **polyfile)
--#else /* not ANSI_DECLARATORS */
--void readnodes(m, b, nodefilename, polyfilename, polyfile)
--struct mesh *m;
--struct behavior *b;
--char *nodefilename;
--char *polyfilename;
--FILE **polyfile;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  FILE *infile;
--  vertex vertexloop;
--  char inputline[INPUTLINESIZE];
--  char *stringptr;
--  char *infilename;
--  REAL x, y;
--  int firstnode;
--  int nodemarkers;
--  int currentmarker;
--  int i, j;
--
--  if (b->poly) {
--    /* Read the vertices from a .poly file. */
--    if (!b->quiet) {
--      printf("Opening %s.\n", polyfilename);
--    }
--    *polyfile = fopen(polyfilename, "r");
--    if (*polyfile == (FILE *) NULL) {
--      printf("  Error:  Cannot access file %s.\n", polyfilename);
--      triexit(1);
--    }
--    /* Read number of vertices, number of dimensions, number of vertex */
--    /*   attributes, and number of boundary markers.                   */
--    stringptr = readline(inputline, *polyfile, polyfilename);
--    m->invertices = (int) strtol(stringptr, &stringptr, 0);
--    stringptr = findfield(stringptr);
--    if (*stringptr == '\0') {
--      m->mesh_dim = 2;
--    } else {
--      m->mesh_dim = (int) strtol(stringptr, &stringptr, 0);
--    }
--    stringptr = findfield(stringptr);
--    if (*stringptr == '\0') {
--      m->nextras = 0;
--    } else {
--      m->nextras = (int) strtol(stringptr, &stringptr, 0);
--    }
--    stringptr = findfield(stringptr);
--    if (*stringptr == '\0') {
--      nodemarkers = 0;
--    } else {
--      nodemarkers = (int) strtol(stringptr, &stringptr, 0);
--    }
--    if (m->invertices > 0) {
--      infile = *polyfile;
--      infilename = polyfilename;
--      m->readnodefile = 0;
--    } else {
--      /* If the .poly file claims there are zero vertices, that means that */
--      /*   the vertices should be read from a separate .node file.         */
--      m->readnodefile = 1;
--      infilename = nodefilename;
--    }
--  } else {
--    m->readnodefile = 1;
--    infilename = nodefilename;
--    *polyfile = (FILE *) NULL;
--  }
--
--  if (m->readnodefile) {
--    /* Read the vertices from a .node file. */
--    if (!b->quiet) {
--      printf("Opening %s.\n", nodefilename);
--    }
--    infile = fopen(nodefilename, "r");
--    if (infile == (FILE *) NULL) {
--      printf("  Error:  Cannot access file %s.\n", nodefilename);
--      triexit(1);
--    }
--    /* Read number of vertices, number of dimensions, number of vertex */
--    /*   attributes, and number of boundary markers.                   */
--    stringptr = readline(inputline, infile, nodefilename);
--    m->invertices = (int) strtol(stringptr, &stringptr, 0);
--    stringptr = findfield(stringptr);
--    if (*stringptr == '\0') {
--      m->mesh_dim = 2;
--    } else {
--      m->mesh_dim = (int) strtol(stringptr, &stringptr, 0);
--    }
--    stringptr = findfield(stringptr);
--    if (*stringptr == '\0') {
--      m->nextras = 0;
--    } else {
--      m->nextras = (int) strtol(stringptr, &stringptr, 0);
--    }
--    stringptr = findfield(stringptr);
--    if (*stringptr == '\0') {
--      nodemarkers = 0;
--    } else {
--      nodemarkers = (int) strtol(stringptr, &stringptr, 0);
--    }
--  }
--
--  if (m->invertices < 3) {
--    printf("Error:  Input must have at least three input vertices.\n");
--    triexit(1);
--  }
--  if (m->mesh_dim != 2) {
--    printf("Error:  Triangle only works with two-dimensional meshes.\n");
--    triexit(1);
--  }
--  if (m->nextras == 0) {
--    b->weighted = 0;
--  }
--
--  initializevertexpool(m, b);
--
--  /* Read the vertices. */
--  for (i = 0; i < m->invertices; i++) {
--    vertexloop = (vertex) poolalloc(&m->vertices);
--    stringptr = readline(inputline, infile, infilename);
--    if (i == 0) {
--      firstnode = (int) strtol(stringptr, &stringptr, 0);
--      if ((firstnode == 0) || (firstnode == 1)) {
--        b->firstnumber = firstnode;
--      }
--    }
--    stringptr = findfield(stringptr);
--    if (*stringptr == '\0') {
--      printf("Error:  Vertex %d has no x coordinate.\n", b->firstnumber + i);
--      triexit(1);
--    }
--    x = (REAL) strtod(stringptr, &stringptr);
--    stringptr = findfield(stringptr);
--    if (*stringptr == '\0') {
--      printf("Error:  Vertex %d has no y coordinate.\n", b->firstnumber + i);
--      triexit(1);
--    }
--    y = (REAL) strtod(stringptr, &stringptr);
--    vertexloop[0] = x;
--    vertexloop[1] = y;
--    /* Read the vertex attributes. */
--    for (j = 2; j < 2 + m->nextras; j++) {
--      stringptr = findfield(stringptr);
--      if (*stringptr == '\0') {
--        vertexloop[j] = 0.0;
--      } else {
--        vertexloop[j] = (REAL) strtod(stringptr, &stringptr);
--      }
--    }
--    if (nodemarkers) {
--      /* Read a vertex marker. */
--      stringptr = findfield(stringptr);
--      if (*stringptr == '\0') {
--        setvertexmark(vertexloop, 0);
--      } else {
--        currentmarker = (int) strtol(stringptr, &stringptr, 0);
--        setvertexmark(vertexloop, currentmarker);
--      }
--    } else {
--      /* If no markers are specified in the file, they default to zero. */
--      setvertexmark(vertexloop, 0);
--    }
--    setvertextype(vertexloop, INPUTVERTEX);
--    /* Determine the smallest and largest x and y coordinates. */
--    if (i == 0) {
--      m->xmin = m->xmax = x;
--      m->ymin = m->ymax = y;
--    } else {
--      m->xmin = (x < m->xmin) ? x : m->xmin;
--      m->xmax = (x > m->xmax) ? x : m->xmax;
--      m->ymin = (y < m->ymin) ? y : m->ymin;
--      m->ymax = (y > m->ymax) ? y : m->ymax;
--    }
--  }
--  if (m->readnodefile) {
--    fclose(infile);
--  }
--
--  /* Nonexistent x value used as a flag to mark circle events in sweepline */
--  /*   Delaunay algorithm.                                                 */
--  m->xminextreme = 10 * m->xmin - 9 * m->xmax;
--}
--
--#endif /* not TRILIBRARY */
--
--/*****************************************************************************/
--/*                                                                           */
--/*  transfernodes()   Read the vertices from memory.                         */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifdef TRILIBRARY
--
--#ifdef ANSI_DECLARATORS
--void transfernodes(struct mesh *m, struct behavior *b, REAL *pointlist,
--                   REAL *pointattriblist, int *pointmarkerlist,
--                   int numberofpoints, int numberofpointattribs)
--#else /* not ANSI_DECLARATORS */
--void transfernodes(m, b, pointlist, pointattriblist, pointmarkerlist,
--                   numberofpoints, numberofpointattribs)
--struct mesh *m;
--struct behavior *b;
--REAL *pointlist;
--REAL *pointattriblist;
--int *pointmarkerlist;
--int numberofpoints;
--int numberofpointattribs;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  vertex vertexloop;
--  REAL x, y;
--  int i, j;
--  int coordindex;
--  int attribindex;
--
--  m->invertices = numberofpoints;
--  m->mesh_dim = 2;
--  m->nextras = numberofpointattribs;
--  m->readnodefile = 0;
--  if (m->invertices < 3) {
--    printf("Error:  Input must have at least three input vertices.\n");
--    triexit(1);
--  }
--  if (m->nextras == 0) {
--    b->weighted = 0;
--  }
--
--  initializevertexpool(m, b);
--
--  /* Read the vertices. */
--  coordindex = 0;
--  attribindex = 0;
--  for (i = 0; i < m->invertices; i++) {
--    vertexloop = (vertex) poolalloc(&m->vertices);
--    /* Read the vertex coordinates. */
--    x = vertexloop[0] = pointlist[coordindex++];
--    y = vertexloop[1] = pointlist[coordindex++];
--    /* Read the vertex attributes. */
--    for (j = 0; j < numberofpointattribs; j++) {
--      vertexloop[2 + j] = pointattriblist[attribindex++];
--    }
--    if (pointmarkerlist != (int *) NULL) {
--      /* Read a vertex marker. */
--      setvertexmark(vertexloop, pointmarkerlist[i]);
--    } else {
--      /* If no markers are specified, they default to zero. */
--      setvertexmark(vertexloop, 0);
--    }
--    setvertextype(vertexloop, INPUTVERTEX);
--    /* Determine the smallest and largest x and y coordinates. */
--    if (i == 0) {
--      m->xmin = m->xmax = x;
--      m->ymin = m->ymax = y;
--    } else {
--      m->xmin = (x < m->xmin) ? x : m->xmin;
--      m->xmax = (x > m->xmax) ? x : m->xmax;
--      m->ymin = (y < m->ymin) ? y : m->ymin;
--      m->ymax = (y > m->ymax) ? y : m->ymax;
--    }
--  }
--
--  /* Nonexistent x value used as a flag to mark circle events in sweepline */
--  /*   Delaunay algorithm.                                                 */
--  m->xminextreme = 10 * m->xmin - 9 * m->xmax;
--}
--
--#endif /* TRILIBRARY */
--
--/*****************************************************************************/
--/*                                                                           */
--/*  readholes()   Read the holes, and possibly regional attributes and area  */
--/*                constraints, from a .poly file.                            */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifndef TRILIBRARY
--
--#ifdef ANSI_DECLARATORS
--void readholes(struct mesh *m, struct behavior *b,
--               FILE *polyfile, char *polyfilename, REAL **hlist, int *holes,
--               REAL **rlist, int *regions)
--#else /* not ANSI_DECLARATORS */
--void readholes(m, b, polyfile, polyfilename, hlist, holes, rlist, regions)
--struct mesh *m;
--struct behavior *b;
--FILE *polyfile;
--char *polyfilename;
--REAL **hlist;
--int *holes;
--REAL **rlist;
--int *regions;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  REAL *holelist;
--  REAL *regionlist;
--  char inputline[INPUTLINESIZE];
--  char *stringptr;
--  int index;
--  int i;
--
--  /* Read the holes. */
--  stringptr = readline(inputline, polyfile, polyfilename);
--  *holes = (int) strtol(stringptr, &stringptr, 0);
--  if (*holes > 0) {
--    holelist = (REAL *) trimalloc(2 * *holes * (int) sizeof(REAL));
--    *hlist = holelist;
--    for (i = 0; i < 2 * *holes; i += 2) {
--      stringptr = readline(inputline, polyfile, polyfilename);
--      stringptr = findfield(stringptr);
--      if (*stringptr == '\0') {
--        printf("Error:  Hole %d has no x coordinate.\n",
--               b->firstnumber + (i >> 1));
--        triexit(1);
--      } else {
--        holelist[i] = (REAL) strtod(stringptr, &stringptr);
--      }
--      stringptr = findfield(stringptr);
--      if (*stringptr == '\0') {
--        printf("Error:  Hole %d has no y coordinate.\n",
--               b->firstnumber + (i >> 1));
--        triexit(1);
--      } else {
--        holelist[i + 1] = (REAL) strtod(stringptr, &stringptr);
--      }
--    }
--  } else {
--    *hlist = (REAL *) NULL;
--  }
--
--#ifndef CDT_ONLY
--  if ((b->regionattrib || b->vararea) && !b->refine) {
--    /* Read the area constraints. */
--    stringptr = readline(inputline, polyfile, polyfilename);
--    *regions = (int) strtol(stringptr, &stringptr, 0);
--    if (*regions > 0) {
--      regionlist = (REAL *) trimalloc(4 * *regions * (int) sizeof(REAL));
--      *rlist = regionlist;
--      index = 0;
--      for (i = 0; i < *regions; i++) {
--        stringptr = readline(inputline, polyfile, polyfilename);
--        stringptr = findfield(stringptr);
--        if (*stringptr == '\0') {
--          printf("Error:  Region %d has no x coordinate.\n",
--                 b->firstnumber + i);
--          triexit(1);
--        } else {
--          regionlist[index++] = (REAL) strtod(stringptr, &stringptr);
--        }
--        stringptr = findfield(stringptr);
--        if (*stringptr == '\0') {
--          printf("Error:  Region %d has no y coordinate.\n",
--                 b->firstnumber + i);
--          triexit(1);
--        } else {
--          regionlist[index++] = (REAL) strtod(stringptr, &stringptr);
--        }
--        stringptr = findfield(stringptr);
--        if (*stringptr == '\0') {
--          printf(
--            "Error:  Region %d has no region attribute or area constraint.\n",
--                 b->firstnumber + i);
--          triexit(1);
--        } else {
--          regionlist[index++] = (REAL) strtod(stringptr, &stringptr);
--        }
--        stringptr = findfield(stringptr);
--        if (*stringptr == '\0') {
--          regionlist[index] = regionlist[index - 1];
--        } else {
--          regionlist[index] = (REAL) strtod(stringptr, &stringptr);
--        }
--        index++;
--      }
--    }
--  } else {
--    /* Set `*regions' to zero to avoid an accidental free() later. */
--    *regions = 0;
--    *rlist = (REAL *) NULL;
--  }
--#endif /* not CDT_ONLY */
--
--  fclose(polyfile);
--}
--
--#endif /* not TRILIBRARY */
--
--/*****************************************************************************/
--/*                                                                           */
--/*  finishfile()   Write the command line to the output file so the user     */
--/*                 can remember how the file was generated.  Close the file. */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifndef TRILIBRARY
--
--#ifdef ANSI_DECLARATORS
--void finishfile(FILE *outfile, int argc, char **argv)
--#else /* not ANSI_DECLARATORS */
--void finishfile(outfile, argc, argv)
--FILE *outfile;
--int argc;
--char **argv;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  int i;
--
--  fprintf(outfile, "# Generated by");
--  for (i = 0; i < argc; i++) {
--    fprintf(outfile, " ");
--    fputs(argv[i], outfile);
--  }
--  fprintf(outfile, "\n");
--  fclose(outfile);
--}
--
--#endif /* not TRILIBRARY */
--
--/*****************************************************************************/
--/*                                                                           */
--/*  writenodes()   Number the vertices and write them to a .node file.       */
--/*                                                                           */
--/*  To save memory, the vertex numbers are written over the boundary markers */
--/*  after the vertices are written to a file.                                */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifdef TRILIBRARY
--
--#ifdef ANSI_DECLARATORS
--void writenodes(struct mesh *m, struct behavior *b, REAL **pointlist,
--                REAL **pointattriblist, int **pointmarkerlist)
--#else /* not ANSI_DECLARATORS */
--void writenodes(m, b, pointlist, pointattriblist, pointmarkerlist)
--struct mesh *m;
--struct behavior *b;
--REAL **pointlist;
--REAL **pointattriblist;
--int **pointmarkerlist;
--#endif /* not ANSI_DECLARATORS */
--
--#else /* not TRILIBRARY */
--
--#ifdef ANSI_DECLARATORS
--void writenodes(struct mesh *m, struct behavior *b, char *nodefilename,
--                int argc, char **argv)
--#else /* not ANSI_DECLARATORS */
--void writenodes(m, b, nodefilename, argc, argv)
--struct mesh *m;
--struct behavior *b;
--char *nodefilename;
--int argc;
--char **argv;
--#endif /* not ANSI_DECLARATORS */
--
--#endif /* not TRILIBRARY */
--
--{
--#ifdef TRILIBRARY
--  REAL *plist;
--  REAL *palist;
--  int *pmlist;
--  int coordindex;
--  int attribindex;
--#else /* not TRILIBRARY */
--  FILE *outfile;
--#endif /* not TRILIBRARY */
--  vertex vertexloop;
--  long outvertices;
--  int vertexnumber;
--  int i;
--
--  if (b->jettison) {
--    outvertices = m->vertices.items - m->undeads;
--  } else {
--    outvertices = m->vertices.items;
--  }
--
--#ifdef TRILIBRARY
--  if (!b->quiet) {
--    printf("Writing vertices.\n");
--  }
--  /* Allocate memory for output vertices if necessary. */
--  if (*pointlist == (REAL *) NULL) {
--    *pointlist = (REAL *) trimalloc((int) (outvertices * 2 * sizeof(REAL)));
--  }
--  /* Allocate memory for output vertex attributes if necessary. */
--  if ((m->nextras > 0) && (*pointattriblist == (REAL *) NULL)) {
--    *pointattriblist = (REAL *) trimalloc((int) (outvertices * m->nextras *
--                                                 sizeof(REAL)));
--  }
--  /* Allocate memory for output vertex markers if necessary. */
--  if (!b->nobound && (*pointmarkerlist == (int *) NULL)) {
--    *pointmarkerlist = (int *) trimalloc((int) (outvertices * sizeof(int)));
--  }
--  plist = *pointlist;
--  palist = *pointattriblist;
--  pmlist = *pointmarkerlist;
--  coordindex = 0;
--  attribindex = 0;
--#else /* not TRILIBRARY */
--  if (!b->quiet) {
--    printf("Writing %s.\n", nodefilename);
--  }
--  outfile = fopen(nodefilename, "w");
--  if (outfile == (FILE *) NULL) {
--    printf("  Error:  Cannot create file %s.\n", nodefilename);
--    triexit(1);
--  }
--  /* Number of vertices, number of dimensions, number of vertex attributes, */
--  /*   and number of boundary markers (zero or one).                        */
--  fprintf(outfile, "%ld  %d  %d  %d\n", outvertices, m->mesh_dim,
--          m->nextras, 1 - b->nobound);
--#endif /* not TRILIBRARY */
--
--  traversalinit(&m->vertices);
--  vertexnumber = b->firstnumber;
--  vertexloop = vertextraverse(m);
--  while (vertexloop != (vertex) NULL) {
--    if (!b->jettison || (vertextype(vertexloop) != UNDEADVERTEX)) {
--#ifdef TRILIBRARY
--      /* X and y coordinates. */
--      plist[coordindex++] = vertexloop[0];
--      plist[coordindex++] = vertexloop[1];
--      /* Vertex attributes. */
--      for (i = 0; i < m->nextras; i++) {
--        palist[attribindex++] = vertexloop[2 + i];
--      }
--      if (!b->nobound) {
--        /* Copy the boundary marker. */
--        pmlist[vertexnumber - b->firstnumber] = vertexmark(vertexloop);
--      }
--#else /* not TRILIBRARY */
--      /* Vertex number, x and y coordinates. */
--      fprintf(outfile, "%4d    %.17g  %.17g", vertexnumber, vertexloop[0],
--              vertexloop[1]);
--      for (i = 0; i < m->nextras; i++) {
--        /* Write an attribute. */
--        fprintf(outfile, "  %.17g", vertexloop[i + 2]);
--      }
--      if (b->nobound) {
--        fprintf(outfile, "\n");
--      } else {
--        /* Write the boundary marker. */
--        fprintf(outfile, "    %d\n", vertexmark(vertexloop));
--      }
--#endif /* not TRILIBRARY */
--
--      setvertexmark(vertexloop, vertexnumber);
--      vertexnumber++;
--    }
--    vertexloop = vertextraverse(m);
--  }
--
--#ifndef TRILIBRARY
--  finishfile(outfile, argc, argv);
--#endif /* not TRILIBRARY */
--}
--
--/*****************************************************************************/
--/*                                                                           */
--/*  numbernodes()   Number the vertices.                                     */
--/*                                                                           */
--/*  Each vertex is assigned a marker equal to its number.                    */
--/*                                                                           */
--/*  Used when writenodes() is not called because no .node file is written.   */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifdef ANSI_DECLARATORS
--void numbernodes(struct mesh *m, struct behavior *b)
--#else /* not ANSI_DECLARATORS */
--void numbernodes(m, b)
--struct mesh *m;
--struct behavior *b;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  vertex vertexloop;
--  int vertexnumber;
--
--  traversalinit(&m->vertices);
--  vertexnumber = b->firstnumber;
--  vertexloop = vertextraverse(m);
--  while (vertexloop != (vertex) NULL) {
--    setvertexmark(vertexloop, vertexnumber);
--    if (!b->jettison || (vertextype(vertexloop) != UNDEADVERTEX)) {
--      vertexnumber++;
--    }
--    vertexloop = vertextraverse(m);
--  }
--}
--
--/*****************************************************************************/
--/*                                                                           */
--/*  writeelements()   Write the triangles to an .ele file.                   */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifdef TRILIBRARY
--
--#ifdef ANSI_DECLARATORS
--void writeelements(struct mesh *m, struct behavior *b,
--                   int **trianglelist, REAL **triangleattriblist)
--#else /* not ANSI_DECLARATORS */
--void writeelements(m, b, trianglelist, triangleattriblist)
--struct mesh *m;
--struct behavior *b;
--int **trianglelist;
--REAL **triangleattriblist;
--#endif /* not ANSI_DECLARATORS */
--
--#else /* not TRILIBRARY */
--
--#ifdef ANSI_DECLARATORS
--void writeelements(struct mesh *m, struct behavior *b, char *elefilename,
--                   int argc, char **argv)
--#else /* not ANSI_DECLARATORS */
--void writeelements(m, b, elefilename, argc, argv)
--struct mesh *m;
--struct behavior *b;
--char *elefilename;
--int argc;
--char **argv;
--#endif /* not ANSI_DECLARATORS */
--
--#endif /* not TRILIBRARY */
--
--{
--#ifdef TRILIBRARY
--  int *tlist;
--  REAL *talist;
--  int vertexindex;
--  int attribindex;
--#else /* not TRILIBRARY */
--  FILE *outfile;
--#endif /* not TRILIBRARY */
--  struct otri triangleloop;
--  vertex p1, p2, p3;
--  vertex mid1, mid2, mid3;
--  long elementnumber;
--  int i;
--
--#ifdef TRILIBRARY
--  if (!b->quiet) {
--    printf("Writing triangles.\n");
--  }
--  /* Allocate memory for output triangles if necessary. */
--  if (*trianglelist == (int *) NULL) {
--    *trianglelist = (int *) trimalloc((int) (m->triangles.items *
--                                             ((b->order + 1) * (b->order + 2) /
--                                              2) * sizeof(int)));
--  }
--  /* Allocate memory for output triangle attributes if necessary. */
--  if ((m->eextras > 0) && (*triangleattriblist == (REAL *) NULL)) {
--    *triangleattriblist = (REAL *) trimalloc((int) (m->triangles.items *
--                                                    m->eextras *
--                                                    sizeof(REAL)));
--  }
--  tlist = *trianglelist;
--  talist = *triangleattriblist;
--  vertexindex = 0;
--  attribindex = 0;
--#else /* not TRILIBRARY */
--  if (!b->quiet) {
--    printf("Writing %s.\n", elefilename);
--  }
--  outfile = fopen(elefilename, "w");
--  if (outfile == (FILE *) NULL) {
--    printf("  Error:  Cannot create file %s.\n", elefilename);
--    triexit(1);
--  }
--  /* Number of triangles, vertices per triangle, attributes per triangle. */
--  fprintf(outfile, "%ld  %d  %d\n", m->triangles.items,
--          (b->order + 1) * (b->order + 2) / 2, m->eextras);
--#endif /* not TRILIBRARY */
--
--  traversalinit(&m->triangles);
--  triangleloop.tri = triangletraverse(m);
--  triangleloop.orient = 0;
--  elementnumber = b->firstnumber;
--  while (triangleloop.tri != (triangle *) NULL) {
--    org(triangleloop, p1);
--    dest(triangleloop, p2);
--    apex(triangleloop, p3);
--    if (b->order == 1) {
--#ifdef TRILIBRARY
--      tlist[vertexindex++] = vertexmark(p1);
--      tlist[vertexindex++] = vertexmark(p2);
--      tlist[vertexindex++] = vertexmark(p3);
--#else /* not TRILIBRARY */
--      /* Triangle number, indices for three vertices. */
--      fprintf(outfile, "%4ld    %4d  %4d  %4d", elementnumber,
--              vertexmark(p1), vertexmark(p2), vertexmark(p3));
--#endif /* not TRILIBRARY */
--    } else {
--      mid1 = (vertex) triangleloop.tri[m->highorderindex + 1];
--      mid2 = (vertex) triangleloop.tri[m->highorderindex + 2];
--      mid3 = (vertex) triangleloop.tri[m->highorderindex];
--#ifdef TRILIBRARY
--      tlist[vertexindex++] = vertexmark(p1);
--      tlist[vertexindex++] = vertexmark(p2);
--      tlist[vertexindex++] = vertexmark(p3);
--      tlist[vertexindex++] = vertexmark(mid1);
--      tlist[vertexindex++] = vertexmark(mid2);
--      tlist[vertexindex++] = vertexmark(mid3);
--#else /* not TRILIBRARY */
--      /* Triangle number, indices for six vertices. */
--      fprintf(outfile, "%4ld    %4d  %4d  %4d  %4d  %4d  %4d", elementnumber,
--              vertexmark(p1), vertexmark(p2), vertexmark(p3), vertexmark(mid1),
--              vertexmark(mid2), vertexmark(mid3));
--#endif /* not TRILIBRARY */
--    }
--
--#ifdef TRILIBRARY
--    for (i = 0; i < m->eextras; i++) {
--      talist[attribindex++] = elemattribute(triangleloop, i);
--    }
--#else /* not TRILIBRARY */
--    for (i = 0; i < m->eextras; i++) {
--      fprintf(outfile, "  %.17g", elemattribute(triangleloop, i));
--    }
--    fprintf(outfile, "\n");
--#endif /* not TRILIBRARY */
--
--    triangleloop.tri = triangletraverse(m);
--    elementnumber++;
--  }
--
--#ifndef TRILIBRARY
--  finishfile(outfile, argc, argv);
--#endif /* not TRILIBRARY */
--}
--
--/*****************************************************************************/
--/*                                                                           */
--/*  writepoly()   Write the segments and holes to a .poly file.              */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifdef TRILIBRARY
--
--#ifdef ANSI_DECLARATORS
--void writepoly(struct mesh *m, struct behavior *b,
--               int **segmentlist, int **segmentmarkerlist)
--#else /* not ANSI_DECLARATORS */
--void writepoly(m, b, segmentlist, segmentmarkerlist)
--struct mesh *m;
--struct behavior *b;
--int **segmentlist;
--int **segmentmarkerlist;
--#endif /* not ANSI_DECLARATORS */
--
--#else /* not TRILIBRARY */
--
--#ifdef ANSI_DECLARATORS
--void writepoly(struct mesh *m, struct behavior *b, char *polyfilename,
--               REAL *holelist, int holes, REAL *regionlist, int regions,
--               int argc, char **argv)
--#else /* not ANSI_DECLARATORS */
--void writepoly(m, b, polyfilename, holelist, holes, regionlist, regions,
--               argc, argv)
--struct mesh *m;
--struct behavior *b;
--char *polyfilename;
--REAL *holelist;
--int holes;
--REAL *regionlist;
--int regions;
--int argc;
--char **argv;
--#endif /* not ANSI_DECLARATORS */
--
--#endif /* not TRILIBRARY */
--
--{
--#ifdef TRILIBRARY
--  int *slist;
--  int *smlist;
--  int index;
--#else /* not TRILIBRARY */
--  FILE *outfile;
--  long holenumber, regionnumber;
--#endif /* not TRILIBRARY */
--  struct osub subsegloop;
--  vertex endpoint1, endpoint2;
--  long subsegnumber;
--
--#ifdef TRILIBRARY
--  if (!b->quiet) {
--    printf("Writing segments.\n");
--  }
--  /* Allocate memory for output segments if necessary. */
--  if (*segmentlist == (int *) NULL) {
--    *segmentlist = (int *) trimalloc((int) (m->subsegs.items * 2 *
--                                            sizeof(int)));
--  }
--  /* Allocate memory for output segment markers if necessary. */
--  if (!b->nobound && (*segmentmarkerlist == (int *) NULL)) {
--    *segmentmarkerlist = (int *) trimalloc((int) (m->subsegs.items *
--                                                  sizeof(int)));
--  }
--  slist = *segmentlist;
--  smlist = *segmentmarkerlist;
--  index = 0;
--#else /* not TRILIBRARY */
--  if (!b->quiet) {
--    printf("Writing %s.\n", polyfilename);
--  }
--  outfile = fopen(polyfilename, "w");
--  if (outfile == (FILE *) NULL) {
--    printf("  Error:  Cannot create file %s.\n", polyfilename);
--    triexit(1);
--  }
--  /* The zero indicates that the vertices are in a separate .node file. */
--  /*   Followed by number of dimensions, number of vertex attributes,   */
--  /*   and number of boundary markers (zero or one).                    */
--  fprintf(outfile, "%d  %d  %d  %d\n", 0, m->mesh_dim, m->nextras,
--          1 - b->nobound);
--  /* Number of segments, number of boundary markers (zero or one). */
--  fprintf(outfile, "%ld  %d\n", m->subsegs.items, 1 - b->nobound);
--#endif /* not TRILIBRARY */
--
--  traversalinit(&m->subsegs);
--  subsegloop.ss = subsegtraverse(m);
--  subsegloop.ssorient = 0;
--  subsegnumber = b->firstnumber;
--  while (subsegloop.ss != (subseg *) NULL) {
--    sorg(subsegloop, endpoint1);
--    sdest(subsegloop, endpoint2);
--#ifdef TRILIBRARY
--    /* Copy indices of the segment's two endpoints. */
--    slist[index++] = vertexmark(endpoint1);
--    slist[index++] = vertexmark(endpoint2);
--    if (!b->nobound) {
--      /* Copy the boundary marker. */
--      smlist[subsegnumber - b->firstnumber] = mark(subsegloop);
--    }
--#else /* not TRILIBRARY */
--    /* Segment number, indices of its two endpoints, and possibly a marker. */
--    if (b->nobound) {
--      fprintf(outfile, "%4ld    %4d  %4d\n", subsegnumber,
--              vertexmark(endpoint1), vertexmark(endpoint2));
--    } else {
--      fprintf(outfile, "%4ld    %4d  %4d    %4d\n", subsegnumber,
--              vertexmark(endpoint1), vertexmark(endpoint2), mark(subsegloop));
--    }
--#endif /* not TRILIBRARY */
--
--    subsegloop.ss = subsegtraverse(m);
--    subsegnumber++;
--  }
--
--#ifndef TRILIBRARY
--#ifndef CDT_ONLY
--  fprintf(outfile, "%d\n", holes);
--  if (holes > 0) {
--    for (holenumber = 0; holenumber < holes; holenumber++) {
--      /* Hole number, x and y coordinates. */
--      fprintf(outfile, "%4ld   %.17g  %.17g\n", b->firstnumber + holenumber,
--              holelist[2 * holenumber], holelist[2 * holenumber + 1]);
--    }
--  }
--  if (regions > 0) {
--    fprintf(outfile, "%d\n", regions);
--    for (regionnumber = 0; regionnumber < regions; regionnumber++) {
--      /* Region number, x and y coordinates, attribute, maximum area. */
--      fprintf(outfile, "%4ld   %.17g  %.17g  %.17g  %.17g\n",
--              b->firstnumber + regionnumber,
--              regionlist[4 * regionnumber], regionlist[4 * regionnumber + 1],
--              regionlist[4 * regionnumber + 2],
--              regionlist[4 * regionnumber + 3]);
--    }
--  }
--#endif /* not CDT_ONLY */
--
--  finishfile(outfile, argc, argv);
--#endif /* not TRILIBRARY */
--}
--
--/*****************************************************************************/
--/*                                                                           */
--/*  writeedges()   Write the edges to an .edge file.                         */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifdef TRILIBRARY
--
--#ifdef ANSI_DECLARATORS
--void writeedges(struct mesh *m, struct behavior *b,
--                int **edgelist, int **edgemarkerlist)
--#else /* not ANSI_DECLARATORS */
--void writeedges(m, b, edgelist, edgemarkerlist)
--struct mesh *m;
--struct behavior *b;
--int **edgelist;
--int **edgemarkerlist;
--#endif /* not ANSI_DECLARATORS */
--
--#else /* not TRILIBRARY */
--
--#ifdef ANSI_DECLARATORS
--void writeedges(struct mesh *m, struct behavior *b, char *edgefilename,
--                int argc, char **argv)
--#else /* not ANSI_DECLARATORS */
--void writeedges(m, b, edgefilename, argc, argv)
--struct mesh *m;
--struct behavior *b;
--char *edgefilename;
--int argc;
--char **argv;
--#endif /* not ANSI_DECLARATORS */
--
--#endif /* not TRILIBRARY */
--
--{
--#ifdef TRILIBRARY
--  int *elist;
--  int *emlist;
--  int index;
--#else /* not TRILIBRARY */
--  FILE *outfile;
--#endif /* not TRILIBRARY */
--  struct otri triangleloop, trisym;
--  struct osub checkmark;
--  vertex p1, p2;
--  long edgenumber;
--  triangle ptr;                         /* Temporary variable used by sym(). */
--  subseg sptr;                      /* Temporary variable used by tspivot(). */
--
--#ifdef TRILIBRARY
--  if (!b->quiet) {
--    printf("Writing edges.\n");
--  }
--  /* Allocate memory for edges if necessary. */
--  if (*edgelist == (int *) NULL) {
--    *edgelist = (int *) trimalloc((int) (m->edges * 2 * sizeof(int)));
--  }
--  /* Allocate memory for edge markers if necessary. */
--  if (!b->nobound && (*edgemarkerlist == (int *) NULL)) {
--    *edgemarkerlist = (int *) trimalloc((int) (m->edges * sizeof(int)));
--  }
--  elist = *edgelist;
--  emlist = *edgemarkerlist;
--  index = 0;
--#else /* not TRILIBRARY */
--  if (!b->quiet) {
--    printf("Writing %s.\n", edgefilename);
--  }
--  outfile = fopen(edgefilename, "w");
--  if (outfile == (FILE *) NULL) {
--    printf("  Error:  Cannot create file %s.\n", edgefilename);
--    triexit(1);
--  }
--  /* Number of edges, number of boundary markers (zero or one). */
--  fprintf(outfile, "%ld  %d\n", m->edges, 1 - b->nobound);
--#endif /* not TRILIBRARY */
--
--  traversalinit(&m->triangles);
--  triangleloop.tri = triangletraverse(m);
--  edgenumber = b->firstnumber;
--  /* To loop over the set of edges, loop over all triangles, and look at   */
--  /*   the three edges of each triangle.  If there isn't another triangle  */
--  /*   adjacent to the edge, operate on the edge.  If there is another     */
--  /*   adjacent triangle, operate on the edge only if the current triangle */
--  /*   has a smaller pointer than its neighbor.  This way, each edge is    */
--  /*   considered only once.                                               */
--  while (triangleloop.tri != (triangle *) NULL) {
--    for (triangleloop.orient = 0; triangleloop.orient < 3;
--         triangleloop.orient++) {
--      sym(triangleloop, trisym);
--      if ((triangleloop.tri < trisym.tri) || (trisym.tri == m->dummytri)) {
--        org(triangleloop, p1);
--        dest(triangleloop, p2);
--#ifdef TRILIBRARY
--        elist[index++] = vertexmark(p1);
--        elist[index++] = vertexmark(p2);
--#endif /* TRILIBRARY */
--        if (b->nobound) {
--#ifndef TRILIBRARY
--          /* Edge number, indices of two endpoints. */
--          fprintf(outfile, "%4ld   %d  %d\n", edgenumber,
--                  vertexmark(p1), vertexmark(p2));
--#endif /* not TRILIBRARY */
--        } else {
--          /* Edge number, indices of two endpoints, and a boundary marker. */
--          /*   If there's no subsegment, the boundary marker is zero.      */
--          if (b->usesegments) {
--            tspivot(triangleloop, checkmark);
--            if (checkmark.ss == m->dummysub) {
--#ifdef TRILIBRARY
--              emlist[edgenumber - b->firstnumber] = 0;
--#else /* not TRILIBRARY */
--              fprintf(outfile, "%4ld   %d  %d  %d\n", edgenumber,
--                      vertexmark(p1), vertexmark(p2), 0);
--#endif /* not TRILIBRARY */
--            } else {
--#ifdef TRILIBRARY
--              emlist[edgenumber - b->firstnumber] = mark(checkmark);
--#else /* not TRILIBRARY */
--              fprintf(outfile, "%4ld   %d  %d  %d\n", edgenumber,
--                      vertexmark(p1), vertexmark(p2), mark(checkmark));
--#endif /* not TRILIBRARY */
--            }
--          } else {
--#ifdef TRILIBRARY
--            emlist[edgenumber - b->firstnumber] = trisym.tri == m->dummytri;
--#else /* not TRILIBRARY */
--            fprintf(outfile, "%4ld   %d  %d  %d\n", edgenumber,
--                    vertexmark(p1), vertexmark(p2), trisym.tri == m->dummytri);
--#endif /* not TRILIBRARY */
--          }
--        }
--        edgenumber++;
--      }
--    }
--    triangleloop.tri = triangletraverse(m);
--  }
--
--#ifndef TRILIBRARY
--  finishfile(outfile, argc, argv);
--#endif /* not TRILIBRARY */
--}
--
--/*****************************************************************************/
--/*                                                                           */
--/*  writevoronoi()   Write the Voronoi diagram to a .v.node and .v.edge      */
--/*                   file.                                                   */
--/*                                                                           */
--/*  The Voronoi diagram is the geometric dual of the Delaunay triangulation. */
--/*  Hence, the Voronoi vertices are listed by traversing the Delaunay        */
--/*  triangles, and the Voronoi edges are listed by traversing the Delaunay   */
--/*  edges.                                                                   */
--/*                                                                           */
--/*  WARNING:  In order to assign numbers to the Voronoi vertices, this       */
--/*  procedure messes up the subsegments or the extra nodes of every          */
--/*  element.  Hence, you should call this procedure last.                    */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifdef TRILIBRARY
--
--#ifdef ANSI_DECLARATORS
--void writevoronoi(struct mesh *m, struct behavior *b, REAL **vpointlist,
--                  REAL **vpointattriblist, int **vpointmarkerlist,
--                  int **vedgelist, int **vedgemarkerlist, REAL **vnormlist)
--#else /* not ANSI_DECLARATORS */
--void writevoronoi(m, b, vpointlist, vpointattriblist, vpointmarkerlist,
--                  vedgelist, vedgemarkerlist, vnormlist)
--struct mesh *m;
--struct behavior *b;
--REAL **vpointlist;
--REAL **vpointattriblist;
--int **vpointmarkerlist;
--int **vedgelist;
--int **vedgemarkerlist;
--REAL **vnormlist;
--#endif /* not ANSI_DECLARATORS */
--
--#else /* not TRILIBRARY */
--
--#ifdef ANSI_DECLARATORS
--void writevoronoi(struct mesh *m, struct behavior *b, char *vnodefilename,
--                  char *vedgefilename, int argc, char **argv)
--#else /* not ANSI_DECLARATORS */
--void writevoronoi(m, b, vnodefilename, vedgefilename, argc, argv)
--struct mesh *m;
--struct behavior *b;
--char *vnodefilename;
--char *vedgefilename;
--int argc;
--char **argv;
--#endif /* not ANSI_DECLARATORS */
--
--#endif /* not TRILIBRARY */
--
--{
--#ifdef TRILIBRARY
--  REAL *plist;
--  REAL *palist;
--  int *elist;
--  REAL *normlist;
--  int coordindex;
--  int attribindex;
--#else /* not TRILIBRARY */
--  FILE *outfile;
--#endif /* not TRILIBRARY */
--  struct otri triangleloop, trisym;
--  vertex torg, tdest, tapex;
--  REAL circumcenter[2];
--  REAL xi, eta;
--  long vnodenumber, vedgenumber;
--  int p1, p2;
--  int i;
--  triangle ptr;                         /* Temporary variable used by sym(). */
--
--#ifdef TRILIBRARY
--  if (!b->quiet) {
--    printf("Writing Voronoi vertices.\n");
--  }
--  /* Allocate memory for Voronoi vertices if necessary. */
--  if (*vpointlist == (REAL *) NULL) {
--    *vpointlist = (REAL *) trimalloc((int) (m->triangles.items * 2 *
--                                            sizeof(REAL)));
--  }
--  /* Allocate memory for Voronoi vertex attributes if necessary. */
--  if (*vpointattriblist == (REAL *) NULL) {
--    *vpointattriblist = (REAL *) trimalloc((int) (m->triangles.items *
--                                                  m->nextras * sizeof(REAL)));
--  }
--  *vpointmarkerlist = (int *) NULL;
--  plist = *vpointlist;
--  palist = *vpointattriblist;
--  coordindex = 0;
--  attribindex = 0;
--#else /* not TRILIBRARY */
--  if (!b->quiet) {
--    printf("Writing %s.\n", vnodefilename);
--  }
--  outfile = fopen(vnodefilename, "w");
--  if (outfile == (FILE *) NULL) {
--    printf("  Error:  Cannot create file %s.\n", vnodefilename);
--    triexit(1);
--  }
--  /* Number of triangles, two dimensions, number of vertex attributes, */
--  /*   no markers.                                                     */
--  fprintf(outfile, "%ld  %d  %d  %d\n", m->triangles.items, 2, m->nextras, 0);
--#endif /* not TRILIBRARY */
--
--  traversalinit(&m->triangles);
--  triangleloop.tri = triangletraverse(m);
--  triangleloop.orient = 0;
--  vnodenumber = b->firstnumber;
--  while (triangleloop.tri != (triangle *) NULL) {
--    org(triangleloop, torg);
--    dest(triangleloop, tdest);
--    apex(triangleloop, tapex);
--    findcircumcenter(m, b, torg, tdest, tapex, circumcenter, &xi, &eta, 0);
--#ifdef TRILIBRARY
--    /* X and y coordinates. */
--    plist[coordindex++] = circumcenter[0];
--    plist[coordindex++] = circumcenter[1];
--    for (i = 2; i < 2 + m->nextras; i++) {
--      /* Interpolate the vertex attributes at the circumcenter. */
--      palist[attribindex++] = torg[i] + xi * (tdest[i] - torg[i])
--                                     + eta * (tapex[i] - torg[i]);
--    }
--#else /* not TRILIBRARY */
--    /* Voronoi vertex number, x and y coordinates. */
--    fprintf(outfile, "%4ld    %.17g  %.17g", vnodenumber, circumcenter[0],
--            circumcenter[1]);
--    for (i = 2; i < 2 + m->nextras; i++) {
--      /* Interpolate the vertex attributes at the circumcenter. */
--      fprintf(outfile, "  %.17g", torg[i] + xi * (tdest[i] - torg[i])
--                                         + eta * (tapex[i] - torg[i]));
--    }
--    fprintf(outfile, "\n");
--#endif /* not TRILIBRARY */
--
--    * (int *) (triangleloop.tri + 6) = (int) vnodenumber;
--    triangleloop.tri = triangletraverse(m);
--    vnodenumber++;
--  }
--
--#ifndef TRILIBRARY
--  finishfile(outfile, argc, argv);
--#endif /* not TRILIBRARY */
--
--#ifdef TRILIBRARY
--  if (!b->quiet) {
--    printf("Writing Voronoi edges.\n");
--  }
--  /* Allocate memory for output Voronoi edges if necessary. */
--  if (*vedgelist == (int *) NULL) {
--    *vedgelist = (int *) trimalloc((int) (m->edges * 2 * sizeof(int)));
--  }
--  *vedgemarkerlist = (int *) NULL;
--  /* Allocate memory for output Voronoi norms if necessary. */
--  if (*vnormlist == (REAL *) NULL) {
--    *vnormlist = (REAL *) trimalloc((int) (m->edges * 2 * sizeof(REAL)));
--  }
--  elist = *vedgelist;
--  normlist = *vnormlist;
--  coordindex = 0;
--#else /* not TRILIBRARY */
--  if (!b->quiet) {
--    printf("Writing %s.\n", vedgefilename);
--  }
--  outfile = fopen(vedgefilename, "w");
--  if (outfile == (FILE *) NULL) {
--    printf("  Error:  Cannot create file %s.\n", vedgefilename);
--    triexit(1);
--  }
--  /* Number of edges, zero boundary markers. */
--  fprintf(outfile, "%ld  %d\n", m->edges, 0);
--#endif /* not TRILIBRARY */
--
--  traversalinit(&m->triangles);
--  triangleloop.tri = triangletraverse(m);
--  vedgenumber = b->firstnumber;
--  /* To loop over the set of edges, loop over all triangles, and look at   */
--  /*   the three edges of each triangle.  If there isn't another triangle  */
--  /*   adjacent to the edge, operate on the edge.  If there is another     */
--  /*   adjacent triangle, operate on the edge only if the current triangle */
--  /*   has a smaller pointer than its neighbor.  This way, each edge is    */
--  /*   considered only once.                                               */
--  while (triangleloop.tri != (triangle *) NULL) {
--    for (triangleloop.orient = 0; triangleloop.orient < 3;
--         triangleloop.orient++) {
--      sym(triangleloop, trisym);
--      if ((triangleloop.tri < trisym.tri) || (trisym.tri == m->dummytri)) {
--        /* Find the number of this triangle (and Voronoi vertex). */
--        p1 = * (int *) (triangleloop.tri + 6);
--        if (trisym.tri == m->dummytri) {
--          org(triangleloop, torg);
--          dest(triangleloop, tdest);
--#ifdef TRILIBRARY
--          /* Copy an infinite ray.  Index of one endpoint, and -1. */
--          elist[coordindex] = p1;
--          normlist[coordindex++] = tdest[1] - torg[1];
--          elist[coordindex] = -1;
--          normlist[coordindex++] = torg[0] - tdest[0];
--#else /* not TRILIBRARY */
--          /* Write an infinite ray.  Edge number, index of one endpoint, -1, */
--          /*   and x and y coordinates of a vector representing the          */
--          /*   direction of the ray.                                         */
--          fprintf(outfile, "%4ld   %d  %d   %.17g  %.17g\n", vedgenumber,
--                  p1, -1, tdest[1] - torg[1], torg[0] - tdest[0]);
--#endif /* not TRILIBRARY */
--        } else {
--          /* Find the number of the adjacent triangle (and Voronoi vertex). */
--          p2 = * (int *) (trisym.tri + 6);
--          /* Finite edge.  Write indices of two endpoints. */
--#ifdef TRILIBRARY
--          elist[coordindex] = p1;
--          normlist[coordindex++] = 0.0;
--          elist[coordindex] = p2;
--          normlist[coordindex++] = 0.0;
--#else /* not TRILIBRARY */
--          fprintf(outfile, "%4ld   %d  %d\n", vedgenumber, p1, p2);
--#endif /* not TRILIBRARY */
--        }
--        vedgenumber++;
--      }
--    }
--    triangleloop.tri = triangletraverse(m);
--  }
--
--#ifndef TRILIBRARY
--  finishfile(outfile, argc, argv);
--#endif /* not TRILIBRARY */
--}
--
--#ifdef TRILIBRARY
--
--#ifdef ANSI_DECLARATORS
--void writeneighbors(struct mesh *m, struct behavior *b, int **neighborlist)
--#else /* not ANSI_DECLARATORS */
--void writeneighbors(m, b, neighborlist)
--struct mesh *m;
--struct behavior *b;
--int **neighborlist;
--#endif /* not ANSI_DECLARATORS */
--
--#else /* not TRILIBRARY */
--
--#ifdef ANSI_DECLARATORS
--void writeneighbors(struct mesh *m, struct behavior *b, char *neighborfilename,
--                    int argc, char **argv)
--#else /* not ANSI_DECLARATORS */
--void writeneighbors(m, b, neighborfilename, argc, argv)
--struct mesh *m;
--struct behavior *b;
--char *neighborfilename;
--int argc;
--char **argv;
--#endif /* not ANSI_DECLARATORS */
--
--#endif /* not TRILIBRARY */
--
--{
--#ifdef TRILIBRARY
--  int *nlist;
--  int index;
--#else /* not TRILIBRARY */
--  FILE *outfile;
--#endif /* not TRILIBRARY */
--  struct otri triangleloop, trisym;
--  long elementnumber;
--  int neighbor1, neighbor2, neighbor3;
--  triangle ptr;                         /* Temporary variable used by sym(). */
--
--#ifdef TRILIBRARY
--  if (!b->quiet) {
--    printf("Writing neighbors.\n");
--  }
--  /* Allocate memory for neighbors if necessary. */
--  if (*neighborlist == (int *) NULL) {
--    *neighborlist = (int *) trimalloc((int) (m->triangles.items * 3 *
--                                             sizeof(int)));
--  }
--  nlist = *neighborlist;
--  index = 0;
--#else /* not TRILIBRARY */
--  if (!b->quiet) {
--    printf("Writing %s.\n", neighborfilename);
--  }
--  outfile = fopen(neighborfilename, "w");
--  if (outfile == (FILE *) NULL) {
--    printf("  Error:  Cannot create file %s.\n", neighborfilename);
--    triexit(1);
--  }
--  /* Number of triangles, three neighbors per triangle. */
--  fprintf(outfile, "%ld  %d\n", m->triangles.items, 3);
--#endif /* not TRILIBRARY */
--
--  traversalinit(&m->triangles);
--  triangleloop.tri = triangletraverse(m);
--  triangleloop.orient = 0;
--  elementnumber = b->firstnumber;
--  while (triangleloop.tri != (triangle *) NULL) {
--    * (int *) (triangleloop.tri + 6) = (int) elementnumber;
--    triangleloop.tri = triangletraverse(m);
--    elementnumber++;
--  }
--  * (int *) (m->dummytri + 6) = -1;
--
--  traversalinit(&m->triangles);
--  triangleloop.tri = triangletraverse(m);
--  elementnumber = b->firstnumber;
--  while (triangleloop.tri != (triangle *) NULL) {
--    triangleloop.orient = 1;
--    sym(triangleloop, trisym);
--    neighbor1 = * (int *) (trisym.tri + 6);
--    triangleloop.orient = 2;
--    sym(triangleloop, trisym);
--    neighbor2 = * (int *) (trisym.tri + 6);
--    triangleloop.orient = 0;
--    sym(triangleloop, trisym);
--    neighbor3 = * (int *) (trisym.tri + 6);
--#ifdef TRILIBRARY
--    nlist[index++] = neighbor1;
--    nlist[index++] = neighbor2;
--    nlist[index++] = neighbor3;
--#else /* not TRILIBRARY */
--    /* Triangle number, neighboring triangle numbers. */
--    fprintf(outfile, "%4ld    %d  %d  %d\n", elementnumber,
--            neighbor1, neighbor2, neighbor3);
--#endif /* not TRILIBRARY */
--
--    triangleloop.tri = triangletraverse(m);
--    elementnumber++;
--  }
--
--#ifndef TRILIBRARY
--  finishfile(outfile, argc, argv);
--#endif /* not TRILIBRARY */
--}
--
--/*****************************************************************************/
--/*                                                                           */
--/*  writeoff()   Write the triangulation to an .off file.                    */
--/*                                                                           */
--/*  OFF stands for the Object File Format, a format used by the Geometry     */
--/*  Center's Geomview package.                                               */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifndef TRILIBRARY
--
--#ifdef ANSI_DECLARATORS
--void writeoff(struct mesh *m, struct behavior *b, char *offfilename,
--              int argc, char **argv)
--#else /* not ANSI_DECLARATORS */
--void writeoff(m, b, offfilename, argc, argv)
--struct mesh *m;
--struct behavior *b;
--char *offfilename;
--int argc;
--char **argv;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  FILE *outfile;
--  struct otri triangleloop;
--  vertex vertexloop;
--  vertex p1, p2, p3;
--  long outvertices;
--
--  if (!b->quiet) {
--    printf("Writing %s.\n", offfilename);
--  }
--
--  if (b->jettison) {
--    outvertices = m->vertices.items - m->undeads;
--  } else {
--    outvertices = m->vertices.items;
--  }
--
--  outfile = fopen(offfilename, "w");
--  if (outfile == (FILE *) NULL) {
--    printf("  Error:  Cannot create file %s.\n", offfilename);
--    triexit(1);
--  }
--  /* Number of vertices, triangles, and edges. */
--  fprintf(outfile, "OFF\n%ld  %ld  %ld\n", outvertices, m->triangles.items,
--          m->edges);
--
--  /* Write the vertices. */
--  traversalinit(&m->vertices);
--  vertexloop = vertextraverse(m);
--  while (vertexloop != (vertex) NULL) {
--    if (!b->jettison || (vertextype(vertexloop) != UNDEADVERTEX)) {
--      /* The "0.0" is here because the OFF format uses 3D coordinates. */
--      fprintf(outfile, " %.17g  %.17g  %.17g\n", vertexloop[0], vertexloop[1],
--              0.0);
--    }
--    vertexloop = vertextraverse(m);
--  }
--
--  /* Write the triangles. */
--  traversalinit(&m->triangles);
--  triangleloop.tri = triangletraverse(m);
--  triangleloop.orient = 0;
--  while (triangleloop.tri != (triangle *) NULL) {
--    org(triangleloop, p1);
--    dest(triangleloop, p2);
--    apex(triangleloop, p3);
--    /* The "3" means a three-vertex polygon. */
--    fprintf(outfile, " 3   %4d  %4d  %4d\n", vertexmark(p1) - b->firstnumber,
--            vertexmark(p2) - b->firstnumber, vertexmark(p3) - b->firstnumber);
--    triangleloop.tri = triangletraverse(m);
--  }
--  finishfile(outfile, argc, argv);
--}
--
--#endif /* not TRILIBRARY */
--
--/**                                                                         **/
--/**                                                                         **/
--/********* File I/O routines end here                                *********/
--
--/*****************************************************************************/
--/*                                                                           */
--/*  quality_statistics()   Print statistics about the quality of the mesh.   */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifdef ANSI_DECLARATORS
--void quality_statistics(struct mesh *m, struct behavior *b)
--#else /* not ANSI_DECLARATORS */
--void quality_statistics(m, b)
--struct mesh *m;
--struct behavior *b;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  struct otri triangleloop;
--  vertex p[3];
--  REAL cossquaretable[8];
--  REAL ratiotable[16];
--  REAL dx[3], dy[3];
--  REAL edgelength[3];
--  REAL dotproduct;
--  REAL cossquare;
--  REAL triarea;
--  REAL shortest, longest;
--  REAL trilongest2;
--  REAL smallestarea, biggestarea;
--  REAL triminaltitude2;
--  REAL minaltitude;
--  REAL triaspect2;
--  REAL worstaspect;
--  REAL smallestangle, biggestangle;
--  REAL radconst, degconst;
--  int angletable[18];
--  int aspecttable[16];
--  int aspectindex;
--  int tendegree;
--  int acutebiggest;
--  int i, ii, j, k;
--
--  printf("Mesh quality statistics:\n\n");
--  radconst = PI / 18.0;
--  degconst = 180.0 / PI;
--  for (i = 0; i < 8; i++) {
--    cossquaretable[i] = cos(radconst * (REAL) (i + 1));
--    cossquaretable[i] = cossquaretable[i] * cossquaretable[i];
--  }
--  for (i = 0; i < 18; i++) {
--    angletable[i] = 0;
--  }
--
--  ratiotable[0]  =      1.5;      ratiotable[1]  =     2.0;
--  ratiotable[2]  =      2.5;      ratiotable[3]  =     3.0;
--  ratiotable[4]  =      4.0;      ratiotable[5]  =     6.0;
--  ratiotable[6]  =     10.0;      ratiotable[7]  =    15.0;
--  ratiotable[8]  =     25.0;      ratiotable[9]  =    50.0;
--  ratiotable[10] =    100.0;      ratiotable[11] =   300.0;
--  ratiotable[12] =   1000.0;      ratiotable[13] = 10000.0;
--  ratiotable[14] = 100000.0;      ratiotable[15] =     0.0;
--  for (i = 0; i < 16; i++) {
--    aspecttable[i] = 0;
--  }
--
--  minaltitude = m->xmax - m->xmin + m->ymax - m->ymin;
--  minaltitude = minaltitude * minaltitude;
--  shortest = minaltitude;
--  longest = 0.0;
--  smallestarea = minaltitude;
--  biggestarea = 0.0;
--  worstaspect = 0.0;
--  smallestangle = 0.0;
--  biggestangle = 2.0;
--  acutebiggest = 1;
--
--  traversalinit(&m->triangles);
--  triangleloop.tri = triangletraverse(m);
--  triangleloop.orient = 0;
--  while (triangleloop.tri != (triangle *) NULL) {
--    org(triangleloop, p[0]);
--    dest(triangleloop, p[1]);
--    apex(triangleloop, p[2]);
--    trilongest2 = 0.0;
--
--    for (i = 0; i < 3; i++) {
--      j = plus1mod3[i];
--      k = minus1mod3[i];
--      dx[i] = p[j][0] - p[k][0];
--      dy[i] = p[j][1] - p[k][1];
--      edgelength[i] = dx[i] * dx[i] + dy[i] * dy[i];
--      if (edgelength[i] > trilongest2) {
--        trilongest2 = edgelength[i];
--      }
--      if (edgelength[i] > longest) {
--        longest = edgelength[i];
--      }
--      if (edgelength[i] < shortest) {
--        shortest = edgelength[i];
--      }
--    }
--
--    triarea = counterclockwise(m, b, p[0], p[1], p[2]);
--    if (triarea < smallestarea) {
--      smallestarea = triarea;
--    }
--    if (triarea > biggestarea) {
--      biggestarea = triarea;
--    }
--    triminaltitude2 = triarea * triarea / trilongest2;
--    if (triminaltitude2 < minaltitude) {
--      minaltitude = triminaltitude2;
--    }
--    triaspect2 = trilongest2 / triminaltitude2;
--    if (triaspect2 > worstaspect) {
--      worstaspect = triaspect2;
--    }
--    aspectindex = 0;
--    while ((triaspect2 > ratiotable[aspectindex] * ratiotable[aspectindex])
--           && (aspectindex < 15)) {
--      aspectindex++;
--    }
--    aspecttable[aspectindex]++;
--
--    for (i = 0; i < 3; i++) {
--      j = plus1mod3[i];
--      k = minus1mod3[i];
--      dotproduct = dx[j] * dx[k] + dy[j] * dy[k];
--      cossquare = dotproduct * dotproduct / (edgelength[j] * edgelength[k]);
--      tendegree = 8;
--      for (ii = 7; ii >= 0; ii--) {
--        if (cossquare > cossquaretable[ii]) {
--          tendegree = ii;
--        }
--      }
--      if (dotproduct <= 0.0) {
--        angletable[tendegree]++;
--        if (cossquare > smallestangle) {
--          smallestangle = cossquare;
--        }
--        if (acutebiggest && (cossquare < biggestangle)) {
--          biggestangle = cossquare;
--        }
--      } else {
--        angletable[17 - tendegree]++;
--        if (acutebiggest || (cossquare > biggestangle)) {
--          biggestangle = cossquare;
--          acutebiggest = 0;
--        }
--      }
--    }
--    triangleloop.tri = triangletraverse(m);
--  }
--
--  shortest = sqrt(shortest);
--  longest = sqrt(longest);
--  minaltitude = sqrt(minaltitude);
--  worstaspect = sqrt(worstaspect);
--  smallestarea *= 0.5;
--  biggestarea *= 0.5;
--  if (smallestangle >= 1.0) {
--    smallestangle = 0.0;
--  } else {
--    smallestangle = degconst * acos(sqrt(smallestangle));
--  }
--  if (biggestangle >= 1.0) {
--    biggestangle = 180.0;
--  } else {
--    if (acutebiggest) {
--      biggestangle = degconst * acos(sqrt(biggestangle));
--    } else {
--      biggestangle = 180.0 - degconst * acos(sqrt(biggestangle));
--    }
--  }
--
--  printf("  Smallest area: %16.5g   |  Largest area: %16.5g\n",
--         smallestarea, biggestarea);
--  printf("  Shortest edge: %16.5g   |  Longest edge: %16.5g\n",
--         shortest, longest);
--  printf("  Shortest altitude: %12.5g   |  Largest aspect ratio: %8.5g\n\n",
--         minaltitude, worstaspect);
--
--  printf("  Triangle aspect ratio histogram:\n");
--  printf("  1.1547 - %-6.6g    :  %8d    | %6.6g - %-6.6g     :  %8d\n",
--         ratiotable[0], aspecttable[0], ratiotable[7], ratiotable[8],
--         aspecttable[8]);
--  for (i = 1; i < 7; i++) {
--    printf("  %6.6g - %-6.6g    :  %8d    | %6.6g - %-6.6g     :  %8d\n",
--           ratiotable[i - 1], ratiotable[i], aspecttable[i],
--           ratiotable[i + 7], ratiotable[i + 8], aspecttable[i + 8]);
--  }
--  printf("  %6.6g - %-6.6g    :  %8d    | %6.6g -            :  %8d\n",
--         ratiotable[6], ratiotable[7], aspecttable[7], ratiotable[14],
--         aspecttable[15]);
--  printf("  (Aspect ratio is longest edge divided by shortest altitude)\n\n");
--
--  printf("  Smallest angle: %15.5g   |  Largest angle: %15.5g\n\n",
--         smallestangle, biggestangle);
--
--  printf("  Angle histogram:\n");
--  for (i = 0; i < 9; i++) {
--    printf("    %3d - %3d degrees:  %8d    |    %3d - %3d degrees:  %8d\n",
--           i * 10, i * 10 + 10, angletable[i],
--           i * 10 + 90, i * 10 + 100, angletable[i + 9]);
--  }
--  printf("\n");
--}
--
--/*****************************************************************************/
--/*                                                                           */
--/*  statistics()   Print all sorts of cool facts.                            */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifdef ANSI_DECLARATORS
--void statistics(struct mesh *m, struct behavior *b)
--#else /* not ANSI_DECLARATORS */
--void statistics(m, b)
--struct mesh *m;
--struct behavior *b;
--#endif /* not ANSI_DECLARATORS */
--
--{
--  printf("\nStatistics:\n\n");
--  printf("  Input vertices: %d\n", m->invertices);
--  if (b->refine) {
--    printf("  Input triangles: %d\n", m->inelements);
--  }
--  if (b->poly) {
--    printf("  Input segments: %d\n", m->insegments);
--    if (!b->refine) {
--      printf("  Input holes: %d\n", m->holes);
--    }
--  }
--
--  printf("\n  Mesh vertices: %ld\n", m->vertices.items - m->undeads);
--  printf("  Mesh triangles: %ld\n", m->triangles.items);
--  printf("  Mesh edges: %ld\n", m->edges);
--  printf("  Mesh exterior boundary edges: %ld\n", m->hullsize);
--  if (b->poly || b->refine) {
--    printf("  Mesh interior boundary edges: %ld\n",
--           m->subsegs.items - m->hullsize);
--    printf("  Mesh subsegments (constrained edges): %ld\n",
--           m->subsegs.items);
--  }
--  printf("\n");
--
--  if (b->verbose) {
--    quality_statistics(m, b);
--    printf("Memory allocation statistics:\n\n");
--    printf("  Maximum number of vertices: %ld\n", m->vertices.maxitems);
--    printf("  Maximum number of triangles: %ld\n", m->triangles.maxitems);
--    if (m->subsegs.maxitems > 0) {
--      printf("  Maximum number of subsegments: %ld\n", m->subsegs.maxitems);
--    }
--    if (m->viri.maxitems > 0) {
--      printf("  Maximum number of viri: %ld\n", m->viri.maxitems);
--    }
--    if (m->badsubsegs.maxitems > 0) {
--      printf("  Maximum number of encroached subsegments: %ld\n",
--             m->badsubsegs.maxitems);
--    }
--    if (m->badtriangles.maxitems > 0) {
--      printf("  Maximum number of bad triangles: %ld\n",
--             m->badtriangles.maxitems);
--    }
--    if (m->flipstackers.maxitems > 0) {
--      printf("  Maximum number of stacked triangle flips: %ld\n",
--             m->flipstackers.maxitems);
--    }
--    if (m->splaynodes.maxitems > 0) {
--      printf("  Maximum number of splay tree nodes: %ld\n",
--             m->splaynodes.maxitems);
--    }
--    printf("  Approximate heap memory use (bytes): %ld\n\n",
--           m->vertices.maxitems * m->vertices.itembytes +
--           m->triangles.maxitems * m->triangles.itembytes +
--           m->subsegs.maxitems * m->subsegs.itembytes +
--           m->viri.maxitems * m->viri.itembytes +
--           m->badsubsegs.maxitems * m->badsubsegs.itembytes +
--           m->badtriangles.maxitems * m->badtriangles.itembytes +
--           m->flipstackers.maxitems * m->flipstackers.itembytes +
--           m->splaynodes.maxitems * m->splaynodes.itembytes);
--
--    printf("Algorithmic statistics:\n\n");
--    if (!b->weighted) {
--      printf("  Number of incircle tests: %ld\n", m->incirclecount);
--    } else {
--      printf("  Number of 3D orientation tests: %ld\n", m->orient3dcount);
--    }
--    printf("  Number of 2D orientation tests: %ld\n", m->counterclockcount);
--    if (m->hyperbolacount > 0) {
--      printf("  Number of right-of-hyperbola tests: %ld\n",
--             m->hyperbolacount);
--    }
--    if (m->circletopcount > 0) {
--      printf("  Number of circle top computations: %ld\n",
--             m->circletopcount);
--    }
--    if (m->circumcentercount > 0) {
--      printf("  Number of triangle circumcenter computations: %ld\n",
--             m->circumcentercount);
--    }
--    printf("\n");
--  }
--}
--
--/*****************************************************************************/
--/*                                                                           */
--/*  main() or triangulate()   Gosh, do everything.                           */
--/*                                                                           */
--/*  The sequence is roughly as follows.  Many of these steps can be skipped, */
--/*  depending on the command line switches.                                  */
--/*                                                                           */
--/*  - Initialize constants and parse the command line.                       */
--/*  - Read the vertices from a file and either                               */
--/*    - triangulate them (no -r), or                                         */
--/*    - read an old mesh from files and reconstruct it (-r).                 */
--/*  - Insert the PSLG segments (-p), and possibly segments on the convex     */
--/*      hull (-c).                                                           */
--/*  - Read the holes (-p), regional attributes (-pA), and regional area      */
--/*      constraints (-pa).  Carve the holes and concavities, and spread the  */
--/*      regional attributes and area constraints.                            */
--/*  - Enforce the constraints on minimum angle (-q) and maximum area (-a).   */
--/*      Also enforce the conforming Delaunay property (-q and -a).           */
--/*  - Compute the number of edges in the resulting mesh.                     */
--/*  - Promote the mesh's linear triangles to higher order elements (-o).     */
--/*  - Write the output files and print the statistics.                       */
--/*  - Check the consistency and Delaunay property of the mesh (-C).          */
--/*                                                                           */
--/*****************************************************************************/
--
--#ifdef TRILIBRARY
--
--#ifdef ANSI_DECLARATORS
--void triangulate(const char *const triswitches, struct triangulateio *in,
--                 struct triangulateio *out, struct triangulateio *vorout)
--#else /* not ANSI_DECLARATORS */
--void triangulate(triswitches, in, out, vorout)
--const char *const triswitches;
--struct triangulateio *in;
--struct triangulateio *out;
--struct triangulateio *vorout;
--#endif /* not ANSI_DECLARATORS */
--
--#else /* not TRILIBRARY */
--
--#ifdef ANSI_DECLARATORS
--int main(int argc, char **argv)
--#else /* not ANSI_DECLARATORS */
--int main(argc, argv)
--int argc;
--char **argv;
--#endif /* not ANSI_DECLARATORS */
--
--#endif /* not TRILIBRARY */
--
--{
--  struct mesh m;
--  struct behavior b;
--  REAL *holearray;                                        /* Array of holes. */
--  REAL *regionarray;   /* Array of regional attributes and area constraints. */
--#ifndef TRILIBRARY
--  FILE *polyfile;
--#endif /* not TRILIBRARY */
--#ifndef NO_TIMER
--  /* Variables for timing the performance of Triangle.  The types are */
--  /*   defined in sys/time.h.                                         */
--  struct timeval tv0, tv1, tv2, tv3, tv4, tv5, tv6;
--  struct timezone tz;
--#endif /* not NO_TIMER */
--
--#ifndef NO_TIMER
--  gettimeofday(&tv0, &tz);
--#endif /* not NO_TIMER */
--
--  triangleinit(&m);
--#ifdef TRILIBRARY
--  parsecommandline(1, &triswitches, &b);
--#else /* not TRILIBRARY */
--  parsecommandline(argc, argv, &b);
--#endif /* not TRILIBRARY */
--  m.steinerleft = b.steiner;
--
--#ifdef TRILIBRARY
--  transfernodes(&m, &b, in->pointlist, in->pointattributelist,
--                in->pointmarkerlist, in->numberofpoints,
--                in->numberofpointattributes);
--#else /* not TRILIBRARY */
--  readnodes(&m, &b, b.innodefilename, b.inpolyfilename, &polyfile);
--#endif /* not TRILIBRARY */
--
--#ifndef NO_TIMER
--  if (!b.quiet) {
--    gettimeofday(&tv1, &tz);
--  }
--#endif /* not NO_TIMER */
--
--#ifdef CDT_ONLY
--  m.hullsize = delaunay(&m, &b);                /* Triangulate the vertices. */
--#else /* not CDT_ONLY */
--  if (b.refine) {
--    /* Read and reconstruct a mesh. */
--#ifdef TRILIBRARY
--    m.hullsize = reconstruct(&m, &b, in->trianglelist,
--                             in->triangleattributelist, in->trianglearealist,
--                             in->numberoftriangles, in->numberofcorners,
--                             in->numberoftriangleattributes,
--                             in->segmentlist, in->segmentmarkerlist,
--                             in->numberofsegments);
--#else /* not TRILIBRARY */
--    m.hullsize = reconstruct(&m, &b, b.inelefilename, b.areafilename,
--                             b.inpolyfilename, polyfile);
--#endif /* not TRILIBRARY */
--  } else {
--    m.hullsize = delaunay(&m, &b);              /* Triangulate the vertices. */
--  }
--#endif /* not CDT_ONLY */
--
--#ifndef NO_TIMER
--  if (!b.quiet) {
--    gettimeofday(&tv2, &tz);
--    if (b.refine) {
--      printf("Mesh reconstruction");
--    } else {
--      printf("Delaunay");
--    }
--    printf(" milliseconds:  %ld\n", 1000l * (tv2.tv_sec - tv1.tv_sec) +
--           (tv2.tv_usec - tv1.tv_usec) / 1000l);
--  }
--#endif /* not NO_TIMER */
--
--  /* Ensure that no vertex can be mistaken for a triangular bounding */
--  /*   box vertex in insertvertex().                                 */
--  m.infvertex1 = (vertex) NULL;
--  m.infvertex2 = (vertex) NULL;
--  m.infvertex3 = (vertex) NULL;
--
--  if (b.usesegments) {
--    m.checksegments = 1;                /* Segments will be introduced next. */
--    if (!b.refine) {
--      /* Insert PSLG segments and/or convex hull segments. */
--#ifdef TRILIBRARY
--      formskeleton(&m, &b, in->segmentlist,
--                   in->segmentmarkerlist, in->numberofsegments);
--#else /* not TRILIBRARY */
--      formskeleton(&m, &b, polyfile, b.inpolyfilename);
--#endif /* not TRILIBRARY */
--    }
--  }
--
--#ifndef NO_TIMER
--  if (!b.quiet) {
--    gettimeofday(&tv3, &tz);
--    if (b.usesegments && !b.refine) {
--      printf("Segment milliseconds:  %ld\n",
--             1000l * (tv3.tv_sec - tv2.tv_sec) +
--             (tv3.tv_usec - tv2.tv_usec) / 1000l);
--    }
--  }
--#endif /* not NO_TIMER */
--
--  if (b.poly && (m.triangles.items > 0)) {
--#ifdef TRILIBRARY
--    holearray = in->holelist;
--    m.holes = in->numberofholes;
--    regionarray = in->regionlist;
--    m.regions = in->numberofregions;
--#else /* not TRILIBRARY */
--    readholes(&m, &b, polyfile, b.inpolyfilename, &holearray, &m.holes,
--              &regionarray, &m.regions);
--#endif /* not TRILIBRARY */
--    if (!b.refine) {
--      /* Carve out holes and concavities. */
--      carveholes(&m, &b, holearray, m.holes, regionarray, m.regions);
--    }
--  } else {
--    /* Without a PSLG, there can be no holes or regional attributes   */
--    /*   or area constraints.  The following are set to zero to avoid */
--    /*   an accidental free() later.                                  */
--    m.holes = 0;
--    m.regions = 0;
--  }
--
--#ifndef NO_TIMER
--  if (!b.quiet) {
--    gettimeofday(&tv4, &tz);
--    if (b.poly && !b.refine) {
--      printf("Hole milliseconds:  %ld\n", 1000l * (tv4.tv_sec - tv3.tv_sec) +
--             (tv4.tv_usec - tv3.tv_usec) / 1000l);
--    }
--  }
--#endif /* not NO_TIMER */
--
--#ifndef CDT_ONLY
--  if (b.quality && (m.triangles.items > 0)) {
--    enforcequality(&m, &b);           /* Enforce angle and area constraints. */
--  }
--#endif /* not CDT_ONLY */
--
--#ifndef NO_TIMER
--  if (!b.quiet) {
--    gettimeofday(&tv5, &tz);
--#ifndef CDT_ONLY
--    if (b.quality) {
--      printf("Quality milliseconds:  %ld\n",
--             1000l * (tv5.tv_sec - tv4.tv_sec) +
--             (tv5.tv_usec - tv4.tv_usec) / 1000l);
--    }
--#endif /* not CDT_ONLY */
--  }
--#endif /* not NO_TIMER */
--
--  /* Calculate the number of edges. */
--  m.edges = (3l * m.triangles.items + m.hullsize) / 2l;
--
--  if (b.order > 1) {
--    highorder(&m, &b);       /* Promote elements to higher polynomial order. */
--  }
--  if (!b.quiet) {
--    printf("\n");
--  }
--
--#ifdef TRILIBRARY
--  if (b.jettison) {
--    out->numberofpoints = m.vertices.items - m.undeads;
--  } else {
--    out->numberofpoints = m.vertices.items;
--  }
--  out->numberofpointattributes = m.nextras;
--  out->numberoftriangles = m.triangles.items;
--  out->numberofcorners = (b.order + 1) * (b.order + 2) / 2;
--  out->numberoftriangleattributes = m.eextras;
--  out->numberofedges = m.edges;
--  if (b.usesegments) {
--    out->numberofsegments = m.subsegs.items;
--  } else {
--    out->numberofsegments = m.hullsize;
--  }
--  if (vorout != (struct triangulateio *) NULL) {
--    vorout->numberofpoints = m.triangles.items;
--    vorout->numberofpointattributes = m.nextras;
--    vorout->numberofedges = m.edges;
--  }
--#endif /* TRILIBRARY */
--  /* If not using iteration numbers, don't write a .node file if one was */
--  /*   read, because the original one would be overwritten!              */
--  if (b.nonodewritten || (b.noiterationnum && m.readnodefile)) {
--    if (!b.quiet) {
--#ifdef TRILIBRARY
--      printf("NOT writing vertices.\n");
--#else /* not TRILIBRARY */
--      printf("NOT writing a .node file.\n");
--#endif /* not TRILIBRARY */
--    }
--    numbernodes(&m, &b);         /* We must remember to number the vertices. */
--  } else {
--    /* writenodes() numbers the vertices too. */
--#ifdef TRILIBRARY
--    writenodes(&m, &b, &out->pointlist, &out->pointattributelist,
--               &out->pointmarkerlist);
--#else /* not TRILIBRARY */
--    writenodes(&m, &b, b.outnodefilename, argc, argv);
--#endif /* TRILIBRARY */
--  }
--  if (b.noelewritten) {
--    if (!b.quiet) {
--#ifdef TRILIBRARY
--      printf("NOT writing triangles.\n");
--#else /* not TRILIBRARY */
--      printf("NOT writing an .ele file.\n");
--#endif /* not TRILIBRARY */
--    }
--  } else {
--#ifdef TRILIBRARY
--    writeelements(&m, &b, &out->trianglelist, &out->triangleattributelist);
--#else /* not TRILIBRARY */
--    writeelements(&m, &b, b.outelefilename, argc, argv);
--#endif /* not TRILIBRARY */
--  }
--  /* The -c switch (convex switch) causes a PSLG to be written */
--  /*   even if none was read.                                  */
--  if (b.poly || b.convex) {
--    /* If not using iteration numbers, don't overwrite the .poly file. */
--    if (b.nopolywritten || b.noiterationnum) {
--      if (!b.quiet) {
--#ifdef TRILIBRARY
--        printf("NOT writing segments.\n");
--#else /* not TRILIBRARY */
--        printf("NOT writing a .poly file.\n");
--#endif /* not TRILIBRARY */
--      }
--    } else {
--#ifdef TRILIBRARY
--      writepoly(&m, &b, &out->segmentlist, &out->segmentmarkerlist);
--      out->numberofholes = m.holes;
--      out->numberofregions = m.regions;
--      if (b.poly) {
--        out->holelist = in->holelist;
--        out->regionlist = in->regionlist;
--      } else {
--        out->holelist = (REAL *) NULL;
--        out->regionlist = (REAL *) NULL;
--      }
--#else /* not TRILIBRARY */
--      writepoly(&m, &b, b.outpolyfilename, holearray, m.holes, regionarray,
--                m.regions, argc, argv);
--#endif /* not TRILIBRARY */
--    }
--  }
--#ifndef TRILIBRARY
--#ifndef CDT_ONLY
--  if (m.regions > 0) {
--    trifree((void *) regionarray);
--  }
--#endif /* not CDT_ONLY */
--  if (m.holes > 0) {
--    trifree((void *) holearray);
--  }
--  if (b.geomview) {
--    writeoff(&m, &b, b.offfilename, argc, argv);
--  }
--#endif /* not TRILIBRARY */
--  if (b.edgesout) {
--#ifdef TRILIBRARY
--    writeedges(&m, &b, &out->edgelist, &out->edgemarkerlist);
--#else /* not TRILIBRARY */
--    writeedges(&m, &b, b.edgefilename, argc, argv);
--#endif /* not TRILIBRARY */
--  }
--  if (b.voronoi) {
--#ifdef TRILIBRARY
--    writevoronoi(&m, &b, &vorout->pointlist, &vorout->pointattributelist,
--                 &vorout->pointmarkerlist, &vorout->edgelist,
--                 &vorout->edgemarkerlist, &vorout->normlist);
--#else /* not TRILIBRARY */
--    writevoronoi(&m, &b, b.vnodefilename, b.vedgefilename, argc, argv);
--#endif /* not TRILIBRARY */
--  }
--  if (b.neighbors) {
--#ifdef TRILIBRARY
--    writeneighbors(&m, &b, &out->neighborlist);
--#else /* not TRILIBRARY */
--    writeneighbors(&m, &b, b.neighborfilename, argc, argv);
--#endif /* not TRILIBRARY */
--  }
--
--  if (!b.quiet) {
--#ifndef NO_TIMER
--    gettimeofday(&tv6, &tz);
--    printf("\nOutput milliseconds:  %ld\n",
--           1000l * (tv6.tv_sec - tv5.tv_sec) +
--           (tv6.tv_usec - tv5.tv_usec) / 1000l);
--    printf("Total running milliseconds:  %ld\n",
--           1000l * (tv6.tv_sec - tv0.tv_sec) +
--           (tv6.tv_usec - tv0.tv_usec) / 1000l);
--#endif /* not NO_TIMER */
--
--    statistics(&m, &b);
--  }
--
--#ifndef REDUCED
--  if (b.docheck) {
--    checkmesh(&m, &b);
--    checkdelaunay(&m, &b);
--  }
--#endif /* not REDUCED */
--
--  triangledeinit(&m, &b);
--#ifndef TRILIBRARY
--  return 0;
--#endif /* not TRILIBRARY */
--};
-diff --git a/v3p/netlib/triangle.h b/v3p/netlib/triangle.h
-deleted file mode 100644
-index de14cb5395..0000000000
---- a/v3p/netlib/triangle.h
-+++ /dev/null
-@@ -1,299 +0,0 @@
--#ifndef netlib_triangle_h_
--#define netlib_triangle_h_
--/*****************************************************************************/
--/*                                                                           */
--/*  (triangle.h)                                                             */
--/*                                                                           */
--/*  Include file for programs that call Triangle.                            */
--/*                                                                           */
--/*  Accompanies Triangle Version 1.6                                         */
--/*  July 28, 2005                                                            */
--/*                                                                           */
--/*  Copyright 1996, 2005                                                     */
--/*  Jonathan Richard Shewchuk                                                */
--/*  2360 Woolsey #H                                                          */
--/*  Berkeley, California  94705-1927                                         */
--/*  jrs@cs.berkeley.edu                                                      */
--/*                                                                           */
--/*****************************************************************************/
--
--/*****************************************************************************/
--/*                                                                           */
--/*  How to call Triangle from another program                                */
--/*                                                                           */
--/*                                                                           */
--/*  If you haven't read Triangle's instructions (run "triangle -h" to read   */
--/*  them), you won't understand what follows.                                */
--/*                                                                           */
--/*  Triangle must be compiled into an object file (triangle.o) with the      */
--/*  TRILIBRARY symbol defined (generally by using the -DTRILIBRARY compiler  */
--/*  switch).  The makefile included with Triangle will do this for you if    */
--/*  you run "make trilibrary".  The resulting object file can be called via  */
--/*  the procedure triangulate().                                             */
--/*                                                                           */
--/*  If the size of the object file is important to you, you may wish to      */
--/*  generate a reduced version of triangle.o.  The REDUCED symbol gets rid   */
--/*  of all features that are primarily of research interest.  Specifically,  */
--/*  the -DREDUCED switch eliminates Triangle's -i, -F, -s, and -C switches.  */
--/*  The CDT_ONLY symbol gets rid of all meshing algorithms above and beyond  */
--/*  constrained Delaunay triangulation.  Specifically, the -DCDT_ONLY switch */
--/*  eliminates Triangle's -r, -q, -a, -u, -D, -Y, -S, and -s switches.       */
--/*                                                                           */
--/*  IMPORTANT:  These definitions (TRILIBRARY, REDUCED, CDT_ONLY) must be    */
--/*  made in the makefile or in triangle.c itself.  Putting these definitions */
--/*  in this file (triangle.h) will not create the desired effect.            */
--/*                                                                           */
--/*                                                                           */
--/*  The calling convention for triangulate() follows.                        */
--/*                                                                           */
--/*      void triangulate(triswitches, in, out, vorout)                       */
--/*      char *triswitches;                                                   */
--/*      struct triangulateio *in;                                            */
--/*      struct triangulateio *out;                                           */
--/*      struct triangulateio *vorout;                                        */
--/*                                                                           */
--/*  `triswitches' is a string containing the command line switches you wish  */
--/*  to invoke.  No initial dash is required.  Some suggestions:              */
--/*                                                                           */
--/*  - You'll probably find it convenient to use the `z' switch so that       */
--/*    points (and other items) are numbered from zero.  This simplifies      */
--/*    indexing, because the first item of any type always starts at index    */
--/*    [0] of the corresponding array, whether that item's number is zero or  */
--/*    one.                                                                   */
--/*  - You'll probably want to use the `Q' (quiet) switch in your final code, */
--/*    but you can take advantage of Triangle's printed output (including the */
--/*    `V' switch) while debugging.                                           */
--/*  - If you are not using the `q', `a', `u', `D', `j', or `s' switches,     */
--/*    then the output points will be identical to the input points, except   */
--/*    possibly for the boundary markers.  If you don't need the boundary     */
--/*    markers, you should use the `N' (no nodes output) switch to save       */
--/*    memory.  (If you do need boundary markers, but need to save memory, a  */
--/*    good nasty trick is to set out->pointlist equal to in->pointlist       */
--/*    before calling triangulate(), so that Triangle overwrites the input    */
--/*    points with identical copies.)                                         */
--/*  - The `I' (no iteration numbers) and `g' (.off file output) switches     */
--/*    have no effect when Triangle is compiled with TRILIBRARY defined.      */
--/*                                                                           */
--/*  `in', `out', and `vorout' are descriptions of the input, the output,     */
--/*  and the Voronoi output.  If the `v' (Voronoi output) switch is not used, */
--/*  `vorout' may be NULL.  `in' and `out' may never be NULL.                 */
--/*                                                                           */
--/*  Certain fields of the input and output structures must be initialized,   */
--/*  as described below.                                                      */
--/*                                                                           */
--/*****************************************************************************/
--
--/*****************************************************************************/
--/*                                                                           */
--/*  The `triangulateio' structure.                                           */
--/*                                                                           */
--/*  Used to pass data into and out of the triangulate() procedure.           */
--/*                                                                           */
--/*                                                                           */
--/*  Arrays are used to store points, triangles, markers, and so forth.  In   */
--/*  all cases, the first item in any array is stored starting at index [0].  */
--/*  However, that item is item number `1' unless the `z' switch is used, in  */
--/*  which case it is item number `0'.  Hence, you may find it easier to      */
--/*  index points (and triangles in the neighbor list) if you use the `z'     */
--/*  switch.  Unless, of course, you're calling Triangle from a Fortran       */
--/*  program.                                                                 */
--/*                                                                           */
--/*  Description of fields (except the `numberof' fields, which are obvious): */
--/*                                                                           */
--/*  `pointlist':  An array of point coordinates.  The first point's x        */
--/*    coordinate is at index [0] and its y coordinate at index [1], followed */
--/*    by the coordinates of the remaining points.  Each point occupies two   */
--/*    REALs.                                                                 */
--/*  `pointattributelist':  An array of point attributes.  Each point's       */
--/*    attributes occupy `numberofpointattributes' REALs.                     */
--/*  `pointmarkerlist':  An array of point markers; one int per point.        */
--/*                                                                           */
--/*  `trianglelist':  An array of triangle corners.  The first triangle's     */
--/*    first corner is at index [0], followed by its other two corners in     */
--/*    counterclockwise order, followed by any other nodes if the triangle    */
--/*    represents a nonlinear element.  Each triangle occupies                */
--/*    `numberofcorners' ints.                                                */
--/*  `triangleattributelist':  An array of triangle attributes.  Each         */
--/*    triangle's attributes occupy `numberoftriangleattributes' REALs.       */
--/*  `trianglearealist':  An array of triangle area constraints; one REAL per */
--/*    triangle.  Input only.                                                 */
--/*  `neighborlist':  An array of triangle neighbors; three ints per          */
--/*    triangle.  Output only.                                                */
--/*                                                                           */
--/*  `segmentlist':  An array of segment endpoints.  The first segment's      */
--/*    endpoints are at indices [0] and [1], followed by the remaining        */
--/*    segments.  Two ints per segment.                                       */
--/*  `segmentmarkerlist':  An array of segment markers; one int per segment.  */
--/*                                                                           */
--/*  `holelist':  An array of holes.  The first hole's x and y coordinates    */
--/*    are at indices [0] and [1], followed by the remaining holes.  Two      */
--/*    REALs per hole.  Input only, although the pointer is copied to the     */
--/*    output structure for your convenience.                                 */
--/*                                                                           */
--/*  `regionlist':  An array of regional attributes and area constraints.     */
--/*    The first constraint's x and y coordinates are at indices [0] and [1], */
--/*    followed by the regional attribute at index [2], followed by the       */
--/*    maximum area at index [3], followed by the remaining area constraints. */
--/*    Four REALs per area constraint.  Note that each regional attribute is  */
--/*    used only if you select the `A' switch, and each area constraint is    */
--/*    used only if you select the `a' switch (with no number following), but */
--/*    omitting one of these switches does not change the memory layout.      */
--/*    Input only, although the pointer is copied to the output structure for */
--/*    your convenience.                                                      */
--/*                                                                           */
--/*  `edgelist':  An array of edge endpoints.  The first edge's endpoints are */
--/*    at indices [0] and [1], followed by the remaining edges.  Two ints per */
--/*    edge.  Output only.                                                    */
--/*  `edgemarkerlist':  An array of edge markers; one int per edge.  Output   */
--/*    only.                                                                  */
--/*  `normlist':  An array of normal vectors, used for infinite rays in       */
--/*    Voronoi diagrams.  The first normal vector's x and y magnitudes are    */
--/*    at indices [0] and [1], followed by the remaining vectors.  For each   */
--/*    finite edge in a Voronoi diagram, the normal vector written is the     */
--/*    zero vector.  Two REALs per edge.  Output only.                        */
--/*                                                                           */
--/*                                                                           */
--/*  Any input fields that Triangle will examine must be initialized.         */
--/*  Furthermore, for each output array that Triangle will write to, you      */
--/*  must either provide space by setting the appropriate pointer to point    */
--/*  to the space you want the data written to, or you must initialize the    */
--/*  pointer to NULL, which tells Triangle to allocate space for the results. */
--/*  The latter option is preferable, because Triangle always knows exactly   */
--/*  how much space to allocate.  The former option is provided mainly for    */
--/*  people who need to call Triangle from Fortran code, though it also makes */
--/*  possible some nasty space-saving tricks, like writing the output to the  */
--/*  same arrays as the input.                                                */
--/*                                                                           */
--/*  Triangle will not free() any input or output arrays, including those it  */
--/*  allocates itself; that's up to you.  You should free arrays allocated by */
--/*  Triangle by calling the trifree() procedure defined below.  (By default, */
--/*  trifree() just calls the standard free() library procedure, but          */
--/*  applications that call triangulate() may replace trimalloc() and         */
--/*  trifree() in triangle.c to use specialized memory allocators.)           */
--/*                                                                           */
--/*  Here's a guide to help you decide which fields you must initialize       */
--/*  before you call triangulate().                                           */
--/*                                                                           */
--/*  `in':                                                                    */
--/*                                                                           */
--/*    - `pointlist' must always point to a list of points; `numberofpoints'  */
--/*      and `numberofpointattributes' must be properly set.                  */
--/*      `pointmarkerlist' must either be set to NULL (in which case all      */
--/*      markers default to zero), or must point to a list of markers.  If    */
--/*      `numberofpointattributes' is not zero, `pointattributelist' must     */
--/*      point to a list of point attributes.                                 */
--/*    - If the `r' switch is used, `trianglelist' must point to a list of    */
--/*      triangles, and `numberoftriangles', `numberofcorners', and           */
--/*      `numberoftriangleattributes' must be properly set.  If               */
--/*      `numberoftriangleattributes' is not zero, `triangleattributelist'    */
--/*      must point to a list of triangle attributes.  If the `a' switch is   */
--/*      used (with no number following), `trianglearealist' must point to a  */
--/*      list of triangle area constraints.  `neighborlist' may be ignored.   */
--/*    - If the `p' switch is used, `segmentlist' must point to a list of     */
--/*      segments, `numberofsegments' must be properly set, and               */
--/*      `segmentmarkerlist' must either be set to NULL (in which case all    */
--/*      markers default to zero), or must point to a list of markers.        */
--/*    - If the `p' switch is used without the `r' switch, then               */
--/*      `numberofholes' and `numberofregions' must be properly set.  If      */
--/*      `numberofholes' is not zero, `holelist' must point to a list of      */
--/*      holes.  If `numberofregions' is not zero, `regionlist' must point to */
--/*      a list of region constraints.                                        */
--/*    - If the `p' switch is used, `holelist', `numberofholes',              */
--/*      `regionlist', and `numberofregions' is copied to `out'.  (You can    */
--/*      nonetheless get away with not initializing them if the `r' switch is */
--/*      used.)                                                               */
--/*    - `edgelist', `edgemarkerlist', `normlist', and `numberofedges' may be */
--/*      ignored.                                                             */
--/*                                                                           */
--/*  `out':                                                                   */
--/*                                                                           */
--/*    - `pointlist' must be initialized (NULL or pointing to memory) unless  */
--/*      the `N' switch is used.  `pointmarkerlist' must be initialized       */
--/*      unless the `N' or `B' switch is used.  If `N' is not used and        */
--/*      `in->numberofpointattributes' is not zero, `pointattributelist' must */
--/*      be initialized.                                                      */
--/*    - `trianglelist' must be initialized unless the `E' switch is used.    */
--/*      `neighborlist' must be initialized if the `n' switch is used.  If    */
--/*      the `E' switch is not used and (`in->numberofelementattributes' is   */
--/*      not zero or the `A' switch is used), `elementattributelist' must be  */
--/*      initialized.  `trianglearealist' may be ignored.                     */
--/*    - `segmentlist' must be initialized if the `p' or `c' switch is used,  */
--/*      and the `P' switch is not used.  `segmentmarkerlist' must also be    */
--/*      initialized under these circumstances unless the `B' switch is used. */
--/*    - `edgelist' must be initialized if the `e' switch is used.            */
--/*      `edgemarkerlist' must be initialized if the `e' switch is used and   */
--/*      the `B' switch is not.                                               */
--/*    - `holelist', `regionlist', `normlist', and all scalars may be ignored.*/
--/*                                                                           */
--/*  `vorout' (only needed if `v' switch is used):                            */
--/*                                                                           */
--/*    - `pointlist' must be initialized.  If `in->numberofpointattributes'   */
--/*      is not zero, `pointattributelist' must be initialized.               */
--/*      `pointmarkerlist' may be ignored.                                    */
--/*    - `edgelist' and `normlist' must both be initialized.                  */
--/*      `edgemarkerlist' may be ignored.                                     */
--/*    - Everything else may be ignored.                                      */
--/*                                                                           */
--/*  After a call to triangulate(), the valid fields of `out' and `vorout'    */
--/*  will depend, in an obvious way, on the choice of switches used.  Note    */
--/*  that when the `p' switch is used, the pointers `holelist' and            */
--/*  `regionlist' are copied from `in' to `out', but no new space is          */
--/*  allocated; be careful that you don't free() the same array twice.  On    */
--/*  the other hand, Triangle will never copy the `pointlist' pointer (or any */
--/*  others); new space is allocated for `out->pointlist', or if the `N'      */
--/*  switch is used, `out->pointlist' remains uninitialized.                  */
--/*                                                                           */
--/*  All of the meaningful `numberof' fields will be properly set; for        */
--/*  instance, `numberofedges' will represent the number of edges in the      */
--/*  triangulation whether or not the edges were written.  If segments are    */
--/*  not used, `numberofsegments' will indicate the number of boundary edges. */
--/*                                                                           */
--/*****************************************************************************/
--#undef REAL
--#ifdef SINGLE
--#define REAL float
--#else /* not SINGLE */
--#define REAL double
--#endif /* not SINGLE */
--
--struct triangulateio {
--  REAL *pointlist;                                               /* In / out */
--  REAL *pointattributelist;                                      /* In / out */
--  int *pointmarkerlist;                                          /* In / out */
--  int numberofpoints;                                            /* In / out */
--  int numberofpointattributes;                                   /* In / out */
--
--  int *trianglelist;                                             /* In / out */
--  REAL *triangleattributelist;                                   /* In / out */
--  REAL *trianglearealist;                                         /* In only */
--  int *neighborlist;                                             /* Out only */
--  int numberoftriangles;                                         /* In / out */
--  int numberofcorners;                                           /* In / out */
--  int numberoftriangleattributes;                                /* In / out */
--
--  int *segmentlist;                                              /* In / out */
--  int *segmentmarkerlist;                                        /* In / out */
--  int numberofsegments;                                          /* In / out */
--
--  REAL *holelist;                        /* In / pointer to array copied out */
--  int numberofholes;                                      /* In / copied out */
--
--  REAL *regionlist;                      /* In / pointer to array copied out */
--  int numberofregions;                                    /* In / copied out */
--
--  int *edgelist;                                                 /* Out only */
--  int *edgemarkerlist;            /* Not used with Voronoi diagram; out only */
--  REAL *normlist;                /* Used only with Voronoi diagram; out only */
--  int numberofedges;                                             /* Out only */
--};
--
--#define ANSI_DECLARATORS
--#ifdef ANSI_DECLARATORS
--void triangulate(const char * const, struct triangulateio *, struct triangulateio *,
--                 struct triangulateio *);
--void trifree(void *memptr);
--#else /* not ANSI_DECLARATORS */
--void triangulate();
--void trifree();
--#endif /* not ANSI_DECLARATORS */
--#endif /* netlib_triangle_h_ */
--- 
-2.46.1
-
diff --git a/0008-More-sonames.patch b/0008-More-sonames.patch
new file mode 100644
index 0000000..7703850
--- /dev/null
+++ b/0008-More-sonames.patch
@@ -0,0 +1,819 @@
+From 0a1e1ce761a79e9856aea1e14dfd177b3d71fec1 Mon Sep 17 00:00:00 2001
+From: Mario Ceresa <mrceresa@gmail.com>
+Date: Wed, 10 Oct 2012 17:38:03 +0200
+Subject: [PATCH 08/23] More sonames
+
+Signed-off-by: Mario Ceresa <mrceresa@gmail.com>
+---
+ contrib/brl/b3p/minizip/CMakeLists.txt   | 1 +
+ contrib/brl/bbas/bdgl/CMakeLists.txt     | 1 +
+ contrib/brl/bbas/bdpg/CMakeLists.txt     | 1 +
+ contrib/brl/bbas/bgrl/CMakeLists.txt     | 1 +
+ contrib/brl/bbas/bnl/CMakeLists.txt      | 1 +
+ contrib/brl/bbas/bnl/algo/CMakeLists.txt | 1 +
+ contrib/brl/bbas/bsol/CMakeLists.txt     | 1 +
+ contrib/brl/bbas/bsta/CMakeLists.txt     | 1 +
+ contrib/brl/bbas/btol/CMakeLists.txt     | 1 +
+ contrib/brl/bbas/bugl/CMakeLists.txt     | 1 +
+ contrib/brl/bbas/bvgl/CMakeLists.txt     | 1 +
+ contrib/brl/bseg/brip/CMakeLists.txt     | 1 +
+ contrib/brl/bseg/sdet/CMakeLists.txt     | 1 +
+ contrib/gel/geml/CMakeLists.txt          | 1 +
+ contrib/gel/gevd/CMakeLists.txt          | 1 +
+ contrib/gel/gmvl/CMakeLists.txt          | 1 +
+ contrib/gel/gst/CMakeLists.txt           | 1 +
+ contrib/gel/gtrl/CMakeLists.txt          | 1 +
+ contrib/gel/vdgl/CMakeLists.txt          | 1 +
+ contrib/gel/vifa/CMakeLists.txt          | 1 +
+ contrib/gel/vmal/CMakeLists.txt          | 1 +
+ contrib/gel/vsol/CMakeLists.txt          | 1 +
+ contrib/gel/vtol/CMakeLists.txt          | 1 +
+ contrib/gel/vtol/algo/CMakeLists.txt     | 1 +
+ contrib/mul/clsfy/CMakeLists.txt         | 1 +
+ contrib/mul/ipts/CMakeLists.txt          | 1 +
+ contrib/mul/mbl/CMakeLists.txt           | 1 +
+ contrib/mul/pdf1d/CMakeLists.txt         | 1 +
+ contrib/mul/vil3d/CMakeLists.txt         | 1 +
+ contrib/mul/vil3d/algo/CMakeLists.txt    | 1 +
+ contrib/mul/vil3d/io/CMakeLists.txt      | 1 +
+ contrib/mul/vimt/CMakeLists.txt          | 1 +
+ contrib/mul/vimt/algo/CMakeLists.txt     | 1 +
+ contrib/mul/vimt3d/CMakeLists.txt        | 1 +
+ contrib/mul/vpdfl/CMakeLists.txt         | 1 +
+ contrib/oxl/mvl/CMakeLists.txt           | 1 +
+ contrib/oxl/osl/CMakeLists.txt           | 1 +
+ contrib/prip/vdtop/CMakeLists.txt        | 1 +
+ contrib/prip/vmap/CMakeLists.txt         | 1 +
+ contrib/prip/vpyr/CMakeLists.txt         | 1 +
+ contrib/rpl/rgrl/CMakeLists.txt          | 1 +
+ contrib/rpl/rrel/CMakeLists.txt          | 2 +-
+ contrib/rpl/rsdl/CMakeLists.txt          | 1 +
+ contrib/tbl/vepl/CMakeLists.txt          | 1 +
+ contrib/tbl/vipl/CMakeLists.txt          | 1 +
+ core/vbl/CMakeLists.txt                  | 1 +
+ core/vbl/io/CMakeLists.txt               | 1 +
+ core/vcsl/CMakeLists.txt                 | 1 +
+ core/vgl/CMakeLists.txt                  | 1 +
+ core/vgl/algo/CMakeLists.txt             | 1 +
+ core/vgl/io/CMakeLists.txt               | 1 +
+ core/vgl/xio/CMakeLists.txt              | 1 +
+ core/vidl/CMakeLists.txt                 | 1 +
+ core/vil/io/CMakeLists.txt               | 1 +
+ core/vil1/CMakeLists.txt                 | 1 +
+ core/vil1/io/CMakeLists.txt              | 1 +
+ core/vnl/io/CMakeLists.txt               | 1 +
+ core/vnl/xio/CMakeLists.txt              | 1 +
+ core/vpl/CMakeLists.txt                  | 1 +
+ core/vsl/CMakeLists.txt                  | 1 +
+ core/vul/CMakeLists.txt                  | 1 +
+ core/vul/io/CMakeLists.txt               | 1 +
+ 62 files changed, 62 insertions(+), 1 deletion(-)
+
+diff --git a/contrib/brl/b3p/minizip/CMakeLists.txt b/contrib/brl/b3p/minizip/CMakeLists.txt
+index 5f9c310..02ccbfe 100644
+--- a/contrib/brl/b3p/minizip/CMakeLists.txt
++++ b/contrib/brl/b3p/minizip/CMakeLists.txt
+@@ -22,6 +22,7 @@ IF(WIN32)
+ ENDIF(WIN32)
+ 
+ ADD_LIBRARY( minizip ${minizip_sources} )
++SET_TARGET_PROPERTIES(minizip PROPERTIES ${VXL_LIBRARY_PROPERTIES})
+ INSTALL_TARGETS( /lib minizip )
+ 
+ ENDIF(ZLIB_FOUND)
+diff --git a/contrib/brl/bbas/bdgl/CMakeLists.txt b/contrib/brl/bbas/bdgl/CMakeLists.txt
+index a6315f0..90b0856 100644
+--- a/contrib/brl/bbas/bdgl/CMakeLists.txt
++++ b/contrib/brl/bbas/bdgl/CMakeLists.txt
+@@ -20,6 +20,7 @@ SET(bdgl_sources
+ )
+ 
+ ADD_LIBRARY(bdgl ${bdgl_sources})
++SET_TARGET_PROPERTIES(bdgl PROPERTIES ${VXL_LIBRARY_PROPERTIES})
+ INSTALL_TARGETS(/lib bdgl)
+ INSTALL_NOBASE_HEADER_FILES(/include/vxl/contrib/brl/bbas/bdgl ${bdgl_sources})
+ 
+diff --git a/contrib/brl/bbas/bdpg/CMakeLists.txt b/contrib/brl/bbas/bdpg/CMakeLists.txt
+index 40ca6cb..73b4eec 100644
+--- a/contrib/brl/bbas/bdpg/CMakeLists.txt
++++ b/contrib/brl/bbas/bdpg/CMakeLists.txt
+@@ -10,6 +10,7 @@ bdpg_array_dynamic_prg.cxx    bdpg_array_dynamic_prg.h
+ AUX_SOURCE_DIRECTORY(Templates bdpg_sources)
+ 
+ ADD_LIBRARY(bdpg ${bdpg_sources})
++SET_TARGET_PROPERTIES(bdpg PROPERTIES ${VXL_LIBRARY_PROPERTIES})
+ INSTALL_TARGETS(/lib bdpg)
+ INSTALL_NOBASE_HEADER_FILES(/include/vxl/contrib/brl/bbas/bdpg ${bdpg_sources})
+ 
+diff --git a/contrib/brl/bbas/bgrl/CMakeLists.txt b/contrib/brl/bbas/bgrl/CMakeLists.txt
+index cd7071c..8a34186 100644
+--- a/contrib/brl/bbas/bgrl/CMakeLists.txt
++++ b/contrib/brl/bbas/bgrl/CMakeLists.txt
+@@ -19,6 +19,7 @@ SET(bgrl_sources
+ AUX_SOURCE_DIRECTORY(Templates bgrl_sources)
+ 
+ ADD_LIBRARY(bgrl ${bgrl_sources})
++SET_TARGET_PROPERTIES(bgrl PROPERTIES ${VXL_LIBRARY_PROPERTIES})
+ INSTALL_TARGETS(/lib bgrl)
+ INSTALL_NOBASE_HEADER_FILES(/include/vxl/contrib/brl/bbas/bgrl ${bgrl_sources})
+ 
+diff --git a/contrib/brl/bbas/bnl/CMakeLists.txt b/contrib/brl/bbas/bnl/CMakeLists.txt
+index 490b3ee..4b17399 100644
+--- a/contrib/brl/bbas/bnl/CMakeLists.txt
++++ b/contrib/brl/bbas/bnl/CMakeLists.txt
+@@ -8,6 +8,7 @@ SET(bnl_sources
+    )
+ 
+ ADD_LIBRARY(bnl ${bnl_sources})
++SET_TARGET_PROPERTIES(bnl PROPERTIES ${VXL_LIBRARY_PROPERTIES})
+ INSTALL_TARGETS(/lib bnl)
+ INSTALL_NOBASE_HEADER_FILES(/include/vxl/contrib/brl/bbas/bnl ${bnl_sources})
+ 
+diff --git a/contrib/brl/bbas/bnl/algo/CMakeLists.txt b/contrib/brl/bbas/bnl/algo/CMakeLists.txt
+index f0c455a..be88139 100644
+--- a/contrib/brl/bbas/bnl/algo/CMakeLists.txt
++++ b/contrib/brl/bbas/bnl/algo/CMakeLists.txt
+@@ -5,6 +5,7 @@ SET( bnl_algo_sources
+ )
+ 
+ ADD_LIBRARY( bnl_algo ${bnl_algo_sources} )
++SET_TARGET_PROPERTIES(bnl_algo PROPERTIES ${VXL_LIBRARY_PROPERTIES})
+ INSTALL_TARGETS(/lib bnl_algo)
+ INSTALL_NOBASE_HEADER_FILES(/include/vxl/contrib/brl/bbas/bnl/algo ${bnl_algo_sources})
+ TARGET_LINK_LIBRARIES( bnl_algo vnl )
+diff --git a/contrib/brl/bbas/bsol/CMakeLists.txt b/contrib/brl/bbas/bsol/CMakeLists.txt
+index 33f6dde..7608c80 100644
+--- a/contrib/brl/bbas/bsol/CMakeLists.txt
++++ b/contrib/brl/bbas/bsol/CMakeLists.txt
+@@ -24,6 +24,7 @@ SET(bsol_sources
+ AUX_SOURCE_DIRECTORY(Templates bsol_sources)
+ 
+ ADD_LIBRARY(bsol ${bsol_sources})
++SET_TARGET_PROPERTIES(bsol PROPERTIES ${VXL_LIBRARY_PROPERTIES})
+ INSTALL_TARGETS(/lib bsol)
+ INSTALL_NOBASE_HEADER_FILES(/include/vxl/contrib/brl/bbas/bsol ${bsol_sources})
+ TARGET_LINK_LIBRARIES(bsol vsol vgl_algo vgl vnl vbl)
+diff --git a/contrib/brl/bbas/bsta/CMakeLists.txt b/contrib/brl/bbas/bsta/CMakeLists.txt
+index 9370247..f762491 100644
+--- a/contrib/brl/bbas/bsta/CMakeLists.txt
++++ b/contrib/brl/bbas/bsta/CMakeLists.txt
+@@ -62,6 +62,7 @@ SET(bsta_sources
+ 
+ AUX_SOURCE_DIRECTORY(Templates bsta_sources)
+ ADD_LIBRARY(bsta  ${bsta_sources})
++SET_TARGET_PROPERTIES(bsta PROPERTIES ${VXL_LIBRARY_PROPERTIES})
+ INSTALL_TARGETS(/lib bsta)
+ INSTALL_NOBASE_HEADER_FILES(/include/vxl/contrib/bsta ${bsta_sources})
+ 
+diff --git a/contrib/brl/bbas/btol/CMakeLists.txt b/contrib/brl/bbas/btol/CMakeLists.txt
+index a80f2ce..d5bcba9 100644
+--- a/contrib/brl/bbas/btol/CMakeLists.txt
++++ b/contrib/brl/bbas/btol/CMakeLists.txt
+@@ -19,6 +19,7 @@ SET(btol_sources
+ )
+ 
+ ADD_LIBRARY(btol ${btol_sources})
++SET_TARGET_PROPERTIES(btol PROPERTIES ${VXL_LIBRARY_PROPERTIES})
+ INSTALL_TARGETS(/lib btol)
+ INSTALL_NOBASE_HEADER_FILES(/include/vxl/contrib/btol ${btol_sources})
+ 
+diff --git a/contrib/brl/bbas/bugl/CMakeLists.txt b/contrib/brl/bbas/bugl/CMakeLists.txt
+index f6cc10a..022890b 100644
+--- a/contrib/brl/bbas/bugl/CMakeLists.txt
++++ b/contrib/brl/bbas/bugl/CMakeLists.txt
+@@ -26,6 +26,7 @@ SET(bugl_sources
+ AUX_SOURCE_DIRECTORY(Templates bugl_sources)
+ 
+ ADD_LIBRARY(bugl ${bugl_sources})
++SET_TARGET_PROPERTIES(bugl PROPERTIES ${VXL_LIBRARY_PROPERTIES})
+ INSTALL_TARGETS(/lib bugl)
+ INSTALL_NOBASE_HEADER_FILES(/include/vxl/contrib/brl/bbas/bugl ${bugl_sources})
+ TARGET_LINK_LIBRARIES(bugl vnl vgl_algo vgl vbl)
+diff --git a/contrib/brl/bbas/bvgl/CMakeLists.txt b/contrib/brl/bbas/bvgl/CMakeLists.txt
+index 3d4e456..bcb5e8b 100644
+--- a/contrib/brl/bbas/bvgl/CMakeLists.txt
++++ b/contrib/brl/bbas/bvgl/CMakeLists.txt
+@@ -38,6 +38,7 @@ ENDIF(EXPAT_FOUND)
+ 
+ #Create BVGL library
+ ADD_LIBRARY(bvgl ${bvgl_sources})
++SET_TARGET_PROPERTIES(bvgl PROPERTIES ${VXL_LIBRARY_PROPERTIES})
+ INSTALL_TARGETS(/lib bvgl)
+ INSTALL_NOBASE_HEADER_FILES(/include/vxl/contrib/brl/bbas/bvgl ${bvgl_sources})
+ TARGET_LINK_LIBRARIES(bvgl vsol vgl_algo vgl_io vgl vnl_algo vnl vil vbl)
+diff --git a/contrib/brl/bseg/brip/CMakeLists.txt b/contrib/brl/bseg/brip/CMakeLists.txt
+index 0e03e27..7864317 100644
+--- a/contrib/brl/bseg/brip/CMakeLists.txt
++++ b/contrib/brl/bseg/brip/CMakeLists.txt
+@@ -40,6 +40,7 @@ SET(brip_sources
+ AUX_SOURCE_DIRECTORY(Templates brip_sources)
+ 
+ ADD_LIBRARY(brip ${brip_sources})
++SET_TARGET_PROPERTIES(brip PROPERTIES ${VXL_LIBRARY_PROPERTIES})
+ INSTALL_TARGETS(/lib brip)
+ INSTALL_NOBASE_HEADER_FILES(/include/vxl/contrib/brl/bseg/brip ${brip_sources})
+ 
+diff --git a/contrib/brl/bseg/sdet/CMakeLists.txt b/contrib/brl/bseg/sdet/CMakeLists.txt
+index 8d603f5..ffb0445 100644
+--- a/contrib/brl/bseg/sdet/CMakeLists.txt
++++ b/contrib/brl/bseg/sdet/CMakeLists.txt
+@@ -55,6 +55,7 @@ SET(sdet_sources
+ AUX_SOURCE_DIRECTORY(Templates sdet_sources)
+ 
+ ADD_LIBRARY(sdet ${sdet_sources})
++SET_TARGET_PROPERTIES(sdet PROPERTIES ${VXL_LIBRARY_PROPERTIES})
+ INSTALL_TARGETS(/lib sdet)
+ INSTALL_NOBASE_HEADER_FILES(/include/vxl/contrib/brl/bseg/sdet ${sdet_sources})
+ 
+diff --git a/contrib/gel/geml/CMakeLists.txt b/contrib/gel/geml/CMakeLists.txt
+index 07b4772..8f4b799 100644
+--- a/contrib/gel/geml/CMakeLists.txt
++++ b/contrib/gel/geml/CMakeLists.txt
+@@ -12,6 +12,7 @@ SET(geml_sources
+ )
+ 
+ ADD_LIBRARY(geml ${geml_sources})
++SET_TARGET_PROPERTIES(geml PROPERTIES ${VXL_LIBRARY_PROPERTIES})
+ INSTALL_TARGETS(/lib geml)
+ INSTALL_NOBASE_HEADER_FILES(/include/vxl/contrib/gel/geml ${geml_sources})
+ TARGET_LINK_LIBRARIES(geml vil1 vnl)
+diff --git a/contrib/gel/gevd/CMakeLists.txt b/contrib/gel/gevd/CMakeLists.txt
+index 87edfbe..265cb28 100644
+--- a/contrib/gel/gevd/CMakeLists.txt
++++ b/contrib/gel/gevd/CMakeLists.txt
+@@ -33,6 +33,7 @@ IF(CMAKE_COMPILER_IS_GNUCXX)
+ ENDIF(CMAKE_COMPILER_IS_GNUCXX)
+ 
+ ADD_LIBRARY(gevd ${gevd_sources})
++SET_TARGET_PROPERTIES(gevd PROPERTIES ${VXL_LIBRARY_PROPERTIES})
+ INSTALL_TARGETS(/lib gevd)
+ INSTALL_NOBASE_HEADER_FILES(/include/vxl/contrib/gel/gevd ${gevd_sources})
+ TARGET_LINK_LIBRARIES(gevd vtol vsol vdgl vil1 vil vnl vgl vbl vul)
+diff --git a/contrib/gel/gmvl/CMakeLists.txt b/contrib/gel/gmvl/CMakeLists.txt
+index 3f99c15..55b1d8c 100644
+--- a/contrib/gel/gmvl/CMakeLists.txt
++++ b/contrib/gel/gmvl/CMakeLists.txt
+@@ -21,6 +21,7 @@ SET(gmvl_sources
+ AUX_SOURCE_DIRECTORY(Templates gmvl_sources)
+ 
+ ADD_LIBRARY(gmvl ${gmvl_sources})
++SET_TARGET_PROPERTIES(gmvl PROPERTIES ${VXL_LIBRARY_PROPERTIES})
+ INSTALL_TARGETS(/lib gmvl)
+ INSTALL_NOBASE_HEADER_FILES(/include/vxl/contrib/gel/gmvl ${gmvl_sources})
+ TARGET_LINK_LIBRARIES(gmvl vtol vil1 vnl vbl vcl)
+diff --git a/contrib/gel/gst/CMakeLists.txt b/contrib/gel/gst/CMakeLists.txt
+index e9e5d01..3bb59d6 100644
+--- a/contrib/gel/gst/CMakeLists.txt
++++ b/contrib/gel/gst/CMakeLists.txt
+@@ -17,6 +17,7 @@ SET(gst_sources
+ AUX_SOURCE_DIRECTORY(Templates gst_sources)
+ 
+ ADD_LIBRARY(gst ${gst_sources})
++SET_TARGET_PROPERTIES(gst PROPERTIES ${VXL_LIBRARY_PROPERTIES})
+ INSTALL_TARGETS(/lib gst)
+ INSTALL_NOBASE_HEADER_FILES(/include/vxl/contrib/gel/gst ${gst_sources})
+ 
+diff --git a/contrib/gel/gtrl/CMakeLists.txt b/contrib/gel/gtrl/CMakeLists.txt
+index c3c79b9..9325960 100644
+--- a/contrib/gel/gtrl/CMakeLists.txt
++++ b/contrib/gel/gtrl/CMakeLists.txt
+@@ -25,6 +25,7 @@ IF(NETLIB_FOUND)
+ ENDIF(NETLIB_FOUND)
+ 
+ ADD_LIBRARY(gtrl ${gtrl_sources})
++SET_TARGET_PROPERTIES(gtrl PROPERTIES ${VXL_LIBRARY_PROPERTIES})
+ INSTALL_TARGETS(/lib gtrl)
+ INSTALL_NOBASE_HEADER_FILES(/include/vxl/contrib/gel/gtrl ${gtrl_sources})
+ 
+diff --git a/contrib/gel/vdgl/CMakeLists.txt b/contrib/gel/vdgl/CMakeLists.txt
+index d5d100d..f0792f2 100644
+--- a/contrib/gel/vdgl/CMakeLists.txt
++++ b/contrib/gel/vdgl/CMakeLists.txt
+@@ -23,6 +23,7 @@ SET(vdgl_sources
+ AUX_SOURCE_DIRECTORY(Templates vdgl_sources)
+ 
+ ADD_LIBRARY(vdgl ${vdgl_sources})
++SET_TARGET_PROPERTIES(vdgl PROPERTIES ${VXL_LIBRARY_PROPERTIES})
+ INSTALL_TARGETS(/lib vdgl)
+ INSTALL_NOBASE_HEADER_FILES(/include/vxl/contrib/gel/vdgl ${vdgl_sources})
+ TARGET_LINK_LIBRARIES(vdgl vsol vgl_algo vgl vnl_algo vnl vbl_io vbl vsl vul vcl)
+diff --git a/contrib/gel/vifa/CMakeLists.txt b/contrib/gel/vifa/CMakeLists.txt
+index a54fac7..8a19e60 100644
+--- a/contrib/gel/vifa/CMakeLists.txt
++++ b/contrib/gel/vifa/CMakeLists.txt
+@@ -31,6 +31,7 @@ SET(vifa_sources
+ AUX_SOURCE_DIRECTORY(Templates vifa_sources)
+ 
+ ADD_LIBRARY(vifa ${vifa_sources})
++SET_TARGET_PROPERTIES(vifa PROPERTIES ${VXL_LIBRARY_PROPERTIES})
+ INSTALL_TARGETS(/lib vifa)
+ INSTALL_NOBASE_HEADER_FILES(/include/vxl/contrib/gel/vifa ${vifa_sources})
+ TARGET_LINK_LIBRARIES(vifa gevd vtol vsol vdgl vnl vgl vbl vul vil vcl)
+diff --git a/contrib/gel/vmal/CMakeLists.txt b/contrib/gel/vmal/CMakeLists.txt
+index 66604bf..63f66f4 100644
+--- a/contrib/gel/vmal/CMakeLists.txt
++++ b/contrib/gel/vmal/CMakeLists.txt
+@@ -37,6 +37,7 @@ AUX_SOURCE_DIRECTORY(Templates vmal_sources)
+ 
+ 
+ ADD_LIBRARY(vmal ${vmal_sources})
++SET_TARGET_PROPERTIES(vmal PROPERTIES ${VXL_LIBRARY_PROPERTIES})
+ INSTALL_TARGETS(/lib vmal)
+ INSTALL_NOBASE_HEADER_FILES(/include/vxl/contrib/gel/vmal ${vmal_sources})
+ 
+diff --git a/contrib/gel/vsol/CMakeLists.txt b/contrib/gel/vsol/CMakeLists.txt
+index 942af24..9fdf889 100644
+--- a/contrib/gel/vsol/CMakeLists.txt
++++ b/contrib/gel/vsol/CMakeLists.txt
+@@ -63,6 +63,7 @@ INCLUDE_DIRECTORIES(${VXLCORE_INCLUDE_DIR})
+ AUX_SOURCE_DIRECTORY(Templates vsol_sources)
+ 
+ ADD_LIBRARY(vsol ${vsol_sources})
++SET_TARGET_PROPERTIES(vsol PROPERTIES ${VXL_LIBRARY_PROPERTIES})
+ INSTALL_TARGETS(/lib vsol)
+ INSTALL_NOBASE_HEADER_FILES(/include/vxl/contrib/gel/vsol ${vsol_sources})
+ TARGET_LINK_LIBRARIES(vsol vgl_algo vgl_io vgl vnl vbl_io vbl vsl vul vcl)
+diff --git a/contrib/gel/vtol/CMakeLists.txt b/contrib/gel/vtol/CMakeLists.txt
+index 7068118..28ab541 100644
+--- a/contrib/gel/vtol/CMakeLists.txt
++++ b/contrib/gel/vtol/CMakeLists.txt
+@@ -35,6 +35,7 @@ IF(CMAKE_COMPILER_IS_GNUCXX)
+ ENDIF(CMAKE_COMPILER_IS_GNUCXX)
+ 
+ ADD_LIBRARY(vtol ${vtol_sources})
++SET_TARGET_PROPERTIES(vtol PROPERTIES ${VXL_LIBRARY_PROPERTIES})
+ INSTALL_TARGETS(/lib vtol)
+ INSTALL_NOBASE_HEADER_FILES(/include/vxl/contrib/gel/vtol ${vtol_sources})
+ TARGET_LINK_LIBRARIES(vtol vdgl vsol vnl vbl vul ${CMAKE_THREAD_LIBS})
+diff --git a/contrib/gel/vtol/algo/CMakeLists.txt b/contrib/gel/vtol/algo/CMakeLists.txt
+index f0edd60..6004217 100644
+--- a/contrib/gel/vtol/algo/CMakeLists.txt
++++ b/contrib/gel/vtol/algo/CMakeLists.txt
+@@ -8,6 +8,7 @@ SET( vtol_algo_sources
+ AUX_SOURCE_DIRECTORY( Templates vtol_algo_sources )
+ 
+ ADD_LIBRARY( vtol_algo ${vtol_algo_sources} )
++SET_TARGET_PROPERTIES(vtol_algo PROPERTIES ${VXL_LIBRARY_PROPERTIES})
+ INSTALL_TARGETS(/lib vtol_algo)
+ INSTALL_NOBASE_HEADER_FILES(/include/vxl/contrib/gel/vtol/algo ${vtol_algo_sources})
+ TARGET_LINK_LIBRARIES( vtol_algo vtol vsol vdgl vil_algo vgl_algo vgl vil vbl )
+diff --git a/contrib/mul/clsfy/CMakeLists.txt b/contrib/mul/clsfy/CMakeLists.txt
+index 9e529ad..2569b87 100644
+--- a/contrib/mul/clsfy/CMakeLists.txt
++++ b/contrib/mul/clsfy/CMakeLists.txt
+@@ -53,6 +53,7 @@ SET(clsfy_sources
+ AUX_SOURCE_DIRECTORY(Templates clsfy_sources)
+ 
+ ADD_LIBRARY(clsfy ${clsfy_sources})
++SET_TARGET_PROPERTIES(clsfy PROPERTIES ${VXL_LIBRARY_PROPERTIES})
+ INSTALL_TARGETS(/lib clsfy)
+ INSTALL_NOBASE_HEADER_FILES(/include/vxl/contrib/mul/clsfy ${clsfy_sources})
+ TARGET_LINK_LIBRARIES(clsfy vpdfl mbl vnl_algo vnl_io vnl vbl vsl vul)
+diff --git a/contrib/mul/ipts/CMakeLists.txt b/contrib/mul/ipts/CMakeLists.txt
+index 54910b6..0d2e31e 100644
+--- a/contrib/mul/ipts/CMakeLists.txt
++++ b/contrib/mul/ipts/CMakeLists.txt
+@@ -16,6 +16,7 @@ SET(ipts_sources
+ )
+ 
+ ADD_LIBRARY(ipts ${ipts_sources})
++SET_TARGET_PROPERTIES(ipts PROPERTIES ${VXL_LIBRARY_PROPERTIES})
+ INSTALL_TARGETS(/lib ipts)
+ INSTALL_NOBASE_HEADER_FILES(/include/vxl/contrib/mul/ipts ${ipts_sources})
+ TARGET_LINK_LIBRARIES(ipts vimt_algo vimt vgl vil_algo vil)
+diff --git a/contrib/mul/mbl/CMakeLists.txt b/contrib/mul/mbl/CMakeLists.txt
+index 75b157f..7009c61 100644
+--- a/contrib/mul/mbl/CMakeLists.txt
++++ b/contrib/mul/mbl/CMakeLists.txt
+@@ -121,6 +121,7 @@ IF(CMAKE_COMPILER_IS_GNUCXX)
+ ENDIF(CMAKE_COMPILER_IS_GNUCXX)
+ 
+ ADD_LIBRARY(mbl ${mbl_sources})
++SET_TARGET_PROPERTIES(mbl PROPERTIES ${VXL_LIBRARY_PROPERTIES})
+ TARGET_LINK_LIBRARIES(mbl vnl_io vnl_algo vgl_io vgl vbl_io vil_io vsl vnl vil vul vbl)
+ 
+ INSTALL_TARGETS(/lib mbl)
+diff --git a/contrib/mul/pdf1d/CMakeLists.txt b/contrib/mul/pdf1d/CMakeLists.txt
+index 6c26478..aca9219 100644
+--- a/contrib/mul/pdf1d/CMakeLists.txt
++++ b/contrib/mul/pdf1d/CMakeLists.txt
+@@ -49,6 +49,7 @@ SET(pdf1d_sources
+ AUX_SOURCE_DIRECTORY(Templates pdf1d_sources)
+ 
+ ADD_LIBRARY(pdf1d ${pdf1d_sources})
++SET_TARGET_PROPERTIES(pdf1d PROPERTIES ${VXL_LIBRARY_PROPERTIES})
+ INSTALL_TARGETS(/lib pdf1d)
+ INSTALL_NOBASE_HEADER_FILES(/include/vxl/contrib/mul/pdf1d ${pdf1d_sources})
+ TARGET_LINK_LIBRARIES( pdf1d mbl vbl vnl_io vnl vsl )
+diff --git a/contrib/mul/vil3d/CMakeLists.txt b/contrib/mul/vil3d/CMakeLists.txt
+index b3fd91f..716ab57 100644
+--- a/contrib/mul/vil3d/CMakeLists.txt
++++ b/contrib/mul/vil3d/CMakeLists.txt
+@@ -49,6 +49,7 @@ SET(vil3d_sources
+ AUX_SOURCE_DIRECTORY(Templates vil3d_sources)
+ 
+ ADD_LIBRARY(vil3d ${vil3d_sources})
++SET_TARGET_PROPERTIES(vil3d PROPERTIES ${VXL_LIBRARY_PROPERTIES})
+ TARGET_LINK_LIBRARIES( vil3d vil vul vsl vcl vnl )
+ 
+ INSTALL_TARGETS(/lib vil3d)
+diff --git a/contrib/mul/vil3d/algo/CMakeLists.txt b/contrib/mul/vil3d/algo/CMakeLists.txt
+index 3aeeff4..9553ad2 100644
+--- a/contrib/mul/vil3d/algo/CMakeLists.txt
++++ b/contrib/mul/vil3d/algo/CMakeLists.txt
+@@ -36,6 +36,7 @@ SET(vil3d_algo_sources
+ AUX_SOURCE_DIRECTORY(Templates vil3d_algo_sources)
+ 
+ ADD_LIBRARY(vil3d_algo ${vil3d_algo_sources})
++SET_TARGET_PROPERTIES(vil3d_algo PROPERTIES ${VXL_LIBRARY_PROPERTIES})
+ INSTALL_TARGETS(/lib vil3d_algo)
+ INSTALL_NOBASE_HEADER_FILES(/include/vxl/contrib/mul/vil3d/algo ${vil3d_algo_sources})
+ TARGET_LINK_LIBRARIES( vil3d_algo vil3d vil_algo vil vnl vgl )
+diff --git a/contrib/mul/vil3d/io/CMakeLists.txt b/contrib/mul/vil3d/io/CMakeLists.txt
+index 9bb78cc..4a369e6 100644
+--- a/contrib/mul/vil3d/io/CMakeLists.txt
++++ b/contrib/mul/vil3d/io/CMakeLists.txt
+@@ -7,6 +7,7 @@ SET(vil3d_io_sources
+ )
+ 
+ ADD_LIBRARY(vil3d_io ${vil3d_io_sources})
++SET_TARGET_PROPERTIES(vil3d_io PROPERTIES ${VXL_LIBRARY_PROPERTIES})
+ INSTALL_TARGETS(/lib vil3d_io)
+ INSTALL_NOBASE_HEADER_FILES(/include/vxl/contrib/mul/vil3d/io ${vil3d_io_sources})
+ TARGET_LINK_LIBRARIES( vil3d_io vil3d vil_io )
+diff --git a/contrib/mul/vimt/CMakeLists.txt b/contrib/mul/vimt/CMakeLists.txt
+index ebcab91..3b07187 100644
+--- a/contrib/mul/vimt/CMakeLists.txt
++++ b/contrib/mul/vimt/CMakeLists.txt
+@@ -35,6 +35,7 @@ SET(vimt_sources
+ AUX_SOURCE_DIRECTORY(Templates vimt_sources)
+ 
+ ADD_LIBRARY(vimt ${vimt_sources})
++SET_TARGET_PROPERTIES(vimt PROPERTIES ${VXL_LIBRARY_PROPERTIES})
+ INSTALL_TARGETS(/lib vimt)
+ INSTALL_NOBASE_HEADER_FILES(/include/vxl/contrib/mul/vimt ${vimt_sources})
+ TARGET_LINK_LIBRARIES(vimt mbl vil_algo vgl vnl vil_io vil )
+diff --git a/contrib/mul/vimt/algo/CMakeLists.txt b/contrib/mul/vimt/algo/CMakeLists.txt
+index 5eb8e8e..215c568 100644
+--- a/contrib/mul/vimt/algo/CMakeLists.txt
++++ b/contrib/mul/vimt/algo/CMakeLists.txt
+@@ -11,6 +11,7 @@ SET( vimt_algo_sources
+ )
+ 
+ ADD_LIBRARY(vimt_algo ${vimt_algo_sources})
++SET_TARGET_PROPERTIES(vimt_algo PROPERTIES ${VXL_LIBRARY_PROPERTIES})
+ INSTALL_TARGETS(/lib vimt_algo)
+ INSTALL_NOBASE_HEADER_FILES(/include/vxl/contrib/mul/vimt/algo ${vimt_algo_sources})
+ TARGET_LINK_LIBRARIES( vimt_algo vimt vil_algo vgl vcl )
+diff --git a/contrib/mul/vimt3d/CMakeLists.txt b/contrib/mul/vimt3d/CMakeLists.txt
+index 51d053c..93efcbf 100644
+--- a/contrib/mul/vimt3d/CMakeLists.txt
++++ b/contrib/mul/vimt3d/CMakeLists.txt
+@@ -34,6 +34,7 @@ SET(vimt3d_sources
+ AUX_SOURCE_DIRECTORY(Templates vimt3d_sources)
+ 
+ ADD_LIBRARY(vimt3d ${vimt3d_sources})
++SET_TARGET_PROPERTIES(vimt3d PROPERTIES ${VXL_LIBRARY_PROPERTIES})
+ INSTALL_TARGETS(/lib vimt3d)
+ INSTALL_NOBASE_HEADER_FILES(/include/vxl/contrib/mul/vimt3d ${vimt3d_sources})
+ TARGET_LINK_LIBRARIES(vimt3d vil3d_algo vil3d_io vil3d vimt mbl vnl_algo vgl vnl_io vnl vil vsl vul)
+diff --git a/contrib/mul/vpdfl/CMakeLists.txt b/contrib/mul/vpdfl/CMakeLists.txt
+index 5e258cd..2c0b05b 100644
+--- a/contrib/mul/vpdfl/CMakeLists.txt
++++ b/contrib/mul/vpdfl/CMakeLists.txt
+@@ -37,6 +37,7 @@ SET(vpdfl_sources
+ AUX_SOURCE_DIRECTORY(Templates vpdfl_sources)
+ 
+ ADD_LIBRARY(vpdfl ${vpdfl_sources})
++SET_TARGET_PROPERTIES(vpdfl PROPERTIES ${VXL_LIBRARY_PROPERTIES})
+ INSTALL_TARGETS(/lib vpdfl)
+ INSTALL_NOBASE_HEADER_FILES(/include/vxl/contrib/mul/vpdfl ${vpdfl_sources})
+ TARGET_LINK_LIBRARIES(vpdfl mbl vnl_algo vnl_io vnl vsl vul)
+diff --git a/contrib/oxl/mvl/CMakeLists.txt b/contrib/oxl/mvl/CMakeLists.txt
+index d2bf196..878be51 100644
+--- a/contrib/oxl/mvl/CMakeLists.txt
++++ b/contrib/oxl/mvl/CMakeLists.txt
+@@ -113,6 +113,7 @@ IF(CMAKE_COMPILER_IS_GNUCXX)
+ ENDIF(CMAKE_COMPILER_IS_GNUCXX)
+ 
+ ADD_LIBRARY(mvl ${mvl_sources})
++SET_TARGET_PROPERTIES(mvl PROPERTIES ${VXL_LIBRARY_PROPERTIES})
+ INSTALL_TARGETS(/lib mvl)
+ INSTALL_NOBASE_HEADER_FILES(/include/vxl/contrib/oxl/mvl ${mvl_sources})
+ TARGET_LINK_LIBRARIES(mvl vil1 vnl_algo vnl vbl vgl vgl_algo vul)
+diff --git a/contrib/oxl/osl/CMakeLists.txt b/contrib/oxl/osl/CMakeLists.txt
+index a5a0fff..d399b31 100644
+--- a/contrib/oxl/osl/CMakeLists.txt
++++ b/contrib/oxl/osl/CMakeLists.txt
+@@ -45,6 +45,7 @@ SET(osl_sources
+ AUX_SOURCE_DIRECTORY(Templates osl_sources)
+ 
+ ADD_LIBRARY(osl ${osl_sources})
++SET_TARGET_PROPERTIES(osl PROPERTIES ${VXL_LIBRARY_PROPERTIES})
+ INSTALL_TARGETS(/lib osl)
+ INSTALL_NOBASE_HEADER_FILES(/include/vxl/contrib/oxl/osl ${osl_sources})
+ TARGET_LINK_LIBRARIES(osl vnl_algo vnl vgl vil1 vbl)
+diff --git a/contrib/prip/vdtop/CMakeLists.txt b/contrib/prip/vdtop/CMakeLists.txt
+index 9723450..feee0c2 100644
+--- a/contrib/prip/vdtop/CMakeLists.txt
++++ b/contrib/prip/vdtop/CMakeLists.txt
+@@ -26,6 +26,7 @@ SET(vdtop_sources
+ )
+ 
+ ADD_LIBRARY(vdtop ${vdtop_sources})
++SET_TARGET_PROPERTIES(vdtop PROPERTIES ${VXL_LIBRARY_PROPERTIES})
+ INSTALL_TARGETS(/lib vdtop)
+ INSTALL_NOBASE_HEADER_FILES(/include/vxl/contrib/prip/vdtop ${vdtop_sources})
+ TARGET_LINK_LIBRARIES(vdtop vmap vil)
+diff --git a/contrib/prip/vmap/CMakeLists.txt b/contrib/prip/vmap/CMakeLists.txt
+index 5c8938b..051ffc2 100644
+--- a/contrib/prip/vmap/CMakeLists.txt
++++ b/contrib/prip/vmap/CMakeLists.txt
+@@ -28,6 +28,7 @@ SET(vmap_sources
+ )
+ 
+ ADD_LIBRARY(vmap ${vmap_sources})
++SET_TARGET_PROPERTIES(vmap PROPERTIES ${VXL_LIBRARY_PROPERTIES})
+ INSTALL_TARGETS(/lib vmap)
+ INSTALL_NOBASE_HEADER_FILES(/include/vxl/contrib/prip/vmap ${vmap_sources})
+ TARGET_LINK_LIBRARIES(vmap vcl)
+diff --git a/contrib/prip/vpyr/CMakeLists.txt b/contrib/prip/vpyr/CMakeLists.txt
+index 0074833..d1a4dda 100644
+--- a/contrib/prip/vpyr/CMakeLists.txt
++++ b/contrib/prip/vpyr/CMakeLists.txt
+@@ -23,6 +23,7 @@ SET(vpyr_sources
+ )
+ 
+ ADD_LIBRARY(vpyr ${vpyr_sources})
++SET_TARGET_PROPERTIES(vpyr PROPERTIES ${VXL_LIBRARY_PROPERTIES})
+ INSTALL_TARGETS(/lib vpyr)
+ INSTALL_NOBASE_HEADER_FILES(/include/vxl/contrib/prip/vpyr ${vpyr_sources})
+ TARGET_LINK_LIBRARIES(vpyr vmap)
+diff --git a/contrib/rpl/rgrl/CMakeLists.txt b/contrib/rpl/rgrl/CMakeLists.txt
+index 82c9861..3b0be6e 100644
+--- a/contrib/rpl/rgrl/CMakeLists.txt
++++ b/contrib/rpl/rgrl/CMakeLists.txt
+@@ -161,6 +161,7 @@ SET( rgrl_sources
+ AUX_SOURCE_DIRECTORY( Templates rgrl_sources )
+ 
+ ADD_LIBRARY( rgrl ${rgrl_sources} )
++SET_TARGET_PROPERTIES(rgrl PROPERTIES ${VXL_LIBRARY_PROPERTIES})
+ INSTALL_TARGETS(/lib rgrl)
+ INSTALL_NOBASE_HEADER_FILES(/include/vxl/contrib/rpl/rgrl ${rgrl_sources})
+ TARGET_LINK_LIBRARIES( rgrl rrel rsdl vil3d vil vnl_algo vnl vbl vul)
+diff --git a/contrib/rpl/rrel/CMakeLists.txt b/contrib/rpl/rrel/CMakeLists.txt
+index 761c023..407a5b0 100644
+--- a/contrib/rpl/rrel/CMakeLists.txt
++++ b/contrib/rpl/rrel/CMakeLists.txt
+@@ -44,7 +44,7 @@ SET(rrel_sources
+ AUX_SOURCE_DIRECTORY(Templates rrel_sources)
+ 
+ ADD_LIBRARY(rrel ${rrel_sources})
+-
++SET_TARGET_PROPERTIES(rrel PROPERTIES ${VXL_LIBRARY_PROPERTIES})
+ INSTALL_TARGETS(/lib rrel)
+ INSTALL_NOBASE_HEADER_FILES(/include/vxl/contrib/rpl/rrel ${rrel_sources})
+ TARGET_LINK_LIBRARIES(rrel vnl_algo vnl vgl)
+diff --git a/contrib/rpl/rsdl/CMakeLists.txt b/contrib/rpl/rsdl/CMakeLists.txt
+index 360068b..b758e19 100644
+--- a/contrib/rpl/rsdl/CMakeLists.txt
++++ b/contrib/rpl/rsdl/CMakeLists.txt
+@@ -21,6 +21,7 @@ IF(CMAKE_COMPILER_IS_GNUCXX)
+ ENDIF(CMAKE_COMPILER_IS_GNUCXX)
+ 
+ ADD_LIBRARY(rsdl ${rsdl_sources})
++SET_TARGET_PROPERTIES(rsdl PROPERTIES ${VXL_LIBRARY_PROPERTIES})
+ INSTALL_TARGETS(/lib rsdl)
+ INSTALL_NOBASE_HEADER_FILES(/include/vxl/contrib/rpl/rsdl ${rsdl_sources})
+ TARGET_LINK_LIBRARIES( rsdl vnl vbl )
+diff --git a/contrib/tbl/vepl/CMakeLists.txt b/contrib/tbl/vepl/CMakeLists.txt
+index c6fa6ec..c7efe76 100644
+--- a/contrib/tbl/vepl/CMakeLists.txt
++++ b/contrib/tbl/vepl/CMakeLists.txt
+@@ -52,6 +52,7 @@ IF(CMAKE_COMPILER_IS_GNUCXX)
+ ENDIF(CMAKE_COMPILER_IS_GNUCXX)
+ 
+ ADD_LIBRARY(vepl ${vepl_sources})
++SET_TARGET_PROPERTIES(vepl PROPERTIES ${VXL_LIBRARY_PROPERTIES})
+ INSTALL_TARGETS(/lib vepl)
+ INSTALL_NOBASE_HEADER_FILES(/include/vxl/contrib/tbl/vepl ${vepl_sources})
+ TARGET_LINK_LIBRARIES(vepl vipl vil ${CMAKE_THREAD_LIBS})
+diff --git a/contrib/tbl/vipl/CMakeLists.txt b/contrib/tbl/vipl/CMakeLists.txt
+index 91a8726..4ee00e7 100644
+--- a/contrib/tbl/vipl/CMakeLists.txt
++++ b/contrib/tbl/vipl/CMakeLists.txt
+@@ -77,6 +77,7 @@ IF(CMAKE_COMPILER_IS_GNUCXX)
+ ENDIF(CMAKE_COMPILER_IS_GNUCXX)
+ 
+ ADD_LIBRARY(vipl ${vipl_sources})
++SET_TARGET_PROPERTIES(vipl PROPERTIES ${VXL_LIBRARY_PROPERTIES})
+ INSTALL_TARGETS(/lib vipl)
+ INSTALL_NOBASE_HEADER_FILES(/include/vxl/contrib/tbl/vipl ${vipl_sources})
+ TARGET_LINK_LIBRARIES(vipl vil vil1 vnl vbl)
+diff --git a/core/vbl/CMakeLists.txt b/core/vbl/CMakeLists.txt
+index 7298356..5c9f57b 100644
+--- a/core/vbl/CMakeLists.txt
++++ b/core/vbl/CMakeLists.txt
+@@ -42,6 +42,7 @@ SET( vbl_sources
+ AUX_SOURCE_DIRECTORY(Templates vbl_sources)
+ 
+ ADD_LIBRARY(vbl ${vbl_sources})
++SET_TARGET_PROPERTIES(vbl PROPERTIES ${VXL_LIBRARY_PROPERTIES})
+ TARGET_LINK_LIBRARIES( vbl vcl )
+ 
+ INSTALL_TARGETS(/lib vbl)
+diff --git a/core/vbl/io/CMakeLists.txt b/core/vbl/io/CMakeLists.txt
+index f79b9f8..8ec5629 100644
+--- a/core/vbl/io/CMakeLists.txt
++++ b/core/vbl/io/CMakeLists.txt
+@@ -17,6 +17,7 @@ SET(vbl_io_sources
+ AUX_SOURCE_DIRECTORY(Templates vbl_io_sources)
+ 
+ ADD_LIBRARY(vbl_io ${vbl_io_sources})
++SET_TARGET_PROPERTIES(vbl_io PROPERTIES ${VXL_LIBRARY_PROPERTIES})
+ TARGET_LINK_LIBRARIES( vbl_io vbl vsl )
+ 
+ INSTALL_TARGETS(/lib vbl_io)
+diff --git a/core/vcsl/CMakeLists.txt b/core/vcsl/CMakeLists.txt
+index f7e8894..49191e6 100644
+--- a/core/vcsl/CMakeLists.txt
++++ b/core/vcsl/CMakeLists.txt
+@@ -63,6 +63,7 @@ doxygen_add_library(core/vcsl
+   AUX_SOURCE_DIRECTORY( Templates vcsl_sources )
+ 
+   ADD_LIBRARY( vcsl ${vcsl_sources} )
++  SET_TARGET_PROPERTIES(vcsl PROPERTIES ${VXL_LIBRARY_PROPERTIES})
+   TARGET_LINK_LIBRARIES( vcsl vnl vbl )
+ 
+   INSTALL_TARGETS(/lib vcsl)
+diff --git a/core/vgl/CMakeLists.txt b/core/vgl/CMakeLists.txt
+index 486fe81..0f22323 100644
+--- a/core/vgl/CMakeLists.txt
++++ b/core/vgl/CMakeLists.txt
+@@ -69,6 +69,7 @@ ENDIF( BUILD_NONCOMMERCIAL )
+ AUX_SOURCE_DIRECTORY(Templates vgl_sources)
+ 
+ ADD_LIBRARY(vgl ${vgl_sources})
++SET_TARGET_PROPERTIES(vgl PROPERTIES ${VXL_LIBRARY_PROPERTIES})
+ TARGET_LINK_LIBRARIES( vgl vcl )
+ doxygen_add_library(core/vgl
+   #DEPENDS core/vsl core/vnl
+diff --git a/core/vgl/algo/CMakeLists.txt b/core/vgl/algo/CMakeLists.txt
+index f124a5c..5cd991f 100644
+--- a/core/vgl/algo/CMakeLists.txt
++++ b/core/vgl/algo/CMakeLists.txt
+@@ -44,6 +44,7 @@ SET( vgl_algo_sources
+ AUX_SOURCE_DIRECTORY(Templates vgl_algo_sources)
+ 
+ ADD_LIBRARY(vgl_algo ${vgl_algo_sources})
++SET_TARGET_PROPERTIES(vgl_algo PROPERTIES ${VXL_LIBRARY_PROPERTIES})
+ TARGET_LINK_LIBRARIES( vgl_algo vgl vnl_algo vnl )
+ 
+ INSTALL_TARGETS(/lib vgl_algo)
+diff --git a/core/vgl/io/CMakeLists.txt b/core/vgl/io/CMakeLists.txt
+index bf27abc..10a6420 100644
+--- a/core/vgl/io/CMakeLists.txt
++++ b/core/vgl/io/CMakeLists.txt
+@@ -29,6 +29,7 @@ SET(vgl_io_sources
+ AUX_SOURCE_DIRECTORY(Templates vgl_io_sources)
+ 
+ ADD_LIBRARY(vgl_io ${vgl_io_sources})
++SET_TARGET_PROPERTIES(vgl_io PROPERTIES ${VXL_LIBRARY_PROPERTIES})
+ TARGET_LINK_LIBRARIES( vgl_io vgl vsl )
+ 
+ INSTALL_TARGETS(/lib vgl_io)
+diff --git a/core/vgl/xio/CMakeLists.txt b/core/vgl/xio/CMakeLists.txt
+index 365fbef..83989e4 100644
+--- a/core/vgl/xio/CMakeLists.txt
++++ b/core/vgl/xio/CMakeLists.txt
+@@ -10,6 +10,7 @@ SET(vgl_xio_sources
+ AUX_SOURCE_DIRECTORY(Templates vgl_xio_sources)
+ 
+ ADD_LIBRARY(vgl_xio ${vgl_xio_sources})
++SET_TARGET_PROPERTIES(vgl_xio PROPERTIES ${VXL_LIBRARY_PROPERTIES})
+ IF(NOT WIN32)
+   SET_TARGET_PROPERTIES(vgl_xio PROPERTIES COMPILE_FLAGS "-fPIC")
+ ENDIF(NOT WIN32)
+diff --git a/core/vidl/CMakeLists.txt b/core/vidl/CMakeLists.txt
+index 1778ca7..eb3dcf1 100644
+--- a/core/vidl/CMakeLists.txt
++++ b/core/vidl/CMakeLists.txt
+@@ -128,6 +128,7 @@ ENDIF(VIDEODEV2_FOUND)
+ AUX_SOURCE_DIRECTORY(Templates vidl_sources)
+ 
+ ADD_LIBRARY(vidl ${vidl_sources})
++SET_TARGET_PROPERTIES(vidl PROPERTIES ${VXL_LIBRARY_PROPERTIES})
+ INSTALL_TARGETS(/lib vidl)
+ INSTALL_NOBASE_HEADER_FILES(/include/vxl/core/vidl ${vidl_sources})
+ 
+diff --git a/core/vil/io/CMakeLists.txt b/core/vil/io/CMakeLists.txt
+index 4b9800f..b6153d8 100644
+--- a/core/vil/io/CMakeLists.txt
++++ b/core/vil/io/CMakeLists.txt
+@@ -15,6 +15,7 @@ IF(CMAKE_COMPILER_IS_GNUCXX)
+ ENDIF(CMAKE_COMPILER_IS_GNUCXX)
+ 
+ ADD_LIBRARY(vil_io ${vil_io_sources})
++SET_TARGET_PROPERTIES(vil_io PROPERTIES ${VXL_LIBRARY_PROPERTIES})
+ TARGET_LINK_LIBRARIES( vil_io vil vsl )
+ 
+ INSTALL_TARGETS(/lib vil_io)
+diff --git a/core/vil1/CMakeLists.txt b/core/vil1/CMakeLists.txt
+index 2bde8ff..cd0797f 100644
+--- a/core/vil1/CMakeLists.txt
++++ b/core/vil1/CMakeLists.txt
+@@ -169,6 +169,7 @@ IF(CMAKE_COMPILER_IS_GNUCXX)
+ ENDIF(CMAKE_COMPILER_IS_GNUCXX)
+ 
+ ADD_LIBRARY(vil1 ${vil1_sources})
++SET_TARGET_PROPERTIES(vil1 PROPERTIES ${VXL_LIBRARY_PROPERTIES})
+ INSTALL_TARGETS(/lib vil1)
+ INSTALL_NOBASE_HEADER_FILES(/include/vxl/core/vil1 ${vil1_sources})
+ 
+diff --git a/core/vil1/io/CMakeLists.txt b/core/vil1/io/CMakeLists.txt
+index c16238a..836bb67 100644
+--- a/core/vil1/io/CMakeLists.txt
++++ b/core/vil1/io/CMakeLists.txt
+@@ -15,6 +15,7 @@ SET(vil1_io_sources
+ AUX_SOURCE_DIRECTORY(Templates vil1_io_sources)
+ 
+ ADD_LIBRARY(vil1_io ${vil1_io_sources})
++SET_TARGET_PROPERTIES(vil1_io PROPERTIES ${VXL_LIBRARY_PROPERTIES})
+ TARGET_LINK_LIBRARIES( vil1_io vil1 vsl )
+ INSTALL_TARGETS(/lib vil1_io)
+ INSTALL_NOBASE_HEADER_FILES(/include/vxl/core/vil1/io ${vil1_io_sources})
+diff --git a/core/vnl/io/CMakeLists.txt b/core/vnl/io/CMakeLists.txt
+index 74da98e..3a723c6 100644
+--- a/core/vnl/io/CMakeLists.txt
++++ b/core/vnl/io/CMakeLists.txt
+@@ -26,6 +26,7 @@ IF(CMAKE_COMPILER_IS_GNUCXX)
+ ENDIF(CMAKE_COMPILER_IS_GNUCXX)
+ 
+ ADD_LIBRARY(vnl_io ${vnl_io_sources} )
++SET_TARGET_PROPERTIES(vnl_io PROPERTIES ${VXL_LIBRARY_PROPERTIES})
+ TARGET_LINK_LIBRARIES( vnl_io vnl vsl )
+ 
+ INSTALL_TARGETS(/lib vnl_io)
+diff --git a/core/vnl/xio/CMakeLists.txt b/core/vnl/xio/CMakeLists.txt
+index b27f519..4b62d4a 100644
+--- a/core/vnl/xio/CMakeLists.txt
++++ b/core/vnl/xio/CMakeLists.txt
+@@ -11,6 +11,7 @@ SET(vnl_xio_sources
+ AUX_SOURCE_DIRECTORY(Templates vnl_xio_sources)
+ 
+ ADD_LIBRARY(vnl_xio ${vnl_xio_sources} )
++SET_TARGET_PROPERTIES(vnl_xio PROPERTIES ${VXL_LIBRARY_PROPERTIES})
+ TARGET_LINK_LIBRARIES( vnl_xio vnl vsl )
+ 
+ INSTALL_TARGETS(/lib vnl_xio)
+diff --git a/core/vpl/CMakeLists.txt b/core/vpl/CMakeLists.txt
+index 4c0fdfe..f2bd994 100644
+--- a/core/vpl/CMakeLists.txt
++++ b/core/vpl/CMakeLists.txt
+@@ -13,6 +13,7 @@ SET( vpl_sources
+ )
+ 
+ ADD_LIBRARY(vpl ${vpl_sources})
++SET_TARGET_PROPERTIES(vpl PROPERTIES ${VXL_LIBRARY_PROPERTIES})
+ IF(NOT WIN32)
+   SET_TARGET_PROPERTIES(vpl PROPERTIES COMPILE_FLAGS "-fPIC")
+ ENDIF(NOT WIN32)
+diff --git a/core/vsl/CMakeLists.txt b/core/vsl/CMakeLists.txt
+index 7823022..e12ddd0 100644
+--- a/core/vsl/CMakeLists.txt
++++ b/core/vsl/CMakeLists.txt
+@@ -36,6 +36,7 @@ SET(vsl_sources
+ AUX_SOURCE_DIRECTORY(Templates vsl_sources)
+ 
+ ADD_LIBRARY(vsl ${vsl_sources})
++SET_TARGET_PROPERTIES(vsl PROPERTIES ${VXL_LIBRARY_PROPERTIES})
+ TARGET_LINK_LIBRARIES( vsl vcl )
+ 
+ INSTALL_TARGETS(/lib vsl)
+diff --git a/core/vul/CMakeLists.txt b/core/vul/CMakeLists.txt
+index f444d6a..ecacb58 100644
+--- a/core/vul/CMakeLists.txt
++++ b/core/vul/CMakeLists.txt
+@@ -76,6 +76,7 @@ ENDIF (SOLARIS)
+ 
+ ENDIF(APPLE)
+ 
++SET_TARGET_PROPERTIES(vul PROPERTIES ${VXL_LIBRARY_PROPERTIES})
+ TARGET_LINK_LIBRARIES( vul vcl )
+ 
+ INSTALL_NOBASE_HEADER_FILES(/include/vxl/core/vul 
+diff --git a/core/vul/io/CMakeLists.txt b/core/vul/io/CMakeLists.txt
+index e52099e..ee4ff9d 100644
+--- a/core/vul/io/CMakeLists.txt
++++ b/core/vul/io/CMakeLists.txt
+@@ -5,6 +5,7 @@ SET(vul_io_sources
+ )
+ 
+ ADD_LIBRARY(vul_io ${vul_io_sources})
++SET_TARGET_PROPERTIES(vul_io PROPERTIES ${VXL_LIBRARY_PROPERTIES})
+ TARGET_LINK_LIBRARIES(vul_io vul vsl)
+ 
+ INSTALL_TARGETS(/lib vul_io)
+-- 
+1.7.11.7
+
diff --git a/0008-v3.5.0-remove-bits-using-triangle.patch b/0008-v3.5.0-remove-bits-using-triangle.patch
deleted file mode 100644
index e4e8a22..0000000
--- a/0008-v3.5.0-remove-bits-using-triangle.patch
+++ /dev/null
@@ -1,2051 +0,0 @@
-From da8df48049aa20240103f6da054d5245faa88c04 Mon Sep 17 00:00:00 2001
-From: "Ankur Sinha (Ankur Sinha Gmail)" <sanjay.ankur@gmail.com>
-Date: Mon, 23 Oct 2023 11:31:49 +0100
-Subject: [PATCH 08/18] v3.5.0: remove bits using triangle
-
----
- contrib/brl/bbas/imesh/algo/CMakeLists.txt    |  11 -
- .../bbas/imesh/algo/imesh_generate_mesh.cxx   | 282 ------
- .../brl/bbas/imesh/algo/imesh_generate_mesh.h |  34 -
- .../brl/bbas/imesh/algo/tests/CMakeLists.txt  |  10 -
- .../brl/bbas/imesh/algo/tests/test_driver.cxx |  12 -
- .../imesh/algo/tests/test_generate_mesh.cxx   |  53 --
- .../bbas/imesh/algo/tests/test_include.cxx    |   1 -
- contrib/brl/bseg/boxm2/pro/boxm2_processes.h  |   1 -
- contrib/brl/bseg/boxm2/pro/boxm2_register.cxx |   1 -
- .../processes/boxm2_texture_mesh_process.cxx  | 842 ------------------
- contrib/brl/bseg/sdet/CMakeLists.txt          |   1 -
- contrib/brl/bseg/sdet/sdet_image_mesh.cxx     | 327 -------
- contrib/brl/bseg/sdet/sdet_image_mesh.h       |  63 --
- contrib/brl/bseg/sdet/tests/test_include.cxx  |   1 -
- contrib/gel/gtrl/CMakeLists.txt               |  13 -
- contrib/gel/gtrl/examples/.NoDartCoverage     |   0
- contrib/gel/gtrl/examples/CMakeLists.txt      |   2 -
- contrib/gel/gtrl/examples/triangulate.cxx     |  45 -
- contrib/gel/gtrl/gtrl_triangulation.cxx       | 110 ---
- contrib/gel/gtrl/gtrl_triangulation.h         |  31 -
- contrib/gel/gtrl/tests/test_include.cxx       |   1 -
- 21 files changed, 1841 deletions(-)
- delete mode 100644 contrib/brl/bbas/imesh/algo/imesh_generate_mesh.cxx
- delete mode 100644 contrib/brl/bbas/imesh/algo/imesh_generate_mesh.h
- delete mode 100644 contrib/brl/bbas/imesh/algo/tests/test_driver.cxx
- delete mode 100644 contrib/brl/bbas/imesh/algo/tests/test_generate_mesh.cxx
- delete mode 100644 contrib/brl/bseg/boxm2/pro/processes/boxm2_texture_mesh_process.cxx
- delete mode 100644 contrib/brl/bseg/sdet/sdet_image_mesh.cxx
- delete mode 100644 contrib/brl/bseg/sdet/sdet_image_mesh.h
- delete mode 100644 contrib/gel/gtrl/examples/.NoDartCoverage
- delete mode 100644 contrib/gel/gtrl/examples/CMakeLists.txt
- delete mode 100644 contrib/gel/gtrl/examples/triangulate.cxx
- delete mode 100644 contrib/gel/gtrl/gtrl_triangulation.cxx
- delete mode 100644 contrib/gel/gtrl/gtrl_triangulation.h
-
-diff --git a/contrib/brl/bbas/imesh/algo/CMakeLists.txt b/contrib/brl/bbas/imesh/algo/CMakeLists.txt
-index cdf5af2819..38efa0d264 100644
---- a/contrib/brl/bbas/imesh/algo/CMakeLists.txt
-+++ b/contrib/brl/bbas/imesh/algo/CMakeLists.txt
-@@ -16,20 +16,9 @@ set(imesh_algo_sources
-    )
- aux_source_directory(Templates imesh_algo_sources)
- 
--if(NETLIB_FOUND)
--  include_directories( ${NETLIB_INCLUDE_DIR} )
--  set(imesh_algo_sources ${imesh_algo_sources}
--      imesh_generate_mesh.cxx     imesh_generate_mesh.h)
--endif()
--
- vxl_add_library(LIBRARY_NAME imesh_algo LIBRARY_SOURCES ${imesh_algo_sources} )
- 
--if(NETLIB_FOUND)
--
--target_link_libraries( imesh_algo imesh ${VXL_LIB_PREFIX}vpgl bpgl bpgl_algo ${VXL_LIB_PREFIX}vgl_algo ${VXL_LIB_PREFIX}vgl ${VXL_LIB_PREFIX}vnl_algo ${VXL_LIB_PREFIX}vnl ${VXL_LIB_PREFIX}vil netlib)
--else()
- target_link_libraries( imesh_algo imesh ${VXL_LIB_PREFIX}vpgl ${VXL_LIB_PREFIX}vgl_algo ${VXL_LIB_PREFIX}vgl ${VXL_LIB_PREFIX}vnl_algo ${VXL_LIB_PREFIX}vnl ${VXL_LIB_PREFIX}vil )
--endif()
- 
- 
- if( BUILD_TESTING )
-diff --git a/contrib/brl/bbas/imesh/algo/imesh_generate_mesh.cxx b/contrib/brl/bbas/imesh/algo/imesh_generate_mesh.cxx
-deleted file mode 100644
-index 423a673bb3..0000000000
---- a/contrib/brl/bbas/imesh/algo/imesh_generate_mesh.cxx
-+++ /dev/null
-@@ -1,282 +0,0 @@
--// This is brl/bbas/imesh/algo/imesh_generate_mesh.cxx
--#include <iostream>
--#include "imesh_generate_mesh.h"
--//:
--// \file
--extern "C" {
--#include <triangle.h>
--}
--#include <cassert>
--#include "vgl/vgl_point_2d.h"
--#include "vgl/vgl_line_segment_2d.h"
--#include "vgl/vgl_box_2d.h"
--#ifdef _MSC_VER
--#  include "vcl_msvc_warnings.h"
--#endif
--#include "vil/vil_image_view.h"
--#define GRID_SIZE 1000 // defined by the tolerance for equal vertices
--
--// a grid index to find coincident vertices
--class point_index
--{
-- public:
--  point_index(vgl_box_2d<double> const&  bb)
--  : vi_(0), x_min_(bb.min_x()), y_min_(bb.min_y()),
--    x_size_(bb.width()), y_size_(bb.height())
--  {
--    img_.set_size(GRID_SIZE, GRID_SIZE);
--    img_.fill(-1);//no vert at location
--  }
--
--  void pt_to_img(vgl_point_2d<double> const& pt, unsigned& i, unsigned& j)
--  {
--    double xi = pt.x()-x_min_, yi = pt.y()-y_min_;
--    i = static_cast<unsigned>((xi*GRID_SIZE)/x_size_);
--    j = static_cast<unsigned>((yi*GRID_SIZE)/y_size_);
--    if (i>=GRID_SIZE) i=GRID_SIZE-1;
--    if (j>=GRID_SIZE) j=GRID_SIZE-1;
--  }
--
--  void insert_point(vgl_point_2d<double> const& pt)
--  {
--    unsigned i=0, j=0;
--    pt_to_img(pt, i, j);
--    if (img_(i,j)>=0)
--      return;//point already exists
--    //insert vertex index
--    img_(i,j) = vi_++;
--  }
--
--  int vert_index(vgl_point_2d<double> const& pt)
--  {
--    unsigned i=0, j=0;
--    pt_to_img(pt, i, j);
--    int index = img_(i,j);
--    assert(index>=0);
--    return index;
--  }
--
--  unsigned size() const {return vi_;}
--
-- private:
--  unsigned vi_;
--  double x_min_;
--  double y_min_;
--  double x_size_;
--  double y_size_;
--  vil_image_view<int> img_;
--};
--
--void
--imesh_generate_mesh_2d(std::vector<vgl_point_2d<double> > const& convex_hull,
--                       std::vector<vgl_line_segment_2d<double> > const& segs,
--                       imesh_mesh& mesh)
--{
--  // form a grid to store vertex indices in order to detect
--  // shared vertices
--  unsigned nch = convex_hull.size();
--  vgl_box_2d<double> bb;
--  for (unsigned i = 0; i<nch; ++i)
--    bb.add(convex_hull[i]);
--  //insert all points into a grid index
--  point_index pindx(bb);
--  for (unsigned i =0; i<nch; ++i)
--    pindx.insert_point(convex_hull[i]);
--  unsigned nsegs = segs.size();
--  for (unsigned i = 0; i<nsegs; ++i) {
--    pindx.insert_point(segs[i].point1());
--    pindx.insert_point(segs[i].point2());
--  }
--  // pindx now contains a single vertex pointer for each pair
--  // of coincident line segment endpoints as well as for each
--  // isolated endpoint
--  unsigned npts = pindx.size();
--  //set up the Delunay constrained triangulation input parameters
--  struct triangulateio in, out, vorout;
--  in.numberofholes = 0;
--  in.numberofregions = 0;
--  in.numberofpointattributes = 0;
--  in.numberofpoints = npts;
--  in.pointlist = (REAL *) malloc(in.numberofpoints * 2 * sizeof(REAL));
--  for (unsigned i = 0; i<nch; ++i) {
--    unsigned pi = pindx.vert_index(convex_hull[i]);
--    in.pointlist[2*pi]=convex_hull[i].x();
--    in.pointlist[2*pi+1]=convex_hull[i].y();
--  }
--  // line segments to be inserted into the triangulation
--  in.numberofsegments = nsegs;
--  in.segmentlist = (int *) malloc(in.numberofsegments * 2 * sizeof(int));
--  unsigned m = 0;
--  for (unsigned i = 0; i<nsegs; ++i) {
--    unsigned pi1 = pindx.vert_index(segs[i].point1());
--    unsigned pi2 = pindx.vert_index(segs[i].point2());
--    in.pointlist[2*pi1]   = segs[i].point1().x();
--    in.pointlist[2*pi1+1] = segs[i].point1().y();
--    in.pointlist[2*pi2]   = segs[i].point2().x();
--    in.pointlist[2*pi2+1] = segs[i].point2().y();
--    in.segmentlist[m]=pi1;     in.segmentlist[m+1]=pi2;
--  }
--  //attributes and markers are not used in this algorithm
--  in.pointattributelist = nullptr;
--  in.pointmarkerlist = (int*)malloc(in.numberofpoints * sizeof(int));
--  for (int i = 0; i<in.numberofpoints; ++i)
--    in.pointmarkerlist[i]=0;
--  in.segmentmarkerlist = (int *) malloc(in.numberofsegments * sizeof(int));;
--  for (int i = 0; i<in.numberofsegments; ++i)
--    in.segmentmarkerlist[i]=0;
--
--  out.pointlist = (REAL *) nullptr;            // Not needed if -N switch used.
--  // Not needed if -N switch used or number of point attributes is zero:
--  out.pointattributelist = (REAL *) nullptr;
--  out.pointmarkerlist = (int *) nullptr; // Not needed if -N or -B switch used.
--  out.trianglelist = (int *) nullptr;          // Not needed if -E switch used.
--  out.neighborlist = (int *) nullptr;         // Needed only if -n switch used.
--  // Needed only if segments are output (-p or -c) and -P not used:
--  out.segmentlist = (int *) (REAL *) malloc(in.numberofsegments * 2 * sizeof(REAL)); // Suspicious. Why the double cast? and why sizeof(REAL) if it's really int*?
--  // Needed only if segments are output (-p or -c) and -P and -B not used:
--  out.segmentmarkerlist = (int *) nullptr;
--  out.edgelist = (int *) nullptr;             // Needed only if -e switch used.
--  out.edgemarkerlist = (int *) nullptr;   // Needed if -e used and -B not used.
--
--  //A string of switch characters must be provided
--  // Triangulate the points.  Switches are chosen to read and write a
--  //   PSLG (p), preserve the convex hull (c), number everything from
--  //   zero (z), produce an edge list (e), and a triangle neighbor list (n)
--
--  triangulate("Qpczen", &in, &out, &vorout);
--
--  // construct the imesh data structure
--  //construct vertices
--  auto* verts = new imesh_vertex_array<2>();
--  unsigned k = 0;
--  for (unsigned i = 0; i<npts; ++i, k+=2)
--    verts->push_back(imesh_vertex<2>(out.pointlist[k], out.pointlist[k+1]));
--  std::unique_ptr<imesh_vertex_array_base> v(verts);
--  mesh.set_vertices(std::move(v));
--  //construct triangular faces
--  auto ntri = static_cast<unsigned>(out.numberoftriangles);
--  auto* faces = new imesh_regular_face_array<3>();
--  for (unsigned t = 0; t<ntri; ++t)
--  {
--    imesh_tri tri(out.trianglelist[t*3],
--                  out.trianglelist[t*3+1],
--                  out.trianglelist[t*3+2]);
--    faces->push_back(tri);
--  }
--  //set the faces on the mesh
--  std::unique_ptr<imesh_face_array_base> f(faces);
--  mesh.set_faces(std::move(f));
--}
--
--
--void
--imesh_generate_mesh_2d_2(std::vector<vgl_point_2d<double> > const& convex_hull,
--                         std::vector<vgl_line_segment_2d<double> > const& segs,
--                         std::vector<vgl_point_2d<double> > const & points,
--                         imesh_mesh& mesh)
--{
--  // form a grid to store vertex indices in order to detect
--  // shared vertices
--  unsigned nch = convex_hull.size();
--  vgl_box_2d<double> bb;
--  for (unsigned i = 0; i<nch; ++i)
--    bb.add(convex_hull[i]);
--  //insert all points into a grid index
--  point_index pindx(bb);
--  for (unsigned i =0; i<nch; ++i)
--    pindx.insert_point(convex_hull[i]);
--  unsigned nsegs = segs.size();
--  for (unsigned i = 0; i<nsegs; ++i) {
--    pindx.insert_point(segs[i].point1());
--    pindx.insert_point(segs[i].point2());
--  }
--
--  for (auto point : points) {
--      pindx.insert_point(point);
--  }
--  // pindx now contains a single vertex pointer for each pair
--  // of coincident line segment endpoints as well as for each
--  // isolated endpoint
--  unsigned npts = pindx.size();
--  //set up the Delunay constrained triangulation input parameters
--  struct triangulateio in, out, vorout;
--  in.numberofholes = 0;
--  in.numberofregions = 0;
--  in.numberofpointattributes = 0;
--  in.numberofpoints = npts;
--  in.pointlist = (REAL *) malloc(in.numberofpoints * 2 * sizeof(REAL));
--  for (unsigned i = 0; i<nch; ++i) {
--    unsigned pi = pindx.vert_index(convex_hull[i]);
--    in.pointlist[2*pi]=convex_hull[i].x();
--    in.pointlist[2*pi+1]=convex_hull[i].y();
--  }
--  for (auto point : points) {
--    unsigned pi = pindx.vert_index(point);
--    in.pointlist[2*pi]=point.x();
--    in.pointlist[2*pi+1]=point.y();
--  }
--
--  // line segments to be inserted into the triangulation
--  in.numberofsegments = nsegs;
--  in.segmentlist = (int *) malloc(in.numberofsegments * 2 * sizeof(int));
--  unsigned m = 0;
--  for (unsigned i = 0; i<nsegs; ++i) {
--    unsigned pi1 = pindx.vert_index(segs[i].point1());
--    unsigned pi2 = pindx.vert_index(segs[i].point2());
--    in.pointlist[2*pi1]   = segs[i].point1().x();
--    in.pointlist[2*pi1+1] = segs[i].point1().y();
--    in.pointlist[2*pi2]   = segs[i].point2().x();
--    in.pointlist[2*pi2+1] = segs[i].point2().y();
--    in.segmentlist[m]=pi1;     in.segmentlist[m+1]=pi2;
--  }
--  //attributes and markers are not used in this algorithm
--  in.pointattributelist = nullptr;
--  in.pointmarkerlist = (int*)malloc(in.numberofpoints * sizeof(int));
--  for (int i = 0; i<in.numberofpoints; ++i)
--    in.pointmarkerlist[i]=0;
--  in.segmentmarkerlist = (int *) malloc(in.numberofsegments * sizeof(int));;
--  for (int i = 0; i<in.numberofsegments; ++i)
--    in.segmentmarkerlist[i]=0;
--
--  out.pointlist = (REAL *) nullptr;            // Not needed if -N switch used.
--  // Not needed if -N switch used or number of point attributes is zero:
--  out.pointattributelist = (REAL *) nullptr;
--  out.pointmarkerlist = (int *) nullptr; // Not needed if -N or -B switch used.
--  out.trianglelist = (int *) nullptr;          // Not needed if -E switch used.
--  out.neighborlist = (int *) nullptr;         // Needed only if -n switch used.
--  // Needed only if segments are output (-p or -c) and -P not used:
--  out.segmentlist = (int *) (REAL *) malloc(in.numberofsegments * 2 * sizeof(REAL)); // Suspicious. Why the double cast? and why sizeof(REAL) if it's really int*?
--  // Needed only if segments are output (-p or -c) and -P and -B not used:
--  out.segmentmarkerlist = (int *) nullptr;
--  out.edgelist = (int *) nullptr;             // Needed only if -e switch used.
--  out.edgemarkerlist = (int *) nullptr;   // Needed if -e used and -B not used.
--
--  //A string of switch characters must be provided
--  // Triangulate the points.  Switches are chosen to read and write a
--  //   PSLG (p), preserve the convex hull (c), number everything from
--  //   zero (z), produce an edge list (e), and a triangle neighbor list (n)
--
--  triangulate("Qpczen", &in, &out, &vorout);
--
--  // construct the imesh data structure
--  //construct vertices
--  auto* verts = new imesh_vertex_array<2>();
--  unsigned k = 0;
--  for (unsigned i = 0; i<npts; ++i, k+=2)
--    verts->push_back(imesh_vertex<2>(out.pointlist[k], out.pointlist[k+1]));
--  std::unique_ptr<imesh_vertex_array_base> v(verts);
--  mesh.set_vertices(std::move(v));
--  //construct triangular faces
--  auto ntri = static_cast<unsigned>(out.numberoftriangles);
--  auto* faces = new imesh_regular_face_array<3>();
--  for (unsigned t = 0; t<ntri; ++t)
--  {
--    imesh_tri tri(out.trianglelist[t*3],
--                  out.trianglelist[t*3+1],
--                  out.trianglelist[t*3+2]);
--    faces->push_back(tri);
--  }
--  //set the faces on the mesh
--  std::unique_ptr<imesh_face_array_base> f(faces);
--  mesh.set_faces(std::move(f));
--}
-diff --git a/contrib/brl/bbas/imesh/algo/imesh_generate_mesh.h b/contrib/brl/bbas/imesh/algo/imesh_generate_mesh.h
-deleted file mode 100644
-index 9736c69aad..0000000000
---- a/contrib/brl/bbas/imesh/algo/imesh_generate_mesh.h
-+++ /dev/null
-@@ -1,34 +0,0 @@
--// This is brl/bbas/imesh/algo/imesh_generate_mesh.h
--#ifndef imesh_generate_mesh_h_
--#define imesh_generate_mesh_h_
--//:
--// \file
--// \brief mesh generation functions
--// \author J.L. Mundy
--// \date March 16, 2011
--//
--// \verbatim
--//  Modifications
--//   <none yet>
--// \endverbatim
--
--#include <iostream>
--#include <vector>
--#include <imesh/imesh_mesh.h>
--#ifdef _MSC_VER
--#  include <vcl_msvc_warnings.h>
--#endif
--#include <vgl/vgl_fwd.h>
--
--//: Fill the convex hull with triangles, constrained by the line segments
--void
--imesh_generate_mesh_2d(std::vector<vgl_point_2d<double> > const& convex_hull,
--                       std::vector< vgl_line_segment_2d<double> > const & segs,
--                       imesh_mesh& mesh);
--void
--imesh_generate_mesh_2d_2(std::vector<vgl_point_2d<double> > const& convex_hull,
--                       std::vector<vgl_line_segment_2d<double> > const& segs,
--                       std::vector<vgl_point_2d<double> > const & points,
--                       imesh_mesh& mesh);
--
--#endif // imesh_generate_mesh_h_
-diff --git a/contrib/brl/bbas/imesh/algo/tests/CMakeLists.txt b/contrib/brl/bbas/imesh/algo/tests/CMakeLists.txt
-index fe15f6b4a2..7d58eba683 100644
---- a/contrib/brl/bbas/imesh/algo/tests/CMakeLists.txt
-+++ b/contrib/brl/bbas/imesh/algo/tests/CMakeLists.txt
-@@ -5,13 +5,3 @@ add_executable( imesh_algo_test_template_include test_template_include.cxx )
- target_link_libraries( imesh_algo_test_template_include imesh_algo)
- 
- include( ${VXL_CMAKE_DIR}/FindNetlib.cmake )
--if(NETLIB_FOUND)
--add_executable( imesh_algo_test_all
--  test_driver.cxx
--  test_generate_mesh.cxx
--)
--target_link_libraries( imesh_algo_test_all imesh imesh_algo ${VXL_LIB_PREFIX}vnl ${VXL_LIB_PREFIX}vgl ${VXL_LIB_PREFIX}testlib )
--if( VXL_RUN_FAILING_TESTS ) ## This test always fails in travis builds, segfault during memory free operation
--add_test( NAME imesh_test_generate_mesh COMMAND $<TARGET_FILE:imesh_algo_test_all> test_generate_mesh)
--endif()
--endif()
-diff --git a/contrib/brl/bbas/imesh/algo/tests/test_driver.cxx b/contrib/brl/bbas/imesh/algo/tests/test_driver.cxx
-deleted file mode 100644
-index d21c4aefc0..0000000000
---- a/contrib/brl/bbas/imesh/algo/tests/test_driver.cxx
-+++ /dev/null
-@@ -1,12 +0,0 @@
--#include "testlib/testlib_register.h"
--
--
--DECLARE( test_generate_mesh );
--
--void
--register_tests()
--{
--  REGISTER( test_generate_mesh );
--}
--
--DEFINE_MAIN;
-diff --git a/contrib/brl/bbas/imesh/algo/tests/test_generate_mesh.cxx b/contrib/brl/bbas/imesh/algo/tests/test_generate_mesh.cxx
-deleted file mode 100644
-index 94f57f46ef..0000000000
---- a/contrib/brl/bbas/imesh/algo/tests/test_generate_mesh.cxx
-+++ /dev/null
-@@ -1,53 +0,0 @@
--#include <vector>
--#include <iostream>
--#include "testlib/testlib_test.h"
--#include <imesh/algo/imesh_generate_mesh.h>
--#include "vgl/vgl_point_2d.h"
--#include "vgl/vgl_line_segment_2d.h"
--#ifdef _MSC_VER
--#  include "vcl_msvc_warnings.h"
--#endif
--
--static void test_generate_mesh()
--{
--  vgl_point_2d<double> p0(0.0, 0.0);
--  vgl_point_2d<double> p1(1.0, 0.0);
--  vgl_point_2d<double> p2(1.0, 10.0);
--  vgl_point_2d<double> p3(0.0, 10.0);
--  vgl_point_2d<double> p4(0.25, 5.0);
--  vgl_point_2d<double> p5(0.75, 5.0);
--  std::vector<vgl_point_2d<double> > c_hull;
--  c_hull.push_back(p0);   c_hull.push_back(p1);
--  c_hull.push_back(p2);   c_hull.push_back(p3);
--  vgl_line_segment_2d<double> ls(p4, p5);
--  std::vector<vgl_line_segment_2d<double> > segs;
--  segs.push_back(ls);
--  imesh_mesh mesh;
--  imesh_generate_mesh_2d(c_hull, segs, mesh);
--  TEST("num_verts, num_faces", mesh.num_verts()*mesh.num_faces(), 36);
--  const imesh_face_array_base& faces = mesh.faces();
--  TEST("face verts", faces(0,0)+faces(0,1)+faces(0,2), 7);
--  vgl_point_2d<double> p6(0.25, 1);
--  vgl_point_2d<double> p7(0.75, 1);
--  vgl_line_segment_2d<double> l2(p5, p7);
--  segs.push_back(l2);
--  imesh_mesh mesh2;
--  imesh_generate_mesh_2d(c_hull, segs,mesh2);
--  unsigned nverts = mesh2.num_verts();
--  unsigned ntris =  mesh2.num_faces();
--  TEST("two segs", nverts*ntris, 56);
--#if 0
--  const imesh_regular_face_array<3>& tris =
--    static_cast<const imesh_regular_face_array<3>&>(mesh2.faces());
--  const imesh_vertex_array<2>& verts = mesh2.vertices<2>();
--  std::cout << "verts\n";
--  for (unsigned i = 0; i< nverts; ++i)
--    std::cout << "v[" << i << "](" << verts[i][0] << ' ' << verts[i][1] << ")\n";
--  std::cout << "faces\n";
--  for (unsigned i = 0; i< ntris; ++i)
--    std::cout << "f[" << i << "](" << tris[i][0]<< ' ' << tris[i][1]
--             << ' ' << tris[i][2] << ")\n";
--#endif
--}
--
--TESTMAIN(test_generate_mesh);
-diff --git a/contrib/brl/bbas/imesh/algo/tests/test_include.cxx b/contrib/brl/bbas/imesh/algo/tests/test_include.cxx
-index bc7bcd02e4..bc5f817ebe 100644
---- a/contrib/brl/bbas/imesh/algo/tests/test_include.cxx
-+++ b/contrib/brl/bbas/imesh/algo/tests/test_include.cxx
-@@ -1,5 +1,4 @@
- #include <imesh/algo/imesh_detect.h>
--#include <imesh/algo/imesh_generate_mesh.h>
- #include <imesh/algo/imesh_imls_surface.h>
- #include <imesh/algo/imesh_intersect.h>
- #include <imesh/algo/imesh_kd_tree.h>
-diff --git a/contrib/brl/bseg/boxm2/pro/boxm2_processes.h b/contrib/brl/bseg/boxm2/pro/boxm2_processes.h
-index feae6ae9b2..4d68be95b0 100644
---- a/contrib/brl/bseg/boxm2/pro/boxm2_processes.h
-+++ b/contrib/brl/bseg/boxm2/pro/boxm2_processes.h
-@@ -15,7 +15,6 @@ DECLARE_FUNC_CONS(boxm2_write_scene_xml_process);
- DECLARE_FUNC_CONS(boxm2_add_block_process);
- DECLARE_FUNC_CONS(boxm2_export_textured_mesh_process);
- DECLARE_FUNC_CONS(boxm2_export_mesh_process);
--DECLARE_FUNC_CONS(boxm2_texture_mesh_process);
- DECLARE_FUNC_CONS(boxm2_describe_scene_process);
- DECLARE_FUNC_CONS(boxm2_create_stream_cache_process);
- DECLARE_FUNC_CONS(boxm2_roi_init_process);
-diff --git a/contrib/brl/bseg/boxm2/pro/boxm2_register.cxx b/contrib/brl/bseg/boxm2/pro/boxm2_register.cxx
-index ea5dfbd6e5..a05b9e5c58 100644
---- a/contrib/brl/bseg/boxm2/pro/boxm2_register.cxx
-+++ b/contrib/brl/bseg/boxm2/pro/boxm2_register.cxx
-@@ -35,7 +35,6 @@ void boxm2_register::register_process()
-   REG_PROCESS_FUNC_CONS(bprb_func_process, bprb_batch_process_manager, boxm2_add_block_process,       "boxm2AddBlockProcess");
-   REG_PROCESS_FUNC_CONS(bprb_func_process, bprb_batch_process_manager, boxm2_export_textured_mesh_process,"boxm2ExportTexturedMeshProcess");
-   REG_PROCESS_FUNC_CONS(bprb_func_process, bprb_batch_process_manager, boxm2_export_mesh_process,"boxm2ExportMeshProcess");
--  REG_PROCESS_FUNC_CONS(bprb_func_process, bprb_batch_process_manager, boxm2_texture_mesh_process,"boxm2TextureMeshProcess");
-   REG_PROCESS_FUNC_CONS(bprb_func_process, bprb_batch_process_manager, boxm2_describe_scene_process,"boxm2DescribeSceneProcess");
-   REG_PROCESS_FUNC_CONS(bprb_func_process, bprb_batch_process_manager, boxm2_create_stream_cache_process, "boxm2CreateStreamCacheProcess");
-   REG_PROCESS_FUNC_CONS(bprb_func_process, bprb_batch_process_manager, boxm2_roi_init_process, "boxm2RoiInitProcess");
-diff --git a/contrib/brl/bseg/boxm2/pro/processes/boxm2_texture_mesh_process.cxx b/contrib/brl/bseg/boxm2/pro/processes/boxm2_texture_mesh_process.cxx
-deleted file mode 100644
-index 8254869a0d..0000000000
---- a/contrib/brl/bseg/boxm2/pro/processes/boxm2_texture_mesh_process.cxx
-+++ /dev/null
-@@ -1,842 +0,0 @@
--// This is brl/bseg/boxm2/pro/processes/boxm2_texture_mesh_process.cxx
--#include <iostream>
--#include <fstream>
--#include <bprb/bprb_func_process.h>
--//:
--// \file
--// \brief  A process for exporting a texture mapped mesh of a scene
--//
--// \author Vishal Jain
--// \date Mar 15, 2011
--
--#ifdef _MSC_VER
--#  include "vcl_msvc_warnings.h"
--#endif
--#include "vul/vul_file.h"
--#include "vul/vul_timer.h"
--#include "vnl/vnl_random.h"
--#include <boxm2/boxm2_scene.h>
--#include <boxm2/boxm2_util.h>
--
--//vil includes
--#include "vil/vil_image_view.h"
--#include "vil/vil_save.h"
--#include <vil/algo/vil_gauss_filter.h>
--
--//vgl
--#include "vgl/vgl_distance.h"
--#include "vgl/vgl_triangle_scan_iterator.h"
--#include <bvgl/bvgl_triangle_interpolation_iterator.h>
--
--//vpgl camera stuff
--#include "vpgl/vpgl_perspective_camera.h"
--// for loading cameras from directory
--#include <bpgl/bpgl_camera_utils.h>
--
--//det and imesh includes
--#include <sdet/sdet_image_mesh.h>
--#include <sdet/sdet_image_mesh_params.h>
--#include <imesh/imesh_fileio.h>
--#include <imesh/algo/imesh_render.h>
--
--namespace boxm2_texture_mesh_process_globals
--{
--  constexpr unsigned n_inputs_ = 4;
--  constexpr unsigned n_outputs_ = 0;
--
--  //struct for passing 3d triangles (couldn't find a 3d triangle in VGL...)
--  struct triangle_3d {
--    vgl_point_3d<double> points[3];
--    unsigned face_id;
--  };
--
--  //aux data structures (norm images, vis images)
--  std::vector<vil_image_view<int>* > vis_images_;
--  std::vector<vil_image_view<float>* > normx_, normy_, normz_;
--
--  //main helper method - fills out a map of imesh_mesh's, each texture mapped with a separate image
--  void boxm2_texture_mesh_from_imgs(const std::string& im_dir,
--                                    const std::string& cam_dir,
--                                    const std::string& out_dir,
--                                    imesh_mesh& in_mesh,
--                                    std::map<std::string, imesh_mesh>& meshes);
--
--  //populates a vector of visibility images (by face id int)
--  void boxm2_visible_faces( std::vector<vpgl_perspective_camera<double>* >& cameras,
--                            imesh_mesh& in_mesh,  unsigned int ni, unsigned int nj);
--
--  //stores a norm image (3d face norm) for each of the texture images
--  void compute_norm_images( std::vector<vpgl_perspective_camera<double>* >& cameras,
--                            imesh_mesh& in_mesh,unsigned int ni, unsigned int nj);
--
--  //smooths the vector of norm images above
--  void smooth_norm_images(double sigma);
--
--  //checks if a triangle in UV space is visible.  us and vs are double buffers of length 3
--  bool face_is_visible( vpgl_perspective_camera<double>* cam,
--                        vil_image_view<int>* vis_img,
--                        triangle_3d& world_tri);
--
--  //matches textures
--  void boxm2_match_textures(std::vector<vpgl_perspective_camera<double>* >& cameras,
--                            std::vector<std::string>& imfiles,
--                            imesh_mesh& in_mesh,
--                            std::map<std::string, std::vector<unsigned> >& app_faces,
--                            std::map<std::string, vpgl_perspective_camera<double>* >& texture_cams);
--
--  //returns a list of visible triangles given a camera,
--  //visibility image, and world coordinate 3d triangle
--  std::vector<triangle_3d> get_visible_triangles(vpgl_perspective_camera<double>* cam,
--                                                vil_image_view<int>* vis_img,
--                                                triangle_3d& world_tri);
--
--  //given revised lists of visible images, norms, etc, return the index of the best view
--  int get_best_view(std::vector<vpgl_perspective_camera<double>* >& cams,
--                    std::vector<vil_image_view<int>* >& vis_images,
--                    std::vector<vil_image_view<float>* >& normx,
--                    std::vector<vil_image_view<float>* >& normy,
--                    std::vector<vil_image_view<float>* >& normz,
--                    triangle_3d& world_tri );
--
--  vgl_vector_3d<double> calc_smooth_norm( vpgl_perspective_camera<double>* cam,
--                                          vil_image_view<int>* vis_img,
--                                          vil_image_view<float>* normx,
--                                          vil_image_view<float>* normy,
--                                          vil_image_view<float>* normz,
--                                          triangle_3d& world_tri);
--}
--
--bool boxm2_texture_mesh_process_cons(bprb_func_process& pro)
--{
--  using namespace boxm2_texture_mesh_process_globals;
--
--  //process takes 2 inputs
--  int i=0;
--  std::vector<std::string> input_types_(n_inputs_);
--  input_types_[i++] = "imesh_mesh_sptr";  //depth image
--  input_types_[i++] = "vcl_string";       //directory of scene images
--  input_types_[i++] = "vcl_string";       //directory of corresponding cams
--  input_types_[i++] = "vcl_string";       //output dir of saved mesh
--
--  // process has 1 output
--  std::vector<std::string>  output_types_(n_outputs_);
--  //output_types_[0] = "boxm2_scene_sptr";
--
--  return pro.set_input_types(input_types_) && pro.set_output_types(output_types_);
--}
--
--bool boxm2_texture_mesh_process(bprb_func_process& pro)
--{
--  using namespace boxm2_texture_mesh_process_globals;
--  if ( pro.n_inputs() < n_inputs_ ) {
--    std::cout << pro.name() << ": The input number should be " << n_inputs_<< std::endl;
--    return false;
--  }
--  unsigned argIdx = 0;
--  imesh_mesh_sptr mesh = pro.get_input<imesh_mesh_sptr>(argIdx++);
--  std::string img_dir = pro.get_input<std::string>(argIdx++);
--  std::string cam_dir = pro.get_input<std::string>(argIdx++);
--  std::string out_dir = pro.get_input<std::string>(argIdx++);
--
--  //create the mesh directory
--  if (out_dir != "") {
--    if (!vul_file::make_directory_path(out_dir.c_str())) {
--      std::cout<<"Couldn't make directory path "<<out_dir<<std::endl;
--      return false;
--    }
--  }
--
--  //////////////////////////////////////////////////////////////////////////////
--  //Texture map the mesh
--  //////////////////////////////////////////////////////////////////////////////
--  vul_timer t;
--  std::map<std::string, imesh_mesh> meshes;
--  boxm2_texture_mesh_from_imgs(img_dir, cam_dir, out_dir, *mesh, meshes);
--
--  ////////////////////////////////////////////////////////////////////////////////
--  //// Write out in VRML format
--  ////////////////////////////////////////////////////////////////////////////////
--  //output file and stream
--  std::string vrfile = out_dir + "/vrmesh.wrl";
--  std::ofstream os(vrfile.c_str());
--
--  //write each submesh into one file
--  std::map<std::string, imesh_mesh>::iterator subMesh;
--  for (subMesh = meshes.begin(); subMesh != meshes.end(); ++subMesh)
--  {
--    imesh_mesh& sMesh = subMesh->second;
--    std::cout<<"Writing sub mesh: "<<sMesh.tex_source()<<" has "<<sMesh.num_faces()<<" faces"<<std::endl;
--    imesh_write_vrml(os, sMesh);
--  }
--  os.close();
--  std::cout<<"Texture Mapping Mesh Time: "<<t.all()<<"ms"<<std::endl;
--
--  return true;
--}
--
--
--//: Given a directory of images, dir cams, an input mesh, this function creates a map of textured meshes
--// (imesh doesn't ostensibly handle meshes from multiple textures)
--void boxm2_texture_mesh_process_globals::boxm2_texture_mesh_from_imgs(const std::string& im_dir,
--                                                                      const std::string& cam_dir,
--                                                                      const std::string& out_dir,
--                                                                      imesh_mesh& in_mesh,
--                                                                      std::map<std::string, imesh_mesh>& meshes)
--{
--  ////////////////////////////////////////////////////////////////////////////////
--  // BEGIN TEXTURE MAPPING
--  // Gather cameras and iamges that will contribute to the texture
--  ////////////////////////////////////////////////////////////////////////////////
--  std::vector<std::string> allims = boxm2_util::images_from_directory(im_dir);
--
--  //create blank texturemap image
--  vil_image_view_base_sptr first_im = boxm2_util::prepare_input_image(allims[0]);
--  auto* imptr = (vil_image_view<vil_rgba<vxl_byte> >*) first_im.ptr();
--  vil_rgba<vxl_byte> mean = boxm2_util::mean_pixel(*imptr);
--  vil_image_view<vil_rgba<vxl_byte> > def(4,4);
--  def.fill( mean );
--  vil_save(def, (out_dir + "/empty.png").c_str());
--
--  //chop paths to make mesh portable
--  for (auto & allim : allims) {
--    std::string full_path = allim;
--    std::string rel_path = vul_file::basename(full_path);
--    allim = rel_path;
--  }
--  std::vector<vpgl_perspective_camera<double>* > allcams = bpgl_camera_utils::cameras_from_directory(cam_dir);
--  if (allims.size() != allcams.size()) {
--    std::cout<<"Texture images are not 1 to 1 with cameras:: dirs "<<im_dir<<" and "<<cam_dir<<std::endl;
--    return;
--  }
--
--  //choose a few random images
--  std::vector<std::string> imfiles;
--  std::vector<vpgl_perspective_camera<double>* > cameras;
--
--  //unsigned int handpicked[] = {0,1,13,25,33,40,51,64,73,82,96,105,109,114,125,133,140,147,153,164,175};
--  //int handpicked[] = { 0,1,13,25,33,51,73,96,109,114,133,147,164};
--  //int handpicked[] = {0,12,18};
--  //int handpicked[] = {0, 1, 26, 33, 56, 96, 114, 133 };
--  //int handpicked[] = {0, 8, 16, 23 };
--  for (unsigned int i=0; i<allims.size(); ++i) {
--      imfiles.push_back(allims[i]);
--      cameras.push_back(allcams[i]);
--      std::cout<<"added image: "<<imfiles[i]<<std::endl;
--  }
--#if 0
--  vnl_random rand(9667566);
--  for (int i=0; i<5; ++i) {
--    unsigned filenum = rand.lrand32(1, allims.size()-1);
--    imfiles.push_back(allims[filenum]);
--    cameras.push_back(allcams[filenum]);
--  }
--#endif
--
--  ////////////////////////////////////////////////////////////////////////////////
--  // make sure mesh has computed vertex normals
--  ////////////////////////////////////////////////////////////////////////////////
--  in_mesh.compute_face_normals();
--
--  ////////////////////////////////////////////////////////////////////////////////
--  // Render Visibility Images
--  ////////////////////////////////////////////////////////////////////////////////
--  std::cout<<"calculating visibility images (for each textured image)"<<std::endl;
--  boxm2_visible_faces(cameras, in_mesh,first_im->ni(),first_im->nj());
--
--  ////////////////////////////////////////////////////////////////////////////////
--  // Render norm images (and then smooth them)
--  ////////////////////////////////////////////////////////////////////////////////
--  std::cout<<"calculating norm images (for each texture image)"<<std::endl;
--  compute_norm_images(cameras, in_mesh,first_im->ni(),first_im->nj());
--  smooth_norm_images(30.0);
--
--  ////////////////////////////////////////////////////////////////////////////////
--  // match each face to best image, store a list for each texture image
--  ////////////////////////////////////////////////////////////////////////////////
--  std::cout<<"Populating faces for each texture"<<std::endl;
--  std::map<std::string, std::vector<unsigned> > app_faces; //image_name to face_list
--  std::map<std::string, vpgl_perspective_camera<double>* > texture_cams;
--  boxm2_match_textures(cameras, imfiles, in_mesh, app_faces, texture_cams);
--
--  ////////////////////////////////////////////////////////////////////////////////
--  // For each image/appearance:
--  //   - create a vert list
--  //   - create a face list
--  //   - create a sub mesh that is textured
--  ////////////////////////////////////////////////////////////////////////////////
--  auto& in_faces = (imesh_face_array&) in_mesh.faces();
--  imesh_vertex_array<3>& in_verts = in_mesh.vertices<3>();
--  //for each appearance (texture image), create an imesh_mesh (subMesh);
--  std::cout<<"Creating Sub Meshes for each texture"<<std::endl;
--  std::map<std::string, std::vector<unsigned> >::iterator apps;
--  for (apps = app_faces.begin(); apps != app_faces.end(); ++apps)
--  {
--    //for each appearance, we're creating a whole new mesh
--    // first create the face list
--    auto* flist = new imesh_face_array();
--
--    //now create the vertex list
--    auto* verts3 = new imesh_vertex_array<3>();
--
--    //get faces list corresponding to this texture
--    std::vector<unsigned>& face_list = apps->second;
--    for (unsigned int i=0; i<face_list.size(); ++i) {
--      //get old face
--      unsigned old_fIdx = face_list[i];
--
--      //old face vertices
--      unsigned v1 = in_faces[old_fIdx][0];
--      unsigned v2 = in_faces[old_fIdx][1];
--      unsigned v3 = in_faces[old_fIdx][2];
--
--      //push these vertices onto the new vert list
--      verts3->push_back( imesh_vertex<3>(in_verts[v1][0], in_verts[v1][1], in_verts[v1][2]) );
--      verts3->push_back( imesh_vertex<3>(in_verts[v2][0], in_verts[v2][1], in_verts[v2][2]) );
--      verts3->push_back( imesh_vertex<3>(in_verts[v3][0], in_verts[v3][1], in_verts[v3][2]) );
--
--      imesh_tri tri(3*i, 3*i+1, 3*i+2);
--      flist->push_back(tri);
--    }
--
--    //create the submesh using the auto ptrs
--    std::unique_ptr<imesh_vertex_array_base> v3(verts3);
--    std::unique_ptr<imesh_face_array_base> f3(flist);
--    imesh_mesh subMesh(std::move(v3), std::move(f3));
--
--    std::cout<<"Setting tex source: "<<apps->first<<std::endl;
--    meshes[apps->first] = subMesh;
--    meshes[apps->first].set_tex_source(apps->first);
--  }
--
--  //////////////////////////////////////////////////////////////////////////////
--  //For each mesh, map each vertex
--  //////////////////////////////////////////////////////////////////////////////
--  std::cout<<"Mapping sub meshes for each texture"<<std::endl;
--  std::map<std::string, imesh_mesh>::iterator subMesh;
--  auto txCam = texture_cams.begin();
--  for (subMesh = meshes.begin(); subMesh != meshes.end(); ++subMesh, ++txCam)
--  {
--    imesh_mesh& mesh = subMesh->second;
--    imesh_vertex_array<3>& verts = mesh.vertices<3>();
--    unsigned nverts = mesh.num_verts();
--
--    //texture map the non empty appearances
--    if (txCam->first != "empty.png")
--    {
--      std::vector<vgl_point_2d<double> > tex_coords(nverts, vgl_point_2d<double>(0.0,0.0));
--      for (unsigned iv = 0; iv<nverts; ++iv)
--      {
--        //find camera corresponding to this texture
--        vpgl_perspective_camera<double>* closest = txCam->second;
--        vgl_point_2d<double> principal_point = closest->get_calibration().principal_point();
--        double ni = principal_point.x()*2.0;
--        double nj = principal_point.y()*2.0;
--
--        //project the vertex onto the camera, store the texture coordinate
--        double x = verts[iv][0];
--        double y = verts[iv][1];
--        double z = verts[iv][2];
--        double u,v;
--        closest->project(x, y, z, u, v);
--
--        //flip v about the y axis
--        v=nj-v;
--
--        //store the tex_coordinate
--        vgl_point_2d<double> uv(u/ni,v/nj);
--        tex_coords[iv] = uv;
--      }
--      mesh.set_tex_coords(tex_coords);
--    }
--    else {
--      //otherwise put in default texture (grey)
--      std::vector<vgl_point_2d<double> > tex_coords(nverts, vgl_point_2d<double>(0.0,0.0));
--      for (unsigned iv = 0; iv<nverts; ++iv) {
--        tex_coords[iv] = vgl_point_2d<double>(.5, .5);
--      }
--      mesh.set_tex_coords(tex_coords);
--    }
--  }
--}
--
--
--//image_name to face_list
--void boxm2_texture_mesh_process_globals::boxm2_match_textures(std::vector<vpgl_perspective_camera<double>* >& cameras,
--                                                              std::vector<std::string>& imfiles,
--                                                              imesh_mesh& in_mesh,
--                                                              std::map<std::string, std::vector<unsigned> >& app_faces,
--                                                              std::map<std::string, vpgl_perspective_camera<double>* >& texture_cams)
--{
--  //grab faces and vertices from the mesh
--  auto& in_faces = (imesh_face_array&) in_mesh.faces();
--  unsigned nfaces = in_mesh.num_faces();
--  imesh_vertex_array<3>& in_verts = in_mesh.vertices<3>();
--
--  //for each face, determine which view is best
--  for (unsigned iface = 0; iface<nfaces; ++iface)
--  {
--    //make a triangle_3d out of this face
--    triangle_3d world_tri;
--    world_tri.face_id = iface;
--    for (int i=0; i<3; ++i) {
--      unsigned vertexId = in_faces[iface][i];
--      double x = in_verts[vertexId][0];
--      double y = in_verts[vertexId][1];
--      double z = in_verts[vertexId][2];
--      world_tri.points[i] = vgl_point_3d<double>(x,y,z);
--    }
--
--    //create list of cameras from which you can see this face
--    std::vector<std::string> visible_imfiles;
--    std::vector<vpgl_perspective_camera<double>* > visible_views;
--    std::vector<vil_image_view<int>* > vis_images;
--    std::vector<vil_image_view<float>* > normx, normy, normz;
--    for (unsigned int i=0; i<vis_images_.size(); ++i) {
--      if ( face_is_visible( cameras[i], vis_images_[i], world_tri) ) {
--        visible_imfiles.push_back(imfiles[i]);
--        visible_views.push_back(cameras[i]);
--        vis_images.push_back(vis_images_[i]);
--        normx.push_back(normx_[i]);
--        normy.push_back(normy_[i]);
--        normz.push_back(normz_[i]);
--      }
--    }
--
--    //now compare the normal to each of the visible view cameras
--#ifdef DEBUG
--    vgl_vector_3d<double>& normal = in_faces.normal(iface);
--    std::cout<<"Face "<<iface<<" normal: "<<normal<<std::endl;
--#endif
--
--    //find camera with the closest look vector to this normal
--    //int closeIdx = boxm2_util::find_nearest_cam(normal, visible_views);
--    int closeIdx = get_best_view(visible_views, vis_images, normx, normy, normz, world_tri);
--    vpgl_perspective_camera<double>* closest = nullptr;
--    std::string im_name = "empty.png";
--    if (closeIdx >= 0) {
--      closest = visible_views[closeIdx];
--      im_name = visible_imfiles[closeIdx];
--    }
--
--    //grab appropriate face list (create it if it's not there)
--    auto iter = app_faces.find(im_name);
--    if ( iter == app_faces.end() ) {
--      std::cout<<"boxm2_match_textures:: Adding image "<<im_name<<" to texture list"<<std::endl;
--      std::vector<unsigned> faceList;
--      faceList.push_back(iface);
--      app_faces[im_name] = faceList;
--
--      //keep track of the camera
--      texture_cams[im_name] = closest;
--    }
--    else {
--      app_faces[im_name].push_back(iface);
--    }
--  }
--
--#if 0
--  ////////////////////////////////////////////////////////////////////////////////
--  // Now there is a set of faces without textures,
--  // for each face
--  //    for each image
--  //      - find visible portions of these faces, record area and angle from dist
--  //    find angle < 60 degrees AND largest area patch
--  //    cut the face such that the patch is exposed (patch may be some arbitrary polygon)
--  //    triangulate the n-gon into n triangles
--  //    add the *new* points to the mesh, as well as the new faces
--  //    remember to not leave the old face in the mesh...
--  ////////////////////////////////////////////////////////////////////////////////
--  for (unsigned iface = 0; iface<nfaces; ++iface)
--  {
--    //whole first chunk figures out which set of triangles this face should be broken into
--    double max_area = 0.0;
--    double max_img = -1;
--    std::vector<triangle_3d> final_triangles;
--    for (int imIdx=0; imIdx<vis_images.size(); ++imIdx) {
--      //if this angle is too large, just pass over it
--      double midAngle = angle(in_faces.normal(iface), -1*cameras[imIdx]->principal_axis()); // return acos(cos_angle(a,b));
--      if (midAngle > vnl_math::pi/3) continue;
--
--      //find visible portion of iface on this image, record area (make a 3d tri out of it first)
--      triangle_3d world_tri;
--      world_tri.face_id = iface;
--      for (int i=0; i<3; ++i) {
--        unsigned vertexId = in_faces[iface][i];
--        double x = in_verts[vertexId][0];
--        double y = in_verts[vertexId][1];
--        double z = in_verts[vertexId][2];
--        world_tri.points[i] = vgl_point_3d<double>(x,y,z);
--      }
--      std::vector<triangle_3d> vis_tris = get_visible_triangles(cameras[imIdx], vis_images[imIdx], world_tri);
--
--      //get the total area of the triangles
--      double totalArea = 0;
--      for (int tri_i = 0; tri_i < vis_tris.size(); ++tri_i) {
--        totalArea+= vgl_triangle_3d_area(vis_tris[tri_i].points[0],
--                                         vis_tris[tri_i].points[1],
--                                         vis_tris[tri_i].points[2]);
--      }
--
--      //store it if it's the biggest patch so far
--      if (totalArea > max_area) {
--        max_area = totalArea;
--        max_img = imIdx;
--        final_triangles = vis_tris;
--      }
--    }
--
--    //now that you have the visible triangles that will be mapped in your mesh...
--    // 1. add the new vertices
--    // 2. add the new faces
--
--    // 3. add the new faces to the correct texture list
--    std::string im_name =
--    app_faces[im_name].push_back(iface);
--  }
--
--  //Be wary of this interpolation iterator - didn't match up with the imesh one
--  bvgl_triangle_interpolation_iterator(double *verts_x, double *verts_y, T *values, unsigned int v0 = 0, unsigned int v1 = 1, unsigned int v2 = 2);
--
--  // Create a new face list with the faces split by visibility
--  imesh_regular_face_array<3>* newFaces = new imesh_regular_face_array<3>();
--#endif
--}
--
--//: Compares each visible camera with the average normal from each norm image, chooses the one that most closely matches
--int boxm2_texture_mesh_process_globals::get_best_view(std::vector<vpgl_perspective_camera<double>* >& cams,
--                                                      std::vector<vil_image_view<int>* >& vis_images,
--                                                      std::vector<vil_image_view<float>* >& normx,
--                                                      std::vector<vil_image_view<float>* >& normy,
--                                                      std::vector<vil_image_view<float>* >& normz,
--                                                      triangle_3d& world_tri)
--{
--  if (cams.empty()) {
--    return -1;
--  }
--
--  //find minimal dot product amongst cams/images
--  double minAngle = 10e20;
--  int minCam = -1;
--  for (unsigned int i=0; i<cams.size(); ++i) {
--    //get the smooth norm corresponding to this camera view
--    vgl_vector_3d<double> normal = calc_smooth_norm( cams[i], vis_images[i], normx[i], normy[i], normz[i], world_tri);
--    //std::cout<<"   face "<<world_tri.face_id<<" image "<<i<<" normal: "<<normal<<std::endl;
--
--    double dotProd = dot_product( normal, -1*cams[i]->principal_axis());
--    double ang = std::acos(dotProd);
--#ifdef DEBUG
--    if ( std::fabs(normal.z()) > .8 ) {
--      std::cout<<"Face normal: "<<normal<<"  principal axis: "<<cams[i]->principal_axis()<<'\n'
--              <<" and angle: " <<ang * vnl_math::deg_per_rad<<std::endl;
--    }
--#endif
--    if (ang < minAngle && ang < vnl_math::pi/2.0) {
--      minAngle = ang;
--      minCam = i;
--    }
--  }
--
--  //return the min cam
--  return minCam;
--}
--
--vgl_vector_3d<double>
--boxm2_texture_mesh_process_globals::calc_smooth_norm( vpgl_perspective_camera<double>* cam,
--                                                      vil_image_view<int>* vis_img,
--                                                      vil_image_view<float>* normx,
--                                                      vil_image_view<float>* normy,
--                                                      vil_image_view<float>* normz,
--                                                      triangle_3d& world_tri)
--{
--  //project triangle
--  double us[3], vs[3];
--  for (int vIdx=0; vIdx<3; ++vIdx) {
--    //project these verts into UV
--    double x = world_tri.points[vIdx].x();
--    double y = world_tri.points[vIdx].y();
--    double z = world_tri.points[vIdx].z();
--    double u,v;
--    cam->project(x, y, z, u, v);
--    us[vIdx] = u;
--    vs[vIdx] = v;
--  }
--
--  //now create a polygon, and find the integer image coordinates (U,V) that this polygon covers
--  int ni = vis_img->ni();
--  int nj = vis_img->nj();
--  double nx=0.0, ny=0.0, nz=0.0; //initialize normal
--  int numNormals = 0;
--
--  vgl_triangle_scan_iterator<double> tsi;
--  tsi.a.x = us[0];  tsi.a.y = vs[0];
--  tsi.b.x = us[1];  tsi.b.y = vs[1];
--  tsi.c.x = us[2];  tsi.c.y = vs[2];
--  for (tsi.reset(); tsi.next(); ) {
--    int y = tsi.scany();
--    if (y<0 || y>=nj) continue;
--    int min_x = tsi.startx();
--    int max_x = tsi.endx();
--    if (min_x >= ni || max_x < 0)
--      continue;
--    if (min_x < 0) min_x = 0;
--    if (max_x >= ni) max_x = ni-1;
--    for (int x = min_x; x <= max_x; ++x) {
--      if ( (*vis_img)(x,y) == int(world_tri.face_id) ) {
--        nx += (*normx)(x,y);
--        ny += (*normy)(x,y);
--        nz += (*normz)(x,y);
--        numNormals++;
--      }
--    }
--  }
--  return {nx/numNormals, ny/numNormals, nz/numNormals};
--}
--
--
--//:
--// returns a list of visible triangles given a camera,
--// visibility image, and world coordinate 3d triangle
--std::vector<boxm2_texture_mesh_process_globals::triangle_3d>
--boxm2_texture_mesh_process_globals::get_visible_triangles(vpgl_perspective_camera<double>* /*cam*/,
--                                                          vil_image_view<int>* /*vis_img*/,
--                                                          triangle_3d& /*world_tri*/)
--{
--  std::cerr << "TODO: boxm2_texture_mesh_process_globals::get_visible_triangles is not yet implemented\n";
--  return std::vector<triangle_3d>();
--}
--
--
--//:
--// given a camera, and an image with ID faces, this method returns true if the entire
--// triangle (id face_id) is unoccluded from this point of view
--bool boxm2_texture_mesh_process_globals::face_is_visible( vpgl_perspective_camera<double>* cam,
--                                                          vil_image_view<int>* vis_img,
--                                                          triangle_3d& world_tri)
--{
--  //project triangle
--  double us[3], vs[3];
--  for (int vIdx=0; vIdx<3; ++vIdx) {
--    //project these verts into UV
--    double x = world_tri.points[vIdx].x();
--    double y = world_tri.points[vIdx].y();
--    double z = world_tri.points[vIdx].z();
--    double u,v;
--    cam->project(x, y, z, u, v);
--    us[vIdx] = u;
--    vs[vIdx] = v;
--  }
--
--  //now create a polygon, and find the integer image coordinates (U,V) that this polygon covers
--  int ni = vis_img->ni();
--  int nj = vis_img->nj();
--  unsigned int numPixels = 0;
--  unsigned int numMatches = 0;
--
--  vgl_triangle_scan_iterator<double> tsi;
--  tsi.a.x = us[0];  tsi.a.y = vs[0];
--  tsi.b.x = us[1];  tsi.b.y = vs[1];
--  tsi.c.x = us[2];  tsi.c.y = vs[2];
--  for (tsi.reset(); tsi.next(); ) {
--    int y = tsi.scany();
--    if (y<0 || y>=nj) continue;
--    int min_x = tsi.startx();
--    int max_x = tsi.endx();
--    if (min_x >= ni || max_x < 0)
--      continue;
--    if (min_x < 0) min_x = 0;
--    if (max_x >= ni) max_x = ni-1;
--    for (int x = min_x; x <= max_x; ++x) {
--      ++numPixels;
--      if ( (*vis_img)(x,y) == int(world_tri.face_id) )
--        ++numMatches;
--    }
--  }
--
--  //if the majority match, it's visible
--  if ( (double) numMatches / (double) numPixels > .99)
--    return true;
--  else
--    return false;
--}
--
--//: Constructs vector of visibility images - images that identify which triangle is visible at which pixel.
--// Function is more or less complete - not much more to it.
--void boxm2_texture_mesh_process_globals::boxm2_visible_faces( std::vector<vpgl_perspective_camera<double>* >& cameras,
--                                                              imesh_mesh& in_mesh, unsigned int ni=1024, unsigned int nj=768)
--{
--  auto& in_faces = (imesh_face_array&) in_mesh.faces();
--
--  unsigned nfaces = in_mesh.num_faces();
--  imesh_vertex_array<3>& in_verts = in_mesh.vertices<3>();
--
--  // iterate over each camera, creating a visibility image for each
--  for (auto pcam : cameras)
--  {
--    //// get the principal point of the cam for image size
--    //std::cout<<(*pcam);
--    //vgl_point_2d<double> principal_point = pcam->get_calibration().principal_point();
--    //unsigned ni = (unsigned) (principal_point.x()*2.0);
--    //unsigned nj = (unsigned) (principal_point.y()*2.0);
--
--    // render the face_id/distance image
--    vil_image_view<double> depth_im(ni, nj);
--    auto*   face_im = new vil_image_view<int>(ni, nj);
--    depth_im.fill(10e100);  //Initial depth is huge,
--    face_im->fill(-1); //initial face id is -1
--    for (unsigned iface = 0; iface<nfaces; ++iface)
--    {
--      // get the vertices from the face, project into UVs
--      double us[3], vs[3], dists[3];
--
--      for (int vIdx=0; vIdx<3; ++vIdx) {
--        unsigned vertIdx = in_faces[iface][vIdx];
--        // project these verts into UV
--        double x = in_verts[vertIdx][0], y = in_verts[vertIdx][1], z = in_verts[vertIdx][2];
--        double u,v;
--        pcam->project(x, y, z, u, v);
--        us[vIdx] = u;
--        vs[vIdx] = v;
--        // keep track of distance to each vertex
--        dists[vIdx] = vgl_distance(vgl_point_3d<double>(x,y,z), pcam->get_camera_center());
--      }
--
--      // render the triangle label onto the label image, using the depth image
--      vgl_point_3d<double> v1(us[0], vs[0], dists[0]);
--      vgl_point_3d<double> v2(us[1], vs[1], dists[1]);
--      vgl_point_3d<double> v3(us[2], vs[2], dists[2]);
--      imesh_render_triangle_label<int>(v1, v2, v3, (int) iface, (*face_im), depth_im);
--    } //end for iface
--
--    // keep the vis_image just calculated
--    vis_images_.push_back(face_im);
--  }
--}
--
--//: Constructs vector of visibility images - images that identify which triangle is visible at which pixel.
--// Function is more or less complete - not much more to it.
--void boxm2_texture_mesh_process_globals::compute_norm_images( std::vector<vpgl_perspective_camera<double>* >& cameras,
--                                                              imesh_mesh& in_mesh,unsigned int ni, unsigned int nj)
--{
--  auto& in_faces = (imesh_face_array&) in_mesh.faces();
--  unsigned nfaces = in_mesh.num_faces();
--
--  for (unsigned int i=0; i<vis_images_.size(); ++i) {
--#if 0
--    // get the principal point/ni,nj
--    vpgl_perspective_camera<double>* pcam = cameras[i];
--    vgl_point_2d<double> principal_point = pcam->get_calibration().principal_point();
--    unsigned ni = (unsigned) (principal_point.x()*2.0);
--    unsigned nj = (unsigned) (principal_point.y()*2.0);
--#endif // 0
--    // create a norm x,y, and z image for each visibility image
--    vil_image_view<int>* vis = vis_images_[i];
--    auto* nx = new vil_image_view<float>(ni, nj);
--    auto* ny = new vil_image_view<float>(ni, nj);
--    auto* nz = new vil_image_view<float>(ni, nj);
--    vgl_vector_3d<double> paxis = cameras[i]->principal_axis();
--    nx->fill( (float) paxis.x());
--    ny->fill( (float) paxis.y());
--    nz->fill( (float) paxis.z());
--    for (unsigned int x=0; x<ni; ++x) {
--      for (unsigned int y=0; y<nj; ++y) {
--        int face_id = (*vis)(x,y);
--        if (face_id >= 0 && face_id < (int)nfaces) {
--          vgl_vector_3d<double> fnorm = in_faces.normal(face_id);
--          (*nx)(x,y) = (float) fnorm.x();
--          (*ny)(x,y) = (float) fnorm.y();
--          (*nz)(x,y) = (float) fnorm.z();
--        }
--      }
--    }
--
--    //keep the vis_image just calculated
--    normx_.push_back(nx);
--    normy_.push_back(ny);
--    normz_.push_back(nz);
--  }
--
--#if 0 // commented out ...
--  imesh_vertex_array<3>& in_verts = in_mesh.vertices<3>();
--  //iterate over each camera, creating a visibility image for each
--  for (unsigned int i=0; i<cameras.size(); ++i)
--  {
--    //get the principal point of the cam for image size
--    vpgl_perspective_camera<double>* pcam = cameras[i];
--    vgl_point_2d<double> principal_point = pcam->get_calibration().principal_point();
--    unsigned ni = (unsigned) (principal_point.x()*2.0);
--    unsigned nj = (unsigned) (principal_point.y()*2.0);
--
--    // render the norm images in each dimension
--    vil_image_view<float>* nx = new vil_image_view<float>(ni, nj);
--    vil_image_view<float>* ny = new vil_image_view<float>(ni, nj);
--    vil_image_view<float>* nz = new vil_image_view<float>(ni, nj);
--    vgl_vector_3d<double> paxis = cameras[i]->principal_axis();
--    nx->fill( (float) paxis.x());
--    ny->fill( (float) paxis.y());
--    nz->fill( (float) paxis.z());
--    vil_image_view<double> depth_im(ni, nj);
--    depth_im.fill(10e100);
--    for (unsigned iface = 0; iface<nfaces; ++iface)
--    {
--      //get face normal - this will be the "ID"
--      vgl_vector_3d<double> fnorm = in_faces.normal(iface);
--
--      //get the vertices from the face, project into UVs
--      double us[3], vs[3], dists[3];
--      for (int vIdx=0; vIdx<3; ++vIdx) {
--        unsigned vertIdx = in_faces[iface][vIdx];
--
--        //project these verts into UV
--        double x = in_verts[vertIdx][0], y = in_verts[vertIdx][1], z = in_verts[vertIdx][2];
--        double u,v;
--        pcam->project(x, y, z, u, v);
--        us[vIdx] = u;
--        vs[vIdx] = v;
--
--        //keep track of distance to each vertex
--        dists[vIdx] = vgl_distance(vgl_point_3d<double>(x,y,z), pcam->get_camera_center());
--      }
--
--      //render the triangle label onto the label image, using the depth image
--      vgl_point_3d<double> v1(us[0], vs[0], dists[0]);
--      vgl_point_3d<double> v2(us[1], vs[1], dists[1]);
--      vgl_point_3d<double> v3(us[2], vs[2], dists[2]);
--      imesh_render_triangle_label<float>(v1, v2, v3, (float) fnorm.x(), (*nx), depth_im);
--      imesh_render_triangle_label<float>(v1, v2, v3, (float) fnorm.y(), (*ny), depth_im);
--      imesh_render_triangle_label<float>(v1, v2, v3, (float) fnorm.z(), (*nz), depth_im);
--    } //end for iface
--
--    //keep the vis_image just calculated
--    normx_.push_back(nx);
--    normy_.push_back(ny);
--    normz_.push_back(nz);
--  }
--#endif // 0
--}
--
--void boxm2_texture_mesh_process_globals::smooth_norm_images(double sigma)
--{
--  vil_gauss_filter_5tap_params params(sigma); //set SIGMA
--  for (unsigned int i=0; i<normx_.size(); ++i) {
--    vil_image_view<float>* currX = normx_[i];
--    auto* newX = new vil_image_view<float>(currX->ni(), currX->nj());
--    vil_gauss_filter_5tap(*currX, *newX, params);
--    //store the filtered image
--    delete currX;
--    normx_[i] = newX;
--
--    //repeat for y
--    vil_image_view<float>* currY = normy_[i];
--    auto* newY = new vil_image_view<float>(currY->ni(), currY->nj());
--    vil_gauss_filter_5tap(*currY, *newY, params);
--    delete currY;
--    normy_[i] = newY;
--
--    //z
--    vil_image_view<float>* currZ = normz_[i];
--    auto* newZ = new vil_image_view<float>(currZ->ni(), currZ->nj());
--    vil_gauss_filter_5tap(*currZ, *newZ, params);
--    delete currZ;
--    normz_[i] = newZ;
--  }
--}
-diff --git a/contrib/brl/bseg/sdet/CMakeLists.txt b/contrib/brl/bseg/sdet/CMakeLists.txt
-index 60a1da2706..081a0a6452 100644
---- a/contrib/brl/bseg/sdet/CMakeLists.txt
-+++ b/contrib/brl/bseg/sdet/CMakeLists.txt
-@@ -39,7 +39,6 @@ set(sdet_sources
-     sdet_nms.cxx                         sdet_nms.h
-     sdet_third_order_edge_det_params.cxx sdet_third_order_edge_det_params.h
-     sdet_third_order_edge_det.cxx        sdet_third_order_edge_det.h
--    sdet_image_mesh.cxx                  sdet_image_mesh.h
-     sdet_image_mesh_params.cxx           sdet_image_mesh_params.h
-     sdet_denoise_mrf.cxx                 sdet_denoise_mrf.h
-     sdet_denoise_mrf_params.cxx          sdet_denoise_mrf_params.h
-diff --git a/contrib/brl/bseg/sdet/sdet_image_mesh.cxx b/contrib/brl/bseg/sdet/sdet_image_mesh.cxx
-deleted file mode 100644
-index 81af9ebb83..0000000000
---- a/contrib/brl/bseg/sdet/sdet_image_mesh.cxx
-+++ /dev/null
-@@ -1,327 +0,0 @@
--// This is brl/bseg/sdet/sdet_image_mesh.cxx
--#include "sdet_image_mesh.h"
--#include "vgl/vgl_point_2d.h"
--#include "vgl/vgl_line_segment_2d.h"
--#include "vil/vil_image_view.h"
--#include "vil/vil_math.h"
--#include "vil/vil_convert.h"
--#include "vil/vil_new.h"
--#include "vil/vil_pixel_format.h"
--#include "vil/vil_save.h"
--#include <vtol/vtol_edge_2d_sptr.h>
--#include <vsol/vsol_line_2d.h>
--#include <vtol/vtol_edge_2d.h>
--#include <vdgl/vdgl_digital_curve.h>
--#include <vdgl/vdgl_interpolator.h>
--#include <vdgl/vdgl_interpolator_sptr.h>
--#include <vdgl/vdgl_edgel_chain.h>
--#include <vdgl/vdgl_edgel_chain_sptr.h>
--
--#include <brip/brip_vil_float_ops.h>
--#include <brip/brip_line_generator.h>
--
--#include <sdet/sdet_detector_params.h>
--#include <sdet/sdet_detector.h>
--#include <sdet/sdet_fit_lines_params.h>
--#include <sdet/sdet_fit_lines.h>
--#include <bil/algo/bil_cedt.h>
--#include <bvgl/bvgl_triangle_interpolation_iterator.h>
--#include <imesh/algo/imesh_generate_mesh.h>
--
--//note: this method is somewhat of a hack and should be replaced by
--// a computed step function transition width, e.g. by a 2nd derivative
--// operator
--bool sdet_image_mesh:: step_boundary(vgl_line_segment_2d<double> const& parent,
--                                     vgl_line_segment_2d<double>& child0,
--                                     vgl_line_segment_2d<double>& child1)
--{
--  if (! resc_ ) return false;
--  unsigned ni = resc_->ni(), nj = resc_->nj();
--  vgl_vector_2d<double> n = parent.normal();
--  vgl_point_2d<double> p1 = parent.point1();
--  vgl_point_2d<double> p2 = parent.point2();
--  vgl_point_2d<double> p10 = p1 - step_half_width_*n;
--  vgl_point_2d<double> p11 = p1 + step_half_width_*n;
--  vgl_point_2d<double> p20 = p2 - step_half_width_*n;
--  vgl_point_2d<double> p21 = p2 + step_half_width_*n;
--  if (p10.x()<0 || p10.y()<0||p20.x()<0||p20.y()<0||
--      p10.x()>=ni ||p10.y()>=nj||p20.x()>=ni||p20.y()>=nj)
--    return false;
--  else
--    child0 = vgl_line_segment_2d<double>(p10, p20);
--  if (p11.x()<0 || p11.y()<0||p21.x()<0||p21.y()<0||
--      p11.x()>=ni ||p11.y()>=nj||p21.x()>=ni||p21.y()>=nj)
--    return false;
--  else
--    child1 = vgl_line_segment_2d<double>(p11, p21);
--  return true;
--}
--
--//---------------------------------------------------------------
--// Constructors
--//
--//----------------------------------------------------------------
--
--// constructor from a parameter block (the only way)
--sdet_image_mesh::sdet_image_mesh(sdet_image_mesh_params& imp)
--  : sdet_image_mesh_params(imp), mesh_valid_(false), resc_(nullptr)
--{
--}
--
--// Destructor
--sdet_image_mesh::~sdet_image_mesh()
--= default;
--
--bool sdet_image_mesh::compute_line_segments(vil_image_resource_sptr const& resc,
--                                            std::vector<vgl_line_segment_2d<double> > & segs)
--{
--  if (!resc) return false;
--  mesh_valid_ = false;
--  sdet_detector_params dp;
--  dp.smooth= smooth_;
--  dp.noise_multiplier = thresh_;
--  dp.aggressive_junction_closure=0;
--  dp.junctionp=false;
--  sdet_detector det(dp);
--  det.SetImage(resc);
--  det.DoContour();
--  std::vector<vtol_edge_2d_sptr>* edges = det.GetEdges();
--  if (!edges) {
--    std::cout<<"sdet_image_mesh:: could not detect edges in buffer"<<std::endl;
--    return false;
--  }
--
--  //fit lines on edges
--  sdet_fit_lines_params flp;
--  flp.min_fit_length_ = min_fit_length_;
--  flp.rms_distance_ = rms_distance_;
--  sdet_fit_lines fl(flp);
--  fl.set_edges(*edges);
--  bool fit_worked = fl.fit_lines();
--  if (!fit_worked) {
--    std::cout<<"sdet_image_mesh:: could not fit lines on edges"<<std::endl;
--    return false;
--  }
--
--  fl.get_line_segs(segs);
--  return true;
--}
--
--bool sdet_image_mesh::compute_mesh()
--{
--  vil_image_view<unsigned char> line_img(resc_->ni(),resc_->nj());//some resource
--  line_img.fill(255);
--
--  std::vector<vgl_line_segment_2d<double> > segs, segs_pair;
--  sdet_detector_params dp;
--  dp.smooth= smooth_;
--  dp.noise_multiplier = thresh_;
--  dp.aggressive_junction_closure=0;
--  dp.junctionp=false;
--  sdet_detector det(dp);
--  det.SetImage(resc_);
--  det.DoContour();
--  std::vector<vtol_edge_2d_sptr>* edges = det.GetEdges();
--  for (auto & edge : *edges)
--  {
--    vsol_curve_2d_sptr c = edge->curve();
--    vdgl_digital_curve_sptr dc = c->cast_to_vdgl_digital_curve();
--    if (!dc)
--      continue;
--    vdgl_interpolator_sptr intp = dc->get_interpolator();
--    vdgl_edgel_chain_sptr ec = intp->get_edgel_chain();
--    int nedgl = ec->size();
--    for (int i=0; i<nedgl; i++)
--    {
--      // anchor_points_.push_back(vgl_point_2d<double>((*ec)[i].x(),(*ec)[i].y()));
--      line_img((int)(*ec)[i].x(),(int) (*ec)[i].y())=0;
--    }
--  }
--
-- bil_cedt dt(line_img);
-- if (!dt.compute_cedt())
--  std::cout<<"Error in computing DT"<<std::endl;
--
-- vil_image_view<float> dtimg=dt.cedtimg();
-- vil_image_view<unsigned char> dtimg_threshed(dtimg.ni(),dtimg.nj());dtimg_threshed.fill(0);
-- for (unsigned i=0;i<dtimg.ni();i++)
--   for (unsigned j=0;j<dtimg.nj();j++)
--     if (dtimg(i,j)<2.0)
--       dtimg_threshed(i,j)=255;
-- vil_save(dtimg_threshed,"F:/visdt/dt_thresh.png");
--
-- //segs_pair.clear();
-- std::vector<vgl_line_segment_2d<double> > lines;
-- this->compute_line_segments(vil_new_image_resource_of_view(dtimg_threshed),lines);
-- segs_pair.insert(segs_pair.end(),lines.begin(),lines.end());
-- line_img.fill(255);
--
-- for (auto & i : segs_pair)
-- {
--   bool init = true;
--   float xs= float(i.point1().x());
--   float ys= float(i.point1().y());
--   float xe= float(i.point2().x());
--   float ye= float(i.point2().y());
--   float x=0.0f;
--   float y=0.0f;
--   while (brip_line_generator::generate(init, xs, ys, xe, ye, x, y))
--   {
--     int xi = (int)x;
--     int yi = (int)y; //convert the pixel location to integer
--     line_img(xi, yi)=0;
--   }
-- }
-- vil_save(line_img,"F:/visdt/line_img_more.png");
--
-- bil_cedt dt1(line_img);
-- if (!dt1.compute_cedt())
--   std::cout<<"Error in computing DT"<<std::endl;
--
--  //generate a 2d mesh based on the edges
--  vgl_point_2d<double> ul(0.0, 0.0), ur(resc_->ni()-1,0.0);
--  vgl_point_2d<double> lr(resc_->ni()-1, resc_->nj()-1), ll(0.0, resc_->nj()-1);
--
--  std::vector<vgl_point_2d<double> > convex_hull;
--  convex_hull.push_back(ul);   convex_hull.push_back(ur);
--  convex_hull.push_back(lr);   convex_hull.push_back(ll);
--  std::vector<vgl_point_2d<double> > cvexh = convex_hull;
--  imesh_mesh mesh_one;
--  imesh_generate_mesh_2d_2(convex_hull, segs_pair,anchor_points_, mesh_one);
--
--  //lift vertices to 3-d
--  const imesh_vertex_array<2>& verts = mesh_one.vertices<2>();
--  auto* verts3 = new imesh_vertex_array<3>();
--
--  // convert image to float
--  vil_image_view<float> view = brip_vil_float_ops::convert_to_float(resc_);
--  unsigned ni = view.ni(), nj = view.nj();
--  float minv=0, maxv=0;
--  vil_math_value_range(view, minv, maxv);
--  unsigned nverts = mesh_one.num_verts();
--  for (unsigned iv = 0; iv<nverts; ++iv)
--  {
--    auto i = static_cast<unsigned>(verts[iv][0]);
--    auto j = static_cast<unsigned>(verts[iv][1]);
--    double height =maxv;
--    if (i<ni && j<nj)
--      height = static_cast<double>(view(i,j));
--    height = maxv-height;
--    imesh_vertex<3> v3(verts[iv][0], verts[iv][1], height);
--    verts3->push_back(v3);
--  }
--  std::unique_ptr<imesh_vertex_array_base> v3(verts3);
--  mesh_one.set_vertices(std::move(v3));
--  //mesh_valid_ = true;
--
--  ///////////////////////////////////////////////////////
--  //compute anchor points, and rerun generate_mesh_2d_2
--  ///////////////////////////////////////////////////////
--  this->set_anchor_points(mesh_one,dt1.cedtimg());
--
--  std::cout<<"Number of anchor points: "<<anchor_points_.size()<<std::endl;
--  imesh_generate_mesh_2d_2(cvexh, segs_pair, anchor_points_, mesh_);
--  const imesh_vertex_array<2>& verts2 = mesh_.vertices<2>();
--  auto* newVerts = new imesh_vertex_array<3>();
--
--  // convert image to float
--  ni = view.ni(), nj = view.nj();
--  vil_math_value_range(view, minv, maxv);
--  nverts = mesh_.num_verts();
--  for (unsigned iv = 0; iv<nverts; ++iv)
--  {
--    auto i = static_cast<unsigned>(verts2[iv][0]);
--    auto j = static_cast<unsigned>(verts2[iv][1]);
--    double height =maxv;
--    if (i<ni && j<nj)
--      height = static_cast<double>(view(i,j));
--    height = maxv-height;
--    imesh_vertex<3> v3(verts2[iv][0], verts2[iv][1], height);
--    newVerts->push_back(v3);
--  }
--  std::unique_ptr<imesh_vertex_array_base> v3_ptr(newVerts);
--  mesh_.set_vertices(std::move(v3_ptr));
--  mesh_valid_ = true;
--
--  return true;
--}
--
--//takes the 3d mesh, calculates depth disparity map (from top)
--void sdet_image_mesh::set_anchor_points(imesh_mesh& mesh, vil_image_view<float> dt_img)
--{
--  //create a tri_depth image
--  int ni = resc_->ni();
--  int nj = resc_->nj();
--  vil_image_view<float> tri_depth(ni, nj);
--
--  //find the range of triangles in the Z direction
--  auto& faces = (imesh_regular_face_array<3>&) mesh.faces();
--  imesh_vertex_array<3>& verts = mesh.vertices<3>();
--  unsigned nfaces = mesh.num_faces();
--  for (unsigned iface = 0; iface<nfaces; ++iface)
--  {
--    unsigned v1 = faces[iface][0];
--    unsigned v2 = faces[iface][1];
--    unsigned v3 = faces[iface][2];
--    double verts_x[] = { verts[v1][0], verts[v2][0], verts[v3][0] };
--    double verts_y[] = { verts[v1][1], verts[v2][1], verts[v3][1] };
--    double verts_z[] = { verts[v1][2], verts[v2][2], verts[v3][2] };
--    bvgl_triangle_interpolation_iterator<double> tsi(verts_x, verts_y, verts_z);
--
--    //scan the triangle, storing the depth
--    for (tsi.reset(); tsi.next(); ) {
--      int y = tsi.scany();
--      if (y<0 || y>=nj) continue;
--      int min_x = tsi.startx();
--      int max_x = tsi.endx();
--      if (min_x >= ni || max_x < 0)
--        continue;
--      if (min_x < 0) min_x = 0;
--      if (max_x >= ni) max_x = ni-1;
--      for (int x = min_x; x <= max_x; ++x) {
--        tri_depth(x,y) = (float) tsi.value_at(x);
--      }
--    }
--  }
--
--  //get range of triangle depths
--  float minz, maxz;
--  vil_math_value_range(tri_depth, minz, maxz);
--
--  //maximum z diff allowed for a triangle is 1/512 of the total z range
--  vil_image_view<float> z_img = brip_vil_float_ops::convert_to_float(resc_);
--
--  //for ( unsigned niter=1;niter<16;niter*=2)
--  {
--    double max_z_diff = (maxz-minz)/64.0;
--    for (int i=0; i<ni; i+=4)
--      for (int j=0; j<nj; j+=4)
--        if ( std::fabs( tri_depth(i,j)- z_img(i,j) ) > max_z_diff && dt_img(i,j) >= 3.5 )
--          anchor_points_.emplace_back(i,j);
--  }
--}
--
--//ensure the image is a byte image (between 0 and 255)
--void sdet_image_mesh::set_image(vil_image_resource_sptr const& resource)
--{
--  resc_ = resource;
--  if (resc_->pixel_format() != VIL_PIXEL_FORMAT_BYTE )
--  {
--    std::cout<<"Converting image from "<<resc_->pixel_format()<<" to vxl_byte image"<<std::endl;
--
--    //make the float image on the range of [0,1];
--    vil_image_view_base_sptr stretched = vil_convert_stretch_range( float(0.0f), resc_->get_view());
--
--    //makvil_image_view_base_sptr byte_img = vil_convert_cast<vxl_byte>(0, stretched*255.0f);
--    vil_image_view_base_sptr dest_sptr = new vil_image_view<float>(stretched->ni(), stretched->nj());
--    auto* dest = (vil_image_view<float>*) dest_sptr.ptr();
--    auto* stf  = (vil_image_view<float>*) stretched.ptr();
--    vil_convert_stretch_range<float>( *stf, *dest, 0.0f, 255.0f);
--
--    //now turn em into bytes
--    vil_image_view_base_sptr converted = vil_convert_cast<vxl_byte>(0, dest_sptr);
--
--    //create new resource sptr
--    resc_ = vil_new_image_resource_of_view(*converted.ptr());
--  }
--}
-diff --git a/contrib/brl/bseg/sdet/sdet_image_mesh.h b/contrib/brl/bseg/sdet/sdet_image_mesh.h
-deleted file mode 100644
-index 3f5a1129ef..0000000000
---- a/contrib/brl/bseg/sdet/sdet_image_mesh.h
-+++ /dev/null
-@@ -1,63 +0,0 @@
--// This is brl/bseg/sdet/sdet_image_mesh.h
--#ifndef sdet_image_mesh_h_
--#define sdet_image_mesh_h_
--//---------------------------------------------------------------------
--//:
--// \file
--// \brief a processor for triangulating a images based on detected line segments
--//
--//  This algorithm triangulates an image into a 3-d mesh based on
--//  detected line segments. The line segments are fit to edge detection
--//  contour chains.
--//
--// \author
--//  J.L. Mundy - March 21, 2011
--//
--// \verbatim
--//  Modifications
--//   <none>
--// \endverbatim
--//
--//-------------------------------------------------------------------------
--#include <iostream>
--#include <vector>
--#ifdef _MSC_VER
--#  include <vcl_msvc_warnings.h>
--#endif
--#include <vgl/vgl_line_segment_2d.h>
--#include <sdet/sdet_image_mesh_params.h>
--#include <imesh/imesh_mesh.h>
--#include <vil/vil_image_resource.h>
--#include <vil/vil_image_view.h>
--
--class sdet_image_mesh : public sdet_image_mesh_params
--{
-- public:
--  // === Constructors/destructor ===
--  sdet_image_mesh(sdet_image_mesh_params& imp);
--  ~sdet_image_mesh() override;
--
--  // === Process methods ===
--  void set_image(vil_image_resource_sptr const& resource);
--  bool compute_mesh();
--
--  // === Accessors ===
--  imesh_mesh& get_mesh() { return mesh_; }
--  bool mesh_valid() const { return mesh_valid_; }
--
-- protected:
--  // === protected methods ===
--  bool step_boundary(vgl_line_segment_2d<double> const& parent,
--                     vgl_line_segment_2d<double>& child0,
--                     vgl_line_segment_2d<double>& child1);
--  void set_anchor_points(imesh_mesh& mesh, vil_image_view<float> dt_img);
--  bool compute_line_segments(vil_image_resource_sptr const& resc,
--                             std::vector<vgl_line_segment_2d<double> >& segs);
--
--  // === members ===
--  bool mesh_valid_;      //: process state flag
--  vil_image_resource_sptr resc_;
--  imesh_mesh mesh_;
--};
--
--#endif // sdet_image_mesh_h_
-diff --git a/contrib/brl/bseg/sdet/tests/test_include.cxx b/contrib/brl/bseg/sdet/tests/test_include.cxx
-index 01ca358991..0e4bcaf1f9 100644
---- a/contrib/brl/bseg/sdet/tests/test_include.cxx
-+++ b/contrib/brl/bseg/sdet/tests/test_include.cxx
-@@ -22,7 +22,6 @@
- #include <sdet/sdet_grid_finder_params.h>
- #include <sdet/sdet_harris_detector.h>
- #include <sdet/sdet_harris_detector_params.h>
--#include <sdet/sdet_image_mesh.h>
- #include <sdet/sdet_image_mesh_params.h>
- #include <sdet/sdet_img_edge.h>
- #include <sdet/sdet_mrf_bp.h>
-diff --git a/contrib/gel/gtrl/CMakeLists.txt b/contrib/gel/gtrl/CMakeLists.txt
-index 13562bb93c..709e5b6b55 100644
---- a/contrib/gel/gtrl/CMakeLists.txt
-+++ b/contrib/gel/gtrl/CMakeLists.txt
-@@ -14,21 +14,8 @@ set(gtrl_sources
- 
- aux_source_directory(Templates gtrl_sources)
- 
--include( ${VXL_CMAKE_DIR}/FindNetlib.cmake )
--
--if(NETLIB_FOUND)
--  include_directories(${NETLIB_INCLUDE_DIR})
--
--  set(gtrl_sources ${gtrl_sources}
--    gtrl_triangulation.cxx gtrl_triangulation.h
--  )
--endif()
--
- vxl_add_library(LIBRARY_NAME gtrl LIBRARY_SOURCES ${gtrl_sources})
- target_link_libraries(gtrl ${VXL_LIB_PREFIX}vbl)
--if(NETLIB_FOUND)
--  target_link_libraries(gtrl ${NETLIB_LIBRARIES})
--endif()
- 
- if( BUILD_TESTING )
-   add_subdirectory(tests)
-diff --git a/contrib/gel/gtrl/examples/.NoDartCoverage b/contrib/gel/gtrl/examples/.NoDartCoverage
-deleted file mode 100644
-index e69de29bb2..0000000000
-diff --git a/contrib/gel/gtrl/examples/CMakeLists.txt b/contrib/gel/gtrl/examples/CMakeLists.txt
-deleted file mode 100644
-index ee97397685..0000000000
---- a/contrib/gel/gtrl/examples/CMakeLists.txt
-+++ /dev/null
-@@ -1,2 +0,0 @@
--add_executable( triangulate triangulate.cxx )
--target_link_libraries( triangulate gtrl )
-diff --git a/contrib/gel/gtrl/examples/triangulate.cxx b/contrib/gel/gtrl/examples/triangulate.cxx
-deleted file mode 100644
-index fa8a0577b3..0000000000
---- a/contrib/gel/gtrl/examples/triangulate.cxx
-+++ /dev/null
-@@ -1,45 +0,0 @@
--//:
--// \file
--// Simple example program to demonstrate the use of the gtrl_triangulation class
--// \author Peter Vanroose
--// \date   8 October 2002
--
--#include <iostream>
--#include <gtrl/gtrl_triangulation.h>
--#ifdef _MSC_VER
--#  include "vcl_msvc_warnings.h"
--#endif
--
--inline std::ostream& operator<<(std::ostream& os, gtrl_vertex const& v)
--{
--  return os << '(' << v.x() << ',' << v.y() << ')';
--}
--
--inline std::ostream& operator<<(std::ostream& os, gtrl_triangle const& t)
--{
--  return os << '[' << *(t.p1()) << ',' << *(t.p2()) << ',' << *(t.p3()) << ']';
--}
--
--int main()
--{
--  std::vector<gtrl_vertex_sptr> v(4);
--  v[0] = new gtrl_vertex( 1.0, 1.0);
--  v[1] = new gtrl_vertex(50.0, 1.0);
--  v[2] = new gtrl_vertex(50.0,50.0);
--  v[3] = new gtrl_vertex( 1.0,50.0);
--  gtrl_polygon poly(v);
--  gtrl_triangulation tri(poly); tri.run();
--
--  std::vector<gtrl_vertex_sptr> p = tri.get_points();
--  std::vector<gtrl_triangle_sptr> t = tri.get_triangles();
--
--  std::cout << p.size() << " triangle points:\n";
--  for (auto & i : p)
--    std::cout << ' ' << *i << '\n';
--
--  std::cout << t.size() << " triangles:\n";
--  for (auto & i : t)
--    std::cout << ' ' << *i << '\n';
--
--  return 0;
--}
-diff --git a/contrib/gel/gtrl/gtrl_triangulation.cxx b/contrib/gel/gtrl/gtrl_triangulation.cxx
-deleted file mode 100644
-index 52103988f8..0000000000
---- a/contrib/gel/gtrl/gtrl_triangulation.cxx
-+++ /dev/null
-@@ -1,110 +0,0 @@
--// This is gel/gtrl/gtrl_triangulation.cxx
--//:
--// \file
--// \author crossge@crd.ge.com
--
--#include <utility>
--#include "gtrl_triangulation.h"
--#ifdef _MSC_VER
--#  include "vcl_msvc_warnings.h"
--#endif
--
--// UNIX specific timer close
--#ifdef _WIN32
--#define NO_TIMER
--#endif
--
--// triangulation library
--extern "C" {
--#ifdef SINGLE
--#define REAL float
--#else /* not SINGLE */
--#define REAL double
--#endif /* not SINGLE */
--
--#include <triangle.h> // from netlib, for triangulate()
--}
--
--
--gtrl_triangulation::gtrl_triangulation( gtrl_polygon poly)
--  : poly_(std::move( poly))
--{
--}
--
--void gtrl_triangulation::run()
--{
--  REAL *points= new REAL[poly_.size()*2];
--  int *markers= new int[poly_.size()];
--
--  // for some reason, the markers don't seem to
--  //   like starting at 0
--  constexpr int offset = 100;
--
--  std::vector<gtrl_vertex_sptr> pointlist;
--
--  for (int i=0; i< poly_.size(); i++)
--    {
--      gtrl_vertex_sptr p= poly_[i];
--      pointlist.push_back( p);
--
--      points[i*2]  = p->x();
--      points[i*2+1]= p->y();
--      markers[i]= i+offset;
--    }
--
--  // input
--  triangulateio in;
--  in.numberofpoints= poly_.size();
--  in.pointlist= points;
--  in.pointmarkerlist= markers;
--  in.numberofpointattributes= 0;
--  in.numberofholes= 0;
--  in.trianglelist= nullptr;
--
--  // output
--  triangulateio out;
--  out.pointlist= nullptr;
--  out.trianglelist= nullptr;
--  out.pointmarkerlist= nullptr;
--  out.numberofpointattributes= 0;
--  out.numberofholes= 0;
--  out.numberoftriangleattributes= 0;
--
--  // do triangulation
--  triangulate( "-z -i -q", &in, &out, nullptr);
--
--  // create any new points that are necessary
--  for (int i=0; i< out.numberofpoints; i++)
--    {
--      if (out.pointmarkerlist[i]< offset)
--        {
--          pointlist.push_back( new gtrl_vertex( out.pointlist[i*2],
--                                                out.pointlist[i*2+1]));
--
--          out.pointmarkerlist[i]= pointlist.size()-1+ offset;
--        }
--    }
--
--  // clean up from previous triangulation
--  tris_.clear();
--
--  // create the triangles
--  for (int i=0; i< out.numberoftriangles; i++)
--    {
--      gtrl_triangle_sptr triangle= new gtrl_triangle( pointlist[ out.pointmarkerlist[ out.trianglelist[i*3]]- offset],
--                                                     pointlist[ out.pointmarkerlist[ out.trianglelist[i*3+1]]- offset],
--                                                     pointlist[ out.pointmarkerlist[ out.trianglelist[i*3+2]]- offset]);
--
--      if (poly_.inside( triangle->mid_point()))
--        tris_.push_back( triangle);
--    }
--
--  pts_= pointlist;
--
--  // clean memory
--  delete[] out.pointlist;
--  delete[] out.pointmarkerlist;
--  delete[] out.trianglelist;
--  delete[] points;
--  delete[] markers;
--}
-diff --git a/contrib/gel/gtrl/gtrl_triangulation.h b/contrib/gel/gtrl/gtrl_triangulation.h
-deleted file mode 100644
-index 5f63552278..0000000000
---- a/contrib/gel/gtrl/gtrl_triangulation.h
-+++ /dev/null
-@@ -1,31 +0,0 @@
--// This is gel/gtrl/gtrl_triangulation.h
--#ifndef gtrl_triangulation_h_
--#define gtrl_triangulation_h_
--//:
--// \file
--// \author crossge@crd.ge.com
--
--#include <gtrl/gtrl_polygon.h>
--#include <gtrl/gtrl_triangle.h>
--
--//: triangulates holeless polygons
--
--class gtrl_triangulation
--{
-- public:
--  // constructors / destructors
--  gtrl_triangulation( gtrl_polygon poly);
--
--  // implementation
--  void run();
--  std::vector<gtrl_triangle_sptr> get_triangles() const { return tris_; }
--  std::vector<gtrl_vertex_sptr> get_points() const { return pts_; }
--
-- protected:
--  gtrl_polygon poly_;
--
--  std::vector<gtrl_triangle_sptr> tris_;
--  std::vector<gtrl_vertex_sptr>   pts_;
--};
--
--#endif // gtrl_triangulation_h_
-diff --git a/contrib/gel/gtrl/tests/test_include.cxx b/contrib/gel/gtrl/tests/test_include.cxx
-index df3ed4bd29..f3e98fca4c 100644
---- a/contrib/gel/gtrl/tests/test_include.cxx
-+++ b/contrib/gel/gtrl/tests/test_include.cxx
-@@ -1,5 +1,4 @@
- #include <gtrl/gtrl_triangle.h>
--#include <gtrl/gtrl_triangulation.h>
- #include <gtrl/gtrl_vertex.h>
- #include <gtrl/gtrl_polygon.h>
- 
--- 
-2.46.1
-
diff --git a/0009-Bumped-up-version-to-1.14.patch b/0009-Bumped-up-version-to-1.14.patch
new file mode 100644
index 0000000..7a34e4a
--- /dev/null
+++ b/0009-Bumped-up-version-to-1.14.patch
@@ -0,0 +1,26 @@
+From 75b02abb0f8c4826c0bf435422b5d659057f664a Mon Sep 17 00:00:00 2001
+From: Mario Ceresa <mrceresa@gmail.com>
+Date: Wed, 10 Oct 2012 17:39:14 +0200
+Subject: [PATCH 09/23] Bumped up version to 1.14
+
+Signed-off-by: Mario Ceresa <mrceresa@gmail.com>
+---
+ CMakeLists.txt | 2 +-
+ 1 file changed, 1 insertion(+), 1 deletion(-)
+
+diff --git a/CMakeLists.txt b/CMakeLists.txt
+index 71f48bc..c532b01 100644
+--- a/CMakeLists.txt
++++ b/CMakeLists.txt
+@@ -13,7 +13,7 @@ ENDIF( COMMAND CMAKE_POLICY )
+ PROJECT(vxl)
+ 
+ SET(VXL_MAJOR_VERSION 1)
+-SET(VXL_MINOR_VERSION 13)
++SET(VXL_MINOR_VERSION 14)
+ SET(VXL_BUILD_VERSION 0)
+ SET(VXL_VERSION
+   "${VXL_MAJOR_VERSION}.${VXL_MINOR_VERSION}.${VXL_BUILD_VERSION}")
+-- 
+1.7.11.7
+
diff --git a/0009-v3.5.0-indent-to-keep-gcc-happy.patch b/0009-v3.5.0-indent-to-keep-gcc-happy.patch
deleted file mode 100644
index a743690..0000000
--- a/0009-v3.5.0-indent-to-keep-gcc-happy.patch
+++ /dev/null
@@ -1,26 +0,0 @@
-From 303abcb68bcc14b04d73460d25d8e4978e5b3617 Mon Sep 17 00:00:00 2001
-From: "Ankur Sinha (Ankur Sinha Gmail)" <sanjay.ankur@gmail.com>
-Date: Mon, 23 Oct 2023 13:27:34 +0100
-Subject: [PATCH 09/18] v3.5.0: indent to keep gcc happy
-
----
- core/vpgl/vpgl_tri_focal_tensor.h | 3 ++-
- 1 file changed, 2 insertions(+), 1 deletion(-)
-
-diff --git a/core/vpgl/vpgl_tri_focal_tensor.h b/core/vpgl/vpgl_tri_focal_tensor.h
-index 21a96688fb..e3f8929767 100644
---- a/core/vpgl/vpgl_tri_focal_tensor.h
-+++ b/core/vpgl/vpgl_tri_focal_tensor.h
-@@ -186,7 +186,8 @@ protected:
- 
- 
-   virtual bool get_epipoles(vgl_homg_point_2d<Type>& e12, vgl_homg_point_2d<Type>& e13)  {
--    if (!epipoles_valid_) compute_epipoles(); e12 = e12_; e13 = e13_; return epipoles_valid_;
-+    if (!epipoles_valid_) compute_epipoles();
-+    e12 = e12_; e13 = e13_; return epipoles_valid_;
-   }
- 
-   bool compute_epipoles();
--- 
-2.46.1
-
diff --git a/0010-Use-system-FindEXPAT.patch b/0010-Use-system-FindEXPAT.patch
new file mode 100644
index 0000000..d9e90af
--- /dev/null
+++ b/0010-Use-system-FindEXPAT.patch
@@ -0,0 +1,26 @@
+From 2eb77e1b65646b0f20682ce8345917b84aa73d11 Mon Sep 17 00:00:00 2001
+From: Mario Ceresa <mrceresa@gmail.com>
+Date: Wed, 10 Oct 2012 17:39:33 +0200
+Subject: [PATCH 10/23] Use system FindEXPAT
+
+Signed-off-by: Mario Ceresa <mrceresa@gmail.com>
+---
+ contrib/brl/bbas/bxml/CMakeLists.txt | 2 +-
+ 1 file changed, 1 insertion(+), 1 deletion(-)
+
+diff --git a/contrib/brl/bbas/bxml/CMakeLists.txt b/contrib/brl/bbas/bxml/CMakeLists.txt
+index 1e15c59..f513190 100644
+--- a/contrib/brl/bbas/bxml/CMakeLists.txt
++++ b/contrib/brl/bbas/bxml/CMakeLists.txt
+@@ -12,7 +12,7 @@ SET( bxml_sources
+     bxml_find.cxx                bxml_find.h
+ )
+ 
+-INCLUDE( ${BRL_MODULE_PATH}/FindEXPAT.cmake )
++FIND_PACKAGE(EXPAT REQUIRED)
+ 
+ IF(EXPAT_FOUND)
+  IF(EXPATPP_FOUND)
+-- 
+1.7.11.7
+
diff --git a/0010-v3.5.0-more-linker-fixes.patch b/0010-v3.5.0-more-linker-fixes.patch
deleted file mode 100644
index 53c9fcc..0000000
--- a/0010-v3.5.0-more-linker-fixes.patch
+++ /dev/null
@@ -1,31 +0,0 @@
-From c45defc6a27e344f7d3f69dde806d4b187e2aa27 Mon Sep 17 00:00:00 2001
-From: "Ankur Sinha (Ankur Sinha Gmail)" <sanjay.ankur@gmail.com>
-Date: Mon, 23 Oct 2023 15:55:38 +0100
-Subject: [PATCH 10/18] v3.5.0: more linker fixes
-
----
- contrib/brl/bbas/imesh/CMakeLists.txt | 4 ++--
- 1 file changed, 2 insertions(+), 2 deletions(-)
-
-diff --git a/contrib/brl/bbas/imesh/CMakeLists.txt b/contrib/brl/bbas/imesh/CMakeLists.txt
-index b122b33faf..a8a107e574 100644
---- a/contrib/brl/bbas/imesh/CMakeLists.txt
-+++ b/contrib/brl/bbas/imesh/CMakeLists.txt
-@@ -22,11 +22,11 @@ aux_source_directory(Templates imesh_sources)
- 
- vxl_add_library(LIBRARY_NAME imesh LIBRARY_SOURCES  ${imesh_sources})
- 
--target_link_libraries(imesh ${VXL_LIB_PREFIX}vgl ${VXL_LIB_PREFIX}vul ${VXL_LIB_PREFIX}vbl_io ${VXL_LIB_PREFIX}vbl)
-+target_link_libraries(imesh ${VXL_LIB_PREFIX}vgl ${VXL_LIB_PREFIX}vul brdb ${VXL_LIB_PREFIX}vbl_io ${VXL_LIB_PREFIX}vbl)
- 
- # Algorithms
- add_subdirectory(algo)
- 
- if( BUILD_TESTING )
-   add_subdirectory(tests)
--endif()
-+endif()
-\ No newline at end of file
--- 
-2.46.1
-
diff --git a/0011-Do-not-use-bundled-minizip.patch b/0011-Do-not-use-bundled-minizip.patch
new file mode 100644
index 0000000..2338597
--- /dev/null
+++ b/0011-Do-not-use-bundled-minizip.patch
@@ -0,0 +1,30 @@
+From 2721eacfd99e884904adbef9b1fe77530bcbbe4c Mon Sep 17 00:00:00 2001
+From: Mario Ceresa <mrceresa@gmail.com>
+Date: Wed, 10 Oct 2012 17:39:50 +0200
+Subject: [PATCH 11/23] Do not use bundled minizip
+
+Signed-off-by: Mario Ceresa <mrceresa@gmail.com>
+---
+ contrib/brl/b3p/CMakeLists.txt | 4 ++--
+ 1 file changed, 2 insertions(+), 2 deletions(-)
+
+diff --git a/contrib/brl/b3p/CMakeLists.txt b/contrib/brl/b3p/CMakeLists.txt
+index 7e61ffb..a0cc98e 100644
+--- a/contrib/brl/b3p/CMakeLists.txt
++++ b/contrib/brl/b3p/CMakeLists.txt
+@@ -16,10 +16,10 @@ MARK_AS_ADVANCED( VXL_FORCE_B3P_EXPAT )
+ SUBDIRS(expat)
+ SUBDIRS(expatpp)
+ 
+-OPTION( VXL_FORCE_B3P_SHAPELIB "Use B3P instead of any native SHAPELIB library?" YES)
++OPTION( VXL_FORCE_B3P_SHAPELIB "Use B3P instead of any native SHAPELIB library?" NO)
+ MARK_AS_ADVANCED( VXL_FORCE_B3P_SHAPELIB )
+ SUBDIRS(shapelib)
+ 
+-SUBDIRS(minizip)
++#SUBDIRS(minizip)
+ 
+ 
+-- 
+1.7.11.7
+
diff --git a/0011-v3.5.0-fix-for-gcc11.patch b/0011-v3.5.0-fix-for-gcc11.patch
deleted file mode 100644
index 7d62d4e..0000000
--- a/0011-v3.5.0-fix-for-gcc11.patch
+++ /dev/null
@@ -1,89 +0,0 @@
-From 690e4102939836f82afb83bba6120698403fcd43 Mon Sep 17 00:00:00 2001
-From: "Ankur Sinha (Ankur Sinha Gmail)" <sanjay.ankur@gmail.com>
-Date: Mon, 23 Oct 2023 17:05:04 +0100
-Subject: [PATCH 11/18] v3.5.0: fix for gcc11
-
----
- .../brl/bseg/boxm2/pro/processes/boxm2_dem_to_xyz_process.cxx    | 1 +
- contrib/brl/bseg/bsgm/bsgm_error_checking.h                      | 1 +
- contrib/brl/bseg/bsgm/bsgm_remove_spikes.h                       | 1 +
- contrib/mul/vil3d/algo/vil3d_locally_z_normalise.h               | 1 +
- core/testlib/testlib_test.h                                      | 1 +
- core/vnl/vnl_bignum.cxx                                          | 1 +
- 6 files changed, 6 insertions(+)
-
-diff --git a/contrib/brl/bseg/boxm2/pro/processes/boxm2_dem_to_xyz_process.cxx b/contrib/brl/bseg/boxm2/pro/processes/boxm2_dem_to_xyz_process.cxx
-index 67f6f1582c..185042f4df 100644
---- a/contrib/brl/bseg/boxm2/pro/processes/boxm2_dem_to_xyz_process.cxx
-+++ b/contrib/brl/bseg/boxm2/pro/processes/boxm2_dem_to_xyz_process.cxx
-@@ -2,6 +2,7 @@
- #include <fstream>
- #include <iostream>
- #include <algorithm>
-+#include <limits>
- #include <bprb/bprb_func_process.h>
- //:
- // \file
-diff --git a/contrib/brl/bseg/bsgm/bsgm_error_checking.h b/contrib/brl/bseg/bsgm/bsgm_error_checking.h
-index 3eb3731a48..69ddb9a659 100644
---- a/contrib/brl/bseg/bsgm/bsgm_error_checking.h
-+++ b/contrib/brl/bseg/bsgm/bsgm_error_checking.h
-@@ -11,6 +11,7 @@
- #include <vgl/vgl_box_2d.h>
- #include <vil/vil_image_view.h>
- #include <vector>
-+#include <limits>
- 
- //:
- // \file
-diff --git a/contrib/brl/bseg/bsgm/bsgm_remove_spikes.h b/contrib/brl/bseg/bsgm/bsgm_remove_spikes.h
-index fd1ca2a941..c20cfe8b80 100644
---- a/contrib/brl/bseg/bsgm/bsgm_remove_spikes.h
-+++ b/contrib/brl/bseg/bsgm/bsgm_remove_spikes.h
-@@ -2,6 +2,7 @@
- #include <iomanip>
- #include <cmath>
- #include <vector>
-+#include <limits>
- #include <vgl/vgl_point_3d.h>
- #include <vil/vil_image_view.h>
- 
-diff --git a/contrib/mul/vil3d/algo/vil3d_locally_z_normalise.h b/contrib/mul/vil3d/algo/vil3d_locally_z_normalise.h
-index 96654ddac0..762d4598bf 100644
---- a/contrib/mul/vil3d/algo/vil3d_locally_z_normalise.h
-+++ b/contrib/mul/vil3d/algo/vil3d_locally_z_normalise.h
-@@ -10,6 +10,7 @@
- #include <vil3d/vil3d_math.h>
- #include <vil3d/algo/vil3d_exp_filter.h>
- #include <cassert>
-+#include <limits>
- #ifdef _MSC_VER
- #  include <vcl_msvc_warnings.h>
- #endif
-diff --git a/core/testlib/testlib_test.h b/core/testlib/testlib_test.h
-index e070f2aacc..87d5c5ceb1 100644
---- a/core/testlib/testlib_test.h
-+++ b/core/testlib/testlib_test.h
-@@ -14,6 +14,7 @@
- 
- #include <string>
- #include <complex>
-+#include <limits>
- 
- //: initialise test counters, check test name 'name' exists
- void testlib_test_start(const char* name = nullptr);
-diff --git a/core/vnl/vnl_bignum.cxx b/core/vnl/vnl_bignum.cxx
-index 26760c2054..0556918395 100644
---- a/core/vnl/vnl_bignum.cxx
-+++ b/core/vnl/vnl_bignum.cxx
-@@ -6,6 +6,7 @@
- #include <algorithm>
- #include <vector>
- #include <iostream>
-+#include <limits>
- #include "vnl_bignum.h"
- //:
- // \file
--- 
-2.46.1
-
diff --git a/0012-Added-Coin3D-Submitted-by-Volker-Frohlich.patch b/0012-Added-Coin3D-Submitted-by-Volker-Frohlich.patch
new file mode 100644
index 0000000..ad1078d
--- /dev/null
+++ b/0012-Added-Coin3D-Submitted-by-Volker-Frohlich.patch
@@ -0,0 +1,32 @@
+From 9cbbbb7fcd8474be298169603f94401efa060806 Mon Sep 17 00:00:00 2001
+From: Mario Ceresa <mrceresa@gmail.com>
+Date: Wed, 10 Oct 2012 18:51:01 +0200
+Subject: [PATCH 12/23] Added Coin3D (Submitted by Volker Frohlich)
+
+Signed-off-by: Mario Ceresa <mrceresa@gmail.com>
+---
+ config/cmake/Modules/NewCMake/FindCoin3D.cmake | 4 +---
+ 1 file changed, 1 insertion(+), 3 deletions(-)
+
+diff --git a/config/cmake/Modules/NewCMake/FindCoin3D.cmake b/config/cmake/Modules/NewCMake/FindCoin3D.cmake
+index 800e578..39407a1 100644
+--- a/config/cmake/Modules/NewCMake/FindCoin3D.cmake
++++ b/config/cmake/Modules/NewCMake/FindCoin3D.cmake
+@@ -57,7 +57,7 @@ ELSE (WIN32)
+     SET(COIN3D_LIBRARY "-framework Coin3d" CACHE STRING "Coin3D library for OSX")
+    ELSE(APPLE)
+ 
+-  FIND_PATH(COIN3D_INCLUDE_DIR Inventor/So.h)
++    FIND_PATH(COIN3D_INCLUDE_DIR Coin2/Inventor/So.h)
+ 
+   FIND_LIBRARY(COIN3D_LIBRARY Coin)   
+   ENDIF(APPLE)
+@@ -70,5 +70,3 @@ INCLUDE(FindPackageHandleStandardArgs)
+ FIND_PACKAGE_HANDLE_STANDARD_ARGS(Coin3D DEFAULT_MSG COIN3D_LIBRARY COIN3D_INCLUDE_DIR)
+ 
+ MARK_AS_ADVANCED(COIN3D_INCLUDE_DIR COIN3D_LIBRARY )
+-
+-
+-- 
+1.7.11.7
+
diff --git a/0012-v3.5.0-link-against-acal.patch b/0012-v3.5.0-link-against-acal.patch
deleted file mode 100644
index 6a791c8..0000000
--- a/0012-v3.5.0-link-against-acal.patch
+++ /dev/null
@@ -1,45 +0,0 @@
-From 0cee9d18cd8a652145684ac0c74d905b810e5e0c Mon Sep 17 00:00:00 2001
-From: "Ankur Sinha (Ankur Sinha Gmail)" <sanjay.ankur@gmail.com>
-Date: Tue, 24 Oct 2023 12:16:41 +0100
-Subject: [PATCH 12/18] v3.5.0: link against acal
-
-To fix:
-```
-/usr/bin/ld: ../../../../../lib/libbsgm.so.3.5.0.0: undefined reference to `acal_f_utils::read_affine_cameras(std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::map<unsigned long, vpgl_affine_camera<double>, std::less<unsigned long>, std::allocator<std::pair<unsigned long const, vpgl_affine_camera<double> > > >&)'
-/usr/bin/ld: ../../../../../lib/libbsgm.so.3.5.0.0: undefined reference to `acal_f_utils::datetime_from_iname(std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, dtime&)'
-/usr/bin/ld: ../../../../../lib/libbsgm.so.3.5.0.0: undefined reference to `dtime::time_diff(dtime const&, dtime const&)'
-collect2: error: ld returned 1 exit status
-```
----
- contrib/brl/bseg/bsgm/CMakeLists.txt         | 2 +-
- contrib/brl/bseg/bsgm/bsgm_pair_selector.cxx | 1 +
- 2 files changed, 2 insertions(+), 1 deletion(-)
-
-diff --git a/contrib/brl/bseg/bsgm/CMakeLists.txt b/contrib/brl/bseg/bsgm/CMakeLists.txt
-index 44c4637af2..975ed5364c 100644
---- a/contrib/brl/bseg/bsgm/CMakeLists.txt
-+++ b/contrib/brl/bseg/bsgm/CMakeLists.txt
-@@ -16,7 +16,7 @@ aux_source_directory(Templates bsgm_sources)
- 
- vxl_add_library(LIBRARY_NAME bsgm LIBRARY_SOURCES ${bsgm_sources})
- 
--target_link_libraries( bsgm vidl_pro ${VXL_LIB_PREFIX}bpgl_algo ${VXL_LIB_PREFIX}brip ${VXL_LIB_PREFIX}bsta ${VXL_LIB_PREFIX}bjson ${VXL_LIB_PREFIX}vpgl ${VXL_LIB_PREFIX}vgl_io ${VXL_LIB_PREFIX}vgl_algo ${VXL_LIB_PREFIX}vil_algo ${VXL_LIB_PREFIX}vnl_algo ${VXL_LIB_PREFIX}vnl ${VXL_LIB_PREFIX}vgl ${VXL_LIB_PREFIX}vil ${VXL_LIB_PREFIX}vul ${VXL_LIB_PREFIX}vcl)
-+target_link_libraries( bsgm vidl_pro ${VXL_LIB_PREFIX}acal ${VXL_LIB_PREFIX}bpgl_algo ${VXL_LIB_PREFIX}brip ${VXL_LIB_PREFIX}bsta ${VXL_LIB_PREFIX}bjson ${VXL_LIB_PREFIX}vpgl ${VXL_LIB_PREFIX}vgl_io ${VXL_LIB_PREFIX}vgl_algo ${VXL_LIB_PREFIX}vil_algo ${VXL_LIB_PREFIX}vnl_algo ${VXL_LIB_PREFIX}vnl ${VXL_LIB_PREFIX}vgl ${VXL_LIB_PREFIX}vil ${VXL_LIB_PREFIX}vul ${VXL_LIB_PREFIX}vcl)
- 
- add_subdirectory( app )
- 
-diff --git a/contrib/brl/bseg/bsgm/bsgm_pair_selector.cxx b/contrib/brl/bseg/bsgm/bsgm_pair_selector.cxx
-index 6320d290ff..e97e318428 100644
---- a/contrib/brl/bseg/bsgm/bsgm_pair_selector.cxx
-+++ b/contrib/brl/bseg/bsgm/bsgm_pair_selector.cxx
-@@ -4,6 +4,7 @@
- #include <algorithm>
- #include <fstream>
- #include <bpgl/acal/acal_metadata.h>
-+#include <bpgl/acal/acal_f_utils.h>
- 
- std::string bsgm_pair_selector::remove_crop_postfix(std::string const& iname)
- {
--- 
-2.46.1
-
diff --git a/0013-Added-SIMVoleon-Submitted-by-Volker-Frohlich.patch b/0013-Added-SIMVoleon-Submitted-by-Volker-Frohlich.patch
new file mode 100644
index 0000000..9295391
--- /dev/null
+++ b/0013-Added-SIMVoleon-Submitted-by-Volker-Frohlich.patch
@@ -0,0 +1,31 @@
+From 03679cdfb3253e9cdae7513c0c0e7e44e5beb641 Mon Sep 17 00:00:00 2001
+From: Mario Ceresa <mrceresa@gmail.com>
+Date: Wed, 10 Oct 2012 18:51:36 +0200
+Subject: [PATCH 13/23] Added SIMVoleon (Submitted by Volker Frohlich)
+
+Signed-off-by: Mario Ceresa <mrceresa@gmail.com>
+---
+ config/cmake/Modules/NewCMake/FindSIMVoleon.cmake | 2 ++
+ 1 file changed, 2 insertions(+)
+
+diff --git a/config/cmake/Modules/NewCMake/FindSIMVoleon.cmake b/config/cmake/Modules/NewCMake/FindSIMVoleon.cmake
+index c4658eb..f4f81d4 100644
+--- a/config/cmake/Modules/NewCMake/FindSIMVoleon.cmake
++++ b/config/cmake/Modules/NewCMake/FindSIMVoleon.cmake
+@@ -54,11 +54,13 @@ IF(COIN3D_FOUND)
+ 
+       FIND_PATH(SIMVOLEON_INCLUDE_DIR VolumeViz/nodes/SoVolumeRender.h
+         /usr/include
++        /usr/include/Coin2
+         /usr/local/include
+       )
+ 
+       FIND_LIBRARY(SIMVOLEON_LIBRARY SimVoleon
+         /usr/lib
++        /usr/lib64
+         /usr/local/lib
+       )   
+ 
+-- 
+1.7.11.7
+
diff --git a/0013-v3.5.0-more-linkage-fixes.patch b/0013-v3.5.0-more-linkage-fixes.patch
deleted file mode 100644
index ad6cc56..0000000
--- a/0013-v3.5.0-more-linkage-fixes.patch
+++ /dev/null
@@ -1,25 +0,0 @@
-From 2757969a8b0e55c2310d50ef4764d3f81ce1d748 Mon Sep 17 00:00:00 2001
-From: "Ankur Sinha (Ankur Sinha Gmail)" <sanjay.ankur@gmail.com>
-Date: Tue, 24 Oct 2023 13:50:37 +0100
-Subject: [PATCH 13/18] v3.5.0: more linkage fixes
-
----
- contrib/brl/bpro/core/vil_pro/tests/CMakeLists.txt | 2 +-
- 1 file changed, 1 insertion(+), 1 deletion(-)
-
-diff --git a/contrib/brl/bpro/core/vil_pro/tests/CMakeLists.txt b/contrib/brl/bpro/core/vil_pro/tests/CMakeLists.txt
-index 66d543b5c9..0ffff761fd 100644
---- a/contrib/brl/bpro/core/vil_pro/tests/CMakeLists.txt
-+++ b/contrib/brl/bpro/core/vil_pro/tests/CMakeLists.txt
-@@ -8,7 +8,7 @@ if(EXPAT_FOUND)
-   test_vil_crop_image_process.cxx
-  )
- 
--target_link_libraries(vil_pro_test_all ${VXL_LIB_PREFIX}testlib vil_pro bprb sdet ${VXL_LIB_PREFIX}vil expat expatpp)
-+target_link_libraries(vil_pro_test_all ${VXL_LIB_PREFIX}testlib vil_pro bprb brdb sdet ${VXL_LIB_PREFIX}vil expat expatpp)
- 
- add_test( NAME bpro_vil_test_convert_to_n_planes_process COMMAND $<TARGET_FILE:vil_pro_test_all> test_vil_convert_to_n_planes_process )
- add_test( NAME bpro_vil_test_crop_image_process COMMAND $<TARGET_FILE:vil_pro_test_all> test_vil_crop_image_process )
--- 
-2.46.1
-
diff --git a/0014-Added-additional-search-path-for-xerces-Submitted-by.patch b/0014-Added-additional-search-path-for-xerces-Submitted-by.patch
new file mode 100644
index 0000000..f5af121
--- /dev/null
+++ b/0014-Added-additional-search-path-for-xerces-Submitted-by.patch
@@ -0,0 +1,40 @@
+From 93f8c6e6fbd727769b436aa0e92dae9ca7f16be1 Mon Sep 17 00:00:00 2001
+From: Mario Ceresa <mrceresa@gmail.com>
+Date: Wed, 10 Oct 2012 18:52:07 +0200
+Subject: [PATCH 14/23] Added additional search path for xerces (Submitted by
+ Volker Frohlich)
+
+Signed-off-by: Mario Ceresa <mrceresa@gmail.com>
+---
+ contrib/brl/bmods/find_xerces.cmake | 4 ++++
+ 1 file changed, 4 insertions(+)
+
+diff --git a/contrib/brl/bmods/find_xerces.cmake b/contrib/brl/bmods/find_xerces.cmake
+index e3a65f7..97290cb 100644
+--- a/contrib/brl/bmods/find_xerces.cmake
++++ b/contrib/brl/bmods/find_xerces.cmake
+@@ -8,6 +8,7 @@
+ FIND_PATH(XERCES_BXML_INCLUDE_PATH dom/DOM.hpp
+           ${vxl_SOURCE_DIR}/../xerces-c-src1_4_0/include
+           /usr/local/xerces-c-src1_4_0/include
++          /usr/include/xercesc
+           ${vxl_SOURCE_DIR}/v3p/xerces-c-src1_4_0/include
+ )
+ 
+@@ -29,10 +30,13 @@ ENDIF(XERCES_BXML_INCLUDE_PATH)
+ 
+ # this line used for transit phase
+ FIND_PATH(XERCES_NEW_BXML_INCLUDE_PATH xercesc/dom/Dom.hpp
++          /usr/include
+           ${vxl_SOURCE_DIR}/../xerces-c2_2_0/include
+ )
+ 
+ FIND_LIBRARY(XERCES_NEW_BXML_LIBRARY_PATH xerces-c_2
++          /usr/lib
++          /usr/lib64
+           ${vxl_SOURCE_DIR}/../xerces-c2_2_0/lib
+           ${vxl_BINARY_DIR}/v3p/lib
+ )
+-- 
+1.7.11.7
+
diff --git a/0014-v3.5.0-use-system-zlib-tiff-minizip-compat.patch b/0014-v3.5.0-use-system-zlib-tiff-minizip-compat.patch
deleted file mode 100644
index ee8fbbc..0000000
--- a/0014-v3.5.0-use-system-zlib-tiff-minizip-compat.patch
+++ /dev/null
@@ -1,52 +0,0 @@
-From ea6a4cc7095db5e98728849f6db505952704ca37 Mon Sep 17 00:00:00 2001
-From: "Ankur Sinha (Ankur Sinha Gmail)" <sanjay.ankur@gmail.com>
-Date: Mon, 22 Jan 2024 11:40:35 +0000
-Subject: [PATCH 14/18] v3.5.0: use system zlib, tiff, minizip-compat
-
----
- contrib/brl/bseg/bmdl/CMakeLists.txt     | 7 +++++++
- contrib/brl/bseg/bmdl/pro/CMakeLists.txt | 4 ++--
- 2 files changed, 9 insertions(+), 2 deletions(-)
-
-diff --git a/contrib/brl/bseg/bmdl/CMakeLists.txt b/contrib/brl/bseg/bmdl/CMakeLists.txt
-index 4890d2ab29..8db0d2ca1c 100644
---- a/contrib/brl/bseg/bmdl/CMakeLists.txt
-+++ b/contrib/brl/bseg/bmdl/CMakeLists.txt
-@@ -1,5 +1,12 @@
- # This is brl/seg/bmdl/CMakeLists.txt
- 
-+FIND_PACKAGE( ZLIB QUIET )
-+if(ZLIB_FOUND)
-+  include_directories( ${ZLIB_INCLUDE_DIR} )
-+  include_directories( ${BRL_INCLUDE_DIR}/b3p )
-+  add_definitions(-DHAS_ZLIB=1)
-+endif()
-+
- if(HAS_GEOTIFF)
-   include_directories( ${GEOTIFF_INCLUDE_DIR} )
- 
-diff --git a/contrib/brl/bseg/bmdl/pro/CMakeLists.txt b/contrib/brl/bseg/bmdl/pro/CMakeLists.txt
-index 7c73fe1bb0..cc30626c09 100644
---- a/contrib/brl/bseg/bmdl/pro/CMakeLists.txt
-+++ b/contrib/brl/bseg/bmdl/pro/CMakeLists.txt
-@@ -1,7 +1,7 @@
- # This is contrib/brl/bseg/bmdl/pro/CMakeLists.txt
- # bmdl's Process Library
- 
--include( ${VXL_CMAKE_DIR}/FindZLIB.cmake )
-+FIND_PACKAGE( ZLIB QUIET )
- if(ZLIB_FOUND)
-   include_directories( ${ZLIB_INCLUDE_DIR} )
-   include_directories( ${BRL_INCLUDE_DIR}/b3p )
-@@ -12,7 +12,7 @@ endif()
- FIND_PACKAGE(EXPAT REQUIRED)
- FIND_PACKAGE(EXPATPP REQUIRED)
- if(EXPAT_FOUND)
--  include(${VXL_CMAKE_DIR}/FindTIFF.cmake)
-+  FIND_PACKAGE(TIFF)
-   if(TIFF_FOUND)
-     include( ${VXL_CMAKE_DIR}/FindGEOTIFF.cmake)
-     if(GEOTIFF_FOUND)
--- 
-2.46.1
-
diff --git a/0015-Manage-KL-library-Submitted-by-Volker-Frohlich.patch b/0015-Manage-KL-library-Submitted-by-Volker-Frohlich.patch
new file mode 100644
index 0000000..9b5c090
--- /dev/null
+++ b/0015-Manage-KL-library-Submitted-by-Volker-Frohlich.patch
@@ -0,0 +1,85 @@
+From f5f4f002e47ce541d8020cd2ae3203bf1b08b9f7 Mon Sep 17 00:00:00 2001
+From: Mario Ceresa <mrceresa@gmail.com>
+Date: Wed, 10 Oct 2012 18:54:20 +0200
+Subject: [PATCH 15/23] Manage KL library (Submitted by Volker Frohlich)
+
+Signed-off-by: Mario Ceresa <mrceresa@gmail.com>
+---
+ contrib/gel/CMakeLists.txt         |  2 ++
+ contrib/gel/vgel/kl/CMakeLists.txt | 46 ++++++++++++++++++++++----------------
+ 2 files changed, 29 insertions(+), 19 deletions(-)
+
+diff --git a/contrib/gel/CMakeLists.txt b/contrib/gel/CMakeLists.txt
+index d9284db..d605337 100644
+--- a/contrib/gel/CMakeLists.txt
++++ b/contrib/gel/CMakeLists.txt
+@@ -4,6 +4,8 @@ PROJECT( gel )
+ 
+ doxygen_add_package(contrib/gel "GE Libraries")
+ 
++SET( GEL_MODULE_PATH ${vxl_SOURCE_DIR}/contrib/gel/gelmods )
++
+ SET( GEL_INCLUDE_DIR ${gel_SOURCE_DIR} CACHE STATIC "GE package include files" )
+ SET( GEL_INSTALL_INCLUDE_DIR 
+   ${CMAKE_INSTALL_PREFIX}/include/vxl/contrib/gel
+diff --git a/contrib/gel/vgel/kl/CMakeLists.txt b/contrib/gel/vgel/kl/CMakeLists.txt
+index bbb86ed..986fe44 100644
+--- a/contrib/gel/vgel/kl/CMakeLists.txt
++++ b/contrib/gel/vgel/kl/CMakeLists.txt
+@@ -1,26 +1,34 @@
+ # gel/vgel/kl/CMakeLists.txt
+ 
+-SET(vgel_kl_sources
+-                      base.h
+- convolve.c           convolve.h
+- klt.c                klt.h
+- pnmio.c              pnmio.h
+- selectGoodFeatures.c
+- trackFeatures.c
+- error.c              error.h
+- klt_util.c           klt_util.h
+- pyramid.c            pyramid.h
+- storeFeatures.c
+- writeFeatures.c
+-)
++INCLUDE(${MODULE_PATH}/FindKL.cmake)
+ 
+-ADD_LIBRARY(vgel_kl ${vgel_kl_sources})
+-INSTALL_TARGETS(/lib vgel_kl)
+-INSTALL_NOBASE_HEADER_FILES(/include/vxl/contrib/gel/vgel/kl ${vgel_kl_sources})
++IF(NOT VXL_USING_NATIVE_KL)
++    INCLUDE(${GEL_MODULE_PATH}/FindKL.cmake)
+ 
+-IF(UNIX)
+-  TARGET_LINK_LIBRARIES(vgel_kl m)
+-ENDIF(UNIX)
++    INCLUDE_DIRECTORIES(${KL_INCLUDE_DIR})
++
++    SET( vgel_kl_sources
++                          base.h
++     convolve.c           convolve.h
++     klt.c                klt.h
++     pnmio.c              pnmio.h
++     selectGoodFeatures.c
++     trackFeatures.c
++     error.c              error.h
++     klt_util.c           klt_util.h
++     pyramid.c            pyramid.h
++     storeFeatures.c
++     writeFeatures.c
++    )
++
++    ADD_LIBRARY(vgel_kl ${vgel_kl_sources})
++    INSTALL_TARGETS(/lib vgel_kl)
++    INSTALL_NOBASE_HEADER_FILES(/include/vxl/contrib/gel/vgel/kl ${vgel_kl_sources})
++
++    IF(UNIX)
++      TARGET_LINK_LIBRARIES(vgel_kl m)
++    ENDIF(UNIX)
++ENDIF(NOT VXL_USING_NATIVE_KL)
+ 
+ IF( BUILD_TESTING )
+   SUBDIRS(tests)
+-- 
+1.7.11.7
+
diff --git a/0015-v3.5.0-fix-linking.patch b/0015-v3.5.0-fix-linking.patch
deleted file mode 100644
index 91cdb04..0000000
--- a/0015-v3.5.0-fix-linking.patch
+++ /dev/null
@@ -1,25 +0,0 @@
-From 4f74f5343ff3595872d045c4bf5025e347d18438 Mon Sep 17 00:00:00 2001
-From: "Ankur Sinha (Ankur Sinha Gmail)" <sanjay.ankur@gmail.com>
-Date: Tue, 23 Jan 2024 16:54:51 +0000
-Subject: [PATCH 15/18] v3.5.0: fix linking
-
----
- contrib/brl/bpro/core/brip_pro/CMakeLists.txt | 2 +-
- 1 file changed, 1 insertion(+), 1 deletion(-)
-
-diff --git a/contrib/brl/bpro/core/brip_pro/CMakeLists.txt b/contrib/brl/bpro/core/brip_pro/CMakeLists.txt
-index cfa7d46af8..b8d557cdb9 100644
---- a/contrib/brl/bpro/core/brip_pro/CMakeLists.txt
-+++ b/contrib/brl/bpro/core/brip_pro/CMakeLists.txt
-@@ -14,7 +14,7 @@ aux_source_directory(Templates brip_pro_sources)
- aux_source_directory(processes brip_pro_sources)
- 
- vxl_add_library(LIBRARY_NAME brip_pro LIBRARY_SOURCES ${brip_pro_sources})
--target_link_libraries(brip_pro bprb brdb brip vil_pro ${VXL_LIB_PREFIX}vil ${VXL_LIB_PREFIX}vsl bil_algo)
-+target_link_libraries(brip_pro bprb brdb brip vpgl_pro vil_pro ${VXL_LIB_PREFIX}vil ${VXL_LIB_PREFIX}vsl bil_algo)
- 
- if( BUILD_TESTING )
-   add_subdirectory(tests)
--- 
-2.46.1
-
diff --git a/0016-Manage-KL-library-2-2-Submitted-by-Volker-Frohlich.patch b/0016-Manage-KL-library-2-2-Submitted-by-Volker-Frohlich.patch
new file mode 100644
index 0000000..783b02d
--- /dev/null
+++ b/0016-Manage-KL-library-2-2-Submitted-by-Volker-Frohlich.patch
@@ -0,0 +1,107 @@
+From b2b3a2da18579c9f6cc6849eded94fd57aadadc2 Mon Sep 17 00:00:00 2001
+From: Mario Ceresa <mrceresa@gmail.com>
+Date: Wed, 10 Oct 2012 18:55:13 +0200
+Subject: [PATCH 16/23] Manage KL library 2/2 (Submitted by Volker Frohlich)
+
+Signed-off-by: Mario Ceresa <mrceresa@gmail.com>
+---
+ contrib/gel/gelmods/FindKL.cmake  | 30 ++++++++++++++++++++++++
+ contrib/gel/gelmods/FindKL2.cmake | 49 +++++++++++++++++++++++++++++++++++++++
+ 2 files changed, 79 insertions(+)
+ create mode 100644 contrib/gel/gelmods/FindKL.cmake
+ create mode 100644 contrib/gel/gelmods/FindKL2.cmake
+
+diff --git a/contrib/gel/gelmods/FindKL.cmake b/contrib/gel/gelmods/FindKL.cmake
+new file mode 100644
+index 0000000..e79e485
+--- /dev/null
++++ b/contrib/gel/gelmods/FindKL.cmake
+@@ -0,0 +1,30 @@
++# - Find KL library
++# Find the native KL includes and library
++# This module defines
++#  KL_INCLUDE_DIR, where to find klt.h, etc.
++#  KL_LIBRARIES, libraries to link against to use KL.
++#  KL_FOUND, If false, do not try to use KL.
++# also defined, but not for general use are
++#  KL_LIBRARY, where to find the KL library.
++
++FIND_PATH( KL_INCLUDE_DIR klt.h
++  /usr/include
++  /usr/include/klt
++  /usr/local/include
++)
++
++SET( KL_NAMES ${KL_NAMES} klt )
++FIND_LIBRARY( KL_LIBRARY
++  NAMES ${KL_NAMES}
++  PATHS /usr/lib
++    /usr/lib64
++    /usr/local/lib
++)
++
++SET( KL_FOUND "NO" )
++IF( KL_INCLUDE_DIR )
++    IF( KL_LIBRARY )
++        SET( KL_FOUND "YES" )
++        SET( KL_LIBRARIES ${KL_LIBRARY} )
++    ENDIF( KL_LIBRARY )
++ENDIF( KL_INCLUDE_DIR )
+diff --git a/contrib/gel/gelmods/FindKL2.cmake b/contrib/gel/gelmods/FindKL2.cmake
+new file mode 100644
+index 0000000..daffa59
+--- /dev/null
++++ b/contrib/gel/gelmods/FindKL2.cmake
+@@ -0,0 +1,49 @@
++#
++# Find a KL library
++#
++# This file is used to manage using either a natively provided KL library or the one in v3p if provided.
++#
++#
++# As per the standard scheme the following definitions are used
++# KL_INCLUDE_DIR - where to find geotiff.h
++# KL_LIBRARIES   - the set of libraries to include to use KL.
++# KL_FOUND       - TRUE, if available somewhere on the system.
++
++# Additionally
++# VXL_USING_NATIVE_KL  - True if we are using a KL library provided outside vxl (or v3p)
++
++
++# If this FORCE variable is unset or is FALSE, try to find a native library.
++IF( VXL_FORCE_V3P_KL )
++ELSE( VXL_FORCE_V3P_KL )
++  INCLUDE( ${MODULE_PATH}/NewCMake/FindKL.cmake )
++ENDIF( VXL_FORCE_V3P_KL )
++
++  
++IF(KL_FOUND)
++
++  SET(VXL_USING_NATIVE_KL "YES")
++
++ELSE(KL_FOUND)
++
++  #
++  # At some point, in a "release" version, it is possible that someone
++  # will not have the v3p geotiff library, so make sure the headers
++  # exist.
++  #
++  
++  IF(EXISTS ${vxl_SOURCE_DIR}/contrib/gel/vgel/kl/klt.h)
++    # Use FIND_PATH here to allow the user to set the path to IGNORE
++    # to disable geotiff support.
++    FIND_PATH(KL_INCLUDE_DIR klt.h
++      ${vxl_SOURCE_DIR}/v3p/geotiff
++    )
++    IF( KL_INCLUDE_DIR )
++      SET( KL_FOUND "YES" )
++      SET( KL_INSTALL_INCLUDE_DIR ${CMAKE_INSTALL_DIR}/include/vxl/v3p/geotiff)
++      SET( KL_LIBRARIES geotiff )
++    ENDIF( KL_INCLUDE_DIR )
++  
++  ENDIF(EXISTS ${vxl_SOURCE_DIR}/v3p/geotiff/geotiff.h)
++  
++ENDIF(KL_FOUND)
+-- 
+1.7.11.7
+
diff --git a/0016-v3.5.0-fix-linking.patch b/0016-v3.5.0-fix-linking.patch
deleted file mode 100644
index 02410cf..0000000
--- a/0016-v3.5.0-fix-linking.patch
+++ /dev/null
@@ -1,26 +0,0 @@
-From 4de179f888a8c0ce9bbec7a63c4e86015598a809 Mon Sep 17 00:00:00 2001
-From: "Ankur Sinha (Ankur Sinha Gmail)" <sanjay.ankur@gmail.com>
-Date: Tue, 1 Oct 2024 16:00:35 +0100
-Subject: [PATCH 16/18] v3.5.0: fix linking
-
----
- contrib/brl/bpro/core/vil_pro/CMakeLists.txt | 3 ++-
- 1 file changed, 2 insertions(+), 1 deletion(-)
-
-diff --git a/contrib/brl/bpro/core/vil_pro/CMakeLists.txt b/contrib/brl/bpro/core/vil_pro/CMakeLists.txt
-index 5298c63727..ba36c765bb 100644
---- a/contrib/brl/bpro/core/vil_pro/CMakeLists.txt
-+++ b/contrib/brl/bpro/core/vil_pro/CMakeLists.txt
-@@ -17,7 +17,8 @@ aux_source_directory(processes vil_pro_sources)
- 
- vxl_add_library(LIBRARY_NAME vil_pro LIBRARY_SOURCES ${vil_pro_sources})
- 
--target_link_libraries(vil_pro bbas_pro bprb bil bil_algo brip sdet ${VXL_LIB_PREFIX}vil_algo ${VXL_LIB_PREFIX}vil_io ${VXL_LIB_PREFIX}vil ${VXL_LIB_PREFIX}vnl ${VXL_LIB_PREFIX}vul ${VXL_LIB_PREFIX}vsl bsta_vis)
-+target_link_libraries(vil_pro bbas_pro bprb bil bil_algo brip sdet ${VXL_LIB_PREFIX}vil_algo ${VXL_LIB_PREFIX}vil_io ${VXL_LIB_PREFIX}vil ${VXL_LIB_PREFIX}vnl ${VXL_LIB_PREFIX}vul ${VXL_LIB_PREFIX}vsl bsta_vis vpgl_pro)
-+# Need vpgl_pro only for the instantiation of brdb_value_t<vbl_smart_ptr<vpgl_camera<double> > >
- 
- if( BUILD_TESTING )
-   add_subdirectory(tests)
--- 
-2.46.1
-
diff --git a/0017-Add-sonames-to-vpgl-lib.patch b/0017-Add-sonames-to-vpgl-lib.patch
new file mode 100644
index 0000000..bd73a4f
--- /dev/null
+++ b/0017-Add-sonames-to-vpgl-lib.patch
@@ -0,0 +1,77 @@
+From b23d58cbe99dd3bda8468a83e59ca0c18a38150d Mon Sep 17 00:00:00 2001
+From: Mario Ceresa <mrceresa@gmail.com>
+Date: Sun, 14 Oct 2012 17:11:31 +0200
+Subject: [PATCH 17/23] Add sonames to vpgl lib
+
+---
+ core/vpgl/CMakeLists.txt              | 1 +
+ core/vpgl/algo/CMakeLists.txt         | 1 +
+ core/vpgl/file_formats/CMakeLists.txt | 2 +-
+ core/vpgl/io/CMakeLists.txt           | 1 +
+ core/vpgl/xio/CMakeLists.txt          | 1 +
+ 5 files changed, 5 insertions(+), 1 deletion(-)
+
+diff --git a/core/vpgl/CMakeLists.txt b/core/vpgl/CMakeLists.txt
+index 235853f..120eebb 100755
+--- a/core/vpgl/CMakeLists.txt
++++ b/core/vpgl/CMakeLists.txt
+@@ -32,6 +32,7 @@ SET( vpgl_sources
+ AUX_SOURCE_DIRECTORY(Templates vpgl_sources)
+ 
+ ADD_LIBRARY(vpgl ${vpgl_sources})
++SET_TARGET_PROPERTIES(vpgl PROPERTIES ${VXL_LIBRARY_PROPERTIES})
+ TARGET_LINK_LIBRARIES(vpgl vnl_algo vnl vgl_algo vgl vul vsl vbl)
+ 
+ IF( BUILD_TESTING )
+diff --git a/core/vpgl/algo/CMakeLists.txt b/core/vpgl/algo/CMakeLists.txt
+index 753efb8..7dfdb9e 100755
+--- a/core/vpgl/algo/CMakeLists.txt
++++ b/core/vpgl/algo/CMakeLists.txt
+@@ -29,6 +29,7 @@ SET( vpgl_algo_sources
+ AUX_SOURCE_DIRECTORY(Templates vpgl_algo_sources)
+ 
+ ADD_LIBRARY(vpgl_algo ${vpgl_algo_sources})
++SET_TARGET_PROPERTIES(vpgl_algo PROPERTIES ${VXL_LIBRARY_PROPERTIES})
+ 
+ TARGET_LINK_LIBRARIES(vpgl_algo vpgl vpgl_file_formats vgl_algo vnl_algo vnl vgl vil vul vbl)
+ 
+diff --git a/core/vpgl/file_formats/CMakeLists.txt b/core/vpgl/file_formats/CMakeLists.txt
+index d5c38f9..e864476 100755
+--- a/core/vpgl/file_formats/CMakeLists.txt
++++ b/core/vpgl/file_formats/CMakeLists.txt
+@@ -21,7 +21,7 @@ IF(TIFF_FOUND)
+ ENDIF(TIFF_FOUND)
+ 
+ ADD_LIBRARY(vpgl_file_formats ${vpgl_file_formats_sources})
+-
++SET_TARGET_PROPERTIES(vpgl_file_formats PROPERTIES ${VXL_LIBRARY_PROPERTIES})
+ TARGET_LINK_LIBRARIES(vpgl_file_formats vpgl vil vnl)
+ 
+ IF( BUILD_TESTING )
+diff --git a/core/vpgl/io/CMakeLists.txt b/core/vpgl/io/CMakeLists.txt
+index 6809320..80ff3a1 100755
+--- a/core/vpgl/io/CMakeLists.txt
++++ b/core/vpgl/io/CMakeLists.txt
+@@ -13,6 +13,7 @@ SET(vpgl_io_sources
+ AUX_SOURCE_DIRECTORY(Templates vpgl_io_sources)
+ 
+ ADD_LIBRARY(vpgl_io ${vpgl_io_sources})
++SET_TARGET_PROPERTIES(vpgl_io PROPERTIES ${VXL_LIBRARY_PROPERTIES})
+ 
+ TARGET_LINK_LIBRARIES(vpgl_io vsl vpgl vnl vgl vgl_algo vgl_io vnl_io vbl_io)
+ 
+diff --git a/core/vpgl/xio/CMakeLists.txt b/core/vpgl/xio/CMakeLists.txt
+index 986ac31..a883456 100644
+--- a/core/vpgl/xio/CMakeLists.txt
++++ b/core/vpgl/xio/CMakeLists.txt
+@@ -5,6 +5,7 @@ SET(vpgl_xio_sources
+ )
+ 
+ ADD_LIBRARY(vpgl_xio ${vpgl_xio_sources} )
++SET_TARGET_PROPERTIES(vpgl_xio PROPERTIES ${VXL_LIBRARY_PROPERTIES})
+ TARGET_LINK_LIBRARIES( vpgl_xio vpgl vsl )
+ 
+ INSTALL_TARGETS(/lib vpgl_xio)
+-- 
+1.7.11.7
+
diff --git a/0017-v3.5.0-remove-boxm2-processes-that-use-sdnet-that-re.patch b/0017-v3.5.0-remove-boxm2-processes-that-use-sdnet-that-re.patch
deleted file mode 100644
index 1c58efb..0000000
--- a/0017-v3.5.0-remove-boxm2-processes-that-use-sdnet-that-re.patch
+++ /dev/null
@@ -1,894 +0,0 @@
-From a002d34fee7a0c86de360de5792dbffbbb5255d9 Mon Sep 17 00:00:00 2001
-From: "Ankur Sinha (Ankur Sinha Gmail)" <sanjay.ankur@gmail.com>
-Date: Tue, 1 Oct 2024 16:26:23 +0100
-Subject: [PATCH 17/18] v3.5.0: remove boxm2 processes that use sdnet that
- require triangle
-
----
- contrib/brl/bseg/boxm2/pro/boxm2_processes.h  |   3 -
- contrib/brl/bseg/boxm2/pro/boxm2_register.cxx |   3 -
- .../processes/boxm2_export_mesh_process.cxx   | 213 -------
- .../boxm2_export_textured_mesh_process.cxx    | 523 ------------------
- .../pro/processes/boxm2_load_mesh_process.cxx |  78 ---
- 5 files changed, 820 deletions(-)
- delete mode 100644 contrib/brl/bseg/boxm2/pro/processes/boxm2_export_mesh_process.cxx
- delete mode 100644 contrib/brl/bseg/boxm2/pro/processes/boxm2_export_textured_mesh_process.cxx
- delete mode 100644 contrib/brl/bseg/boxm2/pro/processes/boxm2_load_mesh_process.cxx
-
-diff --git a/contrib/brl/bseg/boxm2/pro/boxm2_processes.h b/contrib/brl/bseg/boxm2/pro/boxm2_processes.h
-index 4d68be95b0..7094c03fb5 100644
---- a/contrib/brl/bseg/boxm2/pro/boxm2_processes.h
-+++ b/contrib/brl/bseg/boxm2/pro/boxm2_processes.h
-@@ -13,8 +13,6 @@ DECLARE_FUNC_CONS(boxm2_create_cache_process);
- DECLARE_FUNC_CONS(boxm2_create_scene_process);
- DECLARE_FUNC_CONS(boxm2_write_scene_xml_process);
- DECLARE_FUNC_CONS(boxm2_add_block_process);
--DECLARE_FUNC_CONS(boxm2_export_textured_mesh_process);
--DECLARE_FUNC_CONS(boxm2_export_mesh_process);
- DECLARE_FUNC_CONS(boxm2_describe_scene_process);
- DECLARE_FUNC_CONS(boxm2_create_stream_cache_process);
- DECLARE_FUNC_CONS(boxm2_roi_init_process);
-@@ -57,7 +55,6 @@ DECLARE_FUNC_CONS(boxm2_label_to_xyz_process);
- DECLARE_FUNC_CONS(boxm2_label_to_xyz_process2);
- DECLARE_FUNC_CONS(boxm2_prune_scene_blocks_process);
- DECLARE_FUNC_CONS(boxm2_prune_scene_blocks_by_dem_process);
--DECLARE_FUNC_CONS(boxm2_load_mesh_process);
- DECLARE_FUNC_CONS(boxm2_create_camera_from_kml_path_process);  // August 23, 2013 Yi Dong
- 
- DECLARE_FUNC_CONS(boxm2_ortho_geo_cam_from_scene_process);
-diff --git a/contrib/brl/bseg/boxm2/pro/boxm2_register.cxx b/contrib/brl/bseg/boxm2/pro/boxm2_register.cxx
-index a05b9e5c58..e1cefa5765 100644
---- a/contrib/brl/bseg/boxm2/pro/boxm2_register.cxx
-+++ b/contrib/brl/bseg/boxm2/pro/boxm2_register.cxx
-@@ -33,8 +33,6 @@ void boxm2_register::register_process()
-   REG_PROCESS_FUNC_CONS(bprb_func_process, bprb_batch_process_manager, boxm2_create_scene_process,    "boxm2CreateSceneProcess");
-   REG_PROCESS_FUNC_CONS(bprb_func_process, bprb_batch_process_manager, boxm2_write_scene_xml_process, "boxm2WriteSceneXMLProcess");
-   REG_PROCESS_FUNC_CONS(bprb_func_process, bprb_batch_process_manager, boxm2_add_block_process,       "boxm2AddBlockProcess");
--  REG_PROCESS_FUNC_CONS(bprb_func_process, bprb_batch_process_manager, boxm2_export_textured_mesh_process,"boxm2ExportTexturedMeshProcess");
--  REG_PROCESS_FUNC_CONS(bprb_func_process, bprb_batch_process_manager, boxm2_export_mesh_process,"boxm2ExportMeshProcess");
-   REG_PROCESS_FUNC_CONS(bprb_func_process, bprb_batch_process_manager, boxm2_describe_scene_process,"boxm2DescribeSceneProcess");
-   REG_PROCESS_FUNC_CONS(bprb_func_process, bprb_batch_process_manager, boxm2_create_stream_cache_process, "boxm2CreateStreamCacheProcess");
-   REG_PROCESS_FUNC_CONS(bprb_func_process, bprb_batch_process_manager, boxm2_roi_init_process, "boxm2RoiInitProcess");
-@@ -58,7 +56,6 @@ void boxm2_register::register_process()
-   REG_PROCESS_FUNC_CONS(bprb_func_process, bprb_batch_process_manager, boxm2_scene_from_box_cams_process, "boxm2SceneFromBoxCamsProcess");
-   REG_PROCESS_FUNC_CONS(bprb_func_process, bprb_batch_process_manager, boxm2_scene_from_nvm_txt_process, "boxm2SceneFromNVMtxtProcess");
- 
--  REG_PROCESS_FUNC_CONS(bprb_func_process, bprb_batch_process_manager, boxm2_load_mesh_process, "boxm2LoadMeshProcess");
-   REG_PROCESS_FUNC_CONS(bprb_func_process, bprb_batch_process_manager, boxm2_compactify_mog6_view_process, "boxm2CompactifyMog6ViewProcess");
-   REG_PROCESS_FUNC_CONS(bprb_func_process, bprb_batch_process_manager, boxm2_scene_statistics_process, "boxm2SceneStatisticsProcess");
- 
-diff --git a/contrib/brl/bseg/boxm2/pro/processes/boxm2_export_mesh_process.cxx b/contrib/brl/bseg/boxm2/pro/processes/boxm2_export_mesh_process.cxx
-deleted file mode 100644
-index bdc59a32e7..0000000000
---- a/contrib/brl/bseg/boxm2/pro/processes/boxm2_export_mesh_process.cxx
-+++ /dev/null
-@@ -1,213 +0,0 @@
--// This is brl/bseg/boxm2/pro/processes/boxm2_export_mesh_process.cxx
--#include <iostream>
--#include <fstream>
--#include <bprb/bprb_func_process.h>
--//:
--// \file
--// \brief  A process for exporting a texture mapped mesh of a scene
--//
--// \author Vishal Jain
--// \date Mar 15, 2011
--
--#ifdef _MSC_VER
--#  include "vcl_msvc_warnings.h"
--#endif
--#include "vul/vul_file.h"
--#include <boxm2/boxm2_scene.h>
--#include <boxm2/boxm2_util.h>
--
--//vil includes
--#include "vil/vil_image_view.h"
--#include "vil/vil_new.h"
--#include "vil/vil_math.h"
--
--//vgl
--#include "vgl/vgl_point_3d.h"
--#include <bvgl/bvgl_triangle_interpolation_iterator.h>
--
--//det and imesh includes
--#include <sdet/sdet_image_mesh.h>
--#include <sdet/sdet_image_mesh_params.h>
--#include <imesh/imesh_fileio.h>
--#include <imesh/imesh_operations.h>
--
--namespace boxm2_export_mesh_process_globals
--{
--  constexpr unsigned n_inputs_ = 4;
--  constexpr unsigned n_outputs_ = 1;
--}
--
--bool boxm2_export_mesh_process_cons(bprb_func_process& pro)
--{
--  using namespace boxm2_export_mesh_process_globals;
--
--  //process takes 2 inputs
--  int i=0;
--  std::vector<std::string> input_types_(n_inputs_);
--  input_types_[i++] = "vil_image_view_base_sptr";  //depth image
--  input_types_[i++] = "vil_image_view_base_sptr";  //x image
--  input_types_[i++] = "vil_image_view_base_sptr";  //y image
--  input_types_[i++] = "vcl_string";                //output dir of saved mesh
--
--  // process has 1 output
--  std::vector<std::string>  output_types_(n_outputs_);
--  output_types_[0] = "imesh_mesh_sptr";
--
--  return pro.set_input_types(input_types_) && pro.set_output_types(output_types_);
--}
--
--bool boxm2_export_mesh_process(bprb_func_process& pro)
--{
--  using namespace boxm2_export_mesh_process_globals;
--  if ( pro.n_inputs() < n_inputs_ ) {
--    std::cout << pro.name() << ": The input number should be " << n_inputs_<< std::endl;
--    return false;
--  }
--
--  //get the inputs
--  unsigned argIdx = 0;
--  vil_image_view_base_sptr img = pro.get_input<vil_image_view_base_sptr>(argIdx++);
--  vil_image_view_base_sptr ximg = pro.get_input<vil_image_view_base_sptr>(argIdx++);
--  vil_image_view_base_sptr yimg = pro.get_input<vil_image_view_base_sptr>(argIdx++);
--  std::string out_dir = pro.get_input<std::string>(argIdx++);
--
--  //create the mesh directory
--  if (out_dir != "") {
--    if (!vul_file::make_directory_path(out_dir.c_str())) {
--      std::cout<<"Couldn't make directory path "<<out_dir<<std::endl;
--      return false;
--    }
--  }
--
--  //cast camera and image so they are useful
--  auto* z_img = (vil_image_view<float>*) img.ptr();
--  auto* x_img = (vil_image_view<float>*) ximg.ptr();
--  auto* y_img = (vil_image_view<float>*) yimg.ptr();
--
--  //determine size of depth image
--  unsigned ni = z_img->ni();
--  unsigned nj = z_img->nj();
--
--  //create new resource sptr
--  vil_image_resource_sptr z_img_res = vil_new_image_resource_of_view(*z_img);
--
--  //initialize some sdet_image_mesh parameters
--  sdet_image_mesh_params imp;
--  // sigma of the Gaussian for smoothing the image prior to edge detection
--  imp.smooth_ = 1.0f;
--  // the edge detection threshold
--  imp.thresh_ = 1.68f;
--  // the shortest edgel chain that is considered for line fitting
--  imp.min_fit_length_ = 5;
--
--  // the threshold on rms pixel distance of edgels to the line
--  imp.rms_distance_ = 0.11;
--  // the width in pixels of the transition of a step edge
--  imp.step_half_width_ = 0.0;
--
--  // the mesh processor
--  sdet_image_mesh im(imp);
--  im.set_image(z_img_res);
--  if (!im.compute_mesh()) {
--    std::cout<<"mesh could not be computed"<<std::endl;
--    return false;
--  }
--  imesh_mesh& mesh = im.get_mesh();
--  std::cout << "Number of vertices " << mesh.num_verts()
--           << "  number of faces "<< mesh.num_faces()<< '\n';
--
--  ////////////////////////////////////////////////////////////////////////////////
--  // Take mesh and add points to triangles of high depth variance
--  // I.E. if a triangle in mesh has corners both very close and very far from top
--  // camera, take it's centroid point and add x,y,z point, creating 3 new faces
--  ////////////////////////////////////////////////////////////////////////////////
--  mesh.compute_vertex_normals_from_faces();
--
--  ////////////////////////////////////////////////////////////////////////////////
--  //// normalize mesh world points to fit in the image_bb from above
--  ////////////////////////////////////////////////////////////////////////////////
--  // get min and max z values
--  float minz=0, maxz=0;
--  vil_math_value_range(*z_img, minz, maxz);
--  std::cout<<"Min z: "<<minz<<" Max z: "<<maxz<<std::endl;
--
--  //grab vertices in the mesh - convert them to scene coordinates (not image)
--  imesh_vertex_array<3>& verts = mesh.vertices<3>();
--  unsigned nverts = mesh.num_verts();
--  for (unsigned iv = 0; iv<nverts; ++iv)
--  {
--    //get coordinates so you can index into the height map
--    auto i = static_cast<unsigned>(verts[iv][0]);
--    auto j = static_cast<unsigned>(verts[iv][1]);
--    if (i<ni && j<nj)
--    {
--      verts[iv][0] = (*x_img)(i,j);
--      verts[iv][1] = (*y_img)(i,j);
--      verts[iv][2] = (*z_img)(i,j);
--    }
--  }
--
--  ////////////////////////////////////////////////////////////////////////////////
--  //// cut tall triangles into quarters (find midpoints of each
--  ////////////////////////////////////////////////////////////////////////////////
--//bool did_divide = true;
--  //while (did_divide)
--  {
--    std::set<unsigned int> sel_faces;
--    double maxLen = (maxz-minz) / 3.0;
--    auto& faces = (imesh_regular_face_array<3>&) mesh.faces();
--    imesh_vertex_array<3>&       verts = mesh.vertices<3>();
--
--    unsigned nfaces = mesh.num_faces();
--    for (unsigned iface = 0; iface<nfaces; ++iface)
--    {
--      //store three 3d points
--      std::vector<vgl_point_3d<double> > points;
--      for (int i=0; i<3; ++i) {
--        unsigned vertexId = faces[iface][i];
--        double x = verts[vertexId][0];
--        double y = verts[vertexId][1];
--        double z = verts[vertexId][2];
--        points.emplace_back(x,y,z );
--      }
--
--      // if any one side of the triangle is too long, cut it
--      double lenA = (points[0]-points[1]).sqr_length(); // vgl_vector length == distance
--      double lenB = (points[1]-points[2]).sqr_length();
--      double lenC = (points[0]-points[2]).sqr_length();
--      maxLen *= maxLen; // sqr
--      if (lenA > maxLen || lenB > maxLen || lenC > maxLen) {
--        sel_faces.insert(iface);
--      }
--    }
--
--    //if the divide face set is not empty, divide the faces
--    if ( !sel_faces.empty() ) {
--//    did_divide = true;
--
--      std::cout<<"Subdividing mesh"<<std::endl;
--      imesh_quad_subdivide(mesh, sel_faces);
--
--      std::cout<<"Re triangulating mesh"<<std::endl;
--      imesh_triangulate(mesh);
--    }
--//  else {
--//    did_divide = false;
--//  }
--  }
--
--  imesh_mesh_sptr mesh_sptr = new imesh_mesh(mesh);
--
--  ////////////////////////////////////////////////////////////////////////////////
--  //// Write out in VRML format
--  ////////////////////////////////////////////////////////////////////////////////
--  std::string vrfile = out_dir + "/untextured.wrl";
--  std::ofstream os(vrfile.c_str());
--  imesh_write_vrml(os, mesh);
--  os.close();
--
--  // store scene smart pointer
--  argIdx = 0;
--  pro.set_output_val<imesh_mesh_sptr>(argIdx++, mesh_sptr);
--  return true;
--}
-diff --git a/contrib/brl/bseg/boxm2/pro/processes/boxm2_export_textured_mesh_process.cxx b/contrib/brl/bseg/boxm2/pro/processes/boxm2_export_textured_mesh_process.cxx
-deleted file mode 100644
-index 73e67b8bb6..0000000000
---- a/contrib/brl/bseg/boxm2/pro/processes/boxm2_export_textured_mesh_process.cxx
-+++ /dev/null
-@@ -1,523 +0,0 @@
--// This is brl/bseg/boxm2/pro/processes/boxm2_export_textured_mesh_process.cxx
--#include <bprb/bprb_func_process.h>
--#include <fstream>
--#include <iostream>
--#include <utility>
--//:
--// \file
--// \brief  A process for exporting a texture mapped mesh of a scene
--//
--// \author Vishal Jain
--// \date Mar 15, 2011
--
--#ifdef _MSC_VER
--#  include "vcl_msvc_warnings.h"
--#endif
--#include "vul/vul_file.h"
--#include "vul/vul_timer.h"
--#include <boxm2/boxm2_scene.h>
--#include <boxm2/boxm2_util.h>
--
--//vil includes
--#include "vil/vil_image_view.h"
--#include "vil/vil_save.h"
--#include "vil/vil_new.h"
--
--//vgl
--#include "vgl/vgl_distance.h"
--#include "vgl/vgl_ray_3d.h"
--#include "vgl/vgl_point_3d.h"
--#include <bvgl/bvgl_triangle_interpolation_iterator.h>
--
--//vpgl camera stuff
--#include "vpgl/vpgl_perspective_camera.h"
--
--//det and imesh includes
--#include <sdet/sdet_image_mesh.h>
--#include <sdet/sdet_image_mesh_params.h>
--#include <imesh/imesh_fileio.h>
--#include <imesh/algo/imesh_render.h>
--
--namespace boxm2_export_textured_mesh_process_globals
--{
--  constexpr unsigned n_inputs_ = 6;
--  constexpr unsigned n_outputs_ = 0;
--
--  //helper texture map methods
--  void boxm2_texture_mesh_from_imgs(std::string im_dir,
--                                    std::string cam_dir,
--                                    imesh_mesh& in_mesh,
--                                    std::map<std::string, imesh_mesh>& meshes);
--
--  //populates a vector of visibility images (by face id int)
--  void boxm2_visible_faces( std::vector<vpgl_perspective_camera<double>* >& cameras,
--                            std::vector<vil_image_view<int>* >& vis_images,
--                            imesh_mesh& in_mesh);
--
--
--  //checks if a triangle in UV space is visible.  us and vs are double buffers of length 3
--  bool face_is_visible( vpgl_perspective_camera<double>* cam,
--                        vil_image_view<int>* vis_img,
--                        const double* us,
--                        const double* vs,
--                        int face_id);
--}
--
--bool boxm2_export_textured_mesh_process_cons(bprb_func_process& pro)
--{
--  using namespace boxm2_export_textured_mesh_process_globals;
--
--  //process takes 2 inputs
--  int i=0;
--  std::vector<std::string> input_types_(n_inputs_);
--  input_types_[i++] = "vil_image_view_base_sptr";  //depth image
--  input_types_[i++] = "vpgl_camera_double_sptr";   //depth image cam
--  input_types_[i++] = "boxm2_scene_sptr";          //scene object
--  input_types_[i++] = "vcl_string";                //directory of scene images
--  input_types_[i++] = "vcl_string";                //directory of corresponding cams
--  input_types_[i++] = "vcl_string";                //output dir of saved mesh
--
--  // process has 1 output
--  std::vector<std::string>  output_types_(n_outputs_);
--  //output_types_[0] = "boxm2_scene_sptr";
--
--  return pro.set_input_types(input_types_) && pro.set_output_types(output_types_);
--}
--
--bool boxm2_export_textured_mesh_process(bprb_func_process& pro)
--{
--  using namespace boxm2_export_textured_mesh_process_globals;
--  if ( pro.n_inputs() < n_inputs_ ) {
--    std::cout << pro.name() << ": The input number should be " << n_inputs_<< std::endl;
--    return false;
--  }
--
--  //get the inputs
--  unsigned argIdx = 0;
--  vil_image_view_base_sptr img = pro.get_input<vil_image_view_base_sptr>(argIdx++);
--  vpgl_camera_double_sptr  cam = pro.get_input<vpgl_camera_double_sptr>(argIdx++);
--  boxm2_scene_sptr       scene = pro.get_input<boxm2_scene_sptr>(argIdx++);
--  std::string img_dir = pro.get_input<std::string>(argIdx++);
--  std::string cam_dir = pro.get_input<std::string>(argIdx++);
--  std::string out_dir = pro.get_input<std::string>(argIdx++);
--
--  if (img->pixel_format() == VIL_PIXEL_FORMAT_BYTE)
--  {
--    auto* inim = (vil_image_view<vxl_byte>*) img.ptr();
--    auto* fimg = new vil_image_view<float>(img->ni(), img->nj());
--    for (unsigned int i=0; i<img->ni(); ++i)
--      for (unsigned int j=0; j<img->nj(); ++j)
--        (*fimg)(i,j) = (float) (*inim)(i,j) / 255.0f;
--    img = vil_image_view_base_sptr(fimg);
--  }
--
--  //create the mesh directory
--  if (!vul_file::make_directory_path(out_dir.c_str())) {
--    std::cout<<"Couldn't make directory path "<<out_dir<<std::endl;
--    return false;
--  }
--
--  //cast camera and image so they are useful
--  auto* pcam = (vpgl_perspective_camera<double>*) cam.ptr();
--  auto* depth = (vil_image_view<float>*) img.ptr();
--
--  //determine size of depth image
--  unsigned ni = img->ni();
--  unsigned nj = img->nj();
--
--  //calculate XYZ image image that corresponds to depth image
--  auto* xyz_img = new vil_image_view<vil_rgba<float> >(ni, nj);
--  auto* z_img = new vil_image_view<float>(ni,nj);
--  for (unsigned int i=0; i<ni; ++i) {
--    for (unsigned int j=0; j<nj; ++j) {
--      //grab the ray from the camera
--      vgl_ray_3d<double> ray = pcam->backproject_ray( (double) i+.5, (double) j+.5);
--
--      //ray o
--      float ray_ox = float(ray.origin().x()),
--            ray_oy = float(ray.origin().y()),
--            ray_oz = float(ray.origin().z());
--
--      //ray dir
--      float dray_x = float(ray.direction().x()),
--            dray_y = float(ray.direction().y()),
--            dray_z = float(ray.direction().z());
--
--      //expected ray depth
--      float ray_t = (*depth)(i,j);
--
--      //calculate x,y,z position at expected depth
--      (*xyz_img)(i,j) = vil_rgba<float>(ray_ox - ray_t*dray_x,
--                                        ray_oy - ray_t*dray_y,
--                                        ray_oz - ray_t*dray_z,
--                                        0.0f);
--      (*z_img)(i,j) = ray_oz - ray_t*dray_z;
--    }
--  }
--
--  //////////////////////////////////////////////////////////////////////////////
--  // Generate 3d mesh from depth image
--  //////////////////////////////////////////////////////////////////////////////
--  std::cout<<"Generating image mesh"<<std::endl;
--
--  //create new resource sptr
--  vil_image_resource_sptr z_img_res = vil_new_image_resource_of_view(*z_img);
--
--  //initialize some sdet_image_mesh parameters
--  sdet_image_mesh_params imp;
--  // sigma of the Gaussian for smoothing the image prior to edge detection
--  imp.smooth_ = 2.0f;
--  // the edge detection threshold
--  imp.thresh_ = 2.0f;
--  // the shortest edgel chain that is considered for line fitting
--  imp.min_fit_length_ = 7;
--  // the threshold on rms pixel distance of edgels to the line
--  imp.rms_distance_ = 0.1;
--  // the width in pixels of the transition of a step edge
--  imp.step_half_width_ = 5.0;
--
--  // the mesh processor
--  sdet_image_mesh im(imp);
--  im.set_image(z_img_res);
--  if (!im.compute_mesh()) {
--    std::cout<<"mesh could not be computed"<<std::endl;
--    return false;
--  }
--  imesh_mesh& mesh = im.get_mesh();
--  std::cout << "Number of vertices " << mesh.num_verts()
--           << "  number of faces "<< mesh.num_faces()<< '\n';
--
--  std::string meshFile = out_dir + "/wire.wrl";
--  std::ofstream wos(meshFile.c_str());
--  imesh_write_vrml(wos, mesh);
--  wos.close();
--
--  ////////////////////////////////////////////////////////////////////////////////
--  //// normalize mesh world points to fit in the image_bb from above
--  ////////////////////////////////////////////////////////////////////////////////
--  vul_timer t;
--  //grab vertices in the mesh - convert them to scene coordinates (not image)
--  imesh_vertex_array<3>& verts = mesh.vertices<3>();
--  unsigned nverts = mesh.num_verts();
--  for (unsigned iv = 0; iv<nverts; ++iv)
--  {
--    //get coordinates so you can index into the height map
--    auto i = static_cast<unsigned>(verts[iv][0]);
--    auto j = static_cast<unsigned>(verts[iv][1]);
--    double scene_x=0, scene_y=0,scene_z = 0.0;
--    if (i<ni && j<nj) {
--      scene_x = (*xyz_img)(i,j).R();
--      scene_y = (*xyz_img)(i,j).G();
--      scene_z = (*xyz_img)(i,j).B();
--    }
--    verts[iv][0] = scene_x;
--    verts[iv][1] = scene_y;
--    verts[iv][2] = scene_z;
--  }
--  std::cout<<mesh.has_tex_coords()<<std::endl;
--
--  //////////////////////////////////////////////////////////////////////////////
--  //Texture map the mesh
--  //////////////////////////////////////////////////////////////////////////////
--  //boxm2_texture_mesh_topdown(img_dir, cam_dir, mesh);
--  std::map<std::string, imesh_mesh> meshes;
--  boxm2_texture_mesh_from_imgs(img_dir, cam_dir, mesh, meshes);
--
--  ////////////////////////////////////////////////////////////////////////////////
--  //// Write out in VRML format
--  ////////////////////////////////////////////////////////////////////////////////
--  //output file and stream
--  std::string vrfile = out_dir + "/vrmesh.wrl";
--  std::ofstream os(vrfile.c_str());
--
--  //write each submesh into one file
--  std::map<std::string, imesh_mesh>::iterator subMesh;
--  for (subMesh = meshes.begin(); subMesh != meshes.end(); ++subMesh)
--  {
--    imesh_mesh& sMesh = subMesh->second;
--    std::cout<<"Writing sub mesh: "<<sMesh.tex_source()<<" has "<<sMesh.num_faces()<<" faces"<<std::endl;
--    imesh_write_vrml(os, sMesh);
--  }
--  os.close();
--  std::cout<<"Texture Mapping Mesh Time: "<<t.all()<<"ms"<<std::endl;
--
--  return true;
--}
--
--
--//Given a directory of images, dir cams, an input mesh, this function creates
--//map of textured meshes (imesh doesn't ostensibly handle meshes from multiple textures)
--void boxm2_export_textured_mesh_process_globals::boxm2_texture_mesh_from_imgs(std::string im_dir,
--                                                                              std::string cam_dir,
--                                                                              imesh_mesh& in_mesh,
--                                                                              std::map<std::string, imesh_mesh>& meshes)
--{
--  ////////////////////////////////////////////////////////////////////////////////
--  // BEGIN TEXTURE MAPPING
--  // Gather cameras and iamges that will contribute to the texture
--  ////////////////////////////////////////////////////////////////////////////////
--  std::vector<std::string> camfiles = boxm2_util::camfiles_from_directory(std::move(cam_dir));
--  std::vector<std::string> imfiles = boxm2_util::images_from_directory(std::move(im_dir));
--
--  std::vector<vpgl_perspective_camera<double>* > cameras;
--  for (auto & camfile : camfiles) {
--    //build the camera from file
--    std::ifstream ifs(camfile.c_str());
--    auto* icam = new vpgl_perspective_camera<double>;
--    if (!ifs.is_open()) {
--      std::cerr << "Failed to open file " << camfile << '\n';
--      return;
--    }
--    ifs >> *icam;
--    cameras.push_back(icam);
--    std::cout<<icam->principal_axis()<<std::endl;
--  }
--
--  ////////////////////////////////////////////////////////////////////////////////
--  // Grab input mesh vertices and input mesh faces
--  ////////////////////////////////////////////////////////////////////////////////
--  in_mesh.compute_vertex_normals_from_faces();
--  auto& in_faces = (imesh_regular_face_array<3>&) in_mesh.faces();
--  unsigned nfaces = in_mesh.num_faces();
--  imesh_vertex_array<3>& in_verts = in_mesh.vertices<3>();
--
--  ////////////////////////////////////////////////////////////////////////////////
--  // Render Visibility Images
--  ////////////////////////////////////////////////////////////////////////////////
--  std::vector<vil_image_view<int>* > vis_images;
--  boxm2_visible_faces(cameras, vis_images, in_mesh);
--
--  ////////////////////////////////////////////////////////////////////////////////
--  // For each Face:
--  //   determine which image is closest in normal and visible, store face index in a map[image_str, vector<int>face]
--  ////////////////////////////////////////////////////////////////////////////////
--  //texture index
--  std::cout<<"Populating faces for each texture"<<std::endl;
--  std::map<std::string, std::vector<unsigned> > app_faces; //image_name to face_list
--  std::map<std::string, vpgl_perspective_camera<double>* > texture_cams;
--  for (unsigned iface = 0; iface<nfaces; ++iface)
--  {
--    //create list of cameras from which you can see this face
--    std::vector<vpgl_perspective_camera<double>* > visible_views;
--    for (unsigned int i=0; i<vis_images.size(); ++i) {
--      //project triangle
--      double us[3], vs[3];
--      for (int vIdx=0; vIdx<3; ++vIdx) {
--        unsigned vertIdx = in_faces[iface][vIdx];
--
--        //project these verts into UV
--        double x = in_verts[vertIdx][0], y = in_verts[vertIdx][1], z = in_verts[vertIdx][2];
--        double u,v;
--        cameras[i]->project(x, y, z, u, v);
--        us[vIdx] = u;
--        vs[vIdx] = v;
--      }
--      if ( face_is_visible( cameras[i], vis_images[i], us, vs, iface) )
--        visible_views.push_back(cameras[i]);
--    }
--
--    //now compare the normal to each of the visible view cameras
--    vgl_vector_3d<double>& normal = in_faces.normal(iface);
--
--    //find camera with the closest look vector to this normal
--    int closeIdx = boxm2_util::find_nearest_cam(normal, visible_views);
--    vpgl_perspective_camera<double>* closest = nullptr;
--    std::string im_name = "empty";
--    if (closeIdx >= 0) {
--      closest = cameras[closeIdx];
--      im_name = imfiles[closeIdx];
--    }
--
--    //grab appropriate face list (create it if it's not there)
--    auto iter = app_faces.find(im_name);
--    if ( iter == app_faces.end() ) {
--      std::cout<<"Adding image: "<<im_name<<" to texture list"<<std::endl;
--      std::vector<unsigned> faceList;
--      faceList.push_back(iface);
--      app_faces[im_name] = faceList;
--
--      //keep track of the camera
--      texture_cams[im_name] = closest;
--    }
--    else {
--      app_faces[im_name].push_back(iface);
--    }
--  }
--
--  ////////////////////////////////////////////////////////////////////////////////
--  // For each image/appearance:
--  //   - create a vert list
--  //   - create a face list
--  //   - create a sub mesh that is textured
--  ////////////////////////////////////////////////////////////////////////////////
--
--  //for each appearance (texture image), create an imesh_mesh (subMesh);
--  std::cout<<"Creating Sub Meshes for each texture"<<std::endl;
--  std::map<std::string, std::vector<unsigned> >::iterator apps;
--  for (apps = app_faces.begin(); apps != app_faces.end(); ++apps)
--  {
--    //for each appearance, we're creating a whole new mesh
--    // first create the face list
--    auto* flist = new imesh_regular_face_array<3>();
--
--    //now create the vertex list
--    auto* verts3 = new imesh_vertex_array<3>();
--
--    //get faces list corresponding to this texture
--    std::vector<unsigned>& face_list = apps->second;
--    for (unsigned int i=0; i<face_list.size(); ++i) {
--      //get old face
--      unsigned old_fIdx = face_list[i];
--
--      //old face vertices
--      unsigned v1 = in_faces[old_fIdx][0];
--      unsigned v2 = in_faces[old_fIdx][1];
--      unsigned v3 = in_faces[old_fIdx][2];
--
--      //push these vertices onto the new vert list
--      verts3->push_back( imesh_vertex<3>(in_verts[v1][0], in_verts[v1][1], in_verts[v1][2]) );
--      verts3->push_back( imesh_vertex<3>(in_verts[v2][0], in_verts[v2][1], in_verts[v2][2]) );
--      verts3->push_back( imesh_vertex<3>(in_verts[v3][0], in_verts[v3][1], in_verts[v3][2]) );
--
--      imesh_tri tri(3*i, 3*i+1, 3*i+2);
--      flist->push_back(tri);
--    }
--
--    //create the submesh using the auto ptrs
--    std::unique_ptr<imesh_vertex_array_base> v3(verts3);
--    std::unique_ptr<imesh_face_array_base> f3(flist);
--    imesh_mesh subMesh(std::move(v3), std::move(f3));
--
--    std::cout<<"Setting tex source: "<<apps->first<<std::endl;
--    meshes[apps->first] = subMesh;
--    meshes[apps->first].set_tex_source(apps->first);
--  }
--
--  //////////////////////////////////////////////////////////////////////////////
--  //For each mesh, map each vertex
--  //////////////////////////////////////////////////////////////////////////////
--  std::cout<<"Mapping sub meshes for each texture"<<std::endl;
--  std::map<std::string, imesh_mesh>::iterator subMesh;
--  auto txCam = texture_cams.begin();
--  for (subMesh = meshes.begin(); subMesh != meshes.end(); ++subMesh, ++txCam)
--  {
--    imesh_mesh& mesh = subMesh->second;
--    imesh_vertex_array<3>& verts = mesh.vertices<3>();
--    unsigned nverts = mesh.num_verts();
--
--    //texture map the non empty appearances
--    if (txCam->first != "empty")
--    {
--      std::vector<vgl_point_2d<double> > tex_coords(nverts, vgl_point_2d<double>(0.0,0.0));
--      for (unsigned iv = 0; iv<nverts; ++iv)
--      {
--        //find camera corresponding to this texture
--        vpgl_perspective_camera<double>* closest = txCam->second;
--        vgl_point_2d<double> principal_point = closest->get_calibration().principal_point();
--        double ni = principal_point.x()*2.0;
--        double nj = principal_point.y()*2.0;
--
--        //project the vertex onto the camera, store the texture coordinate
--        double x = verts[iv][0];
--        double y = verts[iv][1];
--        double z = verts[iv][2];
--        double u,v;
--        closest->project(x, y, z, u, v);
--
--        //flip v about the y axis
--        v=nj-v;
--
--        //store the tex_coordinate
--        vgl_point_2d<double> uv(u/ni,v/nj);
--        tex_coords[iv] = uv;
--      }
--      mesh.set_tex_coords(tex_coords);
--    }
--  }
--}
--
--bool boxm2_export_textured_mesh_process_globals::face_is_visible( vpgl_perspective_camera<double>*  /*cam*/,
--                                                                  vil_image_view<int>* vis_img,
--                                                                  const double* us,
--                                                                  const double* vs,
--                                                                  int face_id)
--{
--  //now create a polygon, and find the integer image coordinates (U,V) that this polygon covers
--  int ni = vis_img->ni();
--  int nj = vis_img->nj();
--
--  vgl_triangle_scan_iterator<double> tsi;
--  tsi.a.x = us[0];  tsi.a.y = vs[0];
--  tsi.b.x = us[1];  tsi.b.y = vs[1];
--  tsi.c.x = us[2];  tsi.c.y = vs[2];
--  for (tsi.reset(); tsi.next(); ) {
--    int y = tsi.scany();
--    if (y<0 || y>=nj) continue;
--    int min_x = tsi.startx();
--    int max_x = tsi.endx();
--    if (min_x >= ni || max_x < 0)
--      continue;
--    if (min_x < 0) min_x = 0;
--    if (max_x >= ni) max_x = ni-1;
--    for (int x = min_x; x <= max_x; ++x) {
--      if ( (*vis_img)(x,y) != face_id )
--        return false;
--    }
--  }
--
--  //if it made it this far, it's completely visible
--  return true;
--}
--
--
--void boxm2_export_textured_mesh_process_globals::boxm2_visible_faces( std::vector<vpgl_perspective_camera<double>* >& cameras,
--                                                                      std::vector<vil_image_view<int >* >& vis_images,
--                                                                      imesh_mesh& in_mesh)
--{
--  auto& in_faces = (imesh_regular_face_array<3>&) in_mesh.faces();
--  unsigned nfaces = in_mesh.num_faces();
--  imesh_vertex_array<3>& in_verts = in_mesh.vertices<3>();
--
--  //iterate over each camera, creating a visibility image for each
--  for (auto pcam : cameras)
--  {
--    //get the principal point of the cam for image size
--    vgl_point_2d<double> principal_point = pcam->get_calibration().principal_point();
--    auto ni = (unsigned) (principal_point.x()*2.0);
--    auto nj = (unsigned) (principal_point.y()*2.0);
--
--    // render the face_id/distance image
--    vil_image_view<double> depth_im(ni, nj);
--    auto*   face_im = new vil_image_view<int>(ni, nj);
--    depth_im.fill(10e100);  //Initial depth is huge,
--    face_im->fill(-1); //initial face id is -1
--    for (unsigned iface = 0; iface<nfaces; ++iface)
--    {
--      //get the vertices from the face, project into UVs
--      double us[3], vs[3], dists[3];
--      for (int vIdx=0; vIdx<3; ++vIdx) {
--        unsigned vertIdx = in_faces[iface][vIdx];
--
--        //project these verts into UV
--        double x = in_verts[vertIdx][0], y = in_verts[vertIdx][1], z = in_verts[vertIdx][2];
--        double u,v;
--        pcam->project(x, y, z, u, v);
--        us[vIdx] = u;
--        vs[vIdx] = v;
--
--        //keep track of distance to each vertex
--        dists[vIdx] = vgl_distance(vgl_point_3d<double>(x,y,z), pcam->get_camera_center());
--      }
--
--      //render the triangle label onto the label image, using the depth image
--      vgl_point_3d<double> v1(us[0], vs[0], dists[0]);
--      vgl_point_3d<double> v2(us[1], vs[1], dists[1]);
--      vgl_point_3d<double> v3(us[2], vs[2], dists[2]);
--      imesh_render_triangle_label<int>(v1, v2, v3, (int) iface, (*face_im), depth_im);
--    } //end for iface
--
--    //keep the vis_image just calculated
--    vis_images.push_back(face_im);
--    vil_save(depth_im, "/media/VXL/mesh/downtown/dist_im.tif");
--  }
--}
-diff --git a/contrib/brl/bseg/boxm2/pro/processes/boxm2_load_mesh_process.cxx b/contrib/brl/bseg/boxm2/pro/processes/boxm2_load_mesh_process.cxx
-deleted file mode 100644
-index 78c545a3fd..0000000000
---- a/contrib/brl/bseg/boxm2/pro/processes/boxm2_load_mesh_process.cxx
-+++ /dev/null
-@@ -1,78 +0,0 @@
--// This is brl/bseg/boxm2/pro/processes/boxm2_load_mesh_process.cxx
--#include <iostream>
--#include <fstream>
--#include <bprb/bprb_func_process.h>
--//:
--// \file
--// \brief  A process for loading a  mesh
--//
--// \author Vishal Jain
--// \date Mar 15, 2013
--
--#ifdef _MSC_VER
--#  include "vcl_msvc_warnings.h"
--#endif
--#include "vul/vul_file.h"
--#include "vul/vul_timer.h"
--#include "vnl/vnl_random.h"
--#include <boxm2/boxm2_scene.h>
--#include <boxm2/boxm2_util.h>
--
--//vil includes
--#include "vil/vil_image_view.h"
--#include "vil/vil_save.h"
--#include <vil/algo/vil_gauss_filter.h>
--
--//vgl
--#include "vgl/vgl_distance.h"
--#include "vgl/vgl_triangle_scan_iterator.h"
--#include <bvgl/bvgl_triangle_interpolation_iterator.h>
--
--//vpgl camera stuff
--#include "vpgl/vpgl_perspective_camera.h"
--
--//det and imesh includes
--#include <sdet/sdet_image_mesh.h>
--#include <sdet/sdet_image_mesh_params.h>
--#include <imesh/imesh_fileio.h>
--#include <imesh/algo/imesh_render.h>
--
--namespace boxm2_load_mesh_process_globals
--{
--  constexpr unsigned n_inputs_ = 1;
--  constexpr unsigned n_outputs_ = 1;
--}
--
--bool boxm2_load_mesh_process_cons(bprb_func_process& pro)
--{
--  using namespace boxm2_load_mesh_process_globals;
--
--  //process takes 2 inputs
--  int i=0;
--  std::vector<std::string> input_types_(n_inputs_);
--  input_types_[i++] = "vcl_string";       //mesh filename
--
--  // process has 1 output
--  std::vector<std::string>  output_types_(n_outputs_);
--  output_types_[0] = "imesh_mesh_sptr";
--
--  return pro.set_input_types(input_types_) && pro.set_output_types(output_types_);
--}
--
--bool boxm2_load_mesh_process(bprb_func_process& pro)
--{
--  using namespace boxm2_load_mesh_process_globals;
--  if ( pro.n_inputs() < n_inputs_ ) {
--    std::cout << pro.name() << ": The input number should be " << n_inputs_<< std::endl;
--    return false;
--  }
--  unsigned argIdx = 0;
--  std::string mesh_filename = pro.get_input<std::string>(argIdx++);
--  imesh_mesh_sptr mesh = new imesh_mesh();
--  imesh_read(mesh_filename, *(mesh.ptr()));
--  std::cout<<"# of faces "<<mesh->num_faces()<<std::endl;
--  pro.set_output_val<imesh_mesh_sptr>(0,mesh);
--
--
--  return true;
--}
--- 
-2.46.1
-
diff --git a/0018-Added-sonames-to-vgui-vidl-vpdl-Qv-libs.patch b/0018-Added-sonames-to-vgui-vidl-vpdl-Qv-libs.patch
new file mode 100644
index 0000000..9d0f023
--- /dev/null
+++ b/0018-Added-sonames-to-vgui-vidl-vpdl-Qv-libs.patch
@@ -0,0 +1,64 @@
+From 354b76db3c873078198017ca33a22dcfc217be09 Mon Sep 17 00:00:00 2001
+From: Mario Ceresa <mrceresa@gmail.com>
+Date: Sun, 14 Oct 2012 17:38:51 +0200
+Subject: [PATCH 18/23] Added sonames to vgui vidl vpdl Qv libs
+
+---
+ core/vgui/CMakeLists.txt     | 1 +
+ core/vidl/gui/CMakeLists.txt | 1 +
+ core/vpdl/CMakeLists.txt     | 1 +
+ v3p/Qv/CMakeLists.txt        | 2 +-
+ 4 files changed, 4 insertions(+), 1 deletion(-)
+
+diff --git a/core/vgui/CMakeLists.txt b/core/vgui/CMakeLists.txt
+index df5eb3b..0dc1121 100644
+--- a/core/vgui/CMakeLists.txt
++++ b/core/vgui/CMakeLists.txt
+@@ -518,6 +518,7 @@ SET( vgui_sources ${vgui_sources}
+ )
+ 
+ ADD_LIBRARY(vgui ${vgui_sources})
++SET_TARGET_PROPERTIES(vgui PROPERTIES ${VXL_LIBRARY_PROPERTIES})
+ INSTALL_TARGETS(/lib vgui)
+ INSTALL_NOBASE_HEADER_FILES(/include/vxl/core/vgui ${vgui_sources})
+ SET( VGUI_FOUND "YES" CACHE INTERNAL "Was vgui successfully built?" )
+diff --git a/core/vidl/gui/CMakeLists.txt b/core/vidl/gui/CMakeLists.txt
+index 3ecc67f..c055a55 100644
+--- a/core/vidl/gui/CMakeLists.txt
++++ b/core/vidl/gui/CMakeLists.txt
+@@ -12,6 +12,7 @@ SET(vidl_gui_sources
+    )
+ 
+ ADD_LIBRARY(vidl_gui ${vidl_gui_sources})
++SET_TARGET_PROPERTIES(vidl_gui PROPERTIES ${VXL_LIBRARY_PROPERTIES})
+ INSTALL_TARGETS(/lib vidl_gui)
+ INSTALL_NOBASE_HEADER_FILES(/include/vxl/core/vidl/gui ${vidl_gui_sources})
+ TARGET_LINK_LIBRARIES( vidl_gui vidl vgui vil )
+diff --git a/core/vpdl/CMakeLists.txt b/core/vpdl/CMakeLists.txt
+index 7f7fcd8..263cd8c 100644
+--- a/core/vpdl/CMakeLists.txt
++++ b/core/vpdl/CMakeLists.txt
+@@ -48,6 +48,7 @@ SET( vpdl_sources
+ AUX_SOURCE_DIRECTORY(Templates vpdl_sources)
+ 
+ ADD_LIBRARY(vpdl ${vpdl_sources})
++SET_TARGET_PROPERTIES(vpdl PROPERTIES ${VXL_LIBRARY_PROPERTIES})
+ TARGET_LINK_LIBRARIES( vpdl vnl_algo vnl )
+ 
+ INSTALL_TARGETS(/lib vpdl)
+diff --git a/v3p/Qv/CMakeLists.txt b/v3p/Qv/CMakeLists.txt
+index 75bd643..e53f334 100644
+--- a/v3p/Qv/CMakeLists.txt
++++ b/v3p/Qv/CMakeLists.txt
+@@ -169,7 +169,7 @@ IF(CMAKE_COMPILER_IS_GNUCXX)
+ ENDIF(CMAKE_COMPILER_IS_GNUCXX)
+ 
+ ADD_LIBRARY( Qv ${Qv_sources} )
+-
++SET_TARGET_PROPERTIES(Qv PROPERTIES ${VXL_LIBRARY_PROPERTIES})
+ TARGET_LINK_LIBRARIES( Qv vcl )
+ 
+ INSTALL_TARGETS(/lib Qv)
+-- 
+1.7.11.7
+
diff --git a/0018-chore-remove-ctest-dashboard-config.patch b/0018-chore-remove-ctest-dashboard-config.patch
deleted file mode 100644
index e43d5b3..0000000
--- a/0018-chore-remove-ctest-dashboard-config.patch
+++ /dev/null
@@ -1,43 +0,0 @@
-From 99f96d0e6d18996ad58d34998d08f022585ae77b Mon Sep 17 00:00:00 2001
-From: "Ankur Sinha (Ankur Sinha Gmail)" <sanjay.ankur@gmail.com>
-Date: Wed, 2 Oct 2024 14:39:51 +0100
-Subject: [PATCH 18/18] chore: remove ctest dashboard config
-
----
- CMakeLists.txt    | 4 ----
- CTestConfig.cmake | 8 --------
- 2 files changed, 12 deletions(-)
- delete mode 100644 CTestConfig.cmake
-
-diff --git a/CMakeLists.txt b/CMakeLists.txt
-index e1aa0390d4..810a1f4b21 100644
---- a/CMakeLists.txt
-+++ b/CMakeLists.txt
-@@ -322,10 +322,6 @@ configure_file( ${VXL_CMAKE_DIR}/UseVXL.cmake
- # For use in client projects that call UseVXL.cmake
- set(VXL_LIBRARY_PATH ${CMAKE_LIBRARY_OUTPUT_DIRECTORY} CACHE STATIC "Where all the vxl libraries are, for clients to use." )
- 
--# Copy CTestCustom.cmake to top of build tree
--configure_file( ${VXL_CMAKE_DIR}/CTestCustom.cmake
--  ${VXL_BINARY_DIR}/CTestCustom.cmake COPYONLY )
--
- # This command must be the last command in this file
- if(NOT VXL_NO_EXPORT)
-   include(${CMAKE_CURRENT_LIST_DIR}/config/cmake/export/VXLCreateProject.cmake)
-diff --git a/CTestConfig.cmake b/CTestConfig.cmake
-deleted file mode 100644
-index f2620f7bf6..0000000000
---- a/CTestConfig.cmake
-+++ /dev/null
-@@ -1,8 +0,0 @@
--# CTest Configuration for VXL
--set(CTEST_PROJECT_NAME "VXL")
--set(CTEST_NIGHTLY_START_TIME "22:00:00 EST")
--
--set(CTEST_DROP_METHOD "http")
--set(CTEST_DROP_SITE "open.cdash.org")
--set(CTEST_DROP_LOCATION "/submit.php?project=vxl")
--set(CTEST_DROP_SITE_CDASH TRUE)
--- 
-2.46.1
-
diff --git a/0019-Removed-box2m-which-requires-OpenCL-libraries.patch b/0019-Removed-box2m-which-requires-OpenCL-libraries.patch
new file mode 100644
index 0000000..b3355a3
--- /dev/null
+++ b/0019-Removed-box2m-which-requires-OpenCL-libraries.patch
@@ -0,0 +1,35 @@
+From aefaa1d2e0e621d7f3ef2ea420c92bd0c0f29e64 Mon Sep 17 00:00:00 2001
+From: Mario Ceresa <mrceresa@gmail.com>
+Date: Fri, 2 Nov 2012 14:40:49 +0100
+Subject: [PATCH 19/23] Removed box2m which requires OpenCL libraries
+
+---
+ contrib/brl/bseg/CMakeLists.txt | 6 +++---
+ 1 file changed, 3 insertions(+), 3 deletions(-)
+
+diff --git a/contrib/brl/bseg/CMakeLists.txt b/contrib/brl/bseg/CMakeLists.txt
+index b0e3a56..31ea0b5 100644
+--- a/contrib/brl/bseg/CMakeLists.txt
++++ b/contrib/brl/bseg/CMakeLists.txt
+@@ -48,10 +48,10 @@ SUBDIRS(boct)
+ SUBDIRS(boxm)
+ 
+ # updated, gpu compatible octree based modeling
+-SUBDIRS(boxm2)
++#SUBDIRS(boxm2)
+ 
+ # updated, gpu compatible octree based modeling
+-SUBDIRS(boxm2_batch)
++#SUBDIRS(boxm2_batch)
+ 
+ # octree based modeling python interface
+ SUBDIRS(boxm_batch)
+@@ -72,4 +72,4 @@ SUBDIRS(bapl)
+ SUBDIRS(boxm_bridge)
+ 
+ #multi gpu library
+-SUBDIRS(boxm2_multi)
++#SUBDIRS(boxm2_multi)
+-- 
+1.7.11.7
+
diff --git a/0020-Included-missing-vcl_cstdio.h-header.patch b/0020-Included-missing-vcl_cstdio.h-header.patch
new file mode 100644
index 0000000..76cb786
--- /dev/null
+++ b/0020-Included-missing-vcl_cstdio.h-header.patch
@@ -0,0 +1,24 @@
+From fc074ee4b8c2f09a554646ba983622dfb8a75fb5 Mon Sep 17 00:00:00 2001
+From: Mario Ceresa <mrceresa@gmail.com>
+Date: Fri, 2 Nov 2012 14:41:23 +0100
+Subject: [PATCH 20/23] Included missing vcl_cstdio.h header
+
+---
+ .../core/vpgl_pro/processes/vpgl_load_perspective_camera_process.cxx     | 1 +
+ 1 file changed, 1 insertion(+)
+
+diff --git a/contrib/brl/bpro/core/vpgl_pro/processes/vpgl_load_perspective_camera_process.cxx b/contrib/brl/bpro/core/vpgl_pro/processes/vpgl_load_perspective_camera_process.cxx
+index 10fe8a7..1082e34 100644
+--- a/contrib/brl/bpro/core/vpgl_pro/processes/vpgl_load_perspective_camera_process.cxx
++++ b/contrib/brl/bpro/core/vpgl_pro/processes/vpgl_load_perspective_camera_process.cxx
+@@ -5,6 +5,7 @@
+ 
+ #include <vcl_iostream.h>
+ #include <vcl_fstream.h>
++#include <vcl_cstdio.h>
+ #include <vpgl/vpgl_camera_double_sptr.h>
+ #include <vpgl/vpgl_perspective_camera.h>
+ #include <vpgl/io/vpgl_io_perspective_camera.h>
+-- 
+1.7.11.7
+
diff --git a/0021-Use-expatpp.h-which-is-provided-by-fedora-repos.patch b/0021-Use-expatpp.h-which-is-provided-by-fedora-repos.patch
new file mode 100644
index 0000000..00ecf6a
--- /dev/null
+++ b/0021-Use-expatpp.h-which-is-provided-by-fedora-repos.patch
@@ -0,0 +1,25 @@
+From 347dc1b1fe80c9b24a728b142698738f8b6dced2 Mon Sep 17 00:00:00 2001
+From: Mario Ceresa <mrceresa@gmail.com>
+Date: Fri, 2 Nov 2012 14:47:07 +0100
+Subject: [PATCH 21/23] Use expatpp.h which is provided by fedora repos
+
+---
+ contrib/brl/bbas/bvgl/bvgl_labelme_parser.h | 2 +-
+ 1 file changed, 1 insertion(+), 1 deletion(-)
+
+diff --git a/contrib/brl/bbas/bvgl/bvgl_labelme_parser.h b/contrib/brl/bbas/bvgl/bvgl_labelme_parser.h
+index 5740677..bded971 100644
+--- a/contrib/brl/bbas/bvgl/bvgl_labelme_parser.h
++++ b/contrib/brl/bbas/bvgl/bvgl_labelme_parser.h
+@@ -2,7 +2,7 @@
+ #ifndef bvgl_labelme_parser_h_
+ #define bvgl_labelme_parser_h_
+ 
+-#include <expatpplib.h>
++#include <expatpp.h>
+ #include <vcl_string.h>
+ #include <vcl_sstream.h>
+ #include <vgl/vgl_polygon.h>
+-- 
+1.7.11.7
+
diff --git a/0022-Include-missing-vcl_cstdio.h-header.patch b/0022-Include-missing-vcl_cstdio.h-header.patch
new file mode 100644
index 0000000..98ae0af
--- /dev/null
+++ b/0022-Include-missing-vcl_cstdio.h-header.patch
@@ -0,0 +1,24 @@
+From ec88b62f858fd9c03dd58d18d4f52d4f1e9aa784 Mon Sep 17 00:00:00 2001
+From: Mario Ceresa <mrceresa@gmail.com>
+Date: Fri, 2 Nov 2012 14:48:14 +0100
+Subject: [PATCH 22/23] Include missing vcl_cstdio.h header
+
+---
+ contrib/brl/bbas/volm/volm_io.cxx | 1 +
+ 1 file changed, 1 insertion(+)
+
+diff --git a/contrib/brl/bbas/volm/volm_io.cxx b/contrib/brl/bbas/volm/volm_io.cxx
+index 07e695f..02964fb 100755
+--- a/contrib/brl/bbas/volm/volm_io.cxx
++++ b/contrib/brl/bbas/volm/volm_io.cxx
+@@ -11,6 +11,7 @@
+ #include <bsol/bsol_algs.h>
+ #include <vcl_iostream.h>
+ #include <vcl_iomanip.h>
++#include <vcl_cstdio.h>
+ 
+ //:
+ // \file
+-- 
+1.7.11.7
+
diff --git a/0023-Remove-volm-because-of-error-in-function-prototype.patch b/0023-Remove-volm-because-of-error-in-function-prototype.patch
new file mode 100644
index 0000000..ad9dd2f
--- /dev/null
+++ b/0023-Remove-volm-because-of-error-in-function-prototype.patch
@@ -0,0 +1,23 @@
+From b26213c75a1a5f1b9d3ccabab89b1a68d7dffa24 Mon Sep 17 00:00:00 2001
+From: Mario Ceresa <mrceresa@gmail.com>
+Date: Fri, 2 Nov 2012 14:50:10 +0100
+Subject: [PATCH 23/23] Remove volm because of error in function prototype
+
+---
+ contrib/brl/bbas/CMakeLists.txt | 2 +-
+ 1 file changed, 1 insertion(+), 1 deletion(-)
+
+diff --git a/contrib/brl/bbas/CMakeLists.txt b/contrib/brl/bbas/CMakeLists.txt
+index 63f57d4..1628c61 100644
+--- a/contrib/brl/bbas/CMakeLists.txt
++++ b/contrib/brl/bbas/CMakeLists.txt
+@@ -90,5 +90,5 @@ SUBDIRS(bcvr)
+ SUBDIRS(bkml)
+ 
+ # volumetric matching tools
+-SUBDIRS(volm)
++#SUBDIRS(volm)
+ 
+-- 
+1.7.11.7
+
diff --git a/0024-Added-missing-sonames-for-mvl2-and-vepl1.patch b/0024-Added-missing-sonames-for-mvl2-and-vepl1.patch
new file mode 100644
index 0000000..65d8353
--- /dev/null
+++ b/0024-Added-missing-sonames-for-mvl2-and-vepl1.patch
@@ -0,0 +1,37 @@
+From 57527d9b27af9772681dac3d6efa2e4c93232689 Mon Sep 17 00:00:00 2001
+From: Mario Ceresa <mrceresa@gmail.com>
+Date: Sun, 25 Nov 2012 12:30:16 +0100
+Subject: [PATCH 24/24] Added missing sonames for mvl2 and vepl1
+
+---
+ contrib/mul/mvl2/CMakeLists.txt  | 1 +
+ contrib/tbl/vepl1/CMakeLists.txt | 1 +
+ 2 files changed, 2 insertions(+)
+
+diff --git a/contrib/mul/mvl2/CMakeLists.txt b/contrib/mul/mvl2/CMakeLists.txt
+index 8870a91..9994443 100644
+--- a/contrib/mul/mvl2/CMakeLists.txt
++++ b/contrib/mul/mvl2/CMakeLists.txt
+@@ -54,6 +54,7 @@ ENDIF (AVIFILE_FOUND)
+ ADD_LIBRARY(mvl2 ${mvl2_sources})
+ INSTALL_TARGETS(/lib mvl2)
+ INSTALL_NOBASE_HEADER_FILES(/include/vxl/contrib/mul/mvl2 ${mvl2_sources})
++SET_TARGET_PROPERTIES(mvl2 PROPERTIES ${VXL_LIBRARY_PROPERTIES})
+ TARGET_LINK_LIBRARIES( mvl2 vil vul ${AVIFILE_LIBRARIES} )
+ 
+ IF (AVIFILE_FOUND)
+diff --git a/contrib/tbl/vepl1/CMakeLists.txt b/contrib/tbl/vepl1/CMakeLists.txt
+index 1cc2295..0b7303f 100644
+--- a/contrib/tbl/vepl1/CMakeLists.txt
++++ b/contrib/tbl/vepl1/CMakeLists.txt
+@@ -47,6 +47,7 @@ ENDIF(CMAKE_COMPILER_IS_GNUCXX)
+ ADD_LIBRARY(vepl1 ${vepl1_sources})
+ INSTALL_TARGETS(/lib vepl1)
+ INSTALL_NOBASE_HEADER_FILES(/include/vxl/contrib/tbl/vepl1 ${vepl1_sources})
++SET_TARGET_PROPERTIES(vepl1 PROPERTIES ${VXL_LIBRARY_PROPERTIES})
+ TARGET_LINK_LIBRARIES(vepl1 vipl vil1 ${CMAKE_THREAD_LIBS})
+ 
+ IF (BUILD_EXAMPLES)
+-- 
+1.7.11.7
+
diff --git a/0025-Legacy-def1-r35963.patch b/0025-Legacy-def1-r35963.patch
new file mode 100644
index 0000000..c857dc0
--- /dev/null
+++ b/0025-Legacy-def1-r35963.patch
@@ -0,0 +1,37 @@
+commit 849fcbd56d9e55a59608ea1df8da82dcb5dbeb68
+Author: peter_vanroose <peter_vanroose@4b17d0e5-ac7a-4109-a8ed-6b3c4e86a14a>
+Date:   Wed Nov 14 13:42:48 2012 +0000
+
+    added back in the vnl_math_* functions, now as #defines to their vnl_math::* counterparts in the "real" vnl_math namespace
+    
+    git-svn-id: https://svn.code.sf.net/p/vxl/svn/trunk@35963 4b17d0e5-ac7a-4109-a8ed-6b3c4e86a14a
+
+diff --git a/core/vnl/vnl_math.h b/core/vnl/vnl_math.h
+index c458dae..adb5fb4 100644
+--- a/core/vnl/vnl_math.h
++++ b/core/vnl/vnl_math.h
+@@ -659,4 +659,24 @@ namespace vnl_math
+ 
+ } // end of namespace vnl_math
+ 
++// Legacy definitions, for backward compatibility:
++#define vnl_math_isnan vnl_math::isnan
++#define vnl_math_isinf vnl_math::isinf
++#define vnl_math_isfinite vnl_math::isfinite
++#define vnl_math_rnd_halfinttoeven vnl_math::rnd_halfinttoeven
++#define vnl_math_rnd_halfintup vnl_math::rnd_halfintup
++#define vnl_math_rnd vnl_math::rnd
++#define vnl_math_floor vnl_math::floor
++#define vnl_math_ceil vnl_math::ceil
++#define vnl_math_abs vnl_math::abs
++#define vnl_math_max vnl_math::max
++#define vnl_math_min vnl_math::min
++#define vnl_math_sqr vnl_math::sqr
++#define vnl_math_cube vnl_math::cube
++#define vnl_math_sgn vnl_math::sgn
++#define vnl_math_sgn0 vnl_math::sgn0
++#define vnl_math_squared_magnitude vnl_math::squared_magnitude
++#define vnl_math_cuberoot vnl_math::cuberoot
++#define vnl_math_hypot vnl_math::hypot
++
+ #endif // vnl_math_h_
diff --git a/0026-Legacy-def2-r36001.patch b/0026-Legacy-def2-r36001.patch
new file mode 100644
index 0000000..d687ed3
--- /dev/null
+++ b/0026-Legacy-def2-r36001.patch
@@ -0,0 +1,46 @@
+commit 528908a1663fc7e38ee8d7e426cd31853039679b
+Author: peter_vanroose <peter_vanroose@4b17d0e5-ac7a-4109-a8ed-6b3c4e86a14a>
+Date:   Fri Nov 16 12:43:57 2012 +0000
+
+    moved the backward compatibility #defines (vnl_math_floor etc. for vnl_math::floor etc.) inside #if VNL_CONFIG_LEGACY_METHODS; switching that option on will additionally trigger a "deprecated" compile warning
+    
+    git-svn-id: https://svn.code.sf.net/p/vxl/svn/trunk@36001 4b17d0e5-ac7a-4109-a8ed-6b3c4e86a14a
+
+diff --git a/core/vnl/vnl_math.h b/core/vnl/vnl_math.h
+index adb5fb4..34af06b 100644
+--- a/core/vnl/vnl_math.h
++++ b/core/vnl/vnl_math.h
+@@ -35,6 +35,7 @@
+ //   Amitha Perera - 13 Sep 2002 - make constant initialization standards compliant.
+ //   Peter Vanroose -22 Oct 2012 - was a class, now is a namespace
+ //                                 also renamed functions vnl_math_isnan etc. to vnl_math::isnan
++//   Peter Vanroose -15 Nov 2012 - the deprecated vnl_math_* #defines are now only available when VNL_CONFIG_LEGACY_METHODS==1
+ // \endverbatim
+ 
+ #include <vcl_cmath.h>
+@@ -44,6 +45,9 @@
+ #ifdef VNL_CHECK_FPU_ROUNDING_MODE
+ # include <vcl_cassert.h>
+ #endif
++#if VNL_CONFIG_LEGACY_METHODS
++# include <vcl_deprecated.h>
++#endif
+ 
+ // Figure out when the fast implementation can be used
+ #if VNL_CONFIG_ENABLE_SSE2_ROUNDING
+@@ -659,7 +663,7 @@ namespace vnl_math
+ 
+ } // end of namespace vnl_math
+ 
+-// Legacy definitions, for backward compatibility:
++#if VNL_CONFIG_LEGACY_METHODS // Legacy definitions, for backward compatibility; deprecated!
+ #define vnl_math_isnan vnl_math::isnan
+ #define vnl_math_isinf vnl_math::isinf
+ #define vnl_math_isfinite vnl_math::isfinite
+@@ -678,5 +682,6 @@ namespace vnl_math
+ #define vnl_math_squared_magnitude vnl_math::squared_magnitude
+ #define vnl_math_cuberoot vnl_math::cuberoot
+ #define vnl_math_hypot vnl_math::hypot
++#endif // VNL_CONFIG_LEGACY_METHODS
+ 
+ #endif // vnl_math_h_
diff --git a/changelog b/changelog
deleted file mode 100644
index 6b9f2cf..0000000
--- a/changelog
+++ /dev/null
@@ -1,203 +0,0 @@
-* Tue Nov 15 2022 Sandro Mani <manisandro@gmail.com> - 2.0.2-15
-- Rebuild (minizip-ng)
-
-* Sat Jul 23 2022 Fedora Release Engineering <releng@fedoraproject.org> - 2.0.2-14
-- Rebuilt for https://fedoraproject.org/wiki/Fedora_37_Mass_Rebuild
-
-* Sat Jan 22 2022 Fedora Release Engineering <releng@fedoraproject.org> - 2.0.2-13
-- Rebuilt for https://fedoraproject.org/wiki/Fedora_36_Mass_Rebuild
-
-* Fri Jul 23 2021 Fedora Release Engineering <releng@fedoraproject.org> - 2.0.2-12
-- Rebuilt for https://fedoraproject.org/wiki/Fedora_35_Mass_Rebuild
-
-* Tue Feb 09 2021 Miro HronÄŤok <mhroncok@redhat.com> - 2.0.2-11
-- Rebuilt for minizip 3.0.0
-
-* Wed Jan 27 2021 Fedora Release Engineering <releng@fedoraproject.org> - 2.0.2-10
-- Rebuilt for https://fedoraproject.org/wiki/Fedora_34_Mass_Rebuild
-
-* Sat Oct 17 2020 Jeff Law <law@redhat.com> - 2.0.2-9
-- Fix missing #includes for gcc-11
-
-* Mon Jul 27 2020 Ankur Sinha <ankursinha AT fedoraproject DOT org> - 2.0.2-8
-- Rebuild for libdc1394 soname bump
-
-* Fri Jan 31 2020 Fedora Release Engineering <releng@fedoraproject.org> - 2.0.2-7
-- Rebuilt for https://fedoraproject.org/wiki/Fedora_32_Mass_Rebuild
-
-* Sun Sep 15 2019 Ankur Sinha <ankursinha AT fedoraproject DOT org> - 2.0.2-6
-- Fix failing build: update patch to fix minizip include
-
-* Sat Jul 27 2019 Fedora Release Engineering <releng@fedoraproject.org> - 2.0.2-5
-- Rebuilt for https://fedoraproject.org/wiki/Fedora_31_Mass_Rebuild
-
-* Tue May 28 2019 Ankur Sinha <ankursinha AT fedoraproject DOT org> - 2.0.2-4
-- Remove obsolete boxm library (was also causing arm build to fail)
-- Remove obsolete octree library
-
-* Tue May 28 2019 Ankur Sinha <ankursinha AT fedoraproject DOT org> - 2.0.2-3
-- Fix 32 bit arch builds: https://github.com/vxl/vxl/issues/638
-- Remove invalid comments
-- Do not make docs require the base package
-
-* Fri Apr 26 2019 Ankur Sinha <ankursinha AT fedoraproject DOT org> - 2.0.2-2
-- Add complete file list
-- Remove no longer needed BR: klt
-- Remove more unneeded patches
-- Add patch to include FindRPLY.cmake
-- Use system shapelib and expat
-- More patches to complete build
-- Document failing tests, do not let them fail build
-
-* Fri Apr 19 2019 Ankur Sinha <ankursinha AT fedoraproject DOT org> - 2.0.2-2
-- Enable OUL---why was it disabled?
-- Remove rply include patch: build seems to find it just fine.
-- Remove uneeded rply function call fix patch.
-- Remove Coin3D cmake config patch---included in cmake distribution now.
-- Remove SIMVoleon cmake patch---seems to find it just fine.
-- Correct CMake flags.
-- Enable BRL build
-- add Python BR
-- Add expatpp bits manually
-- File upstream issue and use bundled openjpeg2: https://github.com/vxl/vxl/issues/627
-- Remove unneeded xerces BR, and corresponding patch.
-
-* Thu Apr 18 2019 Ankur Sinha <ankursinha AT fedoraproject DOT org> - 2.0.2-1
-- Update to latest upstream release
-- Temporarily use bundled dcmtk (https://github.com/vxl/vxl/issues/550)
-- Use new github upstream
-- Remove uneeded patches
-- Explicitly list all shared objects
-
-* Sat Mar 09 2019 Antonio Trande <sagitterATfedoraproject.org> - 1.17.0-31
-- Rebuild for dcmtk-3.6.4
-
-* Sun Feb 17 2019 Ankur Sinha <ankursinha AT fedoraproject DOT org> - 1.17.0-30
-- Use autosetup macro
-- Remove whitespaces, use space instead of tabs for cleanliness
-
-* Sun Feb 03 2019 Fedora Release Engineering <releng@fedoraproject.org> - 1.17.0-29
-- Rebuilt for https://fedoraproject.org/wiki/Fedora_30_Mass_Rebuild
-
-* Tue Aug 28 2018 Patrik NovotnĂ˝ <panovotn@redhat.com> - 1.17.0-28
-- change requires to minizip-compat(-devel), rhbz#1609830, rhbz#1615381
-
-* Sat Jul 14 2018 Fedora Release Engineering <releng@fedoraproject.org> - 1.17.0-27
-- Rebuilt for https://fedoraproject.org/wiki/Fedora_29_Mass_Rebuild
-
-* Wed Mar 07 2018 Adam Williamson <awilliam@redhat.com> - 1.17.0-26
-- Rebuild to fix GCC 8 mis-compilation
-  See https://da.gd/YJVwk ("GCC 8 ABI change on x86_64")
-
-* Fri Feb 09 2018 Fedora Release Engineering <releng@fedoraproject.org> - 1.17.0-25
-- Rebuilt for https://fedoraproject.org/wiki/Fedora_28_Mass_Rebuild
-
-* Thu Aug 03 2017 Fedora Release Engineering <releng@fedoraproject.org> - 1.17.0-24
-- Rebuilt for https://fedoraproject.org/wiki/Fedora_27_Binutils_Mass_Rebuild
-
-* Thu Jul 27 2017 Fedora Release Engineering <releng@fedoraproject.org> - 1.17.0-23
-- Rebuilt for https://fedoraproject.org/wiki/Fedora_27_Mass_Rebuild
-
-* Mon May 15 2017 Fedora Release Engineering <rel-eng@lists.fedoraproject.org> - 1.17.0-22
-- Rebuilt for https://fedoraproject.org/wiki/Fedora_26_27_Mass_Rebuild
-
-* Sat Feb 11 2017 Fedora Release Engineering <releng@fedoraproject.org> - 1.17.0-21
-- Rebuilt for https://fedoraproject.org/wiki/Fedora_26_Mass_Rebuild
-
-* Thu Feb 25 2016 Tom Callaway <spot@fedoraproject.org> - 1.17.0-20
-- remove non-free lena image file from source tarball (bz1310388)
-- fix FTBFS (bz1303695, bz1308234)
-
-* Fri Feb 05 2016 Fedora Release Engineering <releng@fedoraproject.org> - 1.17.0-19
-- Rebuilt for https://fedoraproject.org/wiki/Fedora_24_Mass_Rebuild
-
-* Fri Jun 19 2015 Fedora Release Engineering <rel-eng@lists.fedoraproject.org> - 1.17.0-18
-- Rebuilt for https://fedoraproject.org/wiki/Fedora_23_Mass_Rebuild
-
-* Sat May 16 2015 Sebastian Pölsterl <sebp@k-d-w.org> - 1.17.0-17
-- Rebuilt using hardened build flags: https://fedoraproject.org/wiki/Changes/Harden_All_Packages
-
-* Mon Feb 16 2015 Ralf Corsépius <corsepiu@fedoraproject.org> - 0.17.0-16
-- Add vxl-0.17.0-gcc5.diff (Work-around GCC-5.0.0 FTBFS RHBZ#1192886).
-- Fix bogus %%changelog date.
-
-* Mon Aug 25 2014 Devrim GĂĽndĂĽz <devrim@gunduz.org> - 1.17.0-15
-- Rebuilt for libgeotiff
-
-* Mon Aug 18 2014 Fedora Release Engineering <rel-eng@lists.fedoraproject.org> - 1.17.0-14
-- Rebuilt for https://fedoraproject.org/wiki/Fedora_21_22_Mass_Rebuild
-
-* Sun Jun 08 2014 Fedora Release Engineering <rel-eng@lists.fedoraproject.org> - 1.17.0-13
-- Rebuilt for https://fedoraproject.org/wiki/Fedora_21_Mass_Rebuild
-
-* Sun Aug 04 2013 Fedora Release Engineering <rel-eng@lists.fedoraproject.org> - 1.17.0-12
-- Rebuilt for https://fedoraproject.org/wiki/Fedora_20_Mass_Rebuild
-
-* Mon Mar 04 2013 Mario Ceresa mrceresa fedoraproject org vxl 1.17.0-11
-- Applied upstream patches (25, 26) to ensure compatibility with ITK
-
-* Fri Feb 15 2013 Fedora Release Engineering <rel-eng@lists.fedoraproject.org> - 1.17.0-10
-- Rebuilt for https://fedoraproject.org/wiki/Fedora_19_Mass_Rebuild
-
-* Mon Jan 21 2013 Adam Tkac <atkac redhat com> - 1.17.0-9
-- rebuild due to "jpeg8-ABI" feature drop
-
-* Wed Dec 05 2012 Dan Horák <dan[at]danny.cz> - 1.17.0-8
-- fix build on non-x86 arches
-
-* Sun Nov 25 2012 Mario Ceresa mrceresa fedoraproject org vxl 1.17.0-7%{?dist}
-- Changed source0 path to point to vxl 1.17
-- Added missing sonames
-
-* Fri Nov 02 2012 Mario Ceresa mrceresa fedoraproject org vxl 1.17.0-6%{?dist}
-- Patched to build BRL
-- Updated to last version
-
-* Mon Oct 29 2012 Mario Ceresa mrceresa fedoraproject org vxl 1.17.0-5%{?dist}
-- Removed expatpp bundled library and added corresponding BR
-- Removed bundled bzip
-
-
-* Thu Oct 18 2012 Mario Ceresa mrceresa fedoraproject org vxl 1.17.0-4%{?dist}
-- Fixed missing oxl_vrml lib
-- Turn on compilation of BRL
-
-* Sun Oct 14 2012 Mario Ceresa mrceresa fedoraproject org vxl 1.17.0-3%{?dist}
-- More fixes from Volker's post https://bugzilla.redhat.com/show_bug.cgi?id=567086#c42
-
-* Wed Oct 10 2012 Mario Ceresa mrceresa fedoraproject org vxl 1.17.0-2%{?dist}
-- Added patches 12-16 from https://bugzilla.redhat.com/show_bug.cgi?id=567086#c42
-- Minor rework of the spec file as pointed out by Volker in the previous link
-
-* Wed Oct 10 2012 Mario Ceresa mrceresa fedoraproject org vxl 1.17.0-1%{?dist}
-- Updated to new version
-- Reworked patches to the new version
-- Disabled BRL because it gives a compilation error
-
-* Fri May 27 2011 Mario Ceresa mrceresa fedoraproject org vxl 1.14.0-1%{?dist}
-- Updated to new version
-- Added BR doxygen (thanks to Ankur for noticing it)
-- Changed patch naming schema
-- Work around a rply related bug (patches 3-6)
-- Thanks to Thomas Bouffon for patch 7-8
-- Patches 9-10 address http://www.itk.org/pipermail/insight-users/2010-July/037418.html
-- Fixed 70 missing sonames in patch 11
-- Removed bundled expact, shapelib, minizip, dcmtk
-- Force brl build
-- Use system shipped FindEXPAT
-
-
-* Tue Mar 23 2010 Mario Ceresa mrceresa fedoraproject org vxl 1.13.0-4%{?dist}
-- sed patch to add ${LIB_SUFFIX} to all lib install target
-- Added soname version info to vil vil_algo lib
-
-* Sun Mar 21 2010 Mario Ceresa mrceresa fedoraproject org vxl 1.13.0-3%{?dist}
-- Applied patch to build against newly packaged rply
-
-* Tue Mar 2 2010 Mario Ceresa mrceresa fedoraproject org vxl 1.13.0-2%{?dist}
-- Applied patch from debian distribution to force the generation of versioned lib
-
-* Fri Feb 19 2010 Mario Ceresa mrceresa fedoraproject org vxl 1.13.0-1%{?dist}
-- Initial RPM Release
-
-
diff --git a/licenses.txt b/licenses.txt
deleted file mode 100644
index eeb2b84..0000000
--- a/licenses.txt
+++ /dev/null
@@ -1,245 +0,0 @@
-# remove bits unbundled and removed in patches and run
-# licensecheck -r . | sed '/UNKNOWN/ d'
-
-# To get a list, run:
-# cat licenses.txt | grep -Ev "^#" | cut -d: -f2 | sort -u
-
-# additional notes on licenses below (also commented by starting line with #):
-
-./core/vxl_copyright.h: BSD 3-Clause License
-./vcl/vcl_atomic_count.h: Boost Software License 1.0
-./config/cmake/CodeCoverage.cmake: BSD 3-Clause License
-./core/vbl/vbl_checked_delete.h: NTP License
-./core/vbl/vbl_disjoint_sets.h: *No copyright* MIT License
-./core/vbl/vbl_scoped_ptr.h: NTP License
-./core/vul/vul_ios_state.h: Boost Software License 1.0
-./scripts/gitsetup/LICENSE: *No copyright* Apache License 2.0
-./scripts/gitsetup/README: *No copyright* Apache License 2.0
-./scripts/gitsetup/git-gerrit-push: Apache License 2.0
-./scripts/gitsetup/setup-gerrit: Apache License 2.0
-./scripts/gitsetup/setup-hooks: Apache License 2.0
-./scripts/gitsetup/setup-sourceforge: Apache License 2.0
-./scripts/gitsetup/setup-ssh: Apache License 2.0
-./scripts/gitsetup/setup-stage: Apache License 2.0
-./scripts/gitsetup/setup-user: Apache License 2.0
-./scripts/gitsetup/tips: Apache License 2.0
-./v3p/clipper/License.txt: *No copyright* Boost Software License 1.0
-./v3p/clipper/clipper.cpp: Boost Software License
-./v3p/clipper/clipper.hxx: Boost Software License
-./v3p/openjpeg2/bio.c: BSD 2-Clause License
-./v3p/openjpeg2/bio.h: BSD 2-Clause License
-./v3p/openjpeg2/cio.c: BSD 2-Clause License
-./v3p/openjpeg2/cio.h: BSD 2-Clause License
-./v3p/openjpeg2/dwt.c: BSD 2-Clause License
-./v3p/openjpeg2/dwt.h: BSD 2-Clause License
-./v3p/openjpeg2/event.c: BSD 2-Clause License
-./v3p/openjpeg2/event.h: BSD 2-Clause License
-./v3p/openjpeg2/fix.h: BSD 2-Clause License
-./v3p/openjpeg2/function_list.c: BSD 2-Clause License
-./v3p/openjpeg2/function_list.h: BSD 2-Clause License
-./v3p/openjpeg2/image.c: BSD 2-Clause License
-./v3p/openjpeg2/image.h: BSD 2-Clause License
-./v3p/openjpeg2/int.h: BSD 2-Clause License
-./v3p/openjpeg2/invert.c: BSD 2-Clause License
-./v3p/openjpeg2/invert.h: BSD 2-Clause License
-./v3p/openjpeg2/j2k.c: BSD 2-Clause License
-./v3p/openjpeg2/j2k.h: BSD 2-Clause License
-./v3p/openjpeg2/j2k_lib.c: BSD 2-Clause License
-./v3p/openjpeg2/j2k_lib.h: BSD 2-Clause License
-./v3p/openjpeg2/jp2.c: BSD 2-Clause License
-./v3p/openjpeg2/jp2.h: BSD 2-Clause License
-./v3p/openjpeg2/jpt.c: BSD 2-Clause License
-./v3p/openjpeg2/jpt.h: BSD 2-Clause License
-./v3p/openjpeg2/license.txt: BSD 2-Clause License
-./v3p/openjpeg2/mct.c: BSD 2-Clause License
-./v3p/openjpeg2/mct.h: BSD 2-Clause License
-./v3p/openjpeg2/mqc.c: BSD 2-Clause License
-./v3p/openjpeg2/mqc.h: BSD 2-Clause License
-./v3p/openjpeg2/openjpeg.c: BSD 2-Clause License
-./v3p/openjpeg2/openjpeg.h: BSD 2-Clause License
-./v3p/openjpeg2/opj_includes.h: BSD 2-Clause License
-./v3p/openjpeg2/opj_malloc.h: BSD 2-Clause License
-./v3p/openjpeg2/pi.c: BSD 2-Clause License
-./v3p/openjpeg2/pi.h: BSD 2-Clause License
-./v3p/openjpeg2/profile.c: BSD 2-Clause License
-./v3p/openjpeg2/profile.h: BSD 2-Clause License
-./v3p/openjpeg2/raw.c: BSD 2-Clause License
-./v3p/openjpeg2/raw.h: BSD 2-Clause License
-./v3p/openjpeg2/t1.c: BSD 2-Clause License
-./v3p/openjpeg2/t1.h: BSD 2-Clause License
-./v3p/openjpeg2/t2.c: BSD 2-Clause License
-./v3p/openjpeg2/t2.h: BSD 2-Clause License
-./v3p/openjpeg2/tcd.c: BSD 2-Clause License
-./v3p/openjpeg2/tcd.h: BSD 2-Clause License
-./v3p/openjpeg2/tgt.c: BSD 2-Clause License
-./v3p/openjpeg2/tgt.h: BSD 2-Clause License
-./vcl/internal/vcl_atomic_count_gcc.h: Boost Software License 1.0
-./vcl/internal/vcl_atomic_count_gcc_x86.h: Boost Software License 1.0
-./vcl/internal/vcl_atomic_count_pthreads.h: Boost Software License 1.0
-./vcl/internal/vcl_atomic_count_solaris.h: Boost Software License 1.0
-./vcl/internal/vcl_atomic_count_sync.h: Boost Software License 1.0
-./vcl/internal/vcl_atomic_count_win32.h: Boost Software License 1.0
-./vcl/internal/vcl_interlocked.h: Boost Software License 1.0
-./contrib/rpl/rgtl/CMakeLists.txt: Boost Software License 1.0
-./contrib/rpl/rgtl/rgtl_compact_tree.h: Boost Software License 1.0
-./contrib/rpl/rgtl/rgtl_compact_tree.hxx: Boost Software License 1.0
-./contrib/rpl/rgtl/rgtl_compact_tree_data_fixed.h: Boost Software License 1.0
-./contrib/rpl/rgtl/rgtl_compact_tree_index.h: Boost Software License 1.0
-./contrib/rpl/rgtl/rgtl_compact_tree_link.h: Boost Software License 1.0
-./contrib/rpl/rgtl/rgtl_compact_tree_node_data.h: Boost Software License 1.0
-./contrib/rpl/rgtl/rgtl_compact_tree_policy.h: Boost Software License 1.0
-./contrib/rpl/rgtl/rgtl_config.h: Boost Software License 1.0
-./contrib/rpl/rgtl/rgtl_license_1_0.txt: *No copyright* Boost Software License 1.0
-./contrib/rpl/rgtl/rgtl_meta.h: Boost Software License 1.0
-./contrib/rpl/rgtl/rgtl_object_array.h: Boost Software License 1.0
-./contrib/rpl/rgtl/rgtl_object_array_points.h: Boost Software License 1.0
-./contrib/rpl/rgtl/rgtl_object_array_points.hxx: Boost Software License 1.0
-./contrib/rpl/rgtl/rgtl_object_array_triangles_3d.cxx: Boost Software License 1.0
-./contrib/rpl/rgtl/rgtl_object_array_triangles_3d.h: Boost Software License 1.0
-./contrib/rpl/rgtl/rgtl_object_closest_polygon_3d.h: Boost Software License 1.0
-./contrib/rpl/rgtl/rgtl_object_once.cxx: Boost Software License 1.0
-./contrib/rpl/rgtl/rgtl_object_once.h: Boost Software License 1.0
-./contrib/rpl/rgtl/rgtl_octree_cell_bounds.h: Boost Software License 1.0
-./contrib/rpl/rgtl/rgtl_octree_cell_bounds.hxx: Boost Software License 1.0
-./contrib/rpl/rgtl/rgtl_octree_cell_geometry.h: Boost Software License 1.0
-./contrib/rpl/rgtl/rgtl_octree_cell_geometry.hxx: Boost Software License 1.0
-./contrib/rpl/rgtl/rgtl_octree_cell_location.h: Boost Software License 1.0
-./contrib/rpl/rgtl/rgtl_octree_cell_location.hxx: Boost Software License 1.0
-./contrib/rpl/rgtl/rgtl_octree_data_fixed.h: Boost Software License 1.0
-./contrib/rpl/rgtl/rgtl_octree_data_fixed.hxx: Boost Software License 1.0
-./contrib/rpl/rgtl/rgtl_octree_dual.h: Boost Software License 1.0
-./contrib/rpl/rgtl/rgtl_octree_dual_element.h: Boost Software License 1.0
-./contrib/rpl/rgtl/rgtl_octree_dual_index.h: Boost Software License 1.0
-./contrib/rpl/rgtl/rgtl_octree_dual_location.h: Boost Software License 1.0
-./contrib/rpl/rgtl/rgtl_octree_dual_visit.h: Boost Software License 1.0
-./contrib/rpl/rgtl/rgtl_octree_objects.h: Boost Software License 1.0
-./contrib/rpl/rgtl/rgtl_octree_objects.hxx: Boost Software License 1.0
-./contrib/rpl/rgtl/rgtl_octree_point_location.h: Boost Software License 1.0
-./contrib/rpl/rgtl/rgtl_octree_point_location.hxx: Boost Software License 1.0
-./contrib/rpl/rgtl/rgtl_separating_axis.h: Boost Software License 1.0
-./contrib/rpl/rgtl/rgtl_separating_axis_projection.h: Boost Software License 1.0
-./contrib/rpl/rgtl/rgtl_serialize.txt: Boost Software License 1.0
-./contrib/rpl/rgtl/rgtl_serialize_access.h: Boost Software License 1.0
-./contrib/rpl/rgtl/rgtl_serialize_base.h: Boost Software License 1.0
-./contrib/rpl/rgtl/rgtl_serialize_direction.h: Boost Software License 1.0
-./contrib/rpl/rgtl/rgtl_serialize_istream.cxx: Boost Software License 1.0
-./contrib/rpl/rgtl/rgtl_serialize_istream.h: Boost Software License 1.0
-./contrib/rpl/rgtl/rgtl_serialize_ostream.cxx: Boost Software License 1.0
-./contrib/rpl/rgtl/rgtl_serialize_ostream.h: Boost Software License 1.0
-./contrib/rpl/rgtl/rgtl_serialize_split.h: Boost Software License 1.0
-./contrib/rpl/rgtl/rgtl_serialize_stl_vector.h: Boost Software License 1.0
-./contrib/rpl/rgtl/rgtl_serialize_vnl_double_3.h: Boost Software License 1.0
-./contrib/rpl/rgtl/rgtl_serialize_vnl_vector_fixed.h: Boost Software License 1.0
-./contrib/rpl/rgtl/rgtl_sqt_base.cxx: Boost Software License 1.0
-./contrib/rpl/rgtl/rgtl_sqt_base.h: Boost Software License 1.0
-./contrib/rpl/rgtl/rgtl_sqt_cell_bounds.h: Boost Software License 1.0
-./contrib/rpl/rgtl/rgtl_sqt_cell_bounds.hxx: Boost Software License 1.0
-./contrib/rpl/rgtl/rgtl_sqt_cell_geometry.h: Boost Software License 1.0
-./contrib/rpl/rgtl/rgtl_sqt_cell_geometry.hxx: Boost Software License 1.0
-./contrib/rpl/rgtl/rgtl_sqt_cell_location.h: Boost Software License 1.0
-./contrib/rpl/rgtl/rgtl_sqt_cell_location.hxx: Boost Software License 1.0
-./contrib/rpl/rgtl/rgtl_sqt_object_array.h: Boost Software License 1.0
-./contrib/rpl/rgtl/rgtl_sqt_object_array_triangles_3d.cxx: Boost Software License 1.0
-./contrib/rpl/rgtl/rgtl_sqt_object_array_triangles_3d.h: Boost Software License 1.0
-./contrib/rpl/rgtl/rgtl_sqt_objects.h: Boost Software License 1.0
-./contrib/rpl/rgtl/rgtl_sqt_objects.hxx: Boost Software License 1.0
-./contrib/rpl/rgtl/rgtl_sqt_space.h: Boost Software License 1.0
-./contrib/rpl/rgtl/rgtl_sqt_space.hxx: Boost Software License 1.0
-./contrib/rpl/rgtl/rgtl_static_assert.h: Boost Software License 1.0
-./contrib/rpl/rgtl/rgtl_tagged_index.h: Boost Software License 1.0
-./contrib/rpl/rgtl/rgtl_tagged_vector.h: Boost Software License 1.0
-./contrib/rpl/rtvl/CMakeLists.txt: Boost Software License 1.0
-./contrib/rpl/rtvl/rtvl_intpow.h: Boost Software License 1.0
-./contrib/rpl/rtvl/rtvl_license_1_0.txt: *No copyright* Boost Software License 1.0
-./contrib/rpl/rtvl/rtvl_refine.h: Boost Software License 1.0
-./contrib/rpl/rtvl/rtvl_refine.hxx: Boost Software License 1.0
-./contrib/rpl/rtvl/rtvl_tensor.h: Boost Software License 1.0
-./contrib/rpl/rtvl/rtvl_tensor.hxx: Boost Software License 1.0
-./contrib/rpl/rtvl/rtvl_tensor_d.h: Boost Software License 1.0
-./contrib/rpl/rtvl/rtvl_tensor_d.hxx: Boost Software License 1.0
-./contrib/rpl/rtvl/rtvl_terms.h: Boost Software License 1.0
-./contrib/rpl/rtvl/rtvl_tokens.h: Boost Software License 1.0
-./contrib/rpl/rtvl/rtvl_vote.h: Boost Software License 1.0
-./contrib/rpl/rtvl/rtvl_vote.hxx: Boost Software License 1.0
-./contrib/rpl/rtvl/rtvl_votee.h: Boost Software License 1.0
-./contrib/rpl/rtvl/rtvl_votee.hxx: Boost Software License 1.0
-./contrib/rpl/rtvl/rtvl_votee_d.h: Boost Software License 1.0
-./contrib/rpl/rtvl/rtvl_votee_d.hxx: Boost Software License 1.0
-./contrib/rpl/rtvl/rtvl_voter.h: Boost Software License 1.0
-./contrib/rpl/rtvl/rtvl_voter.hxx: Boost Software License 1.0
-./contrib/rpl/rtvl/rtvl_weight.h: Boost Software License 1.0
-./contrib/rpl/rtvl/rtvl_weight_original.h: Boost Software License 1.0
-./contrib/rpl/rtvl/rtvl_weight_original.hxx: Boost Software License 1.0
-./contrib/rpl/rtvl/rtvl_weight_smooth.h: Boost Software License 1.0
-./contrib/rpl/rtvl/rtvl_weight_smooth.hxx: Boost Software License 1.0
-./core/doc/book/chapter_vnl.texi: *No copyright* Public domain
-./core/vil/file_formats/viffheader.h.original: NTP License (legal disclaimer)
-./core/vil/file_formats/vil_viffheader.h: NTP License (legal disclaimer)
-./core/vil1/file_formats/vil1_viff_support.c: NTP License (legal disclaimer)
-./core/vil1/file_formats/vil1_viffheader.h: NTP License (legal disclaimer)
-./v3p/netlib/libf2c/Notice: Standard ML of New Jersey License
-./v3p/netlib/libf2c/arithchk.c: Standard ML of New Jersey License
-./v3p/netlib/linalg/lsmrBase.cxx: Apache License 2.0
-./v3p/netlib/linalg/lsmrBase.h: Apache License 2.0
-./v3p/netlib/linalg/lsmrDense.cxx: Apache License 2.0
-./v3p/netlib/linalg/lsmrDense.h: Apache License 2.0
-./v3p/netlib/linalg/lsqrBase.cxx: Apache License 2.0
-./v3p/netlib/linalg/lsqrBase.h: Apache License 2.0
-./v3p/netlib/linalg/lsqrDense.cxx: Apache License 2.0
-./v3p/netlib/linalg/lsqrDense.h: Apache License 2.0
-./v3p/netlib/tests/lsmrTest2.cxx: Apache License 2.0
-./v3p/netlib/tests/lsqrTest1.cxx: Apache License 2.0
-./v3p/netlib/tests/lsqrTest2.cxx: Apache License 2.0
-./v3p/netlib/tests/tricall.c: *No copyright* Public domain
-./contrib/brl/bbas/bjson/bjsoncpp.cxx: MIT License
-./contrib/brl/bbas/bjson/jsoncpp.cxx: MIT License
-./contrib/brl/bbas/bnabo/bnabo.cxx: BSD 3-Clause License
-./contrib/brl/bbas/bnabo/bnabo.h: BSD 3-Clause License
-./contrib/brl/bbas/bnabo/bnabo_brute_force.cxx: BSD 3-Clause License
-./contrib/brl/bbas/bnabo/bnabo_index_heap.h: BSD 3-Clause License
-./contrib/brl/bbas/bnabo/bnabo_kdd_tree.cxx: BSD 3-Clause License
-./contrib/brl/bbas/bnabo/bnabo_private.h: BSD 3-Clause License
-./contrib/mul/doc/book/atexinfo.tex: GNU General Public License v2.0 or later
-./contrib/rpl/rgtl/tests/CMakeLists.txt: Boost Software License 1.0
-./contrib/rpl/rgtl/tests/test_compact_tree_data_fixed.cxx: Boost Software License 1.0
-./contrib/rpl/rgtl/tests/test_driver.cxx: Boost Software License 1.0
-./contrib/rpl/rgtl/tests/test_octree_data_fixed.cxx: Boost Software License 1.0
-./contrib/rpl/rgtl/tests/test_octree_dual_visit.cxx: Boost Software License 1.0
-./contrib/rpl/rgtl/tests/test_octree_objects.cxx: Boost Software License 1.0
-./contrib/rpl/rgtl/tests/test_sqt_base.cxx: Boost Software License 1.0
-./contrib/rpl/rtvl/Templates/rtvl_refine+2-.cxx: Boost Software License 1.0
-./contrib/rpl/rtvl/Templates/rtvl_refine+3-.cxx: Boost Software License 1.0
-./contrib/rpl/rtvl/Templates/rtvl_tensor+2-.cxx: Boost Software License 1.0
-./contrib/rpl/rtvl/Templates/rtvl_tensor+3-.cxx: Boost Software License 1.0
-./contrib/rpl/rtvl/Templates/rtvl_tensor_d+2-.cxx: Boost Software License 1.0
-./contrib/rpl/rtvl/Templates/rtvl_tensor_d+3-.cxx: Boost Software License 1.0
-./contrib/rpl/rtvl/Templates/rtvl_vote+2-.cxx: Boost Software License 1.0
-./contrib/rpl/rtvl/Templates/rtvl_vote+3-.cxx: Boost Software License 1.0
-./contrib/rpl/rtvl/Templates/rtvl_votee+2-.cxx: Boost Software License 1.0
-./contrib/rpl/rtvl/Templates/rtvl_votee+3-.cxx: Boost Software License 1.0
-./contrib/rpl/rtvl/Templates/rtvl_votee_d+2-.cxx: Boost Software License 1.0
-./contrib/rpl/rtvl/Templates/rtvl_votee_d+3-.cxx: Boost Software License 1.0
-./contrib/rpl/rtvl/Templates/rtvl_voter+2-.cxx: Boost Software License 1.0
-./contrib/rpl/rtvl/Templates/rtvl_voter+3-.cxx: Boost Software License 1.0
-./contrib/rpl/rtvl/Templates/rtvl_weight_original+2-.cxx: Boost Software License 1.0
-./contrib/rpl/rtvl/Templates/rtvl_weight_original+3-.cxx: Boost Software License 1.0
-./contrib/rpl/rtvl/Templates/rtvl_weight_smooth+2-.cxx: Boost Software License 1.0
-./contrib/rpl/rtvl/Templates/rtvl_weight_smooth+3-.cxx: Boost Software License 1.0
-./contrib/rpl/rtvl/examples/rtvl_hello.cxx: Boost Software License 1.0
-./contrib/rpl/rtvl/examples/rtvl_saliency_image.cxx: Boost Software License 1.0
-./contrib/tbl/doc/book/atexinfo.tex: GNU General Public License v2.0 or later
-./v3p/dcmtk/ofstd/libsrc/ofstd.cxx: BSD 3-Clause License and/or NTP License
-
-./contrib/brl/bbas/bil/algo/bil_edt.h: *No copyright* GNU Lesser General Public License [generated file]
-# ^
-# Not under this license. The text says:
-# //  Implementation influenced by the LTI lib, which is licensed under LGPL:
-# //    http://ltilib.sourceforge.net
-
-./contrib/brl/bseg/boxm2/doc/book/atexinfo.tex: GNU General Public License v2.0 or later
-./contrib/brl/bseg/boxm2/ocl/exe/auxiliary/js/jquery.cookie-min.js: MIT License
-./contrib/brl/bseg/boxm2/ocl/exe/auxiliary/js/jquery.disabletextselect-min.js: MIT License
-./contrib/brl/bseg/boxm2/ocl/exe/auxiliary/js/jquery.min.js: MIT License
-./contrib/brl/bseg/boxm2/ocl/exe/auxiliary/js/jquery.mousewheel-min.js: MIT License
-./contrib/brl/bseg/boxm2/ocl/exe/auxiliary/js/jquery.reel-min.js: MIT License
-./contrib/brl/bseg/boxm2/ocl/exe/auxiliary/js/miniZoomPan.js: *No copyright* MIT License
diff --git a/sources b/sources
index c1c5d82..90f5730 100644
--- a/sources
+++ b/sources
@@ -1 +1 @@
-SHA512 (vxl-3.5.0-clean.tar.gz) = cb5eaf88e689216b9de56f9a9e07e2a6a8ce4469d0b990f847e8f1060b0a0d6e621ef128c9878a26cef8816b0efd7e99bcca8bc65a43e091f3650158425ebde9
+99b44265df5a638b7757135cb4f10166  vxl-1.17.0-clean.tar.gz
diff --git a/vxl-0.17.0-gcc5.diff b/vxl-0.17.0-gcc5.diff
new file mode 100644
index 0000000..5fc0270
--- /dev/null
+++ b/vxl-0.17.0-gcc5.diff
@@ -0,0 +1,13 @@
+--- vxl-git4e07960/vcl/vcl_compiler.h~	2012-11-02 12:08:21.000000000 +0100
++++ vxl-git4e07960/vcl/vcl_compiler.h	2015-02-15 13:50:46.376329878 +0100
+@@ -119,6 +119,10 @@
+ #  else
+ #   define VCL_GCC_40
+ #  endif
++# elif (__GNUC__== 5)
++// pretend GCC 5 to be GCC 4
++#  define VCL_GCC_4
++#  define VCL_GCC_41
+ # else
+ #  error "Dunno about this gcc"
+ # endif
diff --git a/vxl-1.17.0-gcc6.patch b/vxl-1.17.0-gcc6.patch
new file mode 100644
index 0000000..e12330e
--- /dev/null
+++ b/vxl-1.17.0-gcc6.patch
@@ -0,0 +1,70 @@
+diff -up vxl-git4e07960/core/vnl/io/CMakeLists.txt.gcc6 vxl-git4e07960/core/vnl/io/CMakeLists.txt
+--- vxl-git4e07960/core/vnl/io/CMakeLists.txt.gcc6	2016-02-25 15:41:15.829447406 -0500
++++ vxl-git4e07960/core/vnl/io/CMakeLists.txt	2016-02-25 15:41:29.558366867 -0500
+@@ -22,7 +22,7 @@ AUX_SOURCE_DIRECTORY(Templates vnl_io_so
+ IF(CMAKE_COMPILER_IS_GNUCXX)
+   SET_SOURCE_FILES_PROPERTIES(Templates/vsl_vector_io+vcl_vector+vcl_vector+vnl_vector+double----.cxx
+                               PROPERTIES
+-                              COMPILE_FLAGS -ftemplate-depth-35)
++                              COMPILE_FLAGS -ftemplate-depth=70)
+ ENDIF(CMAKE_COMPILER_IS_GNUCXX)
+ 
+ ADD_LIBRARY(vnl_io ${vnl_io_sources} )
+diff -up vxl-git4e07960/core/vul/vul_psfile.h.gcc6 vxl-git4e07960/core/vul/vul_psfile.h
+--- vxl-git4e07960/core/vul/vul_psfile.h.gcc6	2012-11-02 07:08:21.000000000 -0400
++++ vxl-git4e07960/core/vul/vul_psfile.h	2016-02-25 15:27:18.435360448 -0500
+@@ -37,7 +37,7 @@ class vul_psfile: public vcl_ofstream
+ 
+   vul_psfile(char const* filename, bool debug_output=false);
+   ~vul_psfile();
+-  operator bool() { return (void*)output_filestream!=(void*)0; }
++  operator bool() { return reinterpret_cast<void*>(&output_filestream)!=(void*)0; }
+ 
+   void set_paper_type(vul_psfile::paper_type type){printer_paper_type = type;}
+   void set_paper_layout(vul_psfile::paper_layout layout) {printer_paper_layout = layout;}
+diff -up vxl-git4e07960/vcl/vcl_compiler.h.gcc6 vxl-git4e07960/vcl/vcl_compiler.h
+--- vxl-git4e07960/vcl/vcl_compiler.h.gcc6	2016-02-25 15:10:56.252121833 -0500
++++ vxl-git4e07960/vcl/vcl_compiler.h	2016-02-25 15:10:56.254121822 -0500
+@@ -119,8 +119,8 @@
+ #  else
+ #   define VCL_GCC_40
+ #  endif
+-# elif (__GNUC__== 5)
+-// pretend GCC 5 to be GCC 4
++# elif (__GNUC__>5)
++// pretend GCC 5+ to be GCC 4
+ #  define VCL_GCC_4
+ #  define VCL_GCC_41
+ # else
+diff -up vxl-git4e07960/contrib/mul/tools/crop_image_2d.cxx.gcc6 vxl-git4e07960/contrib/mul/tools/crop_image_2d.cxx
+--- vxl-git4e07960/contrib/mul/tools/crop_image_2d.cxx.gcc6	2016-02-25 16:34:20.892977826 -0500
++++ vxl-git4e07960/contrib/mul/tools/crop_image_2d.cxx	2016-02-25 17:23:52.435971926 -0500
+@@ -15,6 +15,12 @@
+ #include <vul/vul_string.h>
+ #include <vgl/vgl_point_2d.h>
+ 
++// not at all sure this is right, but it gets this past gcc 6.
++
++vcl_ostream& operator <<( vcl_ostream &a, vcl_ostream &b) {
++a << b;
++return a;
++}
+ 
+ //=========================================================================
+ // Static function to create a static logger when first required
+diff -up vxl-git4e07960/contrib/mul/tools/crop_image_3d.cxx.gcc6 vxl-git4e07960/contrib/mul/tools/crop_image_3d.cxx
+--- vxl-git4e07960/contrib/mul/tools/crop_image_3d.cxx.gcc6	2016-02-25 17:15:12.591046600 -0500
++++ vxl-git4e07960/contrib/mul/tools/crop_image_3d.cxx	2016-02-25 17:24:15.283836790 -0500
+@@ -19,6 +19,12 @@
+ #include <vgl/vgl_point_3d.h>
+ #include <vgl/vgl_box_3d.h>
+ 
++// not at all sure this is right, but it gets this past gcc 6.
++
++vcl_ostream& operator <<( vcl_ostream &a, vcl_ostream &b) {
++  a << b;
++  return a;
++}
+ 
+ //=========================================================================
+ // Static function to create a static logger when first required
diff --git a/vxl-1.17.0-secondary.patch b/vxl-1.17.0-secondary.patch
new file mode 100644
index 0000000..39e7e6e
--- /dev/null
+++ b/vxl-1.17.0-secondary.patch
@@ -0,0 +1,30 @@
+diff -up vxl-git4e07960/core/vil/vil_round.h.secondary vxl-git4e07960/core/vil/vil_round.h
+--- vxl-git4e07960/core/vil/vil_round.h.secondary	2012-12-05 08:23:37.072384920 -0500
++++ vxl-git4e07960/core/vil/vil_round.h	2012-12-05 08:24:06.682385737 -0500
+@@ -25,9 +25,8 @@
+ # endif
+ #endif
+ 
+-// Turn on fast impl when using GCC on Intel-based machines with the following exception:
+-//   PPC with Mac OS X
+-#if defined(__GNUC__) && (!defined(__APPLE__)  || !defined(__ppc__) )
++// Turn on fast impl when using GCC on Intel-based machines
++#if defined(__GNUC__) && (defined(__i386__)  || defined(__x86_64__) )
+ # define GCC_USE_FAST_IMPL 1
+ #else
+ # define GCC_USE_FAST_IMPL 0
+diff -up vxl-git4e07960/core/vnl/vnl_math.h.secondary vxl-git4e07960/core/vnl/vnl_math.h
+--- vxl-git4e07960/core/vnl/vnl_math.h.secondary	2012-12-05 08:12:25.282386747 -0500
++++ vxl-git4e07960/core/vnl/vnl_math.h	2012-12-05 08:13:05.142387632 -0500
+@@ -53,9 +53,8 @@
+ #   include <emmintrin.h> // sse 2 intrinsics
+ # endif
+ #endif
+-// Turn on fast impl when using GCC on Intel-based machines with the following exception:
+-//   PPC with Mac OS X
+-#if defined(__GNUC__) && (!defined(__APPLE__)  || !defined(__ppc__) )
++// Turn on fast impl when using GCC on Intel-based machines
++#if defined(__GNUC__) && (defined(__i386__)  || defined(__x86_64__))
+ # define GCC_USE_FAST_IMPL 1
+ #else
+ # define GCC_USE_FAST_IMPL 0
diff --git a/vxl.spec b/vxl.spec
index 2b71ec8..6c9aadc 100644
--- a/vxl.spec
+++ b/vxl.spec
@@ -1,126 +1,109 @@
-%undefine __cmake_in_source_build
-
-# shared objects version: API
-%global major 3
-%global minor 5
-%global patch 0
-
-Name:       vxl
-Version:    3.5.0
-Release:    %autorelease
-Summary:    C++ Libraries for Computer Vision Research and Implementation
-
-# see licenses.txt for a complete break down of licenses (using licensecheck)
-# other licenses are not included because the files they refer to are not used/included in our build
-License:    BSD-3-Clause AND NTP AND BSL-1.0 AND BSD-2-Clause AND MIT AND Apache-2.0 AND LicenseRef-Fedora-Public-Domain AND SMLNJ
-
-# https://fedoraproject.org/wiki/Changes/EncourageI686LeafRemoval
-ExcludeArch: %{ix86}
-
-URL:        https://vxl.github.io/
+Name:		vxl	
+Version:	1.17.0	
+Release:	24%{?dist}
+Summary:	C++ Libraries for Computer Vision Research and Implementation
+Group:		Development/Libraries
+License:	BSD
+URL:		http://vxl.sourceforge.net/
 # Need to remove the non-free lena image from the sources
-# tar xf vxl-%%{version}.tar.gz
-# rm -rf vxl-%%{version}/contrib/prip/vdtop/tests/lena.org.pgm
-# tar cfz vxl-%%{version}-clean.tar.gz vxl-%%{version}/
-#Source0:  https://github.com/vxl/vxl/archive/v%%{version}/%%{name}-%%{version}.tar.gz
-Source0:    %{name}-%{version}-clean.tar.gz
+# tar xf vxl-1.17.0.tar.gz
+# rm -rf vxl-git4e07960/contrib/prip/vdtop/tests/lena.org.pgm 
+# tar cfz vxl-1.17.0-clean.tar.gz vxl-git4e07960/
+# Source0:	http://downloads.sourceforge.net/project/vxl/vxl/1.17/vxl-1.17.0.tar.gz
+Source0:	%{name}-%{version}-clean.tar.gz
+Source2:	https://vxl.svn.sourceforge.net/svnroot/vxl/trunk/core/vxl_copyright.h
+# Fedora has a distribution-specific include dir
+Patch1:		0001-Added-include-path-for-geotiff.patch
+Patch2:		0002-Added-soname-info-for-core-libraries.patch
+# Use system rply and don't use mpeg2
+Patch3:		0003-Use-system-rply.patch
+Patch4:		0004-Added-more-soname.patch
+Patch5:		0005-Do-not-build-OUL.patch
+Patch6:		0006-BUG-rplyConfig.cmake-has-wrong-include-path.patch
+Patch7:		0007-Arguments-of-ply_open-and-create-changed.-Thanks-to-.patch
+Patch8:		0008-More-sonames.patch
+Patch9:		0009-Bumped-up-version-to-1.14.patch
+#TODO: Refers to contrib and is therefore not correct
+Patch10:	0010-Use-system-FindEXPAT.patch
+Patch11:	0011-Do-not-use-bundled-minizip.patch
+Patch12:	0012-Added-Coin3D-Submitted-by-Volker-Frohlich.patch
+Patch13:	0013-Added-SIMVoleon-Submitted-by-Volker-Frohlich.patch
+Patch14:	0014-Added-additional-search-path-for-xerces-Submitted-by.patch
+Patch15:	0015-Manage-KL-library-Submitted-by-Volker-Frohlich.patch
+Patch16:	0016-Manage-KL-library-2-2-Submitted-by-Volker-Frohlich.patch
+Patch17:	0017-Add-sonames-to-vpgl-lib.patch
+Patch18:	0018-Added-sonames-to-vgui-vidl-vpdl-Qv-libs.patch
+Patch19:	0019-Removed-box2m-which-requires-OpenCL-libraries.patch
+Patch20:	0020-Included-missing-vcl_cstdio.h-header.patch
+Patch21:	0021-Use-expatpp.h-which-is-provided-by-fedora-repos.patch
+Patch22:	0022-Include-missing-vcl_cstdio.h-header.patch
+Patch23:	0023-Remove-volm-because-of-error-in-function-prototype.patch
+Patch24:	0024-Added-missing-sonames-for-mvl2-and-vepl1.patch
+Patch25:	0025-Legacy-def1-r35963.patch
+Patch26:	0026-Legacy-def2-r36001.patch
 
-# Patches generated from tree here:
-# https://github.com/sanjayankur31/vxl/tree/fedora-3.5.0
-# use system rply and don't use mpeg2
-Patch:     0001-v3.5.0-unbundle-rply.patch
-Patch:     0002-v3.5.0-Use-Fedora-expat-and-expatpp.patch
-Patch:     0003-v3.5.0-Use-Fedora-minizip.patch
-Patch:     0004-v3.5.0-Add-cmake-module-to-find-RPLY.patch
-Patch:     0005-v3.5.0-fix-bkml-test.patch
-Patch:     0006-v3.5.0-Correct-rply-includedir.patch
-Patch:     0007-v3.5.0-remove-triangle.patch
-Patch:     0008-v3.5.0-remove-bits-using-triangle.patch
-Patch:     0009-v3.5.0-indent-to-keep-gcc-happy.patch
-# otherwise we get:
-# /usr/bin/ld: ../../../../../lib/libimesh.so.3.5.0.0: undefined reference to `brdb_value::registrar::registrar(brdb_value const*)'
-# collect2: error: ld returned 1 exit status
-# gmake[2]: *** [contrib/brl/bseg/baml/tests/CMakeFiles/baml_test_all.dir/build.make:172: bin/baml_test_all] Error 1
-# gmake[2]: Leaving directory '/builddir/build/BUILD/vxl-3.5.0/redhat-linux-build'
-# gmake[1]: *** [CMakeFiles/Makefile2:46025: contrib/brl/bseg/baml/tests/CMakeFiles/baml_test_all.dir/all] Error 2
-Patch:     0010-v3.5.0-more-linker-fixes.patch
+Patch50:        vxl-0.17.0-gcc5.diff
+Patch51:	vxl-1.17.0-gcc6.patch
 
-# Fix missing #include caught by gcc-11
-Patch:     0011-v3.5.0-fix-for-gcc11.patch
-# For linker error
-Patch:     0012-v3.5.0-link-against-acal.patch
-Patch:     0013-v3.5.0-more-linkage-fixes.patch
-Patch:     0014-v3.5.0-use-system-zlib-tiff-minizip-compat.patch
-Patch:     0015-v3.5.0-fix-linking.patch
-Patch:     0016-v3.5.0-fix-linking.patch
-# remove more bits that used triangle
-Patch:     0017-v3.5.0-remove-boxm2-processes-that-use-sdnet-that-re.patch
-# remove ctest dashboard config
-Patch:     0018-chore-remove-ctest-dashboard-config.patch
+Patch100:	%{name}-1.17.0-secondary.patch
 
-BuildRequires:  cmake
-BuildRequires:  Coin4-devel
-BuildRequires:  doxygen
-BuildRequires:  expat-devel
-BuildRequires:  expatpp-devel
-BuildRequires:  freeglut-devel
-BuildRequires:  gcc
-BuildRequires:  gcc-c++
-BuildRequires:  git
+#KL is used in an "UNMAINTAINED_LIBRARY", vgel is only built on request
 
-# Use bundled dcmtk until upstream updates their code to use newer dcmtk
-# https://github.com/vxl/vxl/issues/550
-# BuildRequires:  dcmtk-devel
+Buildroot:	%{_tmppath}/%{name}-%{version}-%{release}-root-%(%{__id_u} -n)
 
-BuildRequires:  libpng-devel
-BuildRequires:  libtiff-devel
-BuildRequires:  libXmu-devel
-BuildRequires:  libXi-devel
-BuildRequires:  libjpeg-devel
+BuildRequires:	cmake 
+BuildRequires:	doxygen
+BuildRequires:	expat-devel
+BuildRequires:	Coin2-devel
+BuildRequires:	dcmtk-devel
+BuildRequires:	doxygen
+BuildRequires:	expat-devel
+BuildRequires:	expatpp-devel
+BuildRequires:	freeglut-devel
+BuildRequires:	klt-devel
+BuildRequires:	libpng-devel
+BuildRequires:	libtiff-devel
+BuildRequires:	libXmu-devel 
+BuildRequires:	libXi-devel
+BuildRequires:	libjpeg-devel
 %ifnarch s390 s390x
-BuildRequires:  libdc1394-devel
+BuildRequires:	libdc1394-devel
 %endif
-BuildRequires:  libgeotiff-devel
-BuildRequires:  libjpeg-turbo-devel
-BuildRequires:  minizip-ng-compat-devel
-
-# Does not build with latest version
-# https://github.com/vxl/vxl/issues/627
-# BuildRequires:  openjpeg2-devel
-# Bundled
-Provides:  bundled(libopenjpeg2) = 2.0.0
-
-
-# Py2 only from the looks of it
-# BuildRequires:  python3-devel
-
-BuildRequires:  rply-devel
-BuildRequires:  shapelib-devel
-BuildRequires:  texi2html
-BuildRequires:  zlib-ng-compat-devel
+BuildRequires:	libgeotiff-devel
+BuildRequires:	libjpeg-turbo-devel
+BuildRequires:	minizip-devel
+BuildRequires:	rply-devel
+BuildRequires:	SIMVoleon-devel
+BuildRequires:	shapelib-devel
+BuildRequires:	texi2html
+BuildRequires:	xerces-c-devel
+BuildRequires:	zlib-devel
 
 #GUI needs wx, a desktop file and an icon
 
 %description
 VXL (the Vision-something-Libraries) is a collection of C++ libraries designed
 for computer vision research and implementation. It was created from TargetJr
-and the IUE with the aim of making a light, fast and consistent system.
+and the IUE with the aim of making a light, fast and consistent system. 
 VXL is written in ANSI/ISO C++ and is designed to be portable over many
 platforms.
 
 
-%package    doc
-Summary:    Documentation for VXL library
-BuildArch:  noarch
+%package	doc
+Summary:	Documentation for VXL library
+Group:		Documentation
+Requires:	%{name} = %{version}-%{release}
+BuildArch:	noarch
 
 %description doc
 
 You should install this package if you would like to
 have all the documentation
 
-%package    devel
-Summary:    Headers and development libraries for VXL
-Requires:   %{name}%{?_isa} = %{version}-%{release}
+%package	devel
+Summary:	Headers and development libraries for VXL
+Group:		Development/Libraries
+Requires:	%{name}%{?_isa} = %{version}-%{release}
 
 %description devel
 
@@ -128,742 +111,257 @@ You should install this package if you would like to
 develop code based on VXL.
 
 %prep
-%autosetup -S git
+%setup -q -n vxl-git4e07960
 
-# remove bundled bits
-# triangle removed in patch (bad license: https://github.com/vxl/vxl/issues/752#issuecomment-655526696)
+cp %{SOURCE2} .
 
-# remove other bits, only leave CMakeLists.txt
-for l in jpeg png zlib tiff geotiff bzlib
+#Remove bundled library (let's use FEDORA's ones)
+# v3p/netlib (made by f2c) dependency not removed because of heavily modifications
+# QV is a Silicon Graphics' VRML parser from the 90s. Now unmantained.
+for l in jpeg png zlib tiff geotiff rply dcmtk bzlib
 do
-    find v3p/$l -type f ! -name 'CMakeLists.txt' -execdir rm -fv {} +
+	find v3p/$l -type f ! -name 'CMakeLists.txt' -execdir rm {} +
 done
-find contrib/brl/b3p/shapelib -type f ! -name 'CMakeLists.txt' -execdir rm -fv {} +
-find contrib/brl/b3p/minizip -type f ! -name 'CMakeLists.txt' -execdir rm -fv {} +
-find contrib/brl/b3p/expat -type f ! -name 'CMakeLists.txt' -execdir rm -fv {} +
-find contrib/brl/b3p/expatpp -type f ! -name 'CMakeLists.txt' -execdir rm -fv {} +
+
+find contrib/brl/b3p/shapelib -type f ! -name 'CMakeLists.txt' -execdir rm {} +
+find contrib/brl/b3p/minizip -type f ! -name 'CMakeLists.txt' -execdir rm {} +
+find contrib/brl/b3p/expat -type f ! -name 'CMakeLists.txt' -execdir rm {} +
+find contrib/gel/vgel/kl -type f ! -name 'CMakeLists.txt' -execdir rm {} +
+find contrib/brl/b3p/expatpp -type f ! -name 'CMakeLists.txt' -execdir rm {} +
+
+# v3p/mpeg2 lib in fedora is not enough to build the target. Moreover it is in rpmfusion repo
+
+#TODO: Various
+#vxl-devel.x86_64: E: invalid-soname /usr/lib64/libvvid.so libvvid.so
+
+%patch1 -p1
+%patch2 -p1
+%patch3 -p1
+%patch4 -p1
+%patch5 -p1
+%patch6 -p1
+%patch7 -p1
+%patch8 -p1
+%patch9 -p1
+%patch10 -p1
+%patch11 -p1
+%patch12 -p1
+%patch13 -p1
+%patch14 -p1
+%patch15 -p1
+%patch16 -p1
+%patch17 -p1
+%patch18 -p1
+%patch19 -p1
+%patch20 -p1
+%patch21 -p1
+%patch22 -p1
+%patch23 -p1
+%patch24 -p1
+%patch25 -p1
+%patch26 -p1
+%patch50 -p1
+%patch51 -p1 -b .gcc6
+%patch100 -p1 -b .secondary
+
+
+#Fix lib / lib64 problem during install:
+find . -name CMakeLists.txt -exec sed -i "s/INSTALL_TARGETS([ ]*\/lib/INSTALL_TARGETS(\/lib\$\{LIB_SUFFIX\}/;" {} +
 
 # Fix executable permissions on source file
-# not using "." for find since it sometimes crashes within the .git folder
-for f in config contrib core scripts v3p vcl; do
-    find $f -name "*.h" -execdir chmod -x '{}' \;
-    find $f -name "*.cxx" -execdir chmod -x '{}' \;
-    find $f -name "*.txx" -execdir chmod -x '{}' \;
-done
+find . -name "*.h" | xargs chmod ugo-x
+find . -name "*.cxx" | xargs chmod ugo-x
+find . -name "*.txx" | xargs chmod ugo-x
 
 %build
-%cmake -DVXL_INSTALL_LIBRARY_DIR:PATH=%{_lib} \
-    -DCMAKE_INSTALL_DATAROOTDIR:PATH=%{_datadir}/%{name} \
-    -DBUILD_SHARED_LIBS:BOOL=TRUE \
-    -DVXL_USE_GEOTIFF:BOOL=TRUE \
-    -DVXL_FORCE_B3P_EXPAT:BOOL=FALSE \
-    -DVXL_FORCE_V3P_DCMTK:BOOL=TRUE \
-    -DVXL_FORCE_V3P_GEOTIFF:BOOL=FALSE \
-    -DVXL_FORCE_V3P_JPEG:BOOL=FALSE \
-    -DVXL_FORCE_V3P_PNG:BOOL=FALSE \
-    -DVXL_FORCE_V3P_TIFF:BOOL=FALSE \
-    -DVXL_FORCE_V3P_ZLIB:BOOL=FALSE \
-    -DVXL_FORCE_V3P_RPLY:BOOL=FALSE \
-    -DVXL_FORCE_V3P_OPENJPEG2:BOOL=TRUE \
-    -DVXL_USING_NATIVE_ZLIB:BOOL=TRUE \
-    -DVXL_USING_NATIVE_JPEG:BOOL=TRUE \
-    -DVXL_USING_NATIVE_PNG:BOOL=TRUE \
-    -DVXL_USING_NATIVE_TIFF:BOOL=TRUE \
-    -DVXL_USING_NATIVE_GEOTIFF:BOOL=TRUE \
-    -DVXL_USING_NATIVE_EXPAT:BOOL=TRUE \
-    -DVXL_USING_NATIVE_EXPATPP:BOOL=TRUE \
-    -DVXL_USING_NATIVE_SHAPELIB:BOOL=TRUE \
-    -DVXL_USING_NATIVE_BZLIB2:BOOL=TRUE \
-    -DVXL_BUILD_VGUI:BOOL=FALSE \
-    -DVXL_BUILD_BGUI3D:BOOL=FALSE \
-    -DVXL_BUILD_OXL:BOOL=TRUE \
-    -DVXL_BUILD_BRL:BOOL=TRUE \
-    -DVXL_BUILD_BRL_PYTHON:BOOL=FALSE \
-    -DVXL_BUILD_GEL:BOOL=TRUE \
-    -DVXL_BUILD_PRIP:BOOL=TRUE \
-    -DVXL_BUILD_CONVERSIONS:BOOL=TRUE \
-    -DVXL_BUILD_CUL:BOOL=TRUE \
-    -DVXL_BUILD_RPL:BOOL=TRUE \
-    -DVXL_BUILD_CONTRIB:BOOL=TRUE \
-    -DVXL_BUILD_CORE_SERIALISATION:BOOL=TRUE \
-    -DVXL_BUILD_CORE_GEOMETRY:BOOL=TRUE \
-    -DVXL_BUILD_CORE_IMAGING:BOOL=TRUE \
-    -DVXL_BUILD_CORE_NUMERICS:BOOL=TRUE \
-    -DVXL_BUILD_CORE_PROBABILITY:BOOL=TRUE \
-    -DVXL_BUILD_CORE_UTILITIES:BOOL=TRUE \
-    -DVXL_BUILD_CORE_VIDEO:BOOL=TRUE \
-    -DVXL_BUILD_EXAMPLES:BOOL=FALSE \
-    -DBUILD_TESTING:BOOL=TRUE \
-    -DVXL_BUILD_DOCUMENTATION:BOOL=TRUE \
-    -DCMAKE_BUILD_TYPE:STRING="RelWithDebInfo" \
-    -DCMAKE_CXX_FLAGS:STRING="$RPM_OPT_FLAGS -fpermissive" \
-    -DVNL_CONFIG_LEGACY_METHODS:BOOL=TRUE
+%cmake -DCMAKE_VERBOSE_MAKEFILE=ON \
+	-DBUILD_SHARED_LIBS:BOOL=ON \
+	-DVXL_FORCE_B3P_EXPAT:BOOL=OFF \
+	-DVXL_FORCE_V3P_DCMTK:BOOL=OFF \
+	-DVXL_FORCE_V3P_GEOTIFF:BOOL=OFF \
+	-DVXL_USING_NATIVE_KL=ON \
+	-DVXL_FORCE_V3P_JPEG:BOOL=OFF \
+	-DVXL_FORCE_V3P_MPEG2:BOOL=OFF \
+	-DVXL_FORCE_V3P_PNG:BOOL=OFF \
+	-DVXL_FORCE_V3P_TIFF:BOOL=OFF \
+	-DVXL_FORCE_V3P_ZLIB:BOOL=OFF \
+	-DVXL_FORCE_V3P_RPLY:BOOL=OFF \
+	-DVXL_USING_NATIVE_ZLIB=ON \
+	-DVXL_USING_NATIVE_JPEG=ON \
+	-DVXL_USING_NATIVE_PNG=ON \
+	-DVXL_USING_NATIVE_TIFF=ON \
+	-DVXL_USING_NATIVE_GEOTIFF=ON \
+	-DVXL_USING_NATIVE_EXPAT=ON \
+	-DVXL_USING_NATIVE_SHAPELIB=ON \
+	-DVXL_USING_NATIVE_BZLIB2=ON \
+	-DBUILD_VGUI=OFF \
+	-DBUILD_BGUI3D=OFF \
+	-DBUILD_OXL:BOOL=ON \
+	-DBUILD_BRL=OFF \
+	-DBUILD_CORE_GEOMETRY:BOOL=ON \
+	-DBUILD_CORE_IMAGING:BOOL=ON \
+	-DBUILD_CORE_NUMERICS:BOOL=ON \
+	-DBUILD_CORE_PROBABILITY:BOOL=ON \
+	-DBUILD_CORE_SERIALISATION:BOOL=ON \
+	-DBUILD_CORE_UTILITIES:BOOL=ON \
+	-DBUILD_CORE_VIDEO:BOOL=ON \
+	-DBUILD_EXAMPLES:BOOL=OFF \
+	-DBUILD_TESTING:BOOL=OFF \
+	-DBUILD_DOCUMENTATION:BOOL=ON \
+	-DCMAKE_BUILD_TYPE:STRING="RelWithDebInfo" \
+	-DCMAKE_CXX_FLAGS:STRING="$RPM_OPT_FLAGS -fpermissive" \
+	-DPYTHON_LIBRARY=/usr/lib64/libpython2.7.so \
+	-DVNL_CONFIG_LEGACY_METHODS=ON .
 
-# Other stuff
-# -DEXPATPP_INCLUDE_DIR:PATH=%%{_includedir} \
-# -DEXPATPP_LIBRARY:PATH=%%{_libdir}/libexpatpp.so \
-# -DPYTHON_LIBRARY=/usr/lib64/libpython2.7.so \
-
-# These comments from older spec versions need verification:
+# Why is expat stated, but not shapelib?
+# DCMDK Cmake -- Included in bundle, but why?
 #BUILD_VGUI? NO, it depends on box2m which in turns relies on OPENCL which is not available in FEDORA
 #wxwidgets seems to be found
 #Multiple versions of QT found please set DESIRED_QT_VERSION
+#TODO: Xerces for brl
+#TODO: Testing?
+#BR: coin2, coin3 (coin3d) brl, bbas
 
-%cmake_build
+make %{?_smp_mflags}
 
 %install
-%cmake_install
+rm -rf $RPM_BUILD_ROOT
+make install DESTDIR=$RPM_BUILD_ROOT
 
-# Stray file installed in a random location
-rm -fv %{buildroot}/usr/contrib/brl/bseg/boxm2/ocl/boxm2_ocl_where_root_dir.h
+%clean
+rm -rf $RPM_BUILD_ROOT
 
 %check
-# different tests fail on different arches
+ctest .
 
-%ifarch x86_64
-# 99% tests passed, 5 tests failed out of 997
-# Total Test time (real) =  23.64 sec
-# The following tests FAILED:
-#        30 -  vul_vul_test_driver (invalid test name)
-#        781 - acal_test_metadata (Failed)
-#        816 - bkml_test_bkml (Subprocess aborted)
-#        836 - volm_test_candidate_region_parser (Subprocess aborted)
-#        979 - vifa_test_int_faces_attr (Subprocess aborted)
-#        980 - vifa_test_int_faces_adj_attr (Subprocess aborted)
-%ctest -E "(acal_test_metadata|bkml_test_bkml|volm_test_candidate_region_parser|vifa_test_int_faces_attr|vifa_test_int_faces_adj_attr|vul_vul_test_driver)"
-%else
-# A number of test fail, but not deterministically on aarch and ppc64le etc, e.g:
+%post -p /sbin/ldconfig
 
-#    183 - vgl_test_frustum_3d (Failed)
-#    557 - m23d_test_ortho_flexible_builder (Failed)
-#    638 - vepl_test_gradient_dir (Failed)
-#    732 - bil_test_warp (Failed)
-#    748 - vsph_test_camera_bounds (Failed)
-#    768 - icam_test_transform (Failed)
-#    812 - imesh_test_imls_surface (Failed)
-#    886 - breg3d_test_ekf_camera_optimizer (Failed)
-# Do not make build fail for this arch
-%ctest || true
-%endif
+%postun -p /sbin/ldconfig
 
 %files
 %doc core/vxl_copyright.h
-%{_bindir}/octree
-%{_libdir}/libacal.so.%{major}.%{minor}
-%{_libdir}/libacal.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libacal_io.so.%{major}.%{minor}
-%{_libdir}/libacal_io.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbaio.so.%{major}.%{minor}
-%{_libdir}/libbaio.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbaml.so.%{major}.%{minor}
-%{_libdir}/libbaml.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbapl.so.%{major}.%{minor}
-%{_libdir}/libbapl.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbapl_io.so.%{major}.%{minor}
-%{_libdir}/libbapl_io.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbapl_pro.so.%{major}.%{minor}
-%{_libdir}/libbapl_pro.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbbas_pro.so.%{major}.%{minor}
-%{_libdir}/libbbas_pro.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbbgm.so.%{major}.%{minor}
-%{_libdir}/libbbgm.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbbgm_pro.so.%{major}.%{minor}
-%{_libdir}/libbbgm_pro.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbcvr.so.%{major}.%{minor}
-%{_libdir}/libbcvr.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbdgl.so.%{major}.%{minor}
-%{_libdir}/libbdgl.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbdpg.so.%{major}.%{minor}
-%{_libdir}/libbdpg.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbetr.so.%{major}.%{minor}
-%{_libdir}/libbetr.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbetr_pro.so.%{major}.%{minor}
-%{_libdir}/libbetr_pro.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbgrl.so.%{major}.%{minor}
-%{_libdir}/libbgrl.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbgrl2.so.%{major}.%{minor}
-%{_libdir}/libbgrl2.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbgrl2_algo.so.%{major}.%{minor}
-%{_libdir}/libbgrl2_algo.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbil.so.%{major}.%{minor}
-%{_libdir}/libbil.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbil_algo.so.%{major}.%{minor}
-%{_libdir}/libbil_algo.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbjson.so.%{major}.%{minor}
-%{_libdir}/libbjson.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbkml.so.%{major}.%{minor}
-%{_libdir}/libbkml.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbmdl.so.%{major}.%{minor}
-%{_libdir}/libbmdl.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbmdl_pro.so.%{major}.%{minor}
-%{_libdir}/libbmdl_pro.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbmsh3d.so.%{major}.%{minor}
-%{_libdir}/libbmsh3d.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbmsh3d_algo.so.%{major}.%{minor}
-%{_libdir}/libbmsh3d_algo.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbmsh3d_pro.so.%{major}.%{minor}
-%{_libdir}/libbmsh3d_pro.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbnabo.so.%{major}.%{minor}
-%{_libdir}/libbnabo.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbnl.so.%{major}.%{minor}
-%{_libdir}/libbnl.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbnl_algo.so.%{major}.%{minor}
-%{_libdir}/libbnl_algo.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libboct.so.%{major}.%{minor}
-%{_libdir}/libboct.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libboxm2.so.%{major}.%{minor}
-%{_libdir}/libboxm2.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libboxm2_basic.so.%{major}.%{minor}
-%{_libdir}/libboxm2_basic.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libboxm2_class.so.%{major}.%{minor}
-%{_libdir}/libboxm2_class.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libboxm2_cpp.so.%{major}.%{minor}
-%{_libdir}/libboxm2_cpp.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libboxm2_cpp_algo.so.%{major}.%{minor}
-%{_libdir}/libboxm2_cpp_algo.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libboxm2_cpp_pro.so.%{major}.%{minor}
-%{_libdir}/libboxm2_cpp_pro.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libboxm2_io.so.%{major}.%{minor}
-%{_libdir}/libboxm2_io.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libboxm2_pro.so.%{major}.%{minor}
-%{_libdir}/libboxm2_pro.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libboxm2_util.so.%{major}.%{minor}
-%{_libdir}/libboxm2_util.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libboxm2_vecf.so.%{major}.%{minor}
-%{_libdir}/libboxm2_vecf.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libboxm2_volm.so.%{major}.%{minor}
-%{_libdir}/libboxm2_volm.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libboxm2_volm_conf.so.%{major}.%{minor}
-%{_libdir}/libboxm2_volm_conf.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libboxm2_volm_desc.so.%{major}.%{minor}
-%{_libdir}/libboxm2_volm_desc.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libboxm2_volm_io.so.%{major}.%{minor}
-%{_libdir}/libboxm2_volm_io.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libboxm2_volm_pro.so.%{major}.%{minor}
-%{_libdir}/libboxm2_volm_pro.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbpgl.so.%{major}.%{minor}
-%{_libdir}/libbpgl.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbpgl_algo.so.%{major}.%{minor}
-%{_libdir}/libbpgl_algo.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbprb.so.%{major}.%{minor}
-%{_libdir}/libbprb.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbrad.so.%{major}.%{minor}
-%{_libdir}/libbrad.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbrad_io.so.%{major}.%{minor}
-%{_libdir}/libbrad_io.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbrad_pro.so.%{major}.%{minor}
-%{_libdir}/libbrad_pro.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbrdb.so.%{major}.%{minor}
-%{_libdir}/libbrdb.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbrec.so.%{major}.%{minor}
-%{_libdir}/libbrec.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbrec_pro.so.%{major}.%{minor}
-%{_libdir}/libbrec_pro.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbreg3d.so.%{major}.%{minor}
-%{_libdir}/libbreg3d.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbreg3d_pro.so.%{major}.%{minor}
-%{_libdir}/libbreg3d_pro.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbres.so.%{major}.%{minor}
-%{_libdir}/libbres.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbrip.so.%{major}.%{minor}
-%{_libdir}/libbrip.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbrip_pro.so.%{major}.%{minor}
-%{_libdir}/libbrip_pro.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbsgm.so.%{major}.%{minor}
-%{_libdir}/libbsgm.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbsgm_pro.so.%{major}.%{minor}
-%{_libdir}/libbsgm_pro.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbsl.so.%{major}.%{minor}
-%{_libdir}/libbsl.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbsol.so.%{major}.%{minor}
-%{_libdir}/libbsol.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbsta.so.%{major}.%{minor}
-%{_libdir}/libbsta.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbsta_algo.so.%{major}.%{minor}
-%{_libdir}/libbsta_algo.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbsta_io.so.%{major}.%{minor}
-%{_libdir}/libbsta_io.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbsta_pro.so.%{major}.%{minor}
-%{_libdir}/libbsta_pro.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbsta_vis.so.%{major}.%{minor}
-%{_libdir}/libbsta_vis.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbstm.so.%{major}.%{minor}
-%{_libdir}/libbstm.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbstm_basic.so.%{major}.%{minor}
-%{_libdir}/libbstm_basic.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbstm_cpp_algo.so.%{major}.%{minor}
-%{_libdir}/libbstm_cpp_algo.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbstm_cpp_pro.so.%{major}.%{minor}
-%{_libdir}/libbstm_cpp_pro.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbstm_io.so.%{major}.%{minor}
-%{_libdir}/libbstm_io.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbstm_multi.so.%{major}.%{minor}
-%{_libdir}/libbstm_multi.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbstm_multi_basic.so.%{major}.%{minor}
-%{_libdir}/libbstm_multi_basic.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbstm_multi_io.so.%{major}.%{minor}
-%{_libdir}/libbstm_multi_io.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbstm_pro.so.%{major}.%{minor}
-%{_libdir}/libbstm_pro.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbstm_util.so.%{major}.%{minor}
-%{_libdir}/libbstm_util.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbsvg.so.%{major}.%{minor}
-%{_libdir}/libbsvg.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbsvg_pro.so.%{major}.%{minor}
-%{_libdir}/libbsvg_pro.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbtol.so.%{major}.%{minor}
-%{_libdir}/libbtol.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbugl.so.%{major}.%{minor}
-%{_libdir}/libbugl.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbundler.so.%{major}.%{minor}
-%{_libdir}/libbundler.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbvgl.so.%{major}.%{minor}
-%{_libdir}/libbvgl.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbvgl_algo.so.%{major}.%{minor}
-%{_libdir}/libbvgl_algo.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbvgl_pro.so.%{major}.%{minor}
-%{_libdir}/libbvgl_pro.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbvpl.so.%{major}.%{minor}
-%{_libdir}/libbvpl.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbvpl_functors.so.%{major}.%{minor}
-%{_libdir}/libbvpl_functors.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbvpl_kernels.so.%{major}.%{minor}
-%{_libdir}/libbvpl_kernels.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbvpl_kernels_io.so.%{major}.%{minor}
-%{_libdir}/libbvpl_kernels_io.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbvpl_kernels_pro.so.%{major}.%{minor}
-%{_libdir}/libbvpl_kernels_pro.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbvpl_pro.so.%{major}.%{minor}
-%{_libdir}/libbvpl_pro.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbvpl_util.so.%{major}.%{minor}
-%{_libdir}/libbvpl_util.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbvpl_util_io.so.%{major}.%{minor}
-%{_libdir}/libbvpl_util_io.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbvrml.so.%{major}.%{minor}
-%{_libdir}/libbvrml.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbvrml_pro.so.%{major}.%{minor}
-%{_libdir}/libbvrml_pro.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbvxm.so.%{major}.%{minor}
-%{_libdir}/libbvxm.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbvxm_algo.so.%{major}.%{minor}
-%{_libdir}/libbvxm_algo.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbvxm_algo_pro.so.%{major}.%{minor}
-%{_libdir}/libbvxm_algo_pro.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbvxm_grid.so.%{major}.%{minor}
-%{_libdir}/libbvxm_grid.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbvxm_grid_io.so.%{major}.%{minor}
-%{_libdir}/libbvxm_grid_io.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbvxm_grid_pro.so.%{major}.%{minor}
-%{_libdir}/libbvxm_grid_pro.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbvxm_io.so.%{major}.%{minor}
-%{_libdir}/libbvxm_io.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbvxm_pro.so.%{major}.%{minor}
-%{_libdir}/libbvxm_pro.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbwm_video.so.%{major}.%{minor}
-%{_libdir}/libbwm_video.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libbxml.so.%{major}.%{minor}
-%{_libdir}/libbxml.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libclipper.so.%{major}.%{minor}
-%{_libdir}/libclipper.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libclsfy.so.%{major}.%{minor}
-%{_libdir}/libclsfy.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libdepth_map.so.%{major}.%{minor}
-%{_libdir}/libdepth_map.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libfhs.so.%{major}.%{minor}
-%{_libdir}/libfhs.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libgeml.so.%{major}.%{minor}
-%{_libdir}/libgeml.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libgevd.so.%{major}.%{minor}
-%{_libdir}/libgevd.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libgmvl.so.%{major}.%{minor}
-%{_libdir}/libgmvl.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libgst.so.%{major}.%{minor}
-%{_libdir}/libgst.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libgtrl.so.%{major}.%{minor}
-%{_libdir}/libgtrl.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libicam.so.%{major}.%{minor}
-%{_libdir}/libicam.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libicam_pro.so.%{major}.%{minor}
-%{_libdir}/libicam_pro.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libihog.so.%{major}.%{minor}
-%{_libdir}/libihog.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libihog_pro.so.%{major}.%{minor}
-%{_libdir}/libihog_pro.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libimesh.so.%{major}.%{minor}
-%{_libdir}/libimesh.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libimesh_algo.so.%{major}.%{minor}
-%{_libdir}/libimesh_algo.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libipts.so.%{major}.%{minor}
-%{_libdir}/libipts.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libm23d.so.%{major}.%{minor}
-%{_libdir}/libm23d.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libmbl.so.%{major}.%{minor}
-%{_libdir}/libmbl.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libmcal.so.%{major}.%{minor}
-%{_libdir}/libmcal.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libmfpf.so.%{major}.%{minor}
-%{_libdir}/libmfpf.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libmipa.so.%{major}.%{minor}
-%{_libdir}/libmipa.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libmmn.so.%{major}.%{minor}
-%{_libdir}/libmmn.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libmsdi.so.%{major}.%{minor}
-%{_libdir}/libmsdi.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libmsm.so.%{major}.%{minor}
-%{_libdir}/libmsm.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libmsm_utils.so.%{major}.%{minor}
-%{_libdir}/libmsm_utils.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libmvl.so.%{major}.%{minor}
-%{_libdir}/libmvl.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libmvl2.so.%{major}.%{minor}
-%{_libdir}/libmvl2.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libopenjpeg2.so.2.%{patch}.0
-%{_libdir}/libopenjpeg2.so.%{major}.%{minor}
-%{_libdir}/libosl.so.%{major}.%{minor}
-%{_libdir}/libosl.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libouel.so.%{major}.%{minor}
-%{_libdir}/libouel.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libouml.so.%{major}.%{minor}
-%{_libdir}/libouml.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/liboxl_vrml.so.%{major}.%{minor}
-%{_libdir}/liboxl_vrml.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libpdf1d.so.%{major}.%{minor}
-%{_libdir}/libpdf1d.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/librgrl.so.%{major}.%{minor}
-%{_libdir}/librgrl.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/librrel.so.%{major}.%{minor}
-%{_libdir}/librrel.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/librsdl.so.%{major}.%{minor}
-%{_libdir}/librsdl.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libsdet.so.%{major}.%{minor}
-%{_libdir}/libsdet.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libsdet_algo.so.%{major}.%{minor}
-%{_libdir}/libsdet_algo.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libsdet_pro.so.%{major}.%{minor}
-%{_libdir}/libsdet_pro.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libtestlib.so.%{major}.%{minor}
-%{_libdir}/libtestlib.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libv3p_netlib.so.%{major}.%{minor}
-%{_libdir}/libv3p_netlib.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libvbl.so.%{major}.%{minor}
-%{_libdir}/libvbl.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libvbl_io.so.%{major}.%{minor}
-%{_libdir}/libvbl_io.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libvcl.so.%{major}.%{minor}
-%{_libdir}/libvcl.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libvcon_pro.so.%{major}.%{minor}
-%{_libdir}/libvcon_pro.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libvcsl.so.%{major}.%{minor}
-%{_libdir}/libvcsl.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libvdgl.so.%{major}.%{minor}
-%{_libdir}/libvdgl.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libvdtop.so.%{major}.%{minor}
-%{_libdir}/libvdtop.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libvepl.so.%{major}.%{minor}
-%{_libdir}/libvepl.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libvgl.so.%{major}.%{minor}
-%{_libdir}/libvgl.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libvgl_algo.so.%{major}.%{minor}
-%{_libdir}/libvgl_algo.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libvgl_io.so.%{major}.%{minor}
-%{_libdir}/libvgl_io.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libvgl_xio.so.%{major}.%{minor}
-%{_libdir}/libvgl_xio.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libvidl.so.%{major}.%{minor}
-%{_libdir}/libvidl.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libvidl_pro.so.%{major}.%{minor}
-%{_libdir}/libvidl_pro.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libvifa.so.%{major}.%{minor}
-%{_libdir}/libvifa.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libvil.so.%{major}.%{minor}
-%{_libdir}/libvil.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libvil1.so.%{major}.%{minor}
-%{_libdir}/libvil1.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libvil3d.so.%{major}.%{minor}
-%{_libdir}/libvil3d.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libvil3d_algo.so.%{major}.%{minor}
-%{_libdir}/libvil3d_algo.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libvil3d_io.so.%{major}.%{minor}
-%{_libdir}/libvil3d_io.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libvil_algo.so.%{major}.%{minor}
-%{_libdir}/libvil_algo.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libvil_io.so.%{major}.%{minor}
-%{_libdir}/libvil_io.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libvil_pro.so.%{major}.%{minor}
-%{_libdir}/libvil_pro.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libvimt.so.%{major}.%{minor}
-%{_libdir}/libvimt.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libvimt3d.so.%{major}.%{minor}
-%{_libdir}/libvimt3d.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libvimt_algo.so.%{major}.%{minor}
-%{_libdir}/libvimt_algo.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libvipl.so.%{major}.%{minor}
-%{_libdir}/libvipl.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libvmal.so.%{major}.%{minor}
-%{_libdir}/libvmal.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libvmap.so.%{major}.%{minor}
-%{_libdir}/libvmap.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libvnl.so.%{major}.%{minor}
-%{_libdir}/libvnl.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libvnl_algo.so.%{major}.%{minor}
-%{_libdir}/libvnl_algo.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libvnl_io.so.%{major}.%{minor}
-%{_libdir}/libvnl_io.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libvnl_xio.so.%{major}.%{minor}
-%{_libdir}/libvnl_xio.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libvolm.so.%{major}.%{minor}
-%{_libdir}/libvolm.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libvolm_conf.so.%{major}.%{minor}
-%{_libdir}/libvolm_conf.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libvolm_desc.so.%{major}.%{minor}
-%{_libdir}/libvolm_desc.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libvolm_pro.so.%{major}.%{minor}
-%{_libdir}/libvolm_pro.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libvpdfl.so.%{major}.%{minor}
-%{_libdir}/libvpdfl.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libvpdl.so.%{major}.%{minor}
-%{_libdir}/libvpdl.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libvpgl.so.%{major}.%{minor}
-%{_libdir}/libvpgl.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libvpgl_algo.so.%{major}.%{minor}
-%{_libdir}/libvpgl_algo.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libvpgl_file_formats.so.%{major}.%{minor}
-%{_libdir}/libvpgl_file_formats.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libvpgl_io.so.%{major}.%{minor}
-%{_libdir}/libvpgl_io.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libvpgl_pro.so.%{major}.%{minor}
-%{_libdir}/libvpgl_pro.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libvpgl_xio.so.%{major}.%{minor}
-%{_libdir}/libvpgl_xio.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libvpl.so.%{major}.%{minor}
-%{_libdir}/libvpl.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libvpyr.so.%{major}.%{minor}
-%{_libdir}/libvpyr.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libvsl.so.%{major}.%{minor}
-%{_libdir}/libvsl.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libvsol.so.%{major}.%{minor}
-%{_libdir}/libvsol.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libvsph.so.%{major}.%{minor}
-%{_libdir}/libvsph.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libvtol.so.%{major}.%{minor}
-%{_libdir}/libvtol.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libvtol_algo.so.%{major}.%{minor}
-%{_libdir}/libvtol_algo.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libvul.so.%{major}.%{minor}
-%{_libdir}/libvul.so.%{major}.%{minor}.%{patch}.0
-%{_libdir}/libvul_io.so.%{major}.%{minor}
-%{_libdir}/libvul_io.so.%{major}.%{minor}.%{patch}.0
+%{_libdir}/*.so.*
+%{_bindir}/*
+#%{_datadir}/%{name}/
 
 %files devel
 %{_datadir}/%{name}
 %{_includedir}/%{name}
-%{_libdir}/libbbas_pro.so
-%{_libdir}/libbapl_pro.so
-%{_libdir}/libbapl_io.so
-%{_libdir}/libacal.so
-%{_libdir}/libacal_io.so
-%{_libdir}/libbaio.so
-%{_libdir}/libbaml.so
-%{_libdir}/libbapl.so
-%{_libdir}/libbbgm.so
-%{_libdir}/libbbgm_pro.so
-%{_libdir}/libbcvr.so
-%{_libdir}/libbdgl.so
-%{_libdir}/libbdpg.so
-%{_libdir}/libbetr.so
-%{_libdir}/libbetr_pro.so
-%{_libdir}/libbgrl.so
-%{_libdir}/libbgrl2.so
-%{_libdir}/libbgrl2_algo.so
-%{_libdir}/libbil.so
-%{_libdir}/libbil_algo.so
-%{_libdir}/libbjson.so
-%{_libdir}/libbkml.so
-%{_libdir}/libbmdl.so
-%{_libdir}/libbmdl_pro.so
-%{_libdir}/libbmsh3d.so
-%{_libdir}/libbmsh3d_algo.so
-%{_libdir}/libbmsh3d_pro.so
-%{_libdir}/libbnabo.so
-%{_libdir}/libbnl.so
-%{_libdir}/libbnl_algo.so
-%{_libdir}/libboct.so
-%{_libdir}/libboxm2.so
-%{_libdir}/libboxm2_basic.so
-%{_libdir}/libboxm2_class.so
-%{_libdir}/libboxm2_cpp.so
-%{_libdir}/libboxm2_cpp_algo.so
-%{_libdir}/libboxm2_cpp_pro.so
-%{_libdir}/libboxm2_io.so
-%{_libdir}/libboxm2_pro.so
-%{_libdir}/libboxm2_util.so
-%{_libdir}/libboxm2_vecf.so
-%{_libdir}/libboxm2_volm.so
-%{_libdir}/libboxm2_volm_conf.so
-%{_libdir}/libboxm2_volm_desc.so
-%{_libdir}/libboxm2_volm_io.so
-%{_libdir}/libboxm2_volm_pro.so
-%{_libdir}/libbpgl.so
-%{_libdir}/libbpgl_algo.so
-%{_libdir}/libbprb.so
-%{_libdir}/libbrad.so
-%{_libdir}/libbrad_io.so
-%{_libdir}/libbrad_pro.so
-%{_libdir}/libbrdb.so
-%{_libdir}/libbrec.so
-%{_libdir}/libbrec_pro.so
-%{_libdir}/libbreg3d.so
-%{_libdir}/libbreg3d_pro.so
-%{_libdir}/libbres.so
-%{_libdir}/libbrip.so
-%{_libdir}/libbrip_pro.so
-%{_libdir}/libbsgm.so
-%{_libdir}/libbsgm_pro.so
-%{_libdir}/libbsl.so
-%{_libdir}/libbsol.so
-%{_libdir}/libbsta.so
-%{_libdir}/libbsta_algo.so
-%{_libdir}/libbsta_io.so
-%{_libdir}/libbsta_pro.so
-%{_libdir}/libbsta_vis.so
-%{_libdir}/libbstm.so
-%{_libdir}/libbstm_basic.so
-%{_libdir}/libbstm_cpp_algo.so
-%{_libdir}/libbstm_cpp_pro.so
-%{_libdir}/libbstm_io.so
-%{_libdir}/libbstm_multi.so
-%{_libdir}/libbstm_multi_basic.so
-%{_libdir}/libbstm_multi_io.so
-%{_libdir}/libbstm_pro.so
-%{_libdir}/libbstm_util.so
-%{_libdir}/libbsvg.so
-%{_libdir}/libbsvg_pro.so
-%{_libdir}/libbtol.so
-%{_libdir}/libbugl.so
-%{_libdir}/libbundler.so
-%{_libdir}/libbvgl.so
-%{_libdir}/libbvgl_algo.so
-%{_libdir}/libbvgl_pro.so
-%{_libdir}/libbvpl.so
-%{_libdir}/libbvpl_functors.so
-%{_libdir}/libbvpl_kernels.so
-%{_libdir}/libbvpl_kernels_io.so
-%{_libdir}/libbvpl_kernels_pro.so
-%{_libdir}/libbvpl_pro.so
-%{_libdir}/libbvpl_util.so
-%{_libdir}/libbvpl_util_io.so
-%{_libdir}/libbvrml.so
-%{_libdir}/libbvrml_pro.so
-%{_libdir}/libbvxm.so
-%{_libdir}/libbvxm_algo.so
-%{_libdir}/libbvxm_algo_pro.so
-%{_libdir}/libbvxm_grid.so
-%{_libdir}/libbvxm_grid_io.so
-%{_libdir}/libbvxm_grid_pro.so
-%{_libdir}/libbvxm_io.so
-%{_libdir}/libbvxm_pro.so
-%{_libdir}/libbwm_video.so
-%{_libdir}/libbxml.so
-%{_libdir}/libclipper.so
-%{_libdir}/libclsfy.so
-%{_libdir}/libdepth_map.so
-%{_libdir}/libfhs.so
-%{_libdir}/libgeml.so
-%{_libdir}/libgevd.so
-%{_libdir}/libgmvl.so
-%{_libdir}/libgst.so
-%{_libdir}/libgtrl.so
-%{_libdir}/libicam.so
-%{_libdir}/libicam_pro.so
-%{_libdir}/libihog.so
-%{_libdir}/libihog_pro.so
-%{_libdir}/libimesh.so
-%{_libdir}/libimesh_algo.so
-%{_libdir}/libipts.so
-%{_libdir}/libm23d.so
-%{_libdir}/libmbl.so
-%{_libdir}/libmcal.so
-%{_libdir}/libmfpf.so
-%{_libdir}/libmipa.so
-%{_libdir}/libmmn.so
-%{_libdir}/libmsdi.so
-%{_libdir}/libmsm.so
-%{_libdir}/libmsm_utils.so
-%{_libdir}/libmvl.so
-%{_libdir}/libmvl2.so
-%{_libdir}/libopenjpeg2.so
-%{_libdir}/libosl.so
-%{_libdir}/libouel.so
-%{_libdir}/libouml.so
-%{_libdir}/liboxl_vrml.so
-%{_libdir}/libpdf1d.so
-%{_libdir}/librgrl.so
-%{_libdir}/librrel.so
-%{_libdir}/librsdl.so
-%{_libdir}/libsdet.so
-%{_libdir}/libsdet_algo.so
-%{_libdir}/libsdet_pro.so
-%{_libdir}/libtestlib.so
-%{_libdir}/libv3p_netlib.so
-%{_libdir}/libvbl.so
-%{_libdir}/libvbl_io.so
-%{_libdir}/libvcl.so
-%{_libdir}/libvcon_pro.so
-%{_libdir}/libvcsl.so
-%{_libdir}/libvdgl.so
-%{_libdir}/libvdtop.so
-%{_libdir}/libvepl.so
-%{_libdir}/libvgl.so
-%{_libdir}/libvgl_algo.so
-%{_libdir}/libvgl_io.so
-%{_libdir}/libvgl_xio.so
-%{_libdir}/libvidl.so
-%{_libdir}/libvidl_pro.so
-%{_libdir}/libvifa.so
-%{_libdir}/libvil.so
-%{_libdir}/libvil1.so
-%{_libdir}/libvil3d.so
-%{_libdir}/libvil3d_algo.so
-%{_libdir}/libvil3d_io.so
-%{_libdir}/libvil_algo.so
-%{_libdir}/libvil_io.so
-%{_libdir}/libvil_pro.so
-%{_libdir}/libvimt.so
-%{_libdir}/libvimt3d.so
-%{_libdir}/libvimt_algo.so
-%{_libdir}/libvipl.so
-%{_libdir}/libvmal.so
-%{_libdir}/libvmap.so
-%{_libdir}/libvnl.so
-%{_libdir}/libvnl_algo.so
-%{_libdir}/libvnl_io.so
-%{_libdir}/libvnl_xio.so
-%{_libdir}/libvolm.so
-%{_libdir}/libvolm_conf.so
-%{_libdir}/libvolm_desc.so
-%{_libdir}/libvolm_pro.so
-%{_libdir}/libvpdfl.so
-%{_libdir}/libvpdl.so
-%{_libdir}/libvpgl.so
-%{_libdir}/libvpgl_algo.so
-%{_libdir}/libvpgl_file_formats.so
-%{_libdir}/libvpgl_io.so
-%{_libdir}/libvpgl_pro.so
-%{_libdir}/libvpgl_xio.so
-%{_libdir}/libvpl.so
-%{_libdir}/libvpyr.so
-%{_libdir}/libvsl.so
-%{_libdir}/libvsol.so
-%{_libdir}/libvsph.so
-%{_libdir}/libvtol.so
-%{_libdir}/libvtol_algo.so
-%{_libdir}/libvul.so
-%{_libdir}/libvul_io.so
-
+%{_libdir}/*.so
 
 %files doc
-%doc core/vxl_copyright.h
 %doc %{_docdir}/*
 
+
+
+
 %changelog
-%autochangelog
+* Thu Aug 03 2017 Fedora Release Engineering <releng@fedoraproject.org> - 1.17.0-24
+- Rebuilt for https://fedoraproject.org/wiki/Fedora_27_Binutils_Mass_Rebuild
+
+* Thu Jul 27 2017 Fedora Release Engineering <releng@fedoraproject.org> - 1.17.0-23
+- Rebuilt for https://fedoraproject.org/wiki/Fedora_27_Mass_Rebuild
+
+* Mon May 15 2017 Fedora Release Engineering <rel-eng@lists.fedoraproject.org> - 1.17.0-22
+- Rebuilt for https://fedoraproject.org/wiki/Fedora_26_27_Mass_Rebuild
+
+* Sat Feb 11 2017 Fedora Release Engineering <releng@fedoraproject.org> - 1.17.0-21
+- Rebuilt for https://fedoraproject.org/wiki/Fedora_26_Mass_Rebuild
+
+* Thu Feb 25 2016 Tom Callaway <spot@fedoraproject.org> - 1.17.0-20
+- remove non-free lena image file from source tarball (bz1310388)
+- fix FTBFS (bz1303695, bz1308234)
+
+* Fri Feb 05 2016 Fedora Release Engineering <releng@fedoraproject.org> - 1.17.0-19
+- Rebuilt for https://fedoraproject.org/wiki/Fedora_24_Mass_Rebuild
+
+* Fri Jun 19 2015 Fedora Release Engineering <rel-eng@lists.fedoraproject.org> - 1.17.0-18
+- Rebuilt for https://fedoraproject.org/wiki/Fedora_23_Mass_Rebuild
+
+* Sat May 16 2015 Sebastian Pölsterl <sebp@k-d-w.org> - 1.17.0-17
+- Rebuilt using hardened build flags: https://fedoraproject.org/wiki/Changes/Harden_All_Packages
+
+* Mon Feb 16 2015 Ralf Corsépius <corsepiu@fedoraproject.org> - 0.17.0-16
+- Add vxl-0.17.0-gcc5.diff (Work-around GCC-5.0.0 FTBFS RHBZ#1192886).
+- Fix bogus %%changelog date.
+
+* Mon Aug 25 2014 Devrim GĂĽndĂĽz <devrim@gunduz.org> - 1.17.0-15
+- Rebuilt for libgeotiff 
+
+* Mon Aug 18 2014 Fedora Release Engineering <rel-eng@lists.fedoraproject.org> - 1.17.0-14
+- Rebuilt for https://fedoraproject.org/wiki/Fedora_21_22_Mass_Rebuild
+
+* Sun Jun 08 2014 Fedora Release Engineering <rel-eng@lists.fedoraproject.org> - 1.17.0-13
+- Rebuilt for https://fedoraproject.org/wiki/Fedora_21_Mass_Rebuild
+
+* Sun Aug 04 2013 Fedora Release Engineering <rel-eng@lists.fedoraproject.org> - 1.17.0-12
+- Rebuilt for https://fedoraproject.org/wiki/Fedora_20_Mass_Rebuild
+
+* Mon Mar 04 2013 Mario Ceresa mrceresa fedoraproject org vxl 1.17.0-11
+- Applied upstream patches (25, 26) to ensure compatibility with ITK
+
+* Fri Feb 15 2013 Fedora Release Engineering <rel-eng@lists.fedoraproject.org> - 1.17.0-10
+- Rebuilt for https://fedoraproject.org/wiki/Fedora_19_Mass_Rebuild
+
+* Mon Jan 21 2013 Adam Tkac <atkac redhat com> - 1.17.0-9
+- rebuild due to "jpeg8-ABI" feature drop
+
+* Wed Dec 05 2012 Dan Horák <dan[at]danny.cz> - 1.17.0-8
+- fix build on non-x86 arches
+
+* Sun Nov 25 2012 Mario Ceresa mrceresa fedoraproject org vxl 1.17.0-7%{?dist}
+- Changed source0 path to point to vxl 1.17
+- Added missing sonames
+
+* Fri Nov 02 2012 Mario Ceresa mrceresa fedoraproject org vxl 1.17.0-6%{?dist}
+- Patched to build BRL
+- Updated to last version
+
+* Mon Oct 29 2012 Mario Ceresa mrceresa fedoraproject org vxl 1.17.0-5%{?dist}
+- Removed expatpp bundled library and added corresponding BR
+- Removed bundled bzip
+
+
+* Thu Oct 18 2012 Mario Ceresa mrceresa fedoraproject org vxl 1.17.0-4%{?dist}
+- Fixed missing oxl_vrml lib
+- Turn on compilation of BRL
+
+* Sun Oct 14 2012 Mario Ceresa mrceresa fedoraproject org vxl 1.17.0-3%{?dist}
+- More fixes from Volker's post https://bugzilla.redhat.com/show_bug.cgi?id=567086#c42
+- 
+
+* Wed Oct 10 2012 Mario Ceresa mrceresa fedoraproject org vxl 1.17.0-2%{?dist}
+- Added patches 12-16 from https://bugzilla.redhat.com/show_bug.cgi?id=567086#c42
+- Minor rework of the spec file as pointed out by Volker in the previous link
+
+* Wed Oct 10 2012 Mario Ceresa mrceresa fedoraproject org vxl 1.17.0-1%{?dist}
+- Updated to new version
+- Reworked patches to the new version
+- Disabled BRL because it gives a compilation error
+
+* Fri May 27 2011 Mario Ceresa mrceresa fedoraproject org vxl 1.14.0-1%{?dist}
+- Updated to new version
+- Added BR doxygen (thanks to Ankur for noticing it)
+- Changed patch naming schema
+- Work around a rply related bug (patches 3-6)
+- Thanks to Thomas Bouffon for patch 7-8
+- Patches 9-10 address http://www.itk.org/pipermail/insight-users/2010-July/037418.html
+- Fixed 70 missing sonames in patch 11
+- Removed bundled expact, shapelib, minizip, dcmtk
+- Force brl build
+- Use system shipped FindEXPAT
+
+
+* Tue Mar 23 2010 Mario Ceresa mrceresa fedoraproject org vxl 1.13.0-4%{?dist}
+- sed patch to add ${LIB_SUFFIX} to all lib install target
+- Added soname version info to vil vil_algo lib
+
+* Sun Mar 21 2010 Mario Ceresa mrceresa fedoraproject org vxl 1.13.0-3%{?dist}
+- Applied patch to build against newly packaged rply
+
+* Tue Mar 2 2010 Mario Ceresa mrceresa fedoraproject org vxl 1.13.0-2%{?dist}
+- Applied patch from debian distribution to force the generation of versioned lib
+
+* Fri Feb 19 2010 Mario Ceresa mrceresa fedoraproject org vxl 1.13.0-1%{?dist}
+- Initial RPM Release
+
diff --git a/vxl_copyright.h b/vxl_copyright.h
new file mode 100644
index 0000000..f8f8004
--- /dev/null
+++ b/vxl_copyright.h
@@ -0,0 +1,37 @@
+#ifndef vxl_copyright_h_
+#define vxl_copyright_h_
+
+// <begin copyright notice>
+// ---------------------------------------------------------------------------
+//
+//                Copyright (c) 2000-2003 TargetJr Consortium
+//               GE Corporate Research and Development (GE CRD)
+//                             1 Research Circle
+//                            Niskayuna, NY 12309
+//                            All Rights Reserved
+//              Reproduction rights limited as described below.
+//
+//      Permission to use, copy, modify, distribute, and sell this software
+//      and its documentation for any purpose is hereby granted without fee,
+//      provided that (i) the above copyright notice and this permission
+//      notice appear in all copies of the software and related documentation,
+//      (ii) the name TargetJr Consortium (represented by GE CRD), may not be
+//      used in any advertising or publicity relating to the software without
+//      the specific, prior written permission of GE CRD, and (iii) any
+//      modifications are clearly marked and summarized in a change history
+//      log.
+//
+//      THE SOFTWARE IS PROVIDED "AS IS" AND WITHOUT WARRANTY OF ANY KIND,
+//      EXPRESS, IMPLIED OR OTHERWISE, INCLUDING WITHOUT LIMITATION, ANY
+//      WARRANTY OF MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE.
+//      IN NO EVENT SHALL THE TARGETJR CONSORTIUM BE LIABLE FOR ANY SPECIAL,
+//      INCIDENTAL, INDIRECT OR CONSEQUENTIAL DAMAGES OF ANY KIND OR ANY
+//      DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS,
+//      WHETHER OR NOT ADVISED OF THE POSSIBILITY OF SUCH DAMAGES, OR ON
+//      ANY THEORY OF LIABILITY ARISING OUT OF OR IN CONNECTION WITH THE
+//      USE OR PERFORMANCE OF THIS SOFTWARE.
+//
+// ---------------------------------------------------------------------------
+// <end copyright notice>
+
+#endif // vxl_copyright_h_