src/glu/sgi/libnurbs/nurbtess/monoChain.h

   1 /*
   2  * SGI FREE SOFTWARE LICENSE B (Version 2.0, Sept. 18, 2008)
   3  * Copyright (C) 1991-2000 Silicon Graphics, Inc. All Rights Reserved.
   4  *
   5  * Permission is hereby granted, free of charge, to any person obtaining a
   6  * copy of this software and associated documentation files (the "Software"),
   7  * to deal in the Software without restriction, including without limitation
   8  * the rights to use, copy, modify, merge, publish, distribute, sublicense,
   9  * and/or sell copies of the Software, and to permit persons to whom the
  10  * Software is furnished to do so, subject to the following conditions:
  11  *
  12  * The above copyright notice including the dates of first publication and
  13  * either this permission notice or a reference to
  14  * http://oss.sgi.com/projects/FreeB/
  15  * shall be included in all copies or substantial portions of the Software.
  16  *
  17  * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
  18  * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  19  * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
  20  * SILICON GRAPHICS, INC. BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
  21  * WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF
  22  * OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
  23  * SOFTWARE.
  24  *
  25  * Except as contained in this notice, the name of Silicon Graphics, Inc.
  26  * shall not be used in advertising or otherwise to promote the sale, use or
  27  * other dealings in this Software without prior written authorization from
  28  * Silicon Graphics, Inc.
  29  */
  30 /*
  31 ** $Header: /home/krh/git/sync/mesa-cvs-repo/Mesa/src/glu/sgi/libnurbs/nurbtess/monoChain.h,v 1.1 2001/03/17 00:25:41 brianp Exp $
  32 */
  33
  34 #ifndef _MONO_CHAIN_H
  35 #define _MONO_CHAIN_H
  36
  37 #include "directedLine.h"
  38 #include "partitionY.h"
  39
  40 class monoChain;
  41
  42 class monoChain{
  43   directedLine* chainHead;
  44   directedLine* chainTail;
  45   monoChain* next;
  46   monoChain* prev;
  47   monoChain* nextPolygon; //a list of polygons
  48
  49   //cached informatin
  50   //bounding box
  51   Real minX, maxX, minY, maxY;
  52   Int isIncrease;
  53
  54   //for efficiently comparing two chains
  55
  56   directedLine* current;
  57
  58 public:
  59   monoChain(directedLine* cHead, directedLine* cTail);
  60   ~monoChain() {}
  61
  62   inline  void setNext(monoChain* n) {next = n;}
  63   inline void setPrev(monoChain* p) {prev = p;}
  64   inline void setNextPolygon(monoChain* np) {nextPolygon = np;}
  65   inline monoChain* getNext() {return next;}
  66   inline monoChain* getPrev() {return prev;}
  67   inline directedLine* getHead() {return chainHead;}
  68   inline directedLine* getTail() {return chainTail;}
  69
  70   inline void resetCurrent() { current = ((isIncrease==1)? chainHead:chainTail);}
  71
  72   void deleteLoop();
  73   void deleteLoopList();
  74
  75   //insert a new chain between prev and this
  76   void insert(monoChain* nc);
  77
  78   Int numChainsSingleLoop();
  79   Int numChainsAllLoops();
  80   monoChain** toArrayAllLoops(Int& num_chains);
  81   Int toArraySingleLoop(monoChain** array, Int index);
  82
  83   Int isKey;
  84   Real keyY; //the current horizotal line
  85   Real chainIntersectHoriz(Real y); //updates current incrementally for efficiency
  86   directedLine* find(Real y);//find dline so that y intersects dline.
  87
  88   void printOneChain();
  89   void printChainLoop();
  90   void printAllLoops();
  91
  92 };
  93
  94 monoChain* directedLineLoopToMonoChainLoop(directedLine* loop);
  95 monoChain* directedLineLoopListToMonoChainLoopList(directedLine* list);
  96 Int MC_sweepY(Int nVertices, monoChain** sortedVertices, sweepRange** ret_ranges);
  97
  98 void MC_findDiagonals(Int total_num_edges, monoChain** sortedVertices,
  99                    sweepRange** ranges, Int& num_diagonals,
 100                    directedLine** diagonal_vertices);
 101
 102 directedLine* MC_partitionY(directedLine *polygons, sampledLine **retSampledLines);
 103
 104 #endif