/* * * Copyright (C) 2000 Silicon Graphics, Inc. All Rights Reserved. * * This library is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public * License as published by the Free Software Foundation; either * version 2.1 of the License, or (at your option) any later version. * * This library is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU * Lesser General Public License for more details. * * Further, this software is distributed without any warranty that it is * free of the rightful claim of any third person regarding infringement * or the like. Any license provided herein, whether implied or * otherwise, applies only to this software file. Patent licenses, if * any, provided herein do not apply to combinations of this program with * other software, or any other product whatsoever. * * You should have received a copy of the GNU Lesser General Public * License along with this library; if not, write to the Free Software * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA * * Contact information: Silicon Graphics, Inc., 1600 Amphitheatre Pkwy, * Mountain View, CA 94043, or: * * http://www.sgi.com * * For further information regarding this notice, see: * * http://oss.sgi.com/projects/GenInfo/NoticeExplan/ * */ /* * monotonizer.c++ - $Revision: 1.1.1.1 $ * Derrick Burns - 1991 */ #include "glimports.h" #include "mystdio.h" #include "myassert.h" #include "arc.h" #include "arctess.h" #include "bezierarc.h" #include "bin.h" #include "mapdesc.h" #include "nurbsconsts.h" #include "subdivider.h" /*----------------------------------------------------------------------------- * Subdivider::decompose - break all curves into monotone arcs *----------------------------------------------------------------------------- */ int Subdivider::decompose( Bin& bin, REAL geo_stepsize ) { Arc_ptr jarc; for( jarc=bin.firstarc(); jarc; jarc=bin.nextarc() ) { if( ! jarc->isTessellated() ) { /* points have not been transformed, therefore they may be either homogeneous or inhomogeneous */ tessellate( jarc, geo_stepsize ); if( jarc->isDisconnected() || jarc->next->isDisconnected() ) return 1; } } for( jarc=bin.firstarc(); jarc; jarc=bin.nextarc() ) { monotonize( jarc, bin ); } #ifndef NDEBUG for( jarc=bin.firstarc(); jarc; jarc=bin.nextarc() ) { assert( isMonotone( jarc ) ); } #endif return 0; } void Subdivider::tessellate( Arc_ptr jarc, REAL geo_stepsize ) { BezierArc *b = jarc->bezierArc; Mapdesc *mapdesc = b->mapdesc; if( mapdesc->isRational() ) { REAL max = mapdesc->calcVelocityRational( b->cpts, b->stride, b->order ); REAL arc_stepsize = (max > 1.0) ? (1.0/max) : 1.0; if( jarc->bezierArc->order != 2 ) arctessellator.tessellateNonlinear( jarc, geo_stepsize, arc_stepsize, 1 ); else { arctessellator.tessellateLinear( jarc, geo_stepsize, arc_stepsize, 1 ); } } else { REAL max = mapdesc->calcVelocityNonrational( b->cpts, b->stride, b->order ); REAL arc_stepsize = (max > 1.0) ? (1.0/max) : 1.0; if( jarc->bezierArc->order != 2 ) arctessellator.tessellateNonlinear( jarc, geo_stepsize, arc_stepsize, 0 ); else { arctessellator.tessellateLinear( jarc, geo_stepsize, arc_stepsize, 0 ); } } } /*------------------------------------------------------------------------- * Subdivider::monotonize - break up a jordan arc into s,t-monotone * components. This code will remove degenerate segments, including * arcs of only a single point. *------------------------------------------------------------------------- */ void Subdivider::monotonize( Arc_ptr jarc, Bin& bin ) { TrimVertex *firstvert = jarc->pwlArc->pts; TrimVertex *lastvert = firstvert + (jarc->pwlArc->npts - 1); long uid = jarc->nuid; arc_side side = jarc->getside(); dir sdir = none; dir tdir = none; int degenerate = 1; int nudegenerate; int change; TrimVertex *vert; for( vert = firstvert; vert != lastvert; vert++ ) { nudegenerate = 1; change = 0; /* check change relative to s axis, clear degenerate bit if needed */ REAL sdiff = vert[1].param[0] - vert[0].param[0]; if( sdiff == 0 ) { if( sdir != same ) { sdir = same; change = 1; } } else if( sdiff < 0.0 ) { if( sdir != down ) { sdir = down; change = 1; } nudegenerate = 0; } else { if( sdir != up ) { sdir = up; change = 1; } nudegenerate = 0; } /* check change relative to t axis, clear degenerate bit if needed */ REAL tdiff = vert[1].param[1] - vert[0].param[1]; if( tdiff == 0 ) { if( tdir != same ) { tdir = same; change = 1; } } else if( tdiff < 0.0 ) { if( tdir != down ) { tdir = down; change = 1; } nudegenerate = 0; } else { if( tdir != up ) { tdir = up; change = 1; } nudegenerate = 0; } if( change ) { if( ! degenerate ) { /* make last segment into separate pwl curve */ jarc->pwlArc->npts = vert - firstvert + 1; jarc = (new(arcpool) Arc( side, uid ))->append( jarc ); jarc->pwlArc = new(pwlarcpool) PwlArc(); bin.addarc( jarc ); } firstvert = jarc->pwlArc->pts = vert; degenerate = nudegenerate; } } jarc->pwlArc->npts = vert - firstvert + 1; if( degenerate ) { /* remove jarc from circularly linked list */ jarc->prev->next = jarc->next; jarc->next->prev = jarc->prev; assert( jarc->prev->check( ) ); assert( jarc->next->check( ) ); /* remove jarc from bin */ bin.remove_this_arc( jarc ); jarc->pwlArc->deleteMe( pwlarcpool ); jarc->pwlArc = 0; jarc->deleteMe( arcpool ); } } /*------------------------------------------------------------------------- * Subdivider::isMonotone - return true if arc is monotone AND non-degenerate *------------------------------------------------------------------------- */ int Subdivider::isMonotone( Arc_ptr jarc ) { TrimVertex *firstvert = jarc->pwlArc->pts; TrimVertex *lastvert = firstvert + (jarc->pwlArc->npts - 1); if( firstvert == lastvert ) return 1; TrimVertex *vert = firstvert; enum dir sdir; enum dir tdir; REAL diff = vert[1].param[0] - vert[0].param[0]; if( diff == 0.0 ) sdir = same; else if( diff < 0.0 ) sdir = down; else sdir = up; diff = vert[1].param[1] - vert[0].param[1]; if( diff == 0.0 ) tdir = same; else if( diff < 0.0 ) tdir = down; else tdir = up; if( (sdir == same) && (tdir == same) ) return 0; for( ++vert ; vert != lastvert; vert++ ) { diff = vert[1].param[0] - vert[0].param[0]; if( diff == 0.0 ) { if( sdir != same ) return 0; } else if( diff < 0.0 ) { if( sdir != down ) return 0; } else { if( sdir != up ) return 0; } diff = vert[1].param[1] - vert[0].param[1]; if( diff == 0.0 ) { if( tdir != same ) return 0; } else if( diff < 0.0 ) { if( tdir != down ) return 0; } else { if( tdir != up ) return 0; } } return 1; }