JunkBox_Lib++ (for Windows) 1.10.1
Loading...
Searching...
No Matches
Classes | Typedefs | Functions | Variables
jbxl Namespace Reference

Classes

class  AffineTrans
 
class  ArrayParam
 
class  Base64
 
class  BREP_CONTOUR
 
class  BREP_EDGE
 
class  BREP_FACET
 
class  BREP_SHELL
 
class  BREP_SOLID
 
class  BREP_VERTEX
 
class  BREP_WING
 
class  BrepSolidList
 
class  CBVHTool
 
class  CLogRingBuffer
 
class  ColladaXML
 
class  ContourBaseData
 
class  ContourTriData
 
class  ContourTriIndex
 
class  CRingBuffer
 
class  CVCounter
 
class  CVDisplay
 
class  CVFrame
 
class  CVTextDocument
 
class  ExCmnHead
 
class  ExMSGraph
 
class  FBXData
 
class  GLTFData
 
class  GLTFShellNode
 
class  MaterialParam
 
class  Matrix
 
class  MeshFacetNode
 MeshObject の Polygonデータ（1面）を格納するクラス．リスト構造を取る． More...
 
class  MeshObjectData
 
class  MSGraph
 
class  MSGraphDisp
 
class  OBJData
 
class  OBJFacetGeoNode
 
class  OBJFacetMtlNode
 
class  OctreeNode
 
class  PCoordinate
 
class  Quaternion
 
class  RBound
 
class  SkinJointData
 
struct  STLData
 
class  TextureParam
 
class  TGAImage
 
struct  tmpSTLData
 データ読み込み用一時データ More...
 
class  TriPolygonData
 
class  TVector
 
class  UVMap
 
class  Vector
 
class  Vector4
 

Typedefs

typedef std::list< BREP_SOLID * > BREP_SOLID_LIST
 
typedef std::list< BREP_SHELL * > BREP_SHELL_LIST
 
typedef std::list< BREP_FACET * > BREP_FACET_LIST
 
typedef std::list< BREP_CONTOUR * > BREP_CONTOUR_LIST
 
typedef std::list< BREP_EDGE * > BREP_EDGE_LIST
 
typedef std::list< BREP_WING * > BREP_WING_LIST
 
typedef std::list< BREP_VERTEX * > BREP_VERTEX_LIST
 
typedef std::vector< Vector< double > > CONTOUR_VECTOR_ARRAY
 
typedef std::vector< Vector< float > > CONTOUR_VECTOR_ARRAY32
 
typedef std::vector< ContourTriIndex > CONTOUR_TRIINDX_ARRAY
 
typedef std::vector< ContourTriData > CONTOUR_TRIDATA_ARRAY
 

Functions

DllExport BREP_WING * CreateWingWithoutContour (BREP_VERTEX *vertex1, BREP_VERTEX *vertex2)
 
DllExport BREP_WING * GetWingOtherSide (BREP_WING *wing)
 
DllExport BREP_EDGE * FindEdge (BREP_VERTEX *vertex1, BREP_VERTEX *vertex2)
 
DllExport BREP_EDGE * CreateEdge (BREP_VERTEX *v1, BREP_VERTEX *v2)
 
DllExport BREP_VERTEX * AddVertex2Octree (BREP_VERTEX *vertex, OctreeNode *octree, bool dupli=false)
 
DllExport BREP_VERTEX ** GetOctreeVertices (OctreeNode *octree, long int *vertexno)
 
DllExport long int OctreeGetter (OctreeNode *p, BREP_VERTEX **vtx, long int counter)
 
DllExport void ConnectWingToVertex (BREP_WING *wing)
 
DllExport void DestroyWing (BREP_WING *wing)
 
DllExport int CompareVertex (BREP_VERTEX *v1, BREP_VERTEX *v2)
 
DllExport TVector< double > Vertex2TVector (BREP_VERTEX *v)
 
void freeBrepSolid (BREP_SOLID *&solid)
 
void freeBrepSolidList (BrepSolidList *&solids)
 
DllExport STLData * readSTLFile (char *fname, long int *fno)
 
DllExport int writeSTLFile (char *fname, BREP_SOLID *solid, bool ascii=false)
 
DllExport int writeSTLFile (char *fname, BREP_SOLID_LIST solid_list, bool ascii=false)
 
DllExport STLData * readSTLFileA (char *fname, long int *fno)
 
DllExport STLData * readSTLFileB (char *fname, long int *fno)
 
DllExport int writeSTLFileA (char *fname, BREP_SOLID *solid)
 
DllExport int writeSTLFileB (char *fname, BREP_SOLID *solid)
 
DllExport int writeSTLFileA (char *fname, BREP_SOLID_LIST solid_list)
 
DllExport int writeSTLFileB (char *fname, BREP_SOLID_LIST solid_list)
 
DllExport void println_FacetAsciiSTL (BREP_CONTOUR *contour)
 
DllExport void freeSTL (STLData *stldata)
 
DllExport BREP_CONTOUR * CreateContourByVector (BREP_FACET *facet, Vector< double > *v, Vector< double > *n=NULL, UVMap< double > *uv=NULL, ArrayParam< int > *w=NULL, bool dupli=false)
 
DllExport BREP_CONTOUR * CreateContourByVertex (BREP_FACET *facet, BREP_VERTEX **vtx)
 
DllExport void CreateContoursList (BREP_SOLID *solid)
 
DllExport void CreateWingsList (BREP_SOLID *solid)
 
DllExport void CreateSurplusContoursList (BREP_SOLID *solid)
 
DllExport void CreateShortageWingsList (BREP_SOLID *solid)
 
DllExport void DeleteSurplusContours (BREP_SOLID *solid)
 
DllExport void DeleteStraightEdges (BREP_SOLID *solid)
 
DllExport void DeleteShortageWings (BREP_SOLID *solid)
 
DllExport void FillShortageWings (BREP_SOLID *solid, int method, bool mode)
 
DllExport int FillShortageWings_Next (BREP_SOLID *solid, bool mode)
 
DllExport int FillShortageWings_Near (BREP_SOLID *solid, bool mode)
 
DllExport bool PatchupContour (BREP_SHELL *shell, BREP_VERTEX **vert, bool mode)
 
DllExport void JoinShortageWings (BREP_SOLID *solid)
 
DllExport void SetMinVertex (BREP_VERTEX_LIST *list, BREP_VERTEX *vrtx)
 
DllExport bool IsIncludeCompleteEdge (BREP_WING *wing)
 
DllExport BREP_VERTEX * FindConnectEdgeVertex (BREP_VERTEX *vert)
 
DllExport int DupEdgeNumber (BREP_CONTOUR *contour)
 
DllExport void ReverseContours (BREP_SOLID *solid)
 
DllExport void SetDeletableContoursByEdge (BREP_EDGE *edge)
 
DllExport void FastDeleteFacet (BREP_FACET *facet)
 
DllExport int IsAtLine (BREP_VERTEX **v)
 
DllExport bool IsForbiddenEdge (BREP_VERTEX **vert)
 
DllExport bool IsCollisionContours (BREP_SOLID *solid, BREP_CONTOUR *contour, BREP_CONTOUR **collision)
 
DllExport bool CollisionTriContour3D (BREP_CONTOUR *contour1, BREP_CONTOUR *contour2)
 
DllExport bool CollisionTriContour2D (BREP_CONTOUR *contour1, BREP_CONTOUR *contour2)
 
DllExport bool IsInTriangle (BREP_CONTOUR *contour1, BREP_CONTOUR *contour2)
 
DllExport int CommonVertex (BREP_CONTOUR *contour1, BREP_CONTOUR *contour2)
 
DllExport bool SamePlaneContour (BREP_CONTOUR *contour1, BREP_CONTOUR *contour2, int &lineno)
 
DllExport int CreateTriSolidFromSTL (BREP_SOLID *solid, STLData *stldata, int fno, bool check=true)
 
DllExport int CreateTriSolidFromVector (BREP_SOLID *solid, int vno, Vector< double > *v, Vector< double > *n=NULL, UVMap< double > *uv=NULL, ArrayParam< int > *w=NULL, bool dupli=false, bool check=true)
 
DllExport void AddVector2TriSolid (BREP_SOLID *solid, BREP_SHELL *shell, Vector< double > *v, Vector< double > *n=NULL, UVMap< double > *uv=NULL, ArrayParam< int > *w=NULL, bool dupli=false)
 
DllExport int CloseTriSolid (BREP_SOLID *solid, bool check=true, CVCounter *counter=NULL)
 
DllExport bool IsConnectEdges (BREP_WING *wing1, BREP_WING *wing2)
 
void SetGlobalFrame (CVFrame *frm)
 グローバルドキュメントのセット
 
void ClearGlobalFrame ()
 グローバルドキュメントのクリア
 
void SetGlobalDisplay (CVDisplay *disp)
 グローバルドキュメントのセット
 
void ClearGlobalDisplay ()
 グローバルドキュメントのクリア
 
void SetGlobalTextDocument (CVTextDocument *doc)
 グローバルドキュメントのセット
 
void ClearGlobalTextDocument ()
 グローバルドキュメントのクリア
 
CVCounter * GetUsableGlobalCounter ()
 現在有効なグローバルカウンタを得る．（子カウンタを得るかもしれない）
 
void SetGlobalCounter (CVCounter *counter)
 グローバルカウンタのセット
 
void ClearGlobalCounter ()
 グローバルカウンタのクリア
 
bool isNull (void *p)
 
template<typename T >
void freeNull (T &p)
 
template<typename T >
void deleteNull (T &p)
 
template<typename T >
void freeArrayParams (ArrayParam< T > *p, int num)
 
template<typename T >
tList * add_tList_object (tList *lt, T obj)
 
template<typename T >
void del_tList_object (tList **lp)
 
void DisPatcher (int sno=0,...)
 
void free_CmnHead (CmnHead *hd)
 
void init_CmnHead (CmnHead *hd)
 
CmnHead getinfo_CmnHead (CmnHead hd)
 ヘッダ情報のみをコピーする
 
uByte & CmnHeadBytePoint (CmnHead hd, int i=0, int j=0, int k=0)
 共通ヘッダCmnHeadから座標を指定して，画像データを取り出す
 
template<typename T >
MSGraph< T > copyCmnHead2MSGraph (CmnHead hd, unsigned int mode=CH2MG_NORMAL, bool cnt=false)
 
template<typename T >
CmnHead copyMSGraph2CmnHead (MSGraph< T > &vp, unsigned int mode=MG2CH_NORMAL, bool cnt=false)
 
template<typename T >
MSGraph< T > scalingMSGraph2D (MSGraph< T > vp, double scale)
 
unsigned int ARGB2Int (unsigned int a, unsigned int r, unsigned int g, unsigned int b)
 
uWord ARGB2Word (uWord a, uWord r, uWord g, uWord b)
 
uWord RGB2Word (uWord r, uWord g, uWord b)
 
CmnHead readUserSetData (FILE *fp, CmnHead *ch, bool cnt=false)
 read_user_data() for C // ユーザ指定(ch)のデータ形式でファイルを読み込む
 
CmnHead readRasData (FILE *fp)
 read_ras_data() for C // SUN RASTER形式のファイルを読み込む
 
int writeRasData (FILE *fp, CmnHead *ch, int obit=8)
 write_ras_data() for C
 
CmnHead readMoonFile (const char *fn, bool no_ntoh=false)
 
CmnHead readMoonData (FILE *fp, unsigned int fsz=0, bool no_ntoh=false)
 
int dicomHeader (FILE *fp, int fsize, int *dsize, int *xsize, int *ysize, int *depth, double *rzxy)
 
MSGraph< sWord > readDicomFile (const char *fn)
 
MSGraph< sWord > readDicomData (FILE *fp, int fsz)
 
CmnHead readXHead (const char *fn, CmnHead *ch=NULL)
 ヘッダ部分のみ読み込み
 
CmnHead readXHeadFile (const char *fn, CmnHead *ch=NULL, bool cnt=false)
 拡張read関数．ファイルを自動判別して読み込む．
 
CmnHead readCmnHeadFile (const char *fn, CmnHead *ch, bool cnt=false)
 拡張read関数．ファイル種別を指定して読み込む．
 
int writeCmnHeadFile (const char *fn, CmnHead *hd, bool cnt=false)
 
int writeCmnHeadData (FILE *fp, CmnHead *hd, bool cnt=false)
 
template<typename T >
MSGraph< T > readGraphicFile (const char *fname, CmnHead *chd=NULL, bool cnt=false)
 
template<typename T >
MSGraph< T > readGraphicSlices (const char *fmt, int fst, int fnd, CmnHead *chd=NULL, bool cnt=false)
 
template<typename T >
int writeGraphicFile (const char *fname, MSGraph< T > vp, int kind=0, int mlt=FALSE, int fnum=0, int tnum=0, bool cnt=false)
 
template<typename T >
int writeRasFile (const char *fname, MSGraph< T > vp)
 
template<typename T >
MSGraph< T > readRasFile (const char *fname)
 
template<typename R , typename T >
MSGraph< R > Laplacian (MSGraph< T > vp, int mode=0)
 
template<typename R , typename T >
MSGraph< R > xSobel (MSGraph< T > vp)
 
template<typename R , typename T >
MSGraph< R > ySobel (MSGraph< T > vp)
 
template<typename R , typename T >
MSGraph< R > zSobel (MSGraph< T > vp)
 
template<typename R , typename T >
MSGraph< R > xxSobel (MSGraph< T > vp)
 
template<typename R , typename T >
MSGraph< R > yySobel (MSGraph< T > vp)
 
template<typename R , typename T >
MSGraph< R > zzSobel (MSGraph< T > vp)
 
template<typename R , typename T >
MSGraph< Vector< R > > vNabla (MSGraph< T > vp)
 
template<typename R , typename T >
MSGraph< R > Nabla (MSGraph< T > vp)
 
template<typename R , typename T >
MSGraph< R > edgeEnhance (MSGraph< T > gd, int mode=0)
 
template<typename T >
MSGraph< T > medianFilter (MSGraph< T > xp, int ms=3)
 
template<typename T >
MSGraph< int > euclidDistance (MSGraph< T > vp, int bc, int &rr)
 
template<typename R , typename T >
MSGraph< R > MSMaskFilter (MSGraph< R > vp, MSGraph< T > filter, int mode=FILTER_NON)
 
void rotate_point (int &x, int &y, double sxc, double syc, double dxc, double dyc, double cst, double snt)
 
void rotate_point_angle (int &x, int &y, double sxc, double syc, double dxc, double dyc, double th)
 
template<typename T >
Vector< double > dgree_circle_MSGraph (MSGraph< T > vp)
 
template<typename T >
Vector< double > object_feature_MSGraph (MSGraph< T > vp, int mn, int mx)
 
template<typename T >
double count_around_MSGraph (MSGraph< T > vp)
 
template<typename T >
int count_area_MSGraph (MSGraph< T > xp)
 
template<typename T >
int count_object_MSGraph (MSGraph< T > xp, int mn, int mx)
 
template<typename T >
RBound< int > out_around_MSGraph (MSGraph< T > vp, int x, int y, int mode=8)
 
template<typename T >
RBound< int > get_boundary_MSGraph (MSGraph< T > vp, T mn, T mx)
 
template<typename T , typename R >
void cat_MSGraph (MSGraph< R > src, MSGraph< T > &dst)
 
template<typename T , typename R >
void cat_MSGraph (MSGraph< R > *src, MSGraph< T > *dst)
 
template<typename R , typename T >
void copy_MSGraph (MSGraph< R > src, MSGraph< T > &dst)
 
template<typename R , typename T >
void copy_MSGraph (MSGraph< R > *src, MSGraph< T > *dst)
 
template<typename T >
MSGraph< T > dup_MSGraph (MSGraph< T > src)
 
template<typename T >
MSGraph< T > * dup_MSGraph (MSGraph< T > *src)
 
template<typename T >
void ToPola (Vector< T > nv, double &cst, double &snt, double &csf, double &snf, double pcsf=0.0, double psnf=1.0)
 
template<typename T , typename R >
void Local2World (MSGraph< T > gd, MSGraph< T > vp, Vector< R > oq, Vector< R > op, Vector< R > ex, double *pcsf=NULL, double *psnf=NULL)
 
template<typename T >
void MSGraph_changeColor (MSGraph< T > vp, int f, int t)
 
template<typename T >
int MSGraph_Paint (MSGraph< T > vp, int x, int y, int mn, int mx, int cc, int mode=8)
 
template<typename T >
int MSGraph_Paint3D (MSGraph< T > vp, int x, int y, int z, int mn, int mx, int cc, int mode=8)
 
template<typename T >
void MSGraph_Line (MSGraph< T > vp, int x1, int y1, int x2, int y2, int cc)
 
template<typename T >
void MSGraph_Triangle (MSGraph< T > vp, int x1, int y1, int x2, int y2, int x3, int y3, int cc, int mode=OFF)
 
template<typename T >
void MSGraph_Box (MSGraph< T > vp, int x1, int y1, int x2, int y2, int cc, int mode=OFF)
 
template<typename T >
void MSGraph_Line3D (MSGraph< T > vp, int x1, int y1, int z1, int x2, int y2, int z2, int cc)
 
template<typename T >
void MSGraph_Circle (MSGraph< T > vp, int x, int y, int r, int cc, int mode=OFF)
 
template<typename T >
void MSGraph_Circle3D (MSGraph< T > vp, Vector<> ox, Vector<> ex, int rr, int cc, int mode=OFF)
 
template<typename T >
void MSGraph_Pool (MSGraph< T > vp, Vector<> a, Vector<> b, int rr, int cc)
 
template<typename T >
void MSGraph_Torus (MSGraph< T > vp, Vector<> ox, Vector<> ex, int rr, int ra, int cc)
 
template<typename T >
void MSGraph_Sphere (MSGraph< T > vp, Vector<> a, int r, int cc, int mode=1)
 
template<typename T >
MSGraph< T > cut_object_MSGraph (MSGraph< T > vp, int mn, int mx, int blank=BOUNDARY_BLANK, bool ecnt=false)
 
template<typename T >
MSGraph< T > cut_object_MSGraph (MSGraph< T > vp, int mn, int mx, RBound< int > rbound, int blank=BOUNDARY_BLANK, bool ecnt=false)
 
template<typename T >
MSGraph< T > cut_object_MSGraph (MSGraph< T > vp, RBound< int > rb, bool ecnt=false)
 
template<typename T >
MSGraph< T > zoom_MSGraph (MSGraph< T > vp, double zm, int mode=ON)
 
template<typename T >
MSGraph< T > reduce_MSGraph (MSGraph< T > vp, double rc, int mode=ON)
 
template<typename T >
MSGraph< T > rotate_MSGraph (MSGraph< T > vp, int xs, int ys, double cst, double snt, int mode=ON)
 
template<typename T >
MSGraph< T > rotate_MSGraph (MSGraph< T > vp, double th, int mode=ON)
 
template<typename T >
MSGraph< T > x_reverse_MSGraph (MSGraph< T > vp, bool ecnt=false)
 
template<typename T >
void set_around_MSGraph (MSGraph< T > vp, int cc=0, int size=1)
 
template<typename T >
MSGraph< T > grab_MSGraph (MSGraph< T > vp, int x1, int y1, int x2, int y2, int zs=0, int ze=0)
 
template<typename T >
MSGraph< T > * grab_MSGraph (MSGraph< T > *vp, int x1, int y1, int x2, int y2, int zs=0, int ze=0)
 
template<typename T >
int addPaint_MSGraph (MSGraph< T > xp, int x, int y, int mn, int mx, int add, int mode=8)
 
template<typename T >
MSGraph< T > Density_Mask (MSGraph< T > vp, double rate, int mode=8, int work_color=0)
 
template<typename T >
MSGraph< T > Density_Filter (MSGraph< T > vp, int size, double rate, int mode=8, int work_color=0)
 
template<typename T >
void delete_noise_MSGraph (MSGraph< T > vp, int size, int mode=8, int work_color=0)
 
template<typename T >
MSGraph< T > Morphology (MSGraph< T > vp, MSGraph< T > xp, int cc, int mode)
 
template<typename T >
MSGraph< T > opening_morph (MSGraph< T > vp, MSGraph< T > xp, int cc)
 
template<typename T >
bool point_open_morph (MSGraph< T > vp, int x, int y, int z, MSGraph< T > xp, int cc)
 
template<typename T >
void copy_morph_element (MSGraph< T > vp, int x, int y, int z, MSGraph< T > xp)
 
template<typename T >
MSGraph< T > fat_object_morph (MSGraph< T > vp, MSGraph< T > xp, int cc)
 
template<typename T >
bool point_fat_object_morph (MSGraph< T > vp, int x, int y, int z, MSGraph< T > xp, int cc)
 
template<typename T >
MSGraph< T > make_element_morph (Parameter32 x)
 
template<typename T >
rectangle * cvDetectObjects (cv::CascadeClassifier cascade, MSGraph< T > *vp, int &num, int sz=0, double scale=1.0)
 
template<typename R , typename T >
cv::Mat copyMSGraph2CvMat (MSGraph< T > *vp)
 
template<typename T >
MSGraph< T > * getMSGraphFromCvMat (cv::Mat mat)
 
template<typename T , typename R >
MSGraph< T > * _getMSGraph_CvMat_C1 (cv::Mat mat)
 
template<typename T , typename R >
MSGraph< T > * _getMSGraph_CvMat_C3 (cv::Mat mat)
 
template<typename R , typename T >
int _linecopy_MAT2MSG_C3 (R *src, T *dst, int len, int sz)
 
TGAImage readTGAFile (const char *fname)
 
TGAImage readTGAData (FILE *fp)
 
int writeTGAFile (const char *fname, TGAImage *tga)
 
int writeTGAData (FILE *fp, TGAImage *tga)
 
int setupTGAData (TGAImage *tga, bool rle)
 
template<typename T >
MSGraph< T > TGAImage2MSGraph (TGAImage tga)
 
template<typename T >
TGAImage MSGraph2TGAImage (MSGraph< T > vp, bool rle)
 
template<typename T >
MSGraph< T > CenterLine (MSGraph< T > gx, int mode)
 
template<typename T >
int nonZeroBoxel (MSGraph< T > vp, int n)
 
template<typename T >
bool deletable (MSGraph< T > vp, int n, int c, int d)
 
int connectNumber (int *w, int c, int d)
 
bool deletable_s (int *v)
 
bool deletable_4 (int *v)
 
bool deletable_5 (int *v)
 
template<typename T >
MSGraph< T > centerLine (MSGraph< T > gx, int mode)
 
template<typename T >
void wSetPixel (MSGraph< T > vp, double x, double y, int cc)
 
template<typename T >
void wSetPixel3D (MSGraph< T > vp, double x, double y, double z, int cc)
 
template<typename T >
T wGetPixel (MSGraph< T > vp, double x, double y)
 
template<typename T >
T wGetPixel3D (MSGraph< T > vp, double x, double y, double z)
 
template<typename T >
void wLine (MSGraph< T > vp, double x1, double y1, double x2, double y2, int cc)
 
template<typename T >
void wLine3D (MSGraph< T > vp, double x1, double y1, double z1, double x2, double y2, double z2, int cc)
 
template<typename T >
void wCircle3D (MSGraph< T > vp, Vector< double > ox, Vector< double > ex, double rr, int cc, int mode)
 
template<typename T >
void wDraw (MSGraph< T > *vp, double x, double y, int cc)
 
template<typename T >
void wDraw3D (MSGraph< T > *vp, double x, double y, double z, int cc)
 
template<typename T >
void wDraw_rel (MSGraph< T > *vp, double x, double y, int cc)
 
template<typename T >
void wDraw_rel3D (MSGraph< T > *vp, double x, double y, double z, int cc)
 
template<typename T >
void freeAffineTrans (AffineTrans< T > *&affine)
 
template<typename T >
AffineTrans< T > * newAffineTrans (AffineTrans< T > p)
 
template<typename T >
AffineTrans< T > operator* (AffineTrans< T > a, AffineTrans< T > b)
 
template<typename T >
void print_Matrix (FILE *fp, Matrix< T > a)
 
template<typename T >
Matrix< T > dup_Matrix (Matrix< T > a)
 
template<typename T >
Matrix< T > operator* (const Matrix< T > a, const Matrix< T > b)
 
template<typename T >
Vector< T > operator* (const Matrix< T > a, const Vector< T > v)
 
template<typename T >
Matrix< T > operator- (const Matrix< T > a)
 
template<typename T >
Matrix< T > operator+ (const Matrix< T > a, const Matrix< T > b)
 
template<typename T >
Matrix< T > operator- (const Matrix< T > a, const Matrix< T > b)
 
template<typename T , typename R >
Matrix< T > operator* (const R d, const Matrix< T > a)
 
template<typename T , typename R >
Matrix< T > operator* (const Matrix< T > a, const R d)
 
template<typename T , typename R >
Matrix< T > operator/ (const Matrix< T > a, const R d)
 
template<typename T >
bool operator== (const Matrix< T > v1, const Matrix< T > v2)
 
template<typename T >
bool isSameDimension (const Matrix< T > v1, const Matrix< T > v2)
 
template<typename T >
Vector< T > Quaternion2ExtEulerXYZ (Quaternion< T > qut, Vector< T > *vct=NULL)
 
template<typename T >
Vector< T > Quaternion2ExtEulerZYX (Quaternion< T > qut, Vector< T > *vct=NULL)
 
template<typename T >
Vector< T > Quaternion2ExtEulerXZY (Quaternion< T > qut, Vector< T > *vct=NULL)
 
template<typename T >
Vector< T > Quaternion2ExtEulerYZX (Quaternion< T > qut, Vector< T > *vct=NULL)
 
template<typename T >
Vector< T > Quaternion2ExtEulerYXZ (Quaternion< T > qut, Vector< T > *vct=NULL)
 
template<typename T >
Vector< T > Quaternion2ExtEulerZXY (Quaternion< T > qut, Vector< T > *vct=NULL)
 
template<typename T >
bool operator== (const Quaternion< T > q1, const Quaternion< T > q2)
 
template<typename T >
bool operator!= (const Quaternion< T > q1, const Quaternion< T > q2)
 ~ 共役
 
template<typename T >
Quaternion< T > operator~ (const Quaternion< T > a)
 
template<typename T >
Quaternion< T > operator- (const Quaternion< T > a)
 
template<typename T >
Quaternion< T > operator+ (const Quaternion< T > a, const Quaternion< T > b)
 
template<typename T >
Quaternion< T > operator- (const Quaternion< T > a, const Quaternion< T > b)
 
template<typename T , typename R >
Quaternion< T > operator* (const R d, const Quaternion< T > a)
 
template<typename T , typename R >
Quaternion< T > operator* (const Quaternion< T > a, const R d)
 
template<typename T , typename R >
Quaternion< T > operator/ (const Quaternion< T > a, const R d)
 
template<typename T >
Quaternion< T > operator* (const Quaternion< T > a, const Quaternion< T > b)
 
template<typename T >
Quaternion< T > operator* (const Quaternion< T > q, const Vector< T > v)
 
template<typename T >
Quaternion< T > operator* (const Vector< T > v, const Quaternion< T > q)
 
template<typename T >
Quaternion< T > ExtEulerXYZ2Quaternion (Vector< T > e)
 
template<typename T >
Quaternion< T > ExtEulerZYX2Quaternion (Vector< T > e)
 
template<typename T >
Quaternion< T > ExtEulerXZY2Quaternion (Vector< T > e)
 
template<typename T >
Quaternion< T > ExtEulerYZX2Quaternion (Vector< T > e)
 
template<typename T >
Quaternion< T > ExtEulerYXZ2Quaternion (Vector< T > e)
 
template<typename T >
Quaternion< T > ExtEulerZXY2Quaternion (Vector< T > e)
 
template<typename T >
Matrix< T > ExtEulerXYZ2RotMatrix (Vector< T > eul)
 
template<typename T >
Matrix< T > ExtEulerZYX2RotMatrix (Vector< T > eul)
 
template<typename T >
Matrix< T > ExtEulerXZY2RotMatrix (Vector< T > eul)
 
template<typename T >
Matrix< T > ExtEulerYZX2RotMatrix (Vector< T > eul)
 
template<typename T >
Matrix< T > ExtEulerZXY2RotMatrix (Vector< T > eul)
 
template<typename T >
Matrix< T > ExtEulerYXZ2RotMatrix (Vector< T > eul)
 
template<typename T >
Vector< T > RotMatrixElements2ExtEulerXYZ (T m11, T m12, T m13, T m21, T m31, T m32, T m33, Vector< T > *vct=NULL)
 
template<typename T >
Vector< T > RotMatrixElements2ExtEulerZYX (T m11, T m12, T m13, T m21, T m23, T m31, T m33, Vector< T > *vct=NULL)
 
template<typename T >
Vector< T > RotMatrixElements2ExtEulerXZY (T m11, T m12, T m13, T m21, T m22, T m23, T m31, Vector< T > *vct=NULL)
 
template<typename T >
Vector< T > RotMatrixElements2ExtEulerYZX (T m11, T m12, T m13, T m21, T m22, T m31, T m32, Vector< T > *vct=NULL)
 
template<typename T >
Vector< T > RotMatrixElements2ExtEulerYXZ (T m12, T m21, T m22, T m23, T m31, T m32, T m33, Vector< T > *vct=NULL)
 
template<typename T >
Vector< T > RotMatrixElements2ExtEulerZXY (T m12, T m13, T m21, T m22, T m23, T m32, T m33, Vector< T > *vct=NULL)
 
template<typename T >
Vector< T > RotMatrix2ExtEulerXYZ (Matrix< T > mtx, Vector< T > *vct=NULL)
 
template<typename T >
Vector< T > RotMatrix2ExtEulerZYX (Matrix< T > mtx, Vector< T > *vct)
 
template<typename T >
Vector< T > RotMatrix2ExtEulerXZY (Matrix< T > mtx, Vector< T > *vct=NULL)
 
template<typename T >
Vector< T > RotMatrix2ExtEulerYZX (Matrix< T > mtx, Vector< T > *vct=NULL)
 
template<typename T >
Vector< T > RotMatrix2ExtEulerYXZ (Matrix< T > mtx, Vector< T > *vct=NULL)
 
template<typename T >
Vector< T > RotMatrix2ExtEulerZXY (Matrix< T > mtx, Vector< T > *vct=NULL)
 
template<typename T >
Quaternion< T > RotMatrix2Quaternion (Matrix< T > mtx)
 
template<typename T >
Vector< T > VectorRotation (Vector< T > v, Quaternion< T > q)
 
template<typename T >
Vector< T > VectorInvRotation (Vector< T > v, Quaternion< T > q)
 
template<typename T >
T * VectorRotation (T *v, Quaternion< T > q)
 
template<typename T >
T * VectorInvRotation (T *v, Quaternion< T > q)
 
template<typename T >
Quaternion< T > V2VQuaternion (Vector< T > a, Vector< T > b)
 
template<typename T >
Quaternion< T > PPPQuaternion (Vector< T > a, Vector< T > b, Vector< T > c)
 
template<typename T >
Quaternion< T > VPPQuaternion (Vector< T > a, Vector< T > b, Vector< T > c)
 
template<typename T >
Quaternion< T > PPVQuaternion (Vector< T > a, Vector< T > b, Vector< T > c)
 
template<typename T >
Quaternion< T > SlerpQuaternion (Quaternion< T > qa, Quaternion< T > qb, T t)
 
void SetZeroEPS (double eps)
 
void SetVectorTolerance (double tol)
 
void SetVertexTolerance (double tol)
 
void SetEdgeTolerance (double tol)
 
void SetFacetTolerance (double tol)
 
void SetCollisionTolerance (double tol)
 
void SetSINTolerance (double tol)
 
void SetAbsVectorTolerance (double tol)
 
void SetAbsVertexTolerance (double tol)
 
template<typename T >
double ProportionVector (TVector< T > v1, TVector< T > v2, T &t)
 
template<typename T >
TVector< T > operator- (const TVector< T > a)
 
template<typename T >
TVector< T > operator+ (const TVector< T > a, const TVector< T > b)
 
template<typename T , typename R >
TVector< T > operator+ (const R d, const TVector< T > a)
 
template<typename T , typename R >
TVector< T > operator+ (const TVector< T > a, const R d)
 
template<typename T >
TVector< T > operator- (const TVector< T > a, const TVector< T > b)
 
template<typename T , typename R >
TVector< T > operator- (const R d, const TVector< T > a)
 
template<typename T , typename R >
TVector< T > operator- (const TVector< T > a, const R d)
 
template<typename T , typename R >
TVector< T > operator* (const R d, const TVector< T > a)
 
template<typename T , typename R >
TVector< T > operator* (const TVector< T > a, const R d)
 
template<typename T , typename R >
TVector< T > operator/ (const TVector< T > a, const R d)
 
template<typename T , typename R >
TVector< T > operator/ (const R d, const TVector< T > a)
 
template<typename T >
bool operator== (const TVector< T > v1, const TVector< T > v2)
 
template<typename T >
bool operator!= (const TVector< T > v1, const TVector< T > v2)
 
template<typename T >
TVector< T > operator^ (const TVector< T > a, const TVector< T > b)
 Cross product 外積
 
template<typename T >
T operator* (const TVector< T > a, const TVector< T > b)
 Dot product 内積
 
template<typename T >
T TVectorMultiTolerance (TVector< T > a, TVector< T > b)
 内積の誤差
 
template<typename T , typename R >
Vector< T > Cast (Vector< R > v)
 
template<typename T >
Vector< T > operator- (const Vector< T > a)
 
template<typename T >
Vector< T > operator+ (const Vector< T > a, const Vector< T > b)
 
template<typename T , typename R >
Vector< T > operator+ (const Vector< T > a, R c)
 
template<typename T , typename R >
Vector< T > operator+ (const R c, Vector< T > a)
 
template<typename T >
Vector< T > operator- (const Vector< T > a, const Vector< T > b)
 
template<typename T , typename R >
Vector< T > operator- (const Vector< T > a, R c)
 
template<typename T , typename R >
Vector< T > operator- (R c, const Vector< T > a)
 
template<typename T , typename R >
Vector< T > operator* (const R d, const Vector< T > a)
 
template<typename T , typename R >
Vector< T > operator* (const Vector< T > a, const R d)
 
template<typename T , typename R >
Vector< T > operator/ (const Vector< T > a, const R d)
 
template<typename T , typename R >
Vector< T > operator/ (const R d, const Vector< T > a)
 
template<typename T >
Vector< T > operator+= (Vector< T > &a, const Vector< T > b)
 
template<typename T , typename R >
Vector< T > operator+= (Vector< T > &a, const Vector< R > b)
 
template<typename T >
Vector< T > operator-= (Vector< T > &a, const Vector< T > b)
 
template<typename T , typename R >
Vector< T > operator-= (Vector< T > &a, const Vector< R > b)
 
template<typename T >
Vector< T > operator^ (const Vector< T > a, const Vector< T > b)
 Cross product 外積
 
template<typename T >
T operator* (const Vector< T > a, const Vector< T > b)
 Dot product 内積
 
template<typename T >
bool operator== (const Vector< T > v1, const Vector< T > v2)
 
template<typename T >
bool operator!= (const Vector< T > v1, const Vector< T > v2)
 
template<typename T >
Vector< T > MidPoint (const Vector< T > a, const Vector< T > b)
 
template<typename T >
double VectorDist (const Vector< T > a, const Vector< T > b)
 点a と b の距離　（a,b は位置ベクトル）
 
template<typename T >
bool operator< (const Vector< T > v1, const Vector< T > v2)
 
template<typename T >
bool same_vector (Vector< T > v1, Vector< T > v2)
 
template<typename T >
Vector< T > * dupVector (Vector< T > *a, int n)
 
template<typename T >
double VectorAngle (Vector< T > a, Vector< T > b)
 
template<typename T >
double VectorAngle (Vector< T > a, Vector< T > b, Vector< T > c)
 
template<typename T >
Vector< T > NewellMethod (Vector< T > v1, Vector< T > v2, Vector< T > v3)
 Normal Vector of 3 Vectors with Newell Mothod.
 
template<typename T >
Vector< T > NewellMethod3 (Vector< T > v1, Vector< T > v2, Vector< T > v3)
 
template<typename T >
Vector< T > NewellMethod4 (Vector< T > v1, Vector< T > v2, Vector< T > v3, Vector< T > v4)
 
template<typename T >
Vector< T > BSplineInterp4 (Vector< T > p0, Vector< T > p1, double t)
 
template<typename T >
bool disJunctBounds (RBound< T > b1, RBound< T > b2)
 
template<typename T , typename R >
UVMap< T > Cast (UVMap< R > v)
 
template<typename T >
UVMap< T > operator- (const UVMap< T > a)
 
template<typename T >
UVMap< T > operator+ (const UVMap< T > a, const UVMap< T > b)
 
template<typename T , typename R >
UVMap< T > operator+ (const UVMap< T > a, R c)
 
template<typename T , typename R >
UVMap< T > operator+ (const R c, UVMap< T > a)
 
template<typename T >
UVMap< T > operator- (const UVMap< T > a, const UVMap< T > b)
 
template<typename T , typename R >
UVMap< T > operator- (const UVMap< T > a, R c)
 
template<typename T , typename R >
UVMap< T > operator- (const R c, UVMap< T >a)
 
template<typename T , typename R >
UVMap< T > operator* (const R d, const UVMap< T > a)
 
template<typename T , typename R >
UVMap< T > operator* (const UVMap< T > a, const R d)
 
template<typename T , typename R >
UVMap< T > operator/ (const UVMap< T > a, const R d)
 
template<typename T , typename R >
UVMap< T > operator/ (const R d, const UVMap< T > a)
 
template<typename T >
bool operator== (const UVMap< T > a, const UVMap< T > b)
 
template<typename T >
bool operator!= (const UVMap< T > a, const UVMap< T > b)
 
template<typename T >
UVMap< T > operator+= (UVMap< T > &a, const UVMap< T > b)
 
template<typename T , typename R >
UVMap< T > operator+= (UVMap< T > &a, const UVMap< R > b)
 
template<typename T >
UVMap< T > operator-= (UVMap< T > &a, const UVMap< T > b)
 
template<typename T , typename R >
UVMap< T > operator-= (UVMap< T > &a, const UVMap< R > b)
 
template<typename T , typename R >
Vector4< T > Cast (Vector4< R > v)
 
template<typename T >
Vector4< T > operator- (const Vector4< T > a)
 
template<typename T >
Vector4< T > operator+ (const Vector4< T > a, const Vector4< T > b)
 
template<typename T , typename R >
Vector4< T > operator+ (const Vector4< T > a, R c)
 
template<typename T , typename R >
Vector4< T > operator+ (const R c, Vector4< T > a)
 
template<typename T >
Vector4< T > operator- (const Vector4< T > a, const Vector4< T > b)
 
template<typename T , typename R >
Vector4< T > operator- (const Vector4< T > a, R c)
 
template<typename T , typename R >
Vector4< T > operator- (R c, const Vector4< T > a)
 
template<typename T , typename R >
Vector4< T > operator* (const R d, const Vector4< T > a)
 
template<typename T , typename R >
Vector4< T > operator* (const Vector4< T > a, const R d)
 
template<typename T , typename R >
Vector4< T > operator/ (const Vector4< T > a, const R d)
 
template<typename T , typename R >
Vector4< T > operator/ (const R d, const Vector4< T > a)
 
template<typename T >
Vector4< T > operator+= (Vector4< T > &a, const Vector4< T > b)
 
template<typename T , typename R >
Vector4< T > operator+= (Vector4< T > &a, const Vector4< R > b)
 
template<typename T >
Vector4< T > operator-= (Vector4< T > &a, const Vector4< T > b)
 
template<typename T , typename R >
Vector4< T > operator-= (Vector4< T > &a, const Vector4< R > b)
 
template<typename T >
T operator* (const Vector4< T > a, const Vector4< T > b)
 Dot product 内積
 
template<typename T >
bool operator== (const Vector4< T > v1, const Vector4< T > v2)
 
template<typename T >
bool operator!= (const Vector4< T > v1, const Vector4< T > v2)
 
template<typename T >
Vector4< T > MidPoint (const Vector4< T > a, const Vector4< T > b)
 
template<typename T >
double Vector4Dist (const Vector4< T > a, const Vector4< T > b)
 点a と b の距離　（a,b は位置ベクトル）
 
template<typename T >
bool operator< (const Vector4< T > v1, const Vector4< T > v2)
 
template<typename T >
bool same_vector (Vector4< T > v1, Vector4< T > v2)
 
template<typename T >
Vector4< T > * dupVector4 (Vector4< T > *a, int n)
 
template<typename T >
double Vector4Angle (Vector4< T > a, Vector4< T > b)
 
template<typename T >
double Vector4Angle (Vector4< T > a, Vector4< T > b, Vector4< T > c)
 
void freeColladaXML (ColladaXML *&dae)
 
TriPolygonData * dupTriPolygonData (TriPolygonData *data, int num)
 
TriPolygonData * joinTriPolygonData (TriPolygonData *&first, int num_f, TriPolygonData *&next, int num_n)
 
void freeTriPolygonData (TriPolygonData *&tridata)
 
void freeTriPolygonData (TriPolygonData *&tridata, int n)
 
void freeContourBaseData (ContourBaseData *&contour)
 
void freeFBXData (FBXData *fbx)
 
void freeGLTFData (GLTFData *gltf)
 
bool isSameTexture (TextureParam a, TextureParam b)
 compare texture ma,e and color
 
MaterialParam * newMaterialParam (MaterialParam p)
 
bool isSameMaterial (MaterialParam a, MaterialParam b)
 compare each texture names and colors
 
void freeMeshFacetNode (MeshFacetNode *&node)
 
void freeMeshFacetList (MeshFacetNode *&node)
 
MeshFacetNode * DelMeshFacetNode (MeshFacetNode *node)
 
MeshFacetNode * AddMeshFacetNode (MeshFacetNode *list, MeshFacetNode *node)
 
void freeMeshObjectData (MeshObjectData *&data)
 
void freeOBJData (OBJData *obj)
 

Variables

class DllExport BREP_SOLID
 
class DllExport BREP_SHELL
 
class DllExport BREP_FACET
 
class DllExport BREP_CONTOUR
 
class DllExport BREP_EDGE
 
class DllExport BREP_WING
 
class DllExport BREP_VERTEX
 
class DllExport OctreeNode
 
CVFrame * GLFrame = NULL
 グローバルディスプレイインターフェイス
 
CVDisplay * GLDisplay = NULL
 グローバルディスプレイインターフェイス
 
CVTextDocument * GLTextDocument = NULL
 グローバル テキストドキュメント インターフェイス
 
CVCounter * GLCounter = NULL
 グローバルカウンタ
 
int ZeroBase = 0
 
int TempBase = 0
 
template<typename T >
class DllExport Quaternion
 
double Vector_Tolerance = 1.0e-8
 
double Vertex_Tolerance = 1.0e-8
 
double Edge_Tolerance = 1.0e-12
 
double Facet_Tolerance = 1.0e-12
 
double Abs_Vector_Tolerance = 1.0e-6
 
double Abs_Vertex_Tolerance = 1.0e-6
 
double Collision_Tolerance = 1.0e-3
 衝突判定用トレランス
 
double Sin_Tolerance = 1.0e-6
 sinθ==0
 
double Zero_Eps = 1.0e-8
 1に対して 0とするトレランス
 
double Zero_Eps2 = Zero_Eps*Zero_Eps
 

Detailed Description

3D Contour（3角ポリゴン）用基本データ

Wavefront FBX ファイル用ツール

glTF/glb ファイル用ツール

JBXL glTF/glb Tool Library (C) 2024 v1.0 by Fumi.Iseki and Austin Tate v1.1.0

Wavefront OBJ ファイル用ツール

Typedef Documentation

◆ BREP_CONTOUR_LIST

typedef std::list<BREP_CONTOUR*> BREP_CONTOUR_LIST

Definition at line 44 of file Brep.h.

◆ BREP_EDGE_LIST

typedef std::list<BREP_EDGE*> BREP_EDGE_LIST

Definition at line 45 of file Brep.h.

◆ BREP_FACET_LIST

typedef std::list<BREP_FACET*> BREP_FACET_LIST

Definition at line 43 of file Brep.h.

◆ BREP_SHELL_LIST

typedef std::list<BREP_SHELL*> BREP_SHELL_LIST

Definition at line 42 of file Brep.h.

◆ BREP_SOLID_LIST

typedef std::list<BREP_SOLID*> BREP_SOLID_LIST

Definition at line 41 of file Brep.h.

◆ BREP_VERTEX_LIST

typedef std::list<BREP_VERTEX*> BREP_VERTEX_LIST

Definition at line 47 of file Brep.h.

◆ BREP_WING_LIST

typedef std::list<BREP_WING*> BREP_WING_LIST

Definition at line 46 of file Brep.h.

◆ CONTOUR_TRIDATA_ARRAY

typedef std::vector<ContourTriData> CONTOUR_TRIDATA_ARRAY

Definition at line 34 of file ContourBaseData.h.

◆ CONTOUR_TRIINDX_ARRAY

typedef std::vector<ContourTriIndex> CONTOUR_TRIINDX_ARRAY

Definition at line 33 of file ContourBaseData.h.

◆ CONTOUR_VECTOR_ARRAY

typedef std::vector<Vector<double> > CONTOUR_VECTOR_ARRAY

Definition at line 31 of file ContourBaseData.h.

◆ CONTOUR_VECTOR_ARRAY32

typedef std::vector<Vector<float> > CONTOUR_VECTOR_ARRAY32

Definition at line 32 of file ContourBaseData.h.

Function Documentation

◆ _getMSGraph_CvMat_C1()

template<typename T , typename R >
MSGraph< T > * _getMSGraph_CvMat_C1 ( cv::Mat mat)

Definition at line 233 of file OpenCVTool.h.

234{
235 MSGraph<T>* vp = NULL;
236
237 if (mat.channels()!=1) return NULL;
238
239 if (mat.dims==2) {
240 vp = new MSGraph<T>(mat.cols, mat.rows);
241 if (vp==NULL || vp->gp==NULL) return vp;
242
243 // 通常は連続しているはず
244 if (mat.isContinuous()) {
245 R* ptr = (R*)mat.data;
246 T* dst = vp->gp;
247 for (int i=0; i<vp->xs*vp->ys; i++) {
248 dst[i] = (T)ptr[i];
249 }
250 }
251 else {
252 for (int j=0; j<vp->ys; j++) {
253 R* ptr = mat.ptr<R>(j);
254 T* dst = &(vp->gp[j*vp->xs]);
255 for (int i=0; i<vp->xs; i++) {
256 dst[i] = (T)ptr[i];
257 }
258 }
259 }
260 //
261 vp->color = GRAPH_COLOR_MONO;
262 }
263
264 // 3次元
265 else if (mat.dims==3) {
266 vp = new MSGraph<T>((int)mat.size[2], (int)mat.size[1], (int)mat.size[0]);
267 if (vp==NULL || vp->gp==NULL) return vp;
268
269 // 通常は連続しているはず
270 if (mat.isContinuous()) {
271 R* ptr = (R*)mat.data;
272 T* dst = vp->gp;
273 for (int i=0; i<vp->xs*vp->ys*vp->zs; i++) {
274 dst[i] = (T)ptr[i];
275 }
276 }
277 else {
278 for (int k=0; k<vp->zs; k++) {
279 int kk = k*vp->ys*vp->xs;
280 for (int j=0; j<vp->ys; j++) {
281 R* ptr = mat.ptr<R>(k, j);
282 T* dst = &(vp->gp[j*vp->xs + kk]);
283 for (int i=0; i<vp->xs; i++) {
284 dst[i] = (T)ptr[i];
285 }
286 }
287 }
288 }
289 //
290 vp->color = GRAPH_COLOR_MONO;
291 }
292 return vp;
293}
jbxl::MSGraph::gp
T * gp
グラフィックデータへのポインタ.
Definition Gdata.h:81
jbxl::MSGraph::color
int color
データのカラータイプ
Definition Gdata.h:89
jbxl::MSGraph::zs
int zs
zサイズ. 4Byte. 2Dの場合は 1.
Definition Gdata.h:80
jbxl::MSGraph::xs
int xs
xサイズ. 4Byte.
Definition Gdata.h:78
jbxl::MSGraph::ys
int ys
yサイズ. 4Byte.
Definition Gdata.h:79
GRAPH_COLOR_MONO
#define GRAPH_COLOR_MONO
0x0000
Definition gheader.h:242

References MSGraph< T >::color, MSGraph< T >::gp, GRAPH_COLOR_MONO, MSGraph< T >::xs, MSGraph< T >::ys, and MSGraph< T >::zs.

◆ _getMSGraph_CvMat_C3()

template<typename T , typename R >
MSGraph< T > * _getMSGraph_CvMat_C3 ( cv::Mat mat)

Definition at line 299 of file OpenCVTool.h.

300{
301 MSGraph<T>* vp = NULL;
302
303 if (mat.channels()!=3) return NULL;
304 int tsz = sizeof(T);
305
306 if (mat.dims==2) {
307 vp = new MSGraph<T>(mat.cols, mat.rows);
308 if (vp==NULL || vp->gp==NULL) return vp;
309
310 // 通常は連続しているはず
311 if (mat.isContinuous()) {
312 R* src = (R*)mat.data;
313 T* dst = vp->gp;
314 vp->color = _linecopy_MAT2MSG_C3(src, dst, vp->xs*vp->ys, tsz);
315 }
316
317 else {
318 for (int j=0; j<vp->ys; j++) {
319 R* src = mat.ptr<R>(j);
320 T* dst = &(vp->gp[j*vp->xs]);
321 _linecopy_MAT2MSG_C3(src, dst, vp->xs, tsz);
322 }
323 vp->color = _linecopy_MAT2MSG_C3((R*)NULL, (T*)NULL, 0, tsz); // return color only
324 }
325 }
326
327 // 3次元
328 else if (mat.dims==3) {
329 vp = new MSGraph<T>((int)mat.size[2], (int)mat.size[1], (int)mat.size[0]);
330 if (vp==NULL || vp->gp==NULL) return vp;
331
332 // 通常は連続しているはず
333 if (mat.isContinuous()) {
334 R* src = (R*)mat.data;
335 T* dst = vp->gp;
336 vp->color = _linecopy_MAT2MSG_C3(src, dst, vp->xs*vp->ys*vp->zs, tsz);
337 }
338 else {
339 for (int k=0; k<vp->zs; k++) {
340 int kk = k*vp->ys*vp->xs;
341 for (int j=0; j<vp->ys; j++) {
342 R* src = mat.ptr<R>(k, j);
343 T* dst = &(vp->gp[j*vp->xs + kk]);
344 for (int i=0; i<vp->xs; i++) {
345 _linecopy_MAT2MSG_C3(src, dst, vp->xs, tsz);
346 }
347 }
348 }
349 vp->color = _linecopy_MAT2MSG_C3((R*)NULL, (T*)NULL, 0, tsz); // return color only
350 }
351 }
352 return vp;
353}
jbxl::_linecopy_MAT2MSG_C3
int _linecopy_MAT2MSG_C3(R *src, T *dst, int len, int sz)
Definition OpenCVTool.h:358

References _linecopy_MAT2MSG_C3(), MSGraph< T >::color, MSGraph< T >::gp, MSGraph< T >::xs, MSGraph< T >::ys, and MSGraph< T >::zs.

Here is the call graph for this function:

◆ _linecopy_MAT2MSG_C3()

template<typename R , typename T >
int _linecopy_MAT2MSG_C3 ( R * src,
T * dst,
int len,
int sz )

Definition at line 358 of file OpenCVTool.h.

359{
360 int i3 = 0;
361 int color = GRAPH_COLOR_MONO;
362
363 if (sz==1) {
364 for (int i=0; i<len; i++) {
365 dst[i] = (T)(((unsigned int)src[i3] + (unsigned int)src[i3+1] + (unsigned int)src[i3+2])/3);
366 i3 += 3;
367 }
368 }
369
370 else if (sz==2) {
371 for (int i=0; i<len; i++) {
372 dst[i] = (T)RGB2Word((unsigned int)src[i3+2], (unsigned int)src[i3+1], (unsigned int)src[i3]);
373 i3 += 3;
374 }
375 color = GRAPH_COLOR_RGB16;
376 }
377
378 else {
379 for (int i=0; i<len; i++) {
380 dst[i] = (T)ABGR2Int(0, (unsigned int)src[i3], (unsigned int)src[i3+1], (unsigned int)src[i3+2]);
381 i3 += 3;
382 }
383 color = GRAPH_COLOR_ABGR;
384 }
385
386 return color;
387}
ABGR2Int
#define ABGR2Int(a, b, g, r)
Definition Gdata.h:1021
GRAPH_COLOR_ABGR
#define GRAPH_COLOR_ABGR
Definition gheader.h:291
GRAPH_COLOR_RGB16
#define GRAPH_COLOR_RGB16
Definition gheader.h:251
jbxl::RGB2Word
uWord RGB2Word(uWord r, uWord g, uWord b)
Definition Gdata.h:1050

References ABGR2Int, GRAPH_COLOR_ABGR, GRAPH_COLOR_MONO, GRAPH_COLOR_RGB16, and RGB2Word().

Referenced by _getMSGraph_CvMat_C3().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ add_tList_object()

template<typename T >
tList * add_tList_object ( tList * lt,
T obj )

非推奨 use get_local_timestamp(time(0), "%Y-%m-%dT%H:%M:%SZ")); need free()

inline char* GetLocalTime(char deli1='-', char deli2='T', char deli3=':', char deli4='Z') ///< not free() { return get_localtime(deli1, deli2, deli3, deli4); }

Definition at line 214 of file tools++.h.

215{
216 T* pp = new T();
217 *pp = obj;
218 lt = add_tList_node_bystr(lt, 0, 0, NULL, NULL, (void*)pp, sizeof(T));
219
220 return lt;
221}
add_tList_node_bystr
tList * add_tList_node_bystr(tList *pp, int id, int lv, const char *key, const char *val, void *ptr, int sz)
文字列データからリスト用ノードを生成し(new),それをリストに追加．
Definition tlist.cpp:462

References add_tList_node_bystr().

Here is the call graph for this function:

◆ AddMeshFacetNode()

MeshFacetNode * AddMeshFacetNode ( MeshFacetNode * list,
MeshFacetNode * node )

Definition at line 507 of file MeshFacetNode.cpp.

508{
509 if (list==NULL) return node;
510 if (node==NULL) return list;
511
512 node->prev = list;
513 node->next = list->next;
514
515 if (list->next!=NULL) list->next->prev = node;
516 list->next = node;
517
518 return node;
519}
jbxl::MeshFacetNode::prev
MeshFacetNode * prev
Definition MeshFacetNode.h:54
jbxl::MeshFacetNode::next
MeshFacetNode * next
Definition MeshFacetNode.h:53

References MeshFacetNode::next, and MeshFacetNode::prev.

Referenced by MeshObjectData::addNode(), and MeshObjectData::addNode().

Here is the caller graph for this function:

◆ addPaint_MSGraph()

template<typename T >
int addPaint_MSGraph ( MSGraph< T > xp,
int x,
int y,
int mn,
int mx,
int add,
int mode = 8 )

template <typename T> int addPaint_MSGraph(MSGraph<T> xp, int x, int y, int mn, int mx, int add, int mode=8)

追加式の 2Dペイント
xp の (x, y)座標から，輝度値 mn〜mx の範囲の点に addを加える．

Parameters
xpグラフィックデータ構造体．
x塗りつぶしを始める点の X座標．
y塗りつぶしを始める点の Y座標．
mn塗りつぶされる輝度値の最小値
mx塗りつぶされる輝度値の最大値．
add加える輝度値．マイナスでも動作するが，作業領域に注意．
modeモード．8以上：平面上で 8近傍の塗りつぶし その他：平面上で 4近傍の塗りつぶし
Attention
輝度値に，addがプラスの場合はadd以上，または addがマイナスの場合は add+輝度値がプラスになるもの があると誤作動する．作業領域として add〜 を使用する．

Definition at line 2212 of file Graph.h.

2213{
2214 int i, k, cc, cx, st, ed, num=0;
2215
2216 if (x<0 || x>=xp.xs || y<0 || y>=xp.ys) return 0;
2217
2218 // 左端へ
2219 cc = (int)xp.point(x, y);
2220 while(x>0) {
2221 cx = (int)xp.point(x-1, y);
2222 if (cx>mx || cx<mn) break;
2223 cc = cx;
2224 x--;
2225 }
2226 st = k = x;
2227
2228 // 右方向へ塗りつぶし
2229 while(k<xp.xs) {
2230 cx = (int)xp.point(k, y);
2231 if (cx>mx || cx<mn) break;
2232 xp.point(k, y) += add;
2233 cc = cx;
2234 num++;
2235 k++;
2236 }
2237 ed = k - 1;
2238
2239 // 上下ライン
2240 for (i=st; i<=ed; i++){
2241 cc = (int)xp.point(i, y) - add;
2242
2243 // 1ライン上へ
2244 if (y-1>=0 && y-1<xp.ys){
2245 cx = (int)xp.point(i, y-1);
2246 if (cx<=mx && cx>=mn) {
2247 num += addPaint_MSGraph(xp, i, y-1, mn, mx, add, mode);
2248 }
2249 if (mode>=8) {
2250 if (i-1>=0) {
2251 cx = (int)xp.point(i-1, y-1);
2252 if (cx<=mx && cx>=mn) {
2253 num += addPaint_MSGraph(xp, i-1, y-1, mn, mx, add, mode);
2254 }
2255 }
2256 if (i+1<xp.xs) {
2257 cx = (int)xp.point(i+1, y-1);
2258 if (cx<=mx && cx>=mn) {
2259 num += addPaint_MSGraph(xp, i+1, y-1, mn, mx, add, mode);
2260 }
2261 }
2262 }
2263 }
2264
2265 // 1ライン下へ
2266 if (y+1>=0 && y+1<xp.ys){
2267 cx = (int)xp.point(i, y+1);
2268 if (cx<=mx && cx>=mn) {
2269 num += addPaint_MSGraph(xp, i, y+1, mn, mx, add, mode);
2270 }
2271 if (mode>=8) {
2272 if (i-1>=0) {
2273 cx = (int)xp.point(i-1, y+1);
2274 if (cx<=mx && cx>=mn) {
2275 num += addPaint_MSGraph(xp, i-1, y+1, mn, mx, add, mode);
2276 }
2277 }
2278 if (i+1<xp.xs) {
2279 cx = (int)xp.point(i+1, y+1);
2280 if (cx<=mx && cx>=mn) {
2281 num += addPaint_MSGraph(xp, i+1, y+1, mn, mx, add, mode);
2282 }
2283 }
2284 }
2285 }
2286 }
2287 return num;
2288}
jbxl::MSGraph::point
T & point(int x, int y=0, int z=0)
座標(x,y,z)の画素値の参照
Definition Gdata.h:114
jbxl::addPaint_MSGraph
int addPaint_MSGraph(MSGraph< T > xp, int x, int y, int mn, int mx, int add, int mode=8)
Definition Graph.h:2212

References addPaint_MSGraph(), MSGraph< T >::point(), MSGraph< T >::xs, and MSGraph< T >::ys.

Referenced by addPaint_MSGraph(), and delete_noise_MSGraph().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ AddVector2TriSolid()

DllExport void AddVector2TriSolid ( BREP_SOLID * solid,
BREP_SHELL * shell,
Vector< double > * vect,
Vector< double > * nrml = NULL,
UVMap< double > * uvmp = NULL,
ArrayParam< int > * wght = NULL,
bool dupli = false )

void jbxl::AddVector2TriSolid(BREP_SOLID* solid, BREP_SHELL* shell, Vector<double>* vect, Vector<double>* nrml, UVMap<double>* uvmp, ArrayParam<int>* wght, bool dupli)

vect[3]を BREP_SOLIDに１個ずつシーケンシャルに追加する． データの追加が終わったら，必ず CloseSolid() を呼ぶこと．
カウンタは無し．外部で利用すること．

Parameters
solidソリッドデータへのポインタ
shellシェルデータへのポインタ
vect3個の頂点データ vect[3] へのポインタ
nrml頂点の法線ベクトルデータへのポインタ．
uvmp頂点の曲面座標データへのポインタ．
wght頂点の重みデータへのポインタ．
duplitrue: 頂点の重複登録を許可する．false: 重複登録を許可しない．

Definition at line 1412 of file TriBrep.cpp.

1413{
1414 BREP_FACET* facet;
1415 BREP_CONTOUR* contour;
1416
1417 if (solid==NULL || shell==NULL || vect==NULL) return;
1418 if (solid->octree==NULL) return;
1419
1420 facet = new BREP_FACET(shell);
1421 contour = CreateContourByVector(facet, vect, nrml, uvmp, wght, dupli);
1422 if (contour!=NULL) {
1423/*
1424 if (check) {
1425 // 衝突判定
1426 BREP_CONTOUR* collision;
1427 facet->CloseData();
1428 if (!IsCollisionContours(solid, contour, &collision)) {
1429 solid->contours.push_back(contour); // IsCollisionContours()用
1430 }
1431 else {
1432 collision->facet->deletable = true; // 衝突相手も消す．
1433 FastDeleteFacet(facet);
1434 }
1435 }
1436 else solid->contours.push_back(contour);
1437*/
1438 solid->contours.push_back(contour);
1439 }
1440 else {
1441 deleteNull(facet);
1442 }
1443
1444 return;
1445}
jbxl::BREP_CONTOUR
Definition Brep.h:168
jbxl::BREP_FACET
Definition Brep.h:136
jbxl::BREP_SOLID::octree
OctreeNode * octree
Definition Brep.h:80
jbxl::BREP_SOLID::contours
BREP_CONTOUR_LIST contours
Contours リスト
Definition Brep.h:83
jbxl::BREP_FACET
class DllExport BREP_FACET
Definition Brep.h:34
jbxl::CreateContourByVector
DllExport BREP_CONTOUR * CreateContourByVector(BREP_FACET *facet, Vector< double > *v, Vector< double > *n=NULL, UVMap< double > *uv=NULL, ArrayParam< int > *w=NULL, bool dupli=false)
Definition TriBrep.cpp:684
jbxl::deleteNull
void deleteNull(T &p)
Definition common++.h:39

References BREP_FACET, BREP_SOLID::contours, CreateContourByVector(), deleteNull(), and BREP_SOLID::octree.

Here is the call graph for this function:

◆ AddVertex2Octree()

DllExport BREP_VERTEX * AddVertex2Octree ( BREP_VERTEX * vert,
OctreeNode * octree,
bool dupli = false )

BREP_VERTEX* jbxl::AddVertex2Octree(BREP_VERTEX* vert, OctreeNode* octree, bool dupli)

Vertex vert を octreeに登録する．

dupli がfalseの場合:
既に同じ位置に Vertexが登録されている場合（UVマップも比べる）は，vertは消去されて，既に登録されている Vertexが返される．
この関数を使用後は vertを使用してはいけない（deleteされている可能性があるので）
dupli が trueの場合:
既に同じ位置に Vertexが登録されていても，重複して登録する．

Parameters
vert登録する頂点データ
octree頂点データを格納するオクトツリー
duplitrue: 頂点の重複登録を許可する．false: 重複登録を許可しない．
Returns
オクトツリー中の頂点データ
使用例
vert = AddVertex2Octree(vert, octree, false);
jbxl::AddVertex2Octree
DllExport BREP_VERTEX * AddVertex2Octree(BREP_VERTEX *vertex, OctreeNode *octree, bool dupli=false)
Definition Brep.cpp:971

Definition at line 971 of file Brep.cpp.

972{
973 OctreeNode* node;
974
975 if (dupli) node = octree->AddWithDuplicates(vert);
976 else node = octree->AddWithUnique(vert);
977 if (node==NULL) return NULL;
978
979 if (node->vertex==vert) {
980 octree->solid->vertexno++; // Vertexを新規登録したのでカウントする．
981 }
982 return node->vertex;
983}
jbxl::BREP_SOLID::vertexno
unsigned int vertexno
頂点の数
Definition Brep.h:75
jbxl::OctreeNode::AddWithDuplicates
OctreeNode * AddWithDuplicates(BREP_VERTEX *new_vertex)
Definition Brep.cpp:729
jbxl::OctreeNode::AddWithUnique
OctreeNode * AddWithUnique(BREP_VERTEX *new_vertex)
Definition Brep.cpp:691
jbxl::OctreeNode::solid
BREP_SOLID * solid
Definition Brep.h:294
jbxl::OctreeNode::vertex
BREP_VERTEX * vertex
ルートノードの場合は NULL
Definition Brep.h:297

References OctreeNode::AddWithDuplicates(), OctreeNode::AddWithUnique(), OctreeNode::solid, OctreeNode::vertex, and BREP_SOLID::vertexno.

Referenced by CreateContourByVector().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ ARGB2Int()

unsigned int ARGB2Int ( unsigned int a,
unsigned int r,
unsigned int g,
unsigned int b )
inline

Definition at line 1000 of file Gdata.h.

1001{
1002 if (isBigEndian) { // A-R-G-B
1003 a = (unsigned int)((a&0x000000ff)<<24);
1004 r = (unsigned int)((r&0x000000ff)<<16);
1005 g = (unsigned int)((g&0x000000ff)<<8);
1006 b = (unsigned int) (b&0x000000ff);
1007 }
1008 else { // B-G-R-A
1009 b = (unsigned int)((b&0x000000ff)<<24);
1010 g = (unsigned int)((g&0x000000ff)<<16);
1011 r = (unsigned int)((r&0x000000ff)<<8);
1012 a = (unsigned int) (a&0x000000ff);
1013 }
1014
1015 unsigned int c = (unsigned int)(a + r + g + b);
1016 return c;
1017}
isBigEndian
#define isBigEndian
Definition tools.h:422

References isBigEndian.

◆ ARGB2Word()

uWord ARGB2Word ( uWord a,
uWord r,
uWord g,
uWord b )
inline

Definition at line 1025 of file Gdata.h.

1026{
1027 if (isBigEndian) { // A-R-G-B
1028 a = (int)(((a&0x00ff)>>4)<<12);
1029 r = (int)(((r&0x00ff)>>4)<<8);
1030 g = (int)(((g&0x00ff)>>4)<<4);
1031 b = (int) ((b&0x00ff)>>4);
1032 }
1033 else { // G-B A-R
1034 g = (int)(((g&0x00ff)>>4)<<12);
1035 b = (int)(((b&0x00ff)>>4)<<8);
1036 a = (int)(((a&0x00ff)>>4)<<4);
1037 r = (int) ((r&0x00ff)>>4);
1038 }
1039
1040 uWord c = (uWord)(a + r + g + b);
1041 return c;
1042}
uWord
unsigned short uWord
2Byte
Definition common.h:334

References isBigEndian.

◆ BSplineInterp4()

template<typename T >
Vector< T > BSplineInterp4 ( Vector< T > p0,
Vector< T > p1,
double t )
inline

4階（3次）Bスプライン曲線補間． 2次の導関数が両端で 0の条件有り．

P(t) = 1/6*(1-t)^3*Q0 + (1/2*t^3 - t^2 + 2/3)*Q1 + (-1/2*t^3 + 1/2*t^2 + 1/2*t + 1/6)*Q2 + 1/6*t^3*Q3 Q0 = 2*P(0) - P(1); Q1 = P(0) Q2 = P(1) Q3 = 2*P(1) - P(0)

Definition at line 334 of file Vector.h.

335{
336 Vector<T> q0 = 2*p0 - p1;
337// Vector<T> q1 = p0;
338// Vector<T> q2 = p1;
339 Vector<T> q3 = 2*p1 - p0;
340
341 double t2 = t*t;
342 double t3 = t2*t;
343
344 double c0 = (t2 - t)*0.5 + (1.0 - t3)*0.16666666666666667; // 1/6*(1-t)^3
345 double c1 = t3*0.5 - t2 + 0.66666666666666667; // 1/2*t3 - t2 + 2/3
346 double c2 = (t + t2 - t3)*0.5 + 0.16666666666666667; // -1/2*t3 + 1/2*t2 + 1/2*t + 1/6
347 double c3 = t3*0.16666666666666667; // 1/6*t3
348
349 Vector<T> vect = c0*q0 + c1*p0 + c2*p1 + c3*q3;
350
351 return vect;
352}

◆ Cast() [1/3]

template<typename T , typename R >
UVMap< T > Cast ( UVMap< R > v)
inline

Definition at line 622 of file Vector.h.

622{ return UVMap<T>((T)v.u, (T)v.v, v.d); }
jbxl::UVMap::d
int d
汎用
Definition Vector.h:604

References UVMap< T >::d, UVMap< T >::u, and UVMap< T >::v.

◆ Cast() [2/3]

template<typename T , typename R >
Vector4< T > Cast ( Vector4< R > v)
inline

Definition at line 781 of file Vector.h.

781{ return Vector4<T>((T)v.x, (T)v.y, (T)v.z, (T)v.t, v.n, v.c, v.d);}
jbxl::Vector4::c
double c
信頼度
Definition Vector.h:715
jbxl::Vector4::d
int d
汎用
Definition Vector.h:716
jbxl::Vector4::n
double n
ノルム
Definition Vector.h:714

References Vector4< T >::c, Vector4< T >::d, Vector4< T >::n, Vector4< T >::t, Vector4< T >::x, Vector4< T >::y, and Vector4< T >::z.

◆ Cast() [3/3]

template<typename T , typename R >
Vector< T > Cast ( Vector< R > v)
inline

Definition at line 126 of file Vector.h.

126{ return Vector<T>((T)v.x, (T)v.y, (T)v.z, v.n, v.c, v.d);}
jbxl::Vector::c
double c
信頼度
Definition Vector.h:63
jbxl::Vector::d
int d
汎用
Definition Vector.h:64
jbxl::Vector::n
double n
ノルム
Definition Vector.h:62

References Vector< T >::c, Vector< T >::d, Vector< T >::n, Vector< T >::x, Vector< T >::y, and Vector< T >::z.

◆ cat_MSGraph() [1/2]

template<typename T , typename R >
void cat_MSGraph ( MSGraph< R > * src,
MSGraph< T > * dst )

template <typename T, typename R> void cat_MSGraph(MSGraph<R>* src, MSGraph<T>* dst)

MSGraph<R>型データのバッファ部を MSGraph<T>型のバッファ部へ上書き（追加）する．
位置，サイズは自動調整される．

Parameters
srcコピー元グラフィックデータ
dstコピー先グラフィックデータ

Definition at line 475 of file Graph.h.

476{
477 if (src==NULL || dst==NULL) return;
478 if ((void*)src->gp==(void*)dst->gp) return;
479
480 int i, x, y, z;
481 MSGraph<T> vp;
482 RBound<int> rb;
483
484 rb.xmin = Min(src->rbound.xmin, dst->rbound.xmin);
485 rb.ymin = Min(src->rbound.ymin, dst->rbound.ymin);
486 rb.zmin = Min(src->rbound.zmin, dst->rbound.zmin);
487 rb.xmax = Max(src->rbound.xmax, dst->rbound.xmax);
488 rb.ymax = Max(src->rbound.ymax, dst->rbound.ymax);
489 rb.zmax = Max(src->rbound.zmax, dst->rbound.zmax);
490
491 vp.set(rb.xmax-rb.xmin+1, rb.ymax-rb.ymin+1, rb.zmax-rb.zmin+1, dst->zero, dst->base, dst->RZxy);
492 if (vp.gp==NULL) return;
493 vp.rbound = rb;
494 vp.max = Max((T)src->max, dst->max);
495 vp.min = Min((T)src->min, dst->min);
496
497 for (i=0; i<dst->xs*dst->ys*dst->zs; i++) {
498 if (dst->gp[i]!=dst->zero) {
499 x = i%dst->xs + dst->rbound.xmin - rb.xmin;
500 y = (i/dst->xs)%dst->ys + dst->rbound.ymin - rb.ymin;
501 z = i/(dst->xs*dst->ys) + dst->rbound.zmin - rb.zmin;
502 vp.gp[z*vp.xs*vp.ys + y*vp.xs + x] = dst->gp[i];
503 }
504 }
505
506 for (i=0; i<src->xs*src->ys*src->zs; i++) {
507 if (src->gp[i]!=src->zero) {
508 x = i%src->xs + src->rbound.xmin - rb.xmin;
509 y = (i/src->xs)%src->ys + src->rbound.ymin - rb.ymin;
510 z = i/(src->xs*src->ys) + src->rbound.zmin - rb.zmin;
511 vp.gp[z*vp.xs*vp.ys + y*vp.xs + x] = (T)src->gp[i];
512 }
513 }
514
515 dst->free();
516 *dst = vp;
517 return;
518}
jbxl::MSGraph::base
T base
画措置の底上げの値．
Definition Gdata.h:83
jbxl::MSGraph::max
T max
画素値の最大値
Definition Gdata.h:87
jbxl::MSGraph::min
T min
画素値の最小値
Definition Gdata.h:88
jbxl::MSGraph::RZxy
double RZxy
Z軸の歪．Z軸の間隔を 1とした XY軸の間隔．(X or Y)/Z.
Definition Gdata.h:92
jbxl::MSGraph::zero
T zero
画素値のゼロ位．
Definition Gdata.h:82
jbxl::MSGraph::free
void free(void)
グラフィックデータを開放する
Definition Gdata.h:378
jbxl::MSGraph::set
void set(RBound< int > rb, T v=(T) 0, T b=(T) 0, double rz=1.0)
Definition Gdata.h:207
jbxl::MSGraph::rbound
RBound< int > rbound
画像の境界情報
Definition Gdata.h:91
jbxl::RBound::xmax
T xmax
x軸境界の最大値．
Definition Vector.h:427
jbxl::RBound::ymin
T ymin
y軸境界の最小値．
Definition Vector.h:428
jbxl::RBound::zmax
T zmax
z軸境界の最大値．
Definition Vector.h:431
jbxl::RBound::xmin
T xmin
x軸境界の最小値．
Definition Vector.h:426
jbxl::RBound::ymax
T ymax
y軸境界の最大値．
Definition Vector.h:429
jbxl::RBound::zmin
T zmin
z軸境界の最小値．
Definition Vector.h:430
Min
#define Min(x, y)
Definition common.h:250
Max
#define Max(x, y)
Definition common.h:247

References MSGraph< T >::base, MSGraph< T >::free(), MSGraph< T >::gp, Max, MSGraph< T >::max, Min, MSGraph< T >::min, MSGraph< T >::rbound, MSGraph< T >::RZxy, MSGraph< T >::set(), RBound< T >::xmax, RBound< T >::xmin, MSGraph< T >::xs, RBound< T >::ymax, RBound< T >::ymin, MSGraph< T >::ys, MSGraph< T >::zero, RBound< T >::zmax, RBound< T >::zmin, and MSGraph< T >::zs.

Here is the call graph for this function:

◆ cat_MSGraph() [2/2]

template<typename T , typename R >
void cat_MSGraph ( MSGraph< R > src,
MSGraph< T > & dst )

template <typename T, typename R> void cat_MSGraph(MSGraph<R> src, MSGraph<T>& dst)

MSGraph<R>型データのバッファ部を MSGraph<T>型のバッファ部へ上書き（追加）する．
位置，サイズは自動調整される．

Parameters
srcコピー元グラフィックデータ
dstコピー先グラフィックデータ

Definition at line 421 of file Graph.h.

422{
423 if ((void*)src.gp==(void*)dst.gp) return;
424
425 int i, x, y, z;
426 MSGraph<T> vp;
427 RBound<int> rb;
428
429 rb.xmin = Min(src.rbound.xmin, dst.rbound.xmin);
430 rb.ymin = Min(src.rbound.ymin, dst.rbound.ymin);
431 rb.zmin = Min(src.rbound.zmin, dst.rbound.zmin);
432 rb.xmax = Max(src.rbound.xmax, dst.rbound.xmax);
433 rb.ymax = Max(src.rbound.ymax, dst.rbound.ymax);
434 rb.zmax = Max(src.rbound.zmax, dst.rbound.zmax);
435
436 vp.set(rb.xmax-rb.xmin+1, rb.ymax-rb.ymin+1, rb.zmax-rb.zmin+1, dst.zero, dst.base, dst.RZxy);
437 if (vp.gp==NULL) return;
438 vp.rbound = rb;
439 vp.max = Max((T)src.max, dst.max);
440 vp.min = Min((T)src.min, dst.min);
441
442 for (i=0; i<dst.xs*dst.ys*dst.zs; i++) {
443 if (dst.gp[i]!=dst.zero) {
444 x = i%dst.xs + dst.rbound.xmin - rb.xmin;
445 y = (i/dst.xs)%dst.ys + dst.rbound.ymin - rb.ymin;
446 z = i/(dst.xs*dst.ys) + dst.rbound.zmin - rb.zmin;
447 vp.gp[z*vp.xs*vp.ys + y*vp.xs + x] = dst.gp[i];
448 }
449 }
450
451 for (i=0; i<src.xs*src.ys*src.zs; i++) {
452 if (src.gp[i]!=src.zero) {
453 x = i%src.xs + src.rbound.xmin - rb.xmin;
454 y = (i/src.xs)%src.ys + src.rbound.ymin - rb.ymin;
455 z = i/(src.xs*src.ys) + src.rbound.zmin - rb.zmin;
456 vp.gp[z*vp.xs*vp.ys + y*vp.xs + x] = (T)src.gp[i];
457 }
458 }
459
460 dst.free();
461 dst = vp;
462 return;
463}

References MSGraph< T >::base, MSGraph< T >::free(), MSGraph< T >::gp, Max, MSGraph< T >::max, Min, MSGraph< T >::min, MSGraph< T >::rbound, MSGraph< T >::RZxy, MSGraph< T >::set(), RBound< T >::xmax, RBound< T >::xmin, MSGraph< T >::xs, RBound< T >::ymax, RBound< T >::ymin, MSGraph< T >::ys, MSGraph< T >::zero, RBound< T >::zmax, RBound< T >::zmin, and MSGraph< T >::zs.

Here is the call graph for this function:

◆ CenterLine()

template<typename T >
MSGraph< T > CenterLine ( MSGraph< T > gx,
int mode )

◆ centerLine()

template<typename T >
MSGraph< T > centerLine ( MSGraph< T > gx,
int mode )

template <typename T> MSGraph<T> centerLine(MSGraph<T> gx, int mode)

3D画像に対して，連結数に基づいた細線化を行う．

Parameters
gx3D画像．
mode26: 26近傍，その他: 6近傍
Returns
細線化された画像データ．
See also
信学論D-II, Vol.J79-D-II, pp.1675-1685, 1996.

Definition at line 41 of file Thinning.h.

42{
43 int i, j, k, l, m, n, w, b, nn, mm;
44 int rr, dd, xs, ps;
45
46 bool dt;
47
48 MSGraph<int> gd;
49 MSGraph<T> vp;
50 tList *pp, *px;
51 tList_data ld;
52
53 if (mode!=26) mode = 6;
54 xs = gx.xs;
55 ps = gx.xs*gx.ys;
56 ld = init_tList_data();
57
58 // STEP 1
59 //DEBUG_Warning("center_line: start step1");
60 gd = euclidDistance(gx, gd.zero+1, rr);
61
62 dd = SINTMAX;
63 rr = 0;
64 for (i=0; i<gd.xs*gd.ys*gd.zs; i++) {
65 if (gd.gp[i]!=0) {
66 gd.gp[i] += 20;
67 dd = Min(dd, gd.gp[i]);
68 rr = Max(rr, gd.gp[i]);
69 }
70 }
71
72 // STEP 2
73 //DEBUG_Warning("center_line: start step2");
74 pp = px = new_tList_node();
75
76 for (k=1; k<gd.zs-1; k++) {
77 l = k*ps;
78 for (j=1; j<gd.ys-1; j++) {
79 m = l + j*xs;
80 for (i=1; i<gd.xs-1; i++) {
81 n = m + i;
82 if (gd.gp[n]>20) {
83 w = gd.gp[n+1]*gd.gp[n-1]*gd.gp[n+xs]*gd.gp[n-xs]
84 *gd.gp[n+ps]*gd.gp[n-ps];
85 if(w==0) {
86 ld.id = n;
87 ld.lv = (int)gd.gp[n];
88 px = add_tList_node_bydata(px, ld);
89 gd.gp[n] = 1;
90 }
91 }
92 }
93 }
94 }
95
96 //DEBUG_Warning("center_line: start step3, step4 and step5");
97 do {
98 // STEP 3
99 //DEBUG_Warning("center_line: start step3");
100 px = pp->next;
101 while(px!=NULL) {
102 if (px->ldat.lv<=dd) {
103 dt = deletable(gd, px->ldat.id, mode, 3);
104 if (dt) {
105 m = nonZeroBoxel(gd, px->ldat.id);
106 if (m==1) {
107 tList* pv = px->prev;
108 del_tList_node(&px);
109 px = pv;
110 }
111 else px->ldat.lv = m/3 + 7;
112 }
113 else {
114 px->ldat.lv = 16;
115 }
116 }
117 px = px->next;
118 }
119
120 // STEP 4
121 //DEBUG_Warning("center_line: start step4");
122 for (b=7; b<=15; b++) {
123 px = pp->next;
124 while(px!=NULL) {
125 if (px->ldat.lv==b) {
126 dt = deletable(gd, px->ldat.id, mode, 3);
127 if (dt) {
128 m = nonZeroBoxel(gd, px->ldat.id);
129 if (m==1) {
130 tList* pv = px->prev;
131 del_tList_node(&px);
132 px = pv;
133 }
134 else {
135 i = px->ldat.id;
136 gd.gp[i] = 0;
137
138 tList* pv = px->prev;
139 del_tList_node(&px);
140 px = pv;
141
142 if (gd.gp[i+1]>20) {
143 ld.id = i+1;
144 ld.lv = (int)gd.gp[ld.id];
145 px = add_tList_node_bydata(px, ld);
146 gd.gp[ld.id] = 1;
147 }
148 if (gd.gp[i-1]>20) {
149 ld.id = i-1;
150 ld.lv = (int)gd.gp[ld.id];
151 px = add_tList_node_bydata(px, ld);
152 gd.gp[ld.id] = 1;
153 }
154 if (gd.gp[i+xs]>20) {
155 ld.id = i+xs;
156 ld.lv = (int)gd.gp[ld.id];
157 px = add_tList_node_bydata(px, ld);
158 gd.gp[ld.id] = 1;
159 }
160 if (gd.gp[i-xs]>20) {
161 ld.id = i-xs;
162 ld.lv = (int)gd.gp[ld.id];
163 px = add_tList_node_bydata(px, ld);
164 gd.gp[ld.id] = 1;
165 }
166 if (gd.gp[i+ps]>20) {
167 ld.id = i+ps;
168 ld.lv = (int)gd.gp[ld.id];
169 px = add_tList_node_bydata(px, ld);
170 gd.gp[ld.id] = 1;
171 }
172 if (gd.gp[i-ps]>20) {
173 ld.id = i-ps;
174 ld.lv = (int)gd.gp[ld.id];
175 px = add_tList_node_bydata(px, ld);
176 gd.gp[ld.id] = 1;
177 }
178 }
179 }
180 else {
181 px->ldat.lv = 16;
182 }
183 }
184 px = px->next;
185 }
186 }
187
188 // STEP 5
189 //DEBUG_Warning("center_line: start step5");
190 dd = rr;
191 px = pp->next;
192 while(px!=NULL) {
193 if (px->ldat.lv>20) {
194 dd = Min(dd, px->ldat.lv);
195 }
196 px = px->next;
197 }
198 mm = nn = 0;
199 px = pp->next;
200 while(px!=NULL) {
201 nn++;
202 if (px->ldat.lv==16) mm++;
203 px = px->next;
204 }
205
206 } while (dd<rr || mm!=nn);
207
208 vp.setup(gd.xs, gd.ys, gd.zs);
209 for (i=0; i<gd.xs*gd.ys*gd.zs; i++) vp.gp[i] = (T)gd.gp[i];
210 gd.free();
211
212 return vp;
213}
SINTMAX
#define SINTMAX
Definition common.h:204
jbxl::euclidDistance
MSGraph< int > euclidDistance(MSGraph< T > vp, int bc, int &rr)
Definition Gmt.h:864
jbxl::nonZeroBoxel
int nonZeroBoxel(MSGraph< T > vp, int n)
Definition Thinning.h:216
jbxl::deletable
bool deletable(MSGraph< T > vp, int n, int c, int d)
Definition Thinning.h:268
tList_data
add_tList_node_bydata
tList * add_tList_node_bydata(tList *pp, tList_data ldat)
データ(ldat)からリスト用ノードを生成し(new),それを指定したリストの後ろに追加．
Definition tlist.cpp:417
del_tList_node
tList * del_tList_node(tList **node)
リスト用のノードを削除．
Definition tlist.cpp:270
init_tList_data
tList_data init_tList_data(void)
空のノードデータを静的に作成．データを初期化するのに使用する．
Definition tlist.cpp:26
new_tList_node
tList * new_tList_node(void)
リスト用の空ノードを動的に生成する．
Definition tlist.cpp:198

References add_tList_node_bydata(), del_tList_node(), deletable(), euclidDistance(), MSGraph< T >::free(), MSGraph< T >::gp, init_tList_data(), Max, Min, new_tList_node(), nonZeroBoxel(), SINTMAX, MSGraph< T >::xs, MSGraph< T >::ys, MSGraph< T >::zero, and MSGraph< T >::zs.

Here is the call graph for this function:

◆ ClearGlobalCounter()

void ClearGlobalCounter ( )
inline

Definition at line 195 of file ClassBox.h.

195{ GLCounter = NULL;}
jbxl::GLCounter
CVCounter * GLCounter
グローバルカウンタ
Definition ClassBox.cpp:22

References GLCounter.

◆ ClearGlobalDisplay()

void ClearGlobalDisplay ( )
inline

Definition at line 77 of file ClassBox.h.

77{ GLDisplay = NULL;}
jbxl::GLDisplay
CVDisplay * GLDisplay
グローバルディスプレイインターフェイス
Definition ClassBox.cpp:16

References GLDisplay.

◆ ClearGlobalFrame()

void ClearGlobalFrame ( )
inline

Definition at line 48 of file ClassBox.h.

48{ GLFrame = NULL;}
jbxl::GLFrame
CVFrame * GLFrame
グローバルディスプレイインターフェイス
Definition ClassBox.cpp:15

References GLFrame.

◆ ClearGlobalTextDocument()

void ClearGlobalTextDocument ( )
inline

Definition at line 122 of file ClassBox.h.

122{ GLTextDocument = NULL;}
jbxl::GLTextDocument
CVTextDocument * GLTextDocument
グローバル テキストドキュメント インターフェイス
Definition ClassBox.cpp:17

References GLTextDocument.

◆ CloseTriSolid()

DllExport int CloseTriSolid ( BREP_SOLID * solid,
bool check = true,
CVCounter * counter = NULL )

int jbxl::CloseTriSolid(BREP_SOLID* solid, bool check, CVCounter* counter)

AddVector2TriSolid() の最後に呼んで，データをクローズする． BREP_SOLIDに使用された有効なファセットの数を返す．

Parameters
solidソリッドデータへのポインタ
checkデータのエラーチェックを行うか? 行う場合，不正データは削除される．
counter仮想カウンタ．
Return values
-1ソリッドがNULL

Definition at line 1459 of file TriBrep.cpp.

1460{
1461 if (solid==NULL) return -1;
1462
1463 // deletableになっているContourがあるかもしれないので，CreateContoursList()で作り直し．
1464 CreateContoursList(solid);
1465 CreateWingsList(solid);
1466
1467 if (check) {
1468 // 多重Edgeの削除
1469 CreateSurplusContoursList(solid);
1470 if (counter!=NULL) counter->MakeChildCounter(10);
1471 DeleteSurplusContours(solid);
1472 if (counter!=NULL) counter->DeleteChildCounter();
1473 // 直線に並んだ Edgeの削除
1474 CreateShortageWingsList(solid);
1475 if (counter!=NULL) counter->MakeChildCounter(10);
1476 DeleteStraightEdges(solid);
1477 if (counter!=NULL) counter->DeleteChildCounter();
1478 }
1479
1480 CreateSurplusContoursList(solid); // 作り直し
1481 CreateShortageWingsList(solid);
1482 solid->vcount = 3; // for Triangle Facet
1483 solid->CloseData(); // Close Octree
1484 //
1485 return (int)solid->contours.size();
1486}
jbxl::BREP_SOLID::CloseData
void CloseData(void)
Definition Brep.cpp:92
jbxl::BREP_SOLID::vcount
int vcount
１面あたりの頂点数
Definition Brep.h:77
jbxl::CVCounter::DeleteChildCounter
virtual void DeleteChildCounter()
子カウンタの削除（有効領域の無効化）
Definition ClassBox.h:179
jbxl::CVCounter::MakeChildCounter
virtual CVCounter * MakeChildCounter(int n)
子カウンタの作成（有効領域を再定義）
Definition ClassBox.h:178
jbxl::CreateSurplusContoursList
DllExport void CreateSurplusContoursList(BREP_SOLID *solid)
Definition TriBrep.cpp:84
jbxl::CreateShortageWingsList
DllExport void CreateShortageWingsList(BREP_SOLID *solid)
Definition TriBrep.cpp:105
jbxl::CreateWingsList
DllExport void CreateWingsList(BREP_SOLID *solid)
Definition TriBrep.cpp:58
jbxl::DeleteStraightEdges
DllExport void DeleteStraightEdges(BREP_SOLID *solid)
Definition TriBrep.cpp:210
jbxl::CreateContoursList
DllExport void CreateContoursList(BREP_SOLID *solid)
Definition TriBrep.cpp:22
jbxl::DeleteSurplusContours
DllExport void DeleteSurplusContours(BREP_SOLID *solid)
Definition TriBrep.cpp:140

References BREP_SOLID::CloseData(), BREP_SOLID::contours, CreateContoursList(), CreateShortageWingsList(), CreateSurplusContoursList(), CreateWingsList(), CVCounter::DeleteChildCounter(), DeleteStraightEdges(), DeleteSurplusContours(), CVCounter::MakeChildCounter(), and BREP_SOLID::vcount.

Referenced by BrepSolidList::addSolid(), CreateTriSolidFromSTL(), CreateTriSolidFromVector(), and BrepSolidList::getMerge().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ CmnHeadBytePoint()

uByte & CmnHeadBytePoint ( CmnHead hd,
int i = 0,
int j = 0,
int k = 0 )
inline

Definition at line 36 of file Gdata.h.

37{
38 return hd.grptr[(int)i + (int)j*hd.xsize + (int)k*hd.xsize*hd.ysize];
39}
CmnHead::grptr
uByte * grptr
Pointer to Data.
Definition gheader.h:138
CmnHead::ysize
int ysize
Height of Graphics.
Definition gheader.h:129
CmnHead::xsize
int xsize
Width of Graphics.
Definition gheader.h:128

References CmnHead::grptr, CmnHead::xsize, and CmnHead::ysize.

◆ CollisionTriContour2D()

DllExport bool CollisionTriContour2D ( BREP_CONTOUR * contour1,
BREP_CONTOUR * contour2 )

Definition at line 1053 of file TriBrep.cpp.

1054{
1055 double uc, vc, tm, um, ut, vt, tmt, umt;
1056 BREP_WING* wing = contour1->wing;
1057 TVector<double> directR = contour2->directR;
1058 TVector<double> directS = contour2->directS;
1059 TVector<double> directRS = contour2->directRS;
1060
1061 wing = contour1->wing;
1062 for (int i=0; i<3; i++) {
1063 TVector<double> point = Vertex2TVector(wing->vertex);
1064 TVector<double> directB = Vertex2TVector(wing->next->vertex) - point;
1065 TVector<double> directQ = Vertex2TVector(contour2->wing->vertex) - point;
1066 TVector<double> directQB = directQ^directB;
1067 directB.norm();
1068
1069 tm = directQB*directS;
1070 um = directRS*directB;
1071 tmt = TVectorMultiTolerance(directQB, directS);
1072 umt = TVectorMultiTolerance(directRS, directB);
1073
1074 if (Xabs(tm)<=Max(tmt, Zero_Eps) || Xabs(um)<=Max(umt, Zero_Eps)) {
1075 TVector<double> directBR = directB^directR;
1076 TVector<double> directQR = directQ^directR;
1077 TVector<double> directQB = directQ^directB;
1078 uc = ProportionVector(directQB, directBR, ut);
1079 vc = ProportionVector(directQR, directBR, vt);
1080 ut = Max(ut, Collision_Tolerance);
1081 vt = Max(vt, Collision_Tolerance);
1082 if (uc>ut && 1.-uc>ut && vc>vt && 1.-vc>vt &&
1083 uc*directR.n>directR.t && (1.-uc)*directR.n>directR.t &&
1084 vc*directB.n>directB.t && (1.-vc)*directB.n>directB.t) {
1085 // DEBUG_MODE PRINT_MESG("同一平面上1 %e %e %e %e\n", uc, vc, ut, vt);
1086 // PrintFacetAsciiSTL(contour1);
1087 // PrintFacetAsciiSTL(contour2);
1088 return true;
1089 }
1090
1091 directBR = directB^directS;
1092 directQR = (directQ+directR)^directS;
1093 directQB = (directQ+directR)^directB;
1094 uc = ProportionVector(directQB, directBR, ut);
1095 vc = ProportionVector(directQR, directBR, vt);
1096 ut = Max(ut, Collision_Tolerance);
1097 vt = Max(vt, Collision_Tolerance);
1098 if (uc>ut && 1.-uc>ut && vc>vt && 1.-vc>vt &&
1099 uc*directS.n>directS.t && (1.-uc)*directS.n>directS.t &&
1100 vc*directB.n>directB.t && (1.-vc)*directB.n>directB.t) {
1101// DEBUG_MODE PRINT_MESG("同一平面上2 %e %e %e %e\n", uc, vc, ut, vt);
1102// PrintFacetAsciiSTL(contour1);
1103// PrintFacetAsciiSTL(contour2);
1104 return true;
1105 }
1106
1107 TVector<double> directT = directR + directS;
1108 directBR = directB^directT;
1109 directQR = directQ^directT;
1110 directQB = directQ^directB;
1111 uc = ProportionVector(directQB, directBR, ut);
1112 vc = ProportionVector(directQR, directBR, vt);
1113 ut = Max(ut, Collision_Tolerance);
1114 vt = Max(vt, Collision_Tolerance);
1115 if (uc>ut && 1.-uc>ut && vc>vt && 1.-vc>vt &&
1116 uc*directT.n>directT.t && (1.-uc)*directT.n>directT.t &&
1117 vc*directB.n>directB.t && (1.-vc)*directB.n>directB.t) {
1118// DEBUG_MODE PRINT_MESG("同一平面上3 %e %e %e %e\n", uc, vc, ut, vt);
1119// PrintFacetAsciiSTL(contour1);
1120// PrintFacetAsciiSTL(contour2);
1121 return true;
1122 }
1123 }
1124
1125 wing = wing->next;
1126 }
1127
1128 return false;
1129}
jbxl::BREP_CONTOUR::directRS
TVector< double > directRS
Definition Brep.h:179
jbxl::BREP_CONTOUR::wing
BREP_WING * wing
Definition Brep.h:171
jbxl::BREP_CONTOUR::directS
TVector< double > directS
Definition Brep.h:178
jbxl::BREP_CONTOUR::directR
TVector< double > directR
△QRS 三角Contour衝突検出用
Definition Brep.h:177
jbxl::BREP_WING
Definition Brep.h:208
jbxl::BREP_WING::next
BREP_WING * next
Definition Brep.h:212
jbxl::BREP_WING::vertex
BREP_VERTEX * vertex
Start of Vertex.
Definition Brep.h:210
jbxl::TVector::t
T t
トレランス．誤差．
Definition TVector.h:29
jbxl::Vector::norm
double norm(void)
Definition Vector.h:71
Xabs
#define Xabs(x)
Definition common.h:257
jbxl::Collision_Tolerance
double Collision_Tolerance
衝突判定用トレランス
Definition Tolerance.cpp:22
jbxl::ProportionVector
double ProportionVector(TVector< T > v1, TVector< T > v2, T &t)
Definition TVector.h:62
jbxl::TVectorMultiTolerance
T TVectorMultiTolerance(TVector< T > a, TVector< T > b)
内積の誤差
Definition TVector.h:183
jbxl::Vertex2TVector
DllExport TVector< double > Vertex2TVector(BREP_VERTEX *v)
Definition Brep.cpp:1036
jbxl::Zero_Eps
double Zero_Eps
1に対して 0とするトレランス
Definition Tolerance.cpp:26

References Collision_Tolerance, BREP_CONTOUR::directR, BREP_CONTOUR::directRS, BREP_CONTOUR::directS, Max, Vector< T >::n, BREP_WING::next, Vector< T >::norm(), ProportionVector(), TVector< T >::t, TVectorMultiTolerance(), BREP_WING::vertex, Vertex2TVector(), BREP_CONTOUR::wing, Xabs, and Zero_Eps.

Referenced by IsCollisionContours().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ CollisionTriContour3D()

DllExport bool CollisionTriContour3D ( BREP_CONTOUR * contour1,
BREP_CONTOUR * contour2 )

bool jbxl::CollisionTriContour3D(BREP_CONTOUR* contour1, BREP_CONTOUR* contour2)

contour1と contour2が衝突しているかどうかをチェックする．
contour2->directRS, directR, directS が予め計算されていなければならない．→例えば ComputeDirectRS() を使用

Definition at line 991 of file TriBrep.cpp.

992{
993 double tc, uc, vc, tm, um, ut, vt, tt, tmt, umt;
994 BREP_WING* wing = contour1->wing;
995 TVector<double> directR = contour2->directR;
996 TVector<double> directS = contour2->directS;
997 TVector<double> directRS = contour2->directRS;
998 TVector<double> directT;
999 TVector<double> directB;
1000 TVector<double> directQB;
1001 TVector<double> directN;
1002
1003 // 各辺による衝突検出
1004 for (int i=0; i<3; i++) {
1005 TVector<double> point = Vertex2TVector(wing->vertex);
1006 TVector<double> directQ = Vertex2TVector(contour2->wing->vertex) - point;
1007
1008 for (int j=0; j<2; j++) {
1009 directN = Vertex2TVector(wing->next->vertex);
1010 if (j==0) directB = directN - point;
1011 else directB = directB + (Vertex2TVector(wing->next->next->vertex) - directN)*0.5;
1012 directQB = directQ^directB;
1013
1014 um = directRS*directB;
1015 tm = directQB*directS;
1016 umt = TVectorMultiTolerance(directRS, directB);
1017 tmt = TVectorMultiTolerance(directQB, directS);
1018
1019 if (Xabs(um)>Max(umt, Zero_Eps) && Xabs(tm)>Max(tmt, Zero_Eps)) {
1020 uc = tm;
1021 tc = -directQB*directR;
1022 vc = directRS*directQ;
1023 ut = tmt;
1024 tt = TVectorMultiTolerance(directQB, directR);
1025 vt = TVectorMultiTolerance(directRS, directQ);
1026
1027 ut = Max(Collision_Tolerance, (um*ut+umt*uc)/(um*um));
1028 tt = Max(Collision_Tolerance, (tm*tt+tmt*tc)/(tm*tm));
1029 vt = Max(Collision_Tolerance, (um*vt+umt*vc)/(um*um));
1030 uc = uc/um;
1031 tc = tc/tm;
1032 vc = vc/um;
1033 directT = directR + tc*directS;
1034
1035 if (uc>ut && 1.-uc>ut && tc>tt && 1.-tc>tt && vc>vt && 1.-vc>vt &&
1036 uc*directT.n>directT.t && (1.-uc)*directT.n>directT.t &&
1037 tc*directS.n>directS.t && (1.-tc)*directS.n>directS.t &&
1038 vc*directB.n>directB.t && (1.-vc)*directB.n>directB.t) {
1039 // DEBUG_MODE PRINT_MESG("3D衝突 %d !!!! %e %e %e\n", j+1, uc, tc, vc);
1040 // PrintFacetAsciiSTL(contour1);
1041 // PrintFacetAsciiSTL(contour2);
1042 return true;
1043 }
1044 }
1045 }
1046 wing = wing->next;
1047 }
1048
1049 return false;
1050}

References Collision_Tolerance, BREP_CONTOUR::directR, BREP_CONTOUR::directRS, BREP_CONTOUR::directS, Max, Vector< T >::n, BREP_WING::next, TVector< T >::t, TVectorMultiTolerance(), BREP_WING::vertex, Vertex2TVector(), BREP_CONTOUR::wing, Xabs, and Zero_Eps.

Referenced by IsCollisionContours().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ CommonVertex()

DllExport int CommonVertex ( BREP_CONTOUR * contour1,
BREP_CONTOUR * contour2 )

Definition at line 1191 of file TriBrep.cpp.

1192{
1193 BREP_VERTEX_LIST vertex_list;
1194
1195 int cnt = 0;
1196 BREP_WING* wing1 = contour1->wing;
1197 for (int i=0; i<3; i++) {
1198 bool common = false;
1199 BREP_WING* wing2 = contour2->wing;
1200 for (int j=0; j<3; j++) {
1201 if (wing1->vertex==wing2->vertex) {
1202 cnt++;
1203 common = true;
1204 break;
1205 }
1206 wing2 = wing2->next;
1207 }
1208 if (!common) vertex_list.push_back(wing1->vertex);
1209 wing1 = wing1->next;
1210 }
1211 return cnt;
1212}
jbxl::BREP_VERTEX_LIST
std::list< BREP_VERTEX * > BREP_VERTEX_LIST
Definition Brep.h:47

References BREP_WING::next, BREP_WING::vertex, and BREP_CONTOUR::wing.

Referenced by IsCollisionContours().

Here is the caller graph for this function:

◆ CompareVertex()

DllExport int CompareVertex ( BREP_VERTEX * v1,
BREP_VERTEX * v2 )

int jbxl::CompareVertex(BREP_VERTEX* v1, BREP_VERTEX* v2)

v2 に対する v1 の位置を検査する．

Return values
0〜7Vertex の位置
8同じVertex

Definition at line 1007 of file Brep.cpp.

1008{
1009 double tolerance = v1->tolerance + v2->tolerance;
1010 double dist2 = (v1->point.x - v2->point.x)*(v1->point.x - v2->point.x) +
1011 (v1->point.y - v2->point.y)*(v1->point.y - v2->point.y) +
1012 (v1->point.z - v2->point.z)*(v1->point.z - v2->point.z);
1013 if (dist2<=tolerance*tolerance) return 8; // 同じ位置．同じテクスチャマップ．
1014
1015 int code = 0;
1016 if (v1->point.x > v2->point.x) code += 1;
1017 if (v1->point.y > v2->point.y) code += 2;
1018 if (v1->point.z > v2->point.z) code += 4;
1019 return code; // x1 > x2 || y1 > y2 || z1 > z2
1020}
jbxl::BREP_VERTEX::point
Vector< double > point
頂点の座標．
Definition Brep.h:260
jbxl::BREP_VERTEX::tolerance
double tolerance
Definition Brep.h:270

References BREP_VERTEX::point, BREP_VERTEX::tolerance, Vector< T >::x, Vector< T >::y, and Vector< T >::z.

Referenced by OctreeNode::AddWithDuplicates(), OctreeNode::AddWithUnique(), and OctreeNode::FindSubtree().

Here is the caller graph for this function:

◆ connectNumber()

int connectNumber ( int * w,
int c,
int d )

int jbxl::connectNumber(int* w, int c, int d)

連結数の計算

Parameters
ww[] 近傍の連結数
c近傍数
d次元数
Returns
連結数

Definition at line 26 of file Thinning.cpp.

27{
28 int i;
29 int cn, n0, n1, n2;
30 int v[27];
31
32 if (d<3) {
33 for(i=0; i<9; i++) v[i] = w[i];
34 if (c==8) {
35 v[4] = 1 - v[4];
36 for (i=0; i<9; i++) v[i] = 1 - v[i];
37 }
38 if (c==4 || c==8) {
39 cn = v[1] - v[1]*v[0]*v[3];
40 cn += v[3] - v[3]*v[6]*v[7];
41 cn += v[5] - v[5]*v[2]*v[1];
42 cn += v[7] - v[7]*v[8]*v[5];
43 }
44 else {
45 cn = -1;
46 }
47 }
48 else {
49 for (i=0; i<27; i++) v[i] = w[i];
50 if (c==26) {
51 v[13] = 1 - v[13];
52 for(i=0; i<27; i++) v[i] = 1 - v[i];
53 }
54 if (c==6 || c==26) {
55 n0 = v[13]*v[14] + v[13]*v[12] +
56 v[13]*v[16] + v[13]*v[10] +
57 v[13]*v[22] + v[13]*v[ 4];
58
59 n1 = v[13]*v[14]*v[10]*v[11] + v[13]*v[14]*v[16]*v[17] +
60 v[13]*v[14]*v[ 4]*v[ 5] + v[13]*v[14]*v[22]*v[23] +
61 v[13]*v[12]*v[10]*v[ 9] + v[13]*v[12]*v[16]*v[15] +
62 v[13]*v[12]*v[ 4]*v[ 3] + v[13]*v[12]*v[22]*v[21] +
63 v[13]*v[10]*v[ 4]*v[ 1] + v[13]*v[10]*v[22]*v[19] +
64 v[13]*v[16]*v[ 4]*v[ 7] + v[13]*v[16]*v[22]*v[25];
65
66 n2 = v[13]*v[14]*v[10]*v[11]*v[ 4]*v[ 5]*v[ 1]*v[ 2] +
67 v[13]*v[14]*v[10]*v[11]*v[22]*v[23]*v[19]*v[20] +
68 v[13]*v[14]*v[16]*v[17]*v[ 4]*v[ 5]*v[ 7]*v[ 8] +
69 v[13]*v[14]*v[16]*v[17]*v[22]*v[23]*v[25]*v[26] +
70 v[13]*v[12]*v[10]*v[ 9]*v[ 4]*v[ 3]*v[ 1]*v[ 0] +
71 v[13]*v[12]*v[10]*v[ 9]*v[22]*v[21]*v[19]*v[18] +
72 v[13]*v[12]*v[16]*v[15]*v[ 4]*v[ 3]*v[ 7]*v[ 6] +
73 v[13]*v[12]*v[16]*v[15]*v[22]*v[21]*v[25]*v[24];
74
75 cn = n0 - n1 + n2;
76 if (c==26) cn = 2 - cn;
77 }
78 else {
79 cn = -1;
80 }
81 }
82 return cn;
83}

Referenced by deletable().

Here is the caller graph for this function:

◆ ConnectWingToVertex()

DllExport void ConnectWingToVertex ( BREP_WING * wing)

void jbxl::ConnectWingToVertex(BREP_WING* wing)

WingのスタートVertexのリングに，この Wingを登録する．
Wingが実在する（使用されている）ためには，このリングに登録されてることと，Contourから（へ） リンクされることである．

Definition at line 802 of file Brep.cpp.

803{
804 if (wing!=NULL) {
805 (wing->vertex)->wing_list.push_back(wing);
806 }
807}

References BREP_WING::vertex.

◆ copy_morph_element()

template<typename T >
void copy_morph_element ( MSGraph< T > vp,
int x,
int y,
int z,
MSGraph< T > xp )

template <typename T> void copy_morph_element(MSGraph<T> vp, int x, int y, int z, MSGraph<T> xp)

エレメントを対象画像にコピーする．

Definition at line 140 of file Morph.h.

141{
142 int i, j, k, cx, cy, cz;
143 int xx, yy, zz, ax, ay, az;
144
145 for (k=0; k<xp.zs; k++) {
146 zz = z + k - xp.zs/2;
147 az = vp.xs*vp.ys*zz;
148 cz = xp.xs*xp.ys*k;
149 for (j=0; j<xp.ys; j++) {
150 yy = y + j - xp.ys/2;
151 ay = az + vp.xs*yy;
152 cy = cz + xp.xs*j;
153 for (i=0; i<xp.xs; i++) {
154 xx = x + i - xp.xs/2;
155 ax = ay + xx;
156 cx = cy + i;
157 if (xx>=0&&xx<vp.xs&&yy>=0&&yy<vp.ys&&zz>=0&&zz<vp.zs){
158 if (xp.gp[cx]>0) vp.gp[ax] = xp.gp[cx];
159 }
160 }
161 }
162 }
163}

References MSGraph< T >::gp, MSGraph< T >::xs, MSGraph< T >::ys, and MSGraph< T >::zs.

Referenced by fat_object_morph(), and opening_morph().

Here is the caller graph for this function:

◆ copy_MSGraph() [1/2]

template<typename R , typename T >
void copy_MSGraph ( MSGraph< R > * src,
MSGraph< T > * dst )

template <typename R, typename T> void copy_MSGraph(MSGraph<R>* src, MSGraph<T>* dst)

MSGraph<R>型データのバッファ部を MSGraph<T>型のバッファ部へコピーする．
dstのデータ部がある場合は破棄される．

Parameters
srcコピー元グラフィックデータ
dstコピー先グラフィックデータ

Definition at line 566 of file Graph.h.

567{
568 if (src==NULL || dst==NULL) return;
569 if ((void*)src->gp==(void*)dst->gp) return;
570
571 MSGraph<T> vp;
572
573 vp.getm(src->xs, src->ys, src->zs, (T)src->zero);
574 if (vp.gp==NULL) {
575 dst->free();
576 dst->gp = NULL;
577 dst->state = JBXL_GRAPH_MEMORY_ERROR;
578 return;
579 }
580
581 vp.max = (T)src->max;
582 vp.min = (T)src->min;
583 vp.base = (T)src->base;
584 vp.color = src->color;
585 vp.state = src->state;
586 for (int i=0; i<vp.xs*vp.ys*vp.zs; i++) vp.gp[i] = (T)src->gp[i];
587
588 dst->free();
589 *dst = vp;
590 return;
591}
jbxl::MSGraph::state
int state
エラー制御
Definition Gdata.h:90
jbxl::MSGraph::getm
void getm(int x, int y, int z=1, T v=(T) 0)
グラフィックメモリを獲得する
Definition Gdata.h:250
JBXL_GRAPH_MEMORY_ERROR
#define JBXL_GRAPH_MEMORY_ERROR
メモリエラー
Definition jbxl_state.h:170

References MSGraph< T >::base, MSGraph< T >::color, MSGraph< T >::free(), MSGraph< T >::getm(), MSGraph< T >::gp, JBXL_GRAPH_MEMORY_ERROR, MSGraph< T >::max, MSGraph< T >::min, MSGraph< T >::state, MSGraph< T >::xs, MSGraph< T >::ys, MSGraph< T >::zero, and MSGraph< T >::zs.

Here is the call graph for this function:

◆ copy_MSGraph() [2/2]

template<typename R , typename T >
void copy_MSGraph ( MSGraph< R > src,
MSGraph< T > & dst )

template <typename R, typename T> void copy_MSGraph(MSGraph<R> src, MSGraph<T>& dst)

MSGraph<R>型データのバッファ部を MSGraph<T>型のバッファ部へコピーする．
dstのデータ部がある場合は破棄される．

Parameters
srcコピー元グラフィックデータ
dstコピー先グラフィックデータ

Definition at line 530 of file Graph.h.

531{
532 if ((void*)src.gp==(void*)dst.gp) return;
533
534 MSGraph<T> vp;
535
536 vp.getm(src.xs, src.ys, src.zs, (T)src.zero);
537 if (vp.gp==NULL) {
538 dst.free();
539 dst.gp = NULL;
540 dst.state = JBXL_GRAPH_MEMORY_ERROR;
541 return;
542 }
543
544 vp.max = (T)src.max;
545 vp.min = (T)src.min;
546 vp.base = (T)src.base;
547 vp.color = src.color;
548 vp.state = src.state;
549 for (int i=0; i<vp.xs*vp.ys*vp.zs; i++) vp.gp[i] = (T)src.gp[i];
550
551 dst.free();
552 dst = vp;
553 return;
554}

References MSGraph< T >::base, MSGraph< T >::color, MSGraph< T >::free(), MSGraph< T >::getm(), MSGraph< T >::gp, JBXL_GRAPH_MEMORY_ERROR, MSGraph< T >::max, MSGraph< T >::min, MSGraph< T >::state, MSGraph< T >::xs, MSGraph< T >::ys, MSGraph< T >::zero, and MSGraph< T >::zs.

Here is the call graph for this function:

◆ copyCmnHead2MSGraph()

template<typename T >
MSGraph< T > copyCmnHead2MSGraph ( CmnHead hd,
unsigned int mode = CH2MG_NORMAL,
bool cnt = false )

template <typename T> MSGraph<T> copyCmnHead2MSGraph(CmnHead hd, unsigned int mode=CH2MG_NORMAL, bool cnt=false)

CmnHead から MSGraph<T>のデータを作り出す．
MSGraph<T>.gp のメモリ領域は別に作られる．グローバルカウンタが使用可能．

Parameters
hd共通ヘッダ
modeCH2MG_NORMAL (0) ノーマルコピー（デフォルト）
CH2MG_NORZXY (1) Z軸の歪を処理しない．
cntカウンタを使用するか（デフォルト：使用しない false）
Returns
画像データ．エラーの場合は，stateメンバに値が設定される．
Return values
JBXL_GRAPH_HEADER_ERRORstate ヘッダエラー
JBXL_GRAPH_MEMORY_ERRORstate メモリ確保エラー
JBXL_GRAPH_CANCELstate ユーザによる中断

Definition at line 651 of file Gdata.h.

652{
653 MSGraph<T> vp;
654 int kind = hd.kind & 0x00ff;
655
656 vp.init(); // vp.color = GRAPH_COLOR_UNKNOWN;
657
658 if (kind==UN_KNOWN_DATA || hd.kind==HEADER_NONE) {
659 vp.state = JBXL_GRAPH_HEADER_ERROR;
660 return vp;
661 }
662
663 vp.set(hd.xsize, hd.ysize, hd.zsize);
664 if (vp.gp==NULL) { vp.state = JBXL_GRAPH_MEMORY_ERROR; return vp;}
665
666 // カラータイプ
667 if (kind==JPEG_RGB_DATA || kind==JPEG_MONO_DATA) {
668 //if (hd.zsize==3) vp.color = GRAPH_COLOR_PRGB;
669 if (hd.zsize==3) vp.color = GRAPH_COLOR_RGB;
670 }
671 else if (hd.depth==16) {
672 vp.color = GRAPH_COLOR_MONO16;
673 }
674
675 // カウンタ．ここでは，delete禁止
676 CVCounter* counter = NULL;
677 if (vp.zs>=10 && cnt) {
678 counter = GetUsableGlobalCounter();
679 if (counter!=NULL) counter->SetMax(vp.zs/10);
680 }
681
682 int ks, js, ln;
683 ln = vp.xs*vp.ys;
684
685 if (hd.depth==16){
686 sWord* bp = (sWord*)hd.grptr;
687 vp.max = vp.min = bp[0];
688 for (int k=0; k<vp.zs; k++) {
689 ks = k*ln;
690 for (int j=0; j<vp.xs*vp.ys; j++) {
691 js = j+ ks;
692 vp.gp[js] = bp[js];
693 vp.max = Max(vp.max, vp.gp[js]);
694 vp.min = Min(vp.min, vp.gp[js]);
695 }
696
697 if (counter!=NULL && k%10==0) {
698 counter->StepIt();
699 if (counter->isCanceled()) { // キャンセル
700 vp.free();
701 vp.state = JBXL_GRAPH_CANCEL;
702 return vp;
703 }
704 }
705
706 }
707 }
708
709 else if (hd.depth<16){ // ==8
710 //int uint = (unsigned char)hd.grptr[0];
711 vp.max = vp.min = (T)((unsigned char)hd.grptr[0]);
712 for (int k=0; k<vp.zs; k++) {
713 ks = k*ln;
714 for (int j=0; j<vp.xs*vp.ys; j++) {
715 js = j + ks;
716 vp.gp[js] = (T)((unsigned char)hd.grptr[js]);
717 vp.max = Max(vp.max, vp.gp[js]);
718 vp.min = Min(vp.min, vp.gp[js]);
719 }
720
721 if (counter!=NULL && k%10==0) {
722 counter->StepIt();
723 if (counter->isCanceled()) { // キャンセル
724 vp.free();
725 vp.state = JBXL_GRAPH_CANCEL;
726 return vp;
727 }
728 }
729 }
730 }
731
732 else {
733 vp.max = vp.min = (T)((uByte)hd.grptr[0]>>(hd.depth-15));
734 for (int k=0; k<vp.zs; k++) {
735 ks = k*ln;
736 for (int j=0; j<vp.xs*vp.ys; j++) {
737 js = j + ks;
738 vp.gp[js] = (T)((uByte)hd.grptr[js]>>(hd.depth-15));
739 vp.max = Max(vp.max, vp.gp[js]);
740 vp.min = Min(vp.min, vp.gp[js]);
741 }
742
743 if (counter!=NULL && k%10==0) {
744 counter->StepIt();
745 if (counter->isCanceled()) { // キャンセル
746 vp.free();
747 vp.state = JBXL_GRAPH_CANCEL;
748 return vp;
749 }
750 }
751 }
752 }
753
754 // もし存在するなら，ヘッダ部分から Z方向の歪率, rboundを取り出す．
755 if (!checkBit(mode, CH2MG_NOPARM)) {
756 if (hd.bsize>0 && (kind==CT_DATA || kind==CT_3DM || kind==CT_3D_VOL)) {
757 sWord* rz = (sWord*)hd.buf;
758 if (rz[9]==RZXY_RATE || checkBit(hd.kind, HAS_RZXY)) {
759 double rzm = rz[8]/(double)rz[9];
760 if (rzm<5.0 && rzm>0.) vp.RZxy = rzm;
761 }
762
763 if (rz[10]!=0 && checkBit(hd.kind, HAS_BASE)) {
764 vp.base = (T)rz[10];
765 }
766
767 if (checkBit(hd.kind, HAS_RBOUND)) {
768 vp.rbound.xmin = rz[6];
769 vp.rbound.xmax = rz[7];
770 vp.rbound.ymin = rz[4];
771 vp.rbound.ymax = rz[5];
772 vp.rbound.zmin = rz[2];
773 vp.rbound.zmax = rz[3];
774 }
775 }
776 }
777
778 if (counter!=NULL) counter->PutFill();
779
780 return vp;
781}
CH2MG_NOPARM
#define CH2MG_NOPARM
パラメータ処理（Z軸の歪, rboundの処理）をしない．
Definition Gdata.h:625
jbxl::MSGraph::init
void init(void)
グラフィックデータは解放しない
Definition Gdata.h:167
sWord
short sWord
2Byte
Definition common.h:335
uByte
unsigned char uByte
1Byte
Definition common.h:332
checkBit
#define checkBit(dat, bit)
Definition common.h:260
HEADER_NONE
#define HEADER_NONE
0x8000 // ヘッダ種別の指定なし
Definition gheader.h:212
CT_3DM
#define CT_3DM
0x0012 // 3D CT DATA（マルチスライス）
Definition gheader.h:178
GRAPH_COLOR_RGB
#define GRAPH_COLOR_RGB
Definition gheader.h:270
HAS_BASE
#define HAS_BASE
0x0400 // 基底（底上げ）値を持つ
Definition gheader.h:206
RZXY_RATE
#define RZXY_RATE
RZxy をファイルのヘッダに埋め込む際の比率（倍率）．
Definition gheader.h:215
JPEG_RGB_DATA
#define JPEG_RGB_DATA
0x0020 // JPEG RGB
Definition gheader.h:184
CT_DATA
#define CT_DATA
0x0010 // CT DATA (Moon形式)
Definition gheader.h:177
GRAPH_COLOR_MONO16
#define GRAPH_COLOR_MONO16
0x0010
Definition gheader.h:247
HAS_RBOUND
#define HAS_RBOUND
0x2000 // with RBound data
Definition gheader.h:209
UN_KNOWN_DATA
#define UN_KNOWN_DATA
0x0000 // 知らないデータ形式（システムにお任せ）
Definition gheader.h:169
JPEG_MONO_DATA
#define JPEG_MONO_DATA
0x0021 // JPEG MONO
Definition gheader.h:185
HAS_RZXY
#define HAS_RZXY
0x1000 // with RZxy data
Definition gheader.h:208
CT_3D_VOL
#define CT_3D_VOL
0x0013 // CT ボリュームデータ
Definition gheader.h:179
JBXL_GRAPH_CANCEL
#define JBXL_GRAPH_CANCEL
処理がキャンセルされた
Definition jbxl_state.h:168
JBXL_GRAPH_HEADER_ERROR
#define JBXL_GRAPH_HEADER_ERROR
画像ヘッダーのエラー
Definition jbxl_state.h:169
jbxl::GetUsableGlobalCounter
CVCounter * GetUsableGlobalCounter()
現在有効なグローバルカウンタを得る．（子カウンタを得るかもしれない）
Definition ClassBox.h:185
CmnHead::buf
uByte * buf
Ture Header buffer
Definition gheader.h:137
CmnHead::zsize
int zsize
For 3D Data (or Color)
Definition gheader.h:130
CmnHead::kind
int kind
Kind of Graphics Format.
Definition gheader.h:127
CmnHead::bsize
unsigned int bsize
Fllowing buf size or Any Data (byte unit)
Definition gheader.h:132
CmnHead::depth
int depth
Color Depth of Graphics (bit unit)
Definition gheader.h:131

References MSGraph< T >::base, CmnHead::bsize, CmnHead::buf, CH2MG_NOPARM, checkBit, MSGraph< T >::color, CT_3D_VOL, CT_3DM, CT_DATA, CmnHead::depth, MSGraph< T >::free(), GetUsableGlobalCounter(), MSGraph< T >::gp, GRAPH_COLOR_MONO16, GRAPH_COLOR_RGB, CmnHead::grptr, HAS_BASE, HAS_RBOUND, HAS_RZXY, HEADER_NONE, MSGraph< T >::init(), CVCounter::isCanceled(), JBXL_GRAPH_CANCEL, JBXL_GRAPH_HEADER_ERROR, JBXL_GRAPH_MEMORY_ERROR, JPEG_MONO_DATA, JPEG_RGB_DATA, CmnHead::kind, Max, MSGraph< T >::max, Min, MSGraph< T >::min, CVCounter::PutFill(), MSGraph< T >::rbound, MSGraph< T >::RZxy, RZXY_RATE, MSGraph< T >::set(), CVCounter::SetMax(), MSGraph< T >::state, CVCounter::StepIt(), UN_KNOWN_DATA, RBound< T >::xmax, RBound< T >::xmin, MSGraph< T >::xs, CmnHead::xsize, RBound< T >::ymax, RBound< T >::ymin, MSGraph< T >::ys, CmnHead::ysize, RBound< T >::zmax, RBound< T >::zmin, MSGraph< T >::zs, and CmnHead::zsize.

Here is the call graph for this function:

◆ copyMSGraph2CmnHead()

template<typename T >
CmnHead copyMSGraph2CmnHead ( MSGraph< T > & vp,
unsigned int mode = MG2CH_NORMAL,
bool cnt = false )

template <typename T> CmnHead copyMSGraph2CmnHead(MSGraph<T>& vp, unsigned int mode=MG2CH_NORMAL, bool cnt=false)

MSGraph<T> から CmnHeadのデータを作り出す．

CmnHead.grptr のメモリ領域は別に作られる．vpに関しては vp.max, vp.minが設定される．
グローバルカウンタが使用可能．

Parameters
vpコピー元のグラフィックデータ
modeMG2CH_NORMAL (0) ノーマルコピー（デフォルト）
MG2CH_NORZXY (1) Z軸の歪を処理しない．
MG2CH_CONTRAST (2) コントラスト調整
MG2CH_OCTET (4) 8bitへ変換
cntカウンタを使用するか（デフォルト：使用しない false）
Returns
共通ヘッダ．エラーの場合は kind が HEADER_NONE になり，xsizeに値が設定される．
Return values
HEADER_NONEkind エラー
JBXL_GRAPH_HEADER_ERRORxsize ヘッダエラー
JBXL_GRAPH_MEMORY_ERRORxsize メモリ確保エラー
JBXL_GRAPH_CANCELxsize ユーザによる中断

Definition at line 805 of file Gdata.h.

806{
807 CmnHead hd;
808 CTHead ct;
809
810 memset(&ct, 0, sizeof(CTHead));
811 memset(&hd, 0, sizeof(CmnHead));
812
813 if (vp.gp==NULL) {
814 hd.xsize = JBXL_GRAPH_HEADER_ERROR;
815 hd.kind = HEADER_NONE;
816 return hd;
817 }
818
819 //
820 hd.kind = 0; // MSGraphからのコピー時には，ヘッダ情報は既に消失している．
821 hd.xsize = ct.xsize = ct.cutright= vp.xs;
822 hd.ysize = ct.ysize = ct.cutdown = vp.ys;
823 hd.zsize = vp.zs;
824
825 if (checkBit(mode, MG2CH_OCTET)) hd.depth = 8;
826 else hd.depth = sizeof(T)*8;
827 hd.lsize = hd.xsize*hd.ysize*hd.zsize*(hd.depth/8);
828 hd.bsize = sizeof(CTHead);
829
830 hd.grptr = (uByte*)malloc(hd.lsize*sizeof(uByte));
831 if (hd.grptr==NULL) {
832 hd.xsize = JBXL_GRAPH_MEMORY_ERROR;
833 hd.kind = HEADER_NONE;
834 return hd;
835 }
836 memset(hd.grptr, 0, hd.lsize*sizeof(uByte));
837
838 hd.buf = (uByte*)malloc(hd.bsize*sizeof(uByte));
839 if (hd.buf==NULL) {
840 free_CmnHead(&hd);
841 hd.xsize = JBXL_GRAPH_MEMORY_ERROR;
842 return hd;
843 }
844 memset(hd.buf, 0, hd.bsize*sizeof(uByte));
845
846 // カウンタ．ここでは，delete禁止
847 CVCounter* counter = NULL;
848
849 if (hd.zsize>=5 && cnt) {
850 counter = GetUsableGlobalCounter();
851 if (counter!=NULL) counter->SetMax(hd.zsize*2/10);
852 }
853
854 // 最大値，最小値を求める
855 int j, k, ks, js, ln;
856 T max, min;
857 max = min = vp.gp[0];
858
859 ln = vp.xs*vp.ys;
860 for (k=0; k<vp.zs; k++) {
861 ks = k*ln;
862 for (j=0; j<vp.ys*vp.xs; j++) {
863 js = j + ks;
864 min = Min(vp.gp[js], min);
865 max = Max(vp.gp[js], max);
866 }
867
868 // カウンタ
869 if (counter!=NULL && k%10==0) {
870 counter->StepIt();
871 if (counter->isCanceled()) { // キャンセル
872 free_CmnHead(&hd);
873 hd.xsize = JBXL_GRAPH_CANCEL;
874 return hd;
875 }
876 }
877 }
878 vp.max = max;
879 vp.min = min;
880
881 // ノーマルコピー
882 if (mode==MG2CH_NORMAL) {
883 memcpy(hd.grptr, vp.gp, hd.lsize);
884 }
885
886 // 8bitへ変換
887 else if (checkBit(mode, MG2CH_OCTET)) {
888 // 255以下はコントラスト調整しない
889 if (!checkBit(mode, MG2CH_CONTRAST) && vp.max<=255 && vp.min>=0) {
890 max = 255;
891 min = 0;
892 }
893
894 for (k=0; k<hd.zsize; k++) {
895 ks = k*ln;
896 for (j=0; j<hd.xsize*hd.ysize; j++) {
897 js = j + ks;
898 hd.grptr[js] = (uByte)(((vp.gp[js]-min)/(double)(max-min))*255.);
899 }
900
901 // カウンタ
902 if (counter!=NULL && k%10==0) {
903 counter->StepIt();
904 if (counter->isCanceled()) { // キャンセル
905 free_CmnHead(&hd);
906 hd.xsize = JBXL_GRAPH_CANCEL;
907 return hd;
908 }
909 }
910 }
911 }
912 if (counter!=NULL) counter->PutFill();
913
914 memcpy(hd.buf, &ct, hd.bsize);
915
916 // Z方向の歪率, rboundの設定．
917 if (!checkBit(mode, MG2CH_NOPARM)) {
918 sWord* rz = (sWord*)hd.buf;
919 if (vp.RZxy!=1.0) {
920 hd.kind = hd.kind | HAS_RZXY;
921 rz[9] = (sWord)RZXY_RATE;
922 rz[8] = (sWord)(vp.RZxy*RZXY_RATE);
923 }
924 if (vp.base!=0) {
925 rz[10] = (sWord)vp.base;
926 hd.kind |= HAS_BASE;
927 }
928 rz[2] = (sWord)vp.rbound.zmin;
929 rz[3] = (sWord)vp.rbound.zmax;
930 rz[4] = (sWord)vp.rbound.ymin;
931 rz[5] = (sWord)vp.rbound.ymax;
932 rz[6] = (sWord)vp.rbound.xmin;
933 rz[7] = (sWord)vp.rbound.xmax;
934 hd.kind |= HAS_RBOUND;
935 }
936
937 return hd;
938}
MG2CH_CONTRAST
#define MG2CH_CONTRAST
コントラスト調整を行う
Definition Gdata.h:629
MG2CH_NORMAL
#define MG2CH_NORMAL
ノーマルコピー
Definition Gdata.h:627
MG2CH_NOPARM
#define MG2CH_NOPARM
パラメータ処理（Z軸の歪, rboundの処理）をしない．
Definition Gdata.h:628
MG2CH_OCTET
#define MG2CH_OCTET
8bitへ変換
Definition Gdata.h:630
jbxl::free_CmnHead
void free_CmnHead(CmnHead *hd)
Definition Gdata.cpp:25
CTHead::xsize
sWord xsize
Definition gheader.h:65
CTHead::cutdown
sWord cutdown
Definition gheader.h:70
CTHead::ysize
sWord ysize
Definition gheader.h:66
CTHead::cutright
sWord cutright
Definition gheader.h:72
CmnHead::lsize
unsigned int lsize
Size of Graphics Data (byte unit)
Definition gheader.h:133

References MSGraph< T >::base, CmnHead::bsize, CmnHead::buf, checkBit, CTHead::cutdown, CTHead::cutright, CmnHead::depth, free_CmnHead(), GetUsableGlobalCounter(), MSGraph< T >::gp, CmnHead::grptr, HAS_BASE, HAS_RBOUND, HAS_RZXY, HEADER_NONE, CVCounter::isCanceled(), JBXL_GRAPH_CANCEL, JBXL_GRAPH_HEADER_ERROR, JBXL_GRAPH_MEMORY_ERROR, CmnHead::kind, CmnHead::lsize, Max, MSGraph< T >::max, MG2CH_CONTRAST, MG2CH_NOPARM, MG2CH_NORMAL, MG2CH_OCTET, Min, MSGraph< T >::min, CVCounter::PutFill(), MSGraph< T >::rbound, MSGraph< T >::RZxy, RZXY_RATE, CVCounter::SetMax(), CVCounter::StepIt(), RBound< T >::xmax, RBound< T >::xmin, MSGraph< T >::xs, CTHead::xsize, CmnHead::xsize, RBound< T >::ymax, RBound< T >::ymin, MSGraph< T >::ys, CTHead::ysize, CmnHead::ysize, RBound< T >::zmax, RBound< T >::zmin, MSGraph< T >::zs, and CmnHead::zsize.

Referenced by readGraphicSlices(), and writeRasFile().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ copyMSGraph2CvMat()

template<typename R , typename T >
cv::Mat copyMSGraph2CvMat ( MSGraph< T > * vp)

template <typename R, typename T> cv::Mat copyMSGraph2CvMat(MSGraph<T>* vp)

MSGraph<T> vp から OpenCV用の Matデータ（型R）を作り出す．
型 T, R の整合性は呼び出し側の責任． 現在は T->R で単純にキャスト可能な場合にしか対応していない．

vp.color による Matの構成は今後....

Parameters
vp元のグラフィックデータ
Returns
OpenCV のMatデータ
cv::Mat imag = copyMSGraph2CvMat<uByte>(*vp);

Definition at line 114 of file OpenCVTool.h.

115{
116 cv::Mat mat;
117
118 if (vp->zs<=1) {
119 vp->zs = 1;
120 mat = cv::Mat_<R>(vp->ys, vp->xs);
121
122 // 通常は連続しているはず
123 if (mat.isContinuous()) {
124 R* dst = mat.ptr<R>(0);
125 for (int i=0; i<vp->xs*vp->ys; i++) {
126 dst[i] = (R)vp->gp[i];
127 }
128 }
129 else {
130 for (int j=0; j<vp->ys; j++) {
131 R* dst = mat.ptr<R>(j);
132 T* src = &(vp->gp[j*vp->xs]);
133 for (int i=0; i<vp->xs; i++) {
134 dst[i] = (R)src[i];
135 }
136 }
137 }
138 }
139
140 //
141 else {
142 int size[3];
143 size[0] = vp->zs;
144 size[1] = vp->ys;
145 size[2] = vp->xs;
146 mat = cv::Mat_<R>(3, size);
147
148 // 通常は連続しているはず
149 if (mat.isContinuous()) {
150 R* dst = (R*)mat.data;
151 for (int i=0; i<vp->xs*vp->ys*vp->zs; i++) {
152 dst[i] = (R)vp->gp[i];
153 }
154 }
155 else {
156 for (int k=0; k<vp->zs; k++) {
157 int kk = k*vp->ys*vp->xs;
158 for (int j=0; j<vp->ys; j++) {
159 R* dst = mat.ptr<R>(k, j);
160 T* src = &(vp->gp[j*vp->xs + kk]);
161 for (int i=0; i<vp->xs; i++) {
162 dst[i] = (R)src[i];
163 }
164 }
165 }
166 }
167 }
168 return mat;
169}

References MSGraph< T >::gp, MSGraph< T >::xs, MSGraph< T >::ys, and MSGraph< T >::zs.

◆ count_area_MSGraph()

template<typename T >
int count_area_MSGraph ( MSGraph< T > xp)

template <typename T> int count_area_MSGraph(MSGraph<T> xp)

面積を測る．

Definition at line 223 of file Graph.h.

224{
225 int ss = 0;
226
227 for (int i=0; i<xp.xs*xp.ys*xp.zs; i++) {
228 if (xp.gp[i]!=xp.zero) ss++;
229 }
230 return ss;
231}

References MSGraph< T >::gp, MSGraph< T >::xs, MSGraph< T >::ys, MSGraph< T >::zero, and MSGraph< T >::zs.

Referenced by dgree_circle_MSGraph().

Here is the caller graph for this function:

◆ count_around_MSGraph()

template<typename T >
double count_around_MSGraph ( MSGraph< T > vp)

Definition at line 180 of file Graph.h.

181{
182 int i, j, m, n, cc;
183 bool sflg;
184 double cnt;
185 const double qs = 0.70710678118654752440084436210; // sqrt(2.)/2.
186 MSGraph<T> xp;
187
188 xp = zoom_MSGraph(vp, 2, OFF);
189 if (xp.isNull()) return -1.0;
190
191 cnt = 0.0;
192 for (j=1; j<xp.ys-1; j+=2) {
193 for (i=1; i<xp.xs-1; i+=2) {
194 cc = 0;
195 sflg = false;
196 for (n=0; n<2; n++) {
197 for (m=0; m<2; m++) {
198 if (xp.point(i+m, j+n)!=vp.zero) {
199 cc++;
200 if (n>0) if (xp.point(i+(1-m), j)!=vp.zero) sflg = true; // 対角チェック
201 }
202 }
203 }
204
205 if (cc==1 || cc==3) cnt += qs;
206 else if (cc==2) {
207 if (sflg==false) cnt += 1;
208 else cnt += 2;
209 }
210 }
211 }
212 xp.free();
213
214 return cnt;
215}
jbxl::MSGraph::isNull
bool isNull(void)
グラフィックデータを持っていないか？
Definition Gdata.h:194
OFF
#define OFF
Definition common.h:231
jbxl::zoom_MSGraph
MSGraph< T > zoom_MSGraph(MSGraph< T > vp, double zm, int mode=ON)
Definition Graph.h:1733

References MSGraph< T >::free(), MSGraph< T >::isNull(), OFF, MSGraph< T >::point(), MSGraph< T >::xs, MSGraph< T >::ys, MSGraph< T >::zero, and zoom_MSGraph().

Referenced by dgree_circle_MSGraph().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ count_object_MSGraph()

template<typename T >
int count_object_MSGraph ( MSGraph< T > xp,
int mn,
int mx )

Definition at line 234 of file Graph.h.

235{
236 int cnt = 0;
237 int nx, ny;
238 MSGraph<T> pp;
239
240 pp.mimicry(xp);
241 for (int i=0; i<pp.xs*pp.ys*pp.zs; i++) pp.gp[i] = xp.gp[i];
242
243 MSGraph_Paint(pp, 0, 0, pp.zero, pp.zero, mx+1, 4);
244
245 for (int j=0; j<pp.ys; j++) {
246 ny = pp.xs*j;
247 for (int i=0; i<pp.xs; i++) {
248 nx = ny + i;
249 if (pp.gp[nx]==pp.zero) {
250 MSGraph_Paint(pp, i, j, pp.zero, pp.zero, mx, 8);
251 }
252 }
253 }
254
255 MSGraph_Paint(pp, 0, 0, mx+1, mx+1, pp.zero, 4);
256
257 for (int j=0; j<pp.ys; j++) {
258 ny = pp.xs*j;
259 for (int i=0; i<pp.xs; i++) {
260 nx = ny + i;
261 if (pp.gp[nx]>=mn && pp.gp[nx]<=mx) {
262 MSGraph_Paint(pp, i, j, mn, mx, pp.zero, 8);
263 cnt++;
264 }
265 }
266 }
267 pp.free();
268
269 return cnt;
270}
jbxl::MSGraph::mimicry
void mimicry(MSGraph< R > s)
Definition Gdata.h:134
jbxl::MSGraph_Paint
int MSGraph_Paint(MSGraph< T > vp, int x, int y, int mn, int mx, int cc, int mode=8)
Definition Graph.h:793

References MSGraph< T >::free(), MSGraph< T >::gp, MSGraph< T >::mimicry(), MSGraph_Paint(), MSGraph< T >::xs, MSGraph< T >::ys, MSGraph< T >::zero, and MSGraph< T >::zs.

Here is the call graph for this function:

◆ CreateContourByVector()

DllExport BREP_CONTOUR * CreateContourByVector ( BREP_FACET * facet,
Vector< double > * vect,
Vector< double > * nrml = NULL,
UVMap< double > * uvmp = NULL,
ArrayParam< int > * wght = NULL,
bool dupli = false )

BREP_CONTOUR* jbxl::CreateContourByVector(BREP_FACET* facet, Vector<double>* vect, Vector<double>* nrml, UVMap<double>* uvmp, ArrayParam<int>* wght, bool dupli)

Facet と Vector[] から Contour を作る．

vect[0]〜vect[2] は３点の位置ベクトル（順序付けされている） nrml[0]〜nrml[2] は３点の法線ベクトル（NULL なら再計算される） uvmp[0]〜uvmp[2] は３点の曲面座標データ．

Parameters
facetFACETデータへのポインタ
vect3個の頂点データ vect[3] へのポインタ
nrml頂点の法線ベクトルデータへのポインタ．
uvmp頂点の曲面座標データへのポインタ．
wght頂点の重みデータへのポインタ．
duplitrue: 頂点の重複登録を許可する．false: 重複登録を許可しない．

Definition at line 684 of file TriBrep.cpp.

685{
686 BREP_SOLID* solid;
687 BREP_CONTOUR* contour;
688 BREP_VERTEX* vertex[3];
689
690 solid = facet->shell->solid;
691
692 // Vertex の生成
693 for (int i=0; i<3; i++) {
694 vertex[i] = new BREP_VERTEX();
695 vertex[i]->point = vect[i];
696 if (nrml!=NULL) {
697 vertex[i]->calc_normal = false;
698 vertex[i]->normal = nrml[i];
699 }
700 if (uvmp!=NULL) {
701 vertex[i]->uvmap = uvmp[i];
702 }
703 if (wght!=NULL) {
704 vertex[i]->weight.dup(wght[i]);
705 }
706 vertex[i]->CloseData();
707 }
708
709 // 同じ点がある．または３点が直線上にある．
710 if (vertex[0]==vertex[1] || vertex[1]==vertex[2] || vertex[0]==vertex[2]) return NULL;
711 if (IsForbiddenEdge(vertex)) return NULL;
712
713 // Vertexをソリッドの Octreeに登録
714 BREP_VERTEX* vert;
715 for (int i=0; i<3; i++) {
716 vert = AddVertex2Octree(vertex[i], solid->octree, dupli);
717 if (vert!=vertex[i]) {
718 delete vertex[i];
719 vertex[i] = vert;
720 }
721 }
722
723 contour = CreateContourByVertex(facet, vertex);
724
725 return contour;
726}
jbxl::ArrayParam::dup
void dup(ArrayParam< T > a, bool del=true)
Definition tools++.h:138
jbxl::BREP_FACET::shell
BREP_SHELL * shell
Definition Brep.h:138
jbxl::BREP_SHELL::solid
BREP_SOLID * solid
Definition Brep.h:116
jbxl::BREP_SOLID
Definition Brep.h:72
jbxl::BREP_VERTEX
Definition Brep.h:256
jbxl::BREP_VERTEX::calc_normal
bool calc_normal
normal を計算するか? しない場合は入力値を使用する．
Definition Brep.h:267
jbxl::BREP_VERTEX::CloseData
void CloseData()
Definition Brep.cpp:647
jbxl::BREP_VERTEX::normal
Vector< double > normal
法線ベクトル．周りの Contour の法線ベクトルの平均．
Definition Brep.h:261
jbxl::BREP_VERTEX::weight
ArrayParam< int > weight
頂点の重み．要正規化．
Definition Brep.h:263
jbxl::BREP_VERTEX::uvmap
UVMap< double > uvmap
曲面のUV座標
Definition Brep.h:262
jbxl::CreateContourByVertex
DllExport BREP_CONTOUR * CreateContourByVertex(BREP_FACET *facet, BREP_VERTEX **vtx)
Definition TriBrep.cpp:735
jbxl::IsForbiddenEdge
DllExport bool IsForbiddenEdge(BREP_VERTEX **vert)
Definition TriBrep.cpp:886
jbxl::BREP_VERTEX
class DllExport BREP_VERTEX
Definition Brep.h:38

References AddVertex2Octree(), BREP_VERTEX, BREP_VERTEX::calc_normal, BREP_VERTEX::CloseData(), CreateContourByVertex(), ArrayParam< T >::dup(), IsForbiddenEdge(), BREP_VERTEX::normal, BREP_SOLID::octree, BREP_VERTEX::point, BREP_FACET::shell, BREP_SHELL::solid, BREP_VERTEX::uvmap, and BREP_VERTEX::weight.

Referenced by BrepSolidList::addSolid(), AddVector2TriSolid(), CreateTriSolidFromSTL(), CreateTriSolidFromVector(), and BrepSolidList::getMerge().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ CreateContourByVertex()

DllExport BREP_CONTOUR * CreateContourByVertex ( BREP_FACET * facet,
BREP_VERTEX ** vertex )

BREP_CONTOUR* jbxl::CreateContourByVertex(BREP_FACET* facet, BREP_VERTEX** vertex)

Facet と Vertex[3] から Vertex を作る． vertex[0]〜vertex[2] は 3点の Vertex（順序付けされている）

Definition at line 735 of file TriBrep.cpp.

736{
737 // 同じ点がある．または３点が直線上にある．
738 if (vertex[0]==vertex[1] || vertex[1]==vertex[2] || vertex[0]==vertex[2]) return NULL;
739 if (IsForbiddenEdge(vertex)) return NULL;
740
741 BREP_CONTOUR* contour = new BREP_CONTOUR(facet);
742
743 // Wingを作る．
744 BREP_WING* wing = contour->CreateWing(vertex[0], vertex[1]);
745 if (wing!=NULL) wing = contour->CreateWing(vertex[1], vertex[2]);
746 if (wing!=NULL) wing = contour->CreateWing(vertex[2], vertex[0]);
747 if (wing!=NULL) {
748 contour->CloseData(); // 面の法線ベクトルを計算．
749 }
750 else {
751 delete(contour);
752 contour = NULL;
753 }
754
755 return contour;
756}
jbxl::BREP_CONTOUR::CloseData
void CloseData()
Definition Brep.cpp:331
jbxl::BREP_CONTOUR::CreateWing
BREP_WING * CreateWing(BREP_VERTEX *vertex1, BREP_VERTEX *vertex2)
Definition Brep.cpp:387
jbxl::BREP_CONTOUR
class DllExport BREP_CONTOUR
Definition Brep.h:35

References BREP_CONTOUR, BREP_CONTOUR::CloseData(), BREP_CONTOUR::CreateWing(), and IsForbiddenEdge().

Referenced by CreateContourByVector(), PatchupContour(), and ReverseContours().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ CreateContoursList()

DllExport void CreateContoursList ( BREP_SOLID * solid)

void jbxl:: CreateContoursList(BREP_SOLID* solid)

削除マークの付いたContour(Facet)を削除し，全Contour(Facet)の Listを作る．
ただし，読み込み（初期）データは削除しない．

Definition at line 22 of file TriBrep.cpp.

23{
24 solid->contours.clear();
25
26 BREP_SHELL_LIST shells = solid->shells;
27 BREP_SHELL_LIST::iterator ishell;
28 for (ishell=shells.begin(); ishell!=shells.end(); ishell++){
29 BREP_FACET* pbfc;
30 BREP_FACET_LIST::iterator ifacet;
31 for (ifacet =(*ishell)->facets.begin(); ifacet!=(*ishell)->facets.end(); ifacet++){
32 if ((*ifacet)->deletable && !(*ifacet)->notdelete) {
33 pbfc = *ifacet;
34 ifacet = (*ishell)->facets.erase(ifacet);
35 ifacet--;
36 pbfc->shell = NULL;
37 delete(pbfc);
38 }
39 else {
40 BREP_CONTOUR_LIST::iterator icon;
41 for (icon=(*ifacet)->outer_contours.begin(); icon!=(*ifacet)->outer_contours.end(); icon++) {
42 (*ifacet)->deletable = false;
43 solid->contours.push_back(*icon);
44 }
45 }
46 }
47 }
48 solid->facetno = (int)solid->contours.size();
49}
jbxl::BREP_SOLID::facetno
unsigned int facetno
面の数
Definition Brep.h:74
jbxl::BREP_SOLID::shells
BREP_SHELL_LIST shells
Definition Brep.h:79
jbxl::BREP_SHELL_LIST
std::list< BREP_SHELL * > BREP_SHELL_LIST
Definition Brep.h:42

References BREP_SOLID::contours, BREP_SOLID::facetno, BREP_FACET::shell, and BREP_SOLID::shells.

Referenced by CloseTriSolid(), DeleteShortageWings(), DeleteStraightEdges(), FillShortageWings_Near(), FillShortageWings_Next(), JoinShortageWings(), and ReverseContours().

Here is the caller graph for this function:

◆ CreateEdge()

DllExport BREP_EDGE * CreateEdge ( BREP_VERTEX * v1,
BREP_VERTEX * v2 )

Definition at line 988 of file Brep.cpp.

989{
990 if (v1==v2) return NULL;
991
992 BREP_EDGE* edge = new BREP_EDGE(v1, v2);
993 edge->CloseData();
994
995 return edge;
996}
jbxl::BREP_EDGE
Definition Brep.h:231
jbxl::BREP_EDGE::CloseData
void CloseData()
Definition Brep.cpp:557
jbxl::BREP_EDGE
class DllExport BREP_EDGE
Definition Brep.h:36

References BREP_EDGE, and BREP_EDGE::CloseData().

Referenced by CreateWingWithoutContour().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ CreateShortageWingsList()

DllExport void CreateShortageWingsList ( BREP_SOLID * solid)

void jbxl::CreateShortageWingsList(BREP_SOLID* solid)

不完全な Wingの Listを作る．WingsListを利用する．
CreateContoursList(), CreateWingsList()に依存する．

Definition at line 105 of file TriBrep.cpp.

106{
107 solid->shortage_wings.clear();
108
109 BREP_WING_LIST::iterator iwing;
110 for (iwing=solid->wings.begin(); iwing!=solid->wings.end(); iwing++){
111 if ((*iwing)->contour==NULL) solid->shortage_wings.push_back(*iwing);
112 }
113}
jbxl::BREP_SOLID::wings
BREP_WING_LIST wings
Wings リスト
Definition Brep.h:84
jbxl::BREP_SOLID::shortage_wings
BREP_WING_LIST shortage_wings
不足 Wings リスト
Definition Brep.h:87

References BREP_SOLID::shortage_wings, and BREP_SOLID::wings.

Referenced by CloseTriSolid(), DeleteSurplusContours(), and FillShortageWings().

Here is the caller graph for this function:

◆ CreateSurplusContoursList()

DllExport void CreateSurplusContoursList ( BREP_SOLID * solid)

void jbxl::CreateSurplusContoursList(BREP_SOLID* solid)

多重Edgeを持つ Contourの Listを作る．
CreateContoursList()に依存する．

Definition at line 84 of file TriBrep.cpp.

85{
86// DEBUG_MODE PRINT_MESG("Start CreateSurplusContoursList\n");
87 solid->surplus_contours.clear();
88
89 BREP_CONTOUR_LIST::iterator icon;
90 for (icon=solid->contours.begin(); icon!=solid->contours.end(); icon++){
91 if (DupEdgeNumber(*icon)>0) {
92 solid->surplus_contours.push_back(*icon);
93 }
94 }
95// DEBUG_MODE PRINT_MESG("END CreateSurplusContoursList\n");
96}
jbxl::BREP_SOLID::surplus_contours
BREP_CONTOUR_LIST surplus_contours
過剰 Contours リスト
Definition Brep.h:86
jbxl::DupEdgeNumber
DllExport int DupEdgeNumber(BREP_CONTOUR *contour)
Definition TriBrep.cpp:651

References BREP_SOLID::contours, DupEdgeNumber(), and BREP_SOLID::surplus_contours.

Referenced by CloseTriSolid(), and DeleteSurplusContours().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ CreateTriSolidFromSTL()

DllExport int CreateTriSolidFromSTL ( BREP_SOLID * solid,
STLData * stldata,
int fno,
bool check = true )

int jbxl::CreateTriSolidFromSTL(BREP_SOLID* solid, STLData* stldata, int fno, bool check)

STLDataから BREP_SOLIDを生成する．BREP_SOLIDに使用された有効なファセットの数を返す．
STLData中の法線ベクトルは無視して再計算する．
カウンタ使用可能．

Parameters
solidソリッドデータへのポインタ
stldataSTLデータへのポインタ
fnoFacet(STLデータ)の数
checkデータの不正検査を行うか？
Return values
-1ソリッドがNULL，stldataがNULL またはソリッドの Octreeが NULL
-3操作がキャンセルされた．

Definition at line 1230 of file TriBrep.cpp.

1231{
1232 BREP_SHELL* shell;
1233 BREP_FACET* facet;
1234 BREP_CONTOUR* contour;
1235 CVCounter* counter = NULL;
1236 Vector<double> v[4];
1237
1238 if (solid==NULL || stldata==NULL) return -1;
1239 if (solid->octree==NULL) return -1;
1240
1241 solid->contours.clear();
1242
1243 // カウンタ
1244 int intvl = 1;
1245 if (solid->counter!=NULL) {
1246 counter = solid->counter->GetUsableCounter();
1247 if (counter!=NULL) {
1248 counter->SetMax(100);
1249 counter->ResetRate(80, 100);
1250 intvl = Max(1, fno/100);
1251 }
1252 }
1253
1254 shell = new BREP_SHELL(solid);
1255 for (int i=0; i<fno; i++) {
1256 // 読み込んだ STLデータを作業用Vector変数に格納
1257 v[0].x = stldata[i].vect[3]; v[0].y = stldata[i].vect[4]; v[0].z = stldata[i].vect[5];
1258 v[1].x = stldata[i].vect[6]; v[1].y = stldata[i].vect[7]; v[1].z = stldata[i].vect[8];
1259 v[2].x = stldata[i].vect[9]; v[2].y = stldata[i].vect[10]; v[2].z = stldata[i].vect[11];
1260 // ここでは法線ベクトルは 再計算させる．
1261
1262 facet = new BREP_FACET(shell);
1263 contour = CreateContourByVector(facet, v, NULL, NULL, NULL, false);
1264 if (contour!=NULL) {
1265/*
1266 if (check) {
1267 // 衝突判定
1268 BREP_CONTOUR* collision;
1269 facet->CloseData();
1270 if (!IsCollisionContours(solid, contour, &collision)) {
1271 solid->contours.push_back(contour); // IsCollisionContours()用
1272 }
1273 else {
1274 collision->facet->deletable = true; // 衝突相手も消す．
1275 FastDeleteFacet(facet);
1276 }
1277 }
1278 else solid->contours.push_back(contour);
1279*/
1280 solid->contours.push_back(contour);
1281 }
1282 else {
1283 deleteNull(facet); // 中身は空
1284 }
1285
1286 if (counter!=NULL && i%intvl==0) {
1287 counter->StepIt();
1288 if (counter->isCanceled()) {
1289 deleteNull(facet);
1290 return -3;
1291 }
1292 }
1293 }
1294 if (counter!=NULL) counter->PutFill();
1295
1296 //
1297 fno = CloseTriSolid(solid, check, counter);
1298
1299 return fno;
1300}
jbxl::BREP_SHELL
Definition Brep.h:114
jbxl::BREP_SOLID::counter
CVCounter * counter
仮想計量カウンタ
Definition Brep.h:90
jbxl::CVCounter::StepIt
virtual void StepIt(int n=1)
カウンタのメモリを増やす
Definition ClassBox.h:171
jbxl::CVCounter::SetMax
virtual void SetMax(int m)
カウンタの最大値（最終目標）を設定
Definition ClassBox.h:161
jbxl::CVCounter::ResetRate
virtual void ResetRate(int n, int m)
nの目盛り幅を mで読み替える．ここでの定義はあまり意味は無い．
Definition ClassBox.h:174
jbxl::CVCounter::GetUsableCounter
virtual CVCounter * GetUsableCounter()
現在使用可能な目盛りの有効領域を確保
Definition ClassBox.h:177
jbxl::CVCounter::PutFill
virtual void PutFill()
取り敢えずの目標（最短目標）までカウンタを進める．
Definition ClassBox.h:164
jbxl::CVCounter::isCanceled
virtual bool isCanceled()
カウンタがオペレータにより，キャンセルされたか
Definition ClassBox.h:173
jbxl::CloseTriSolid
DllExport int CloseTriSolid(BREP_SOLID *solid, bool check=true, CVCounter *counter=NULL)
Definition TriBrep.cpp:1459
jbxl::BREP_SHELL
class DllExport BREP_SHELL
Definition Brep.h:33
jbxl::STLData::vect
float vect[12]
Definition STL.h:32

References BREP_FACET, BREP_SHELL, CloseTriSolid(), BREP_SOLID::contours, BREP_SOLID::counter, CreateContourByVector(), deleteNull(), CVCounter::GetUsableCounter(), CVCounter::isCanceled(), Max, BREP_SOLID::octree, CVCounter::PutFill(), CVCounter::ResetRate(), CVCounter::SetMax(), CVCounter::StepIt(), STLData::vect, Vector< T >::x, Vector< T >::y, and Vector< T >::z.

Here is the call graph for this function:

◆ CreateTriSolidFromVector()

DllExport int CreateTriSolidFromVector ( BREP_SOLID * solid,
int vno,
Vector< double > * vect,
Vector< double > * nrml = NULL,
UVMap< double > * uvmp = NULL,
ArrayParam< int > * wght = NULL,
bool dupli = false,
bool check = true )

DllExport int jbxl::CreateTriSolidFromVector(BREP_SOLID* solid, int vno, Vector<double>* vect, Vector<double>* nrml, UVMap<double>* uvmp, ArrayParam<int>* wght, bool dupli, bool check)

Vector<double>から BREP_SOLIDを生成する．BREP_SOLIDに使用された有効なファセットの数を返す．
カウンタ使用可能．

Parameters
solidソリッドデータへのポインタ
vno頂点データの数
vect頂点の座標データへのポインタ．
nrml頂点の法線ベクトルデータへのポインタ．
uvmp頂点の曲面座標データへのポインタ．
wght頂点の重みデータへのポインタ．
duplitrue: 頂点の重複登録を許可する．false: 重複登録を許可しない．
checkデータの不正検査を行うか？
Return values
-1ソリッドがNULL，stldataがNULL またはソリッドの Octreeが NULL
-3操作がキャンセルされた．

Definition at line 1321 of file TriBrep.cpp.

1322{
1323 BREP_SHELL* shell;
1324 BREP_FACET* facet;
1325 BREP_CONTOUR* contour;
1326 CVCounter* counter = NULL;
1327 int fno = vno/3;
1328
1329 if (solid==NULL || vect==NULL) return -1;
1330 if (solid->octree==NULL) return -1;
1331
1332 solid->contours.clear();
1333
1334 // カウンタ
1335 int intvl = 1;
1336 if (solid->counter!=NULL) {
1337 counter = solid->counter->GetUsableCounter();
1338 if (counter!=NULL) {
1339 counter->SetMax(100);
1340 counter->ResetRate(80, 100);
1341 intvl = Max(1, fno/100);
1342 }
1343 }
1344
1345 Vector<double>* normal = NULL;
1346 UVMap<double>* uvmap = NULL;
1347 ArrayParam<int>* weight = NULL;
1348 shell = new BREP_SHELL(solid);
1349 //
1350 for (int i=0; i<fno; i++) {
1351 facet = new BREP_FACET(shell);
1352 if (nrml!=NULL) normal = nrml + i*3;
1353 if (uvmp!=NULL) uvmap = uvmp + i*3;
1354 if (wght!=NULL) weight = wght + i*3;
1355 contour = CreateContourByVector(facet, vect + i*3, normal, uvmap, weight, dupli);
1356
1357 if (contour!=NULL) {
1358/*
1359 if (check) {
1360 // 衝突判定．
1361 BREP_CONTOUR* collision;
1362 facet->CloseData();
1363 if (!IsCollisionContours(solid, contour, &collision)) {
1364 solid->contours.push_back(contour); // IsCollisionContours()用
1365 }
1366 else {
1367 collision->facet->deletable = true; // 衝突相手も消す．
1368 FastDeleteFacet(facet);
1369 }
1370 }
1371 else solid->contours.push_back(contour);
1372*/
1373 solid->contours.push_back(contour);
1374 }
1375 else {
1376 deleteNull(facet); // 中身は空
1377 }
1378
1379 if (counter!=NULL && i%intvl==0) {
1380 counter->StepIt();
1381 if (counter->isCanceled()) {
1382 deleteNull(facet);
1383 return -3;
1384 }
1385 }
1386 }
1387 if (counter!=NULL) counter->PutFill();
1388
1389 //
1390 fno = CloseTriSolid(solid, check, counter);
1391
1392 return fno;
1393}

References BREP_FACET, BREP_SHELL, CloseTriSolid(), BREP_SOLID::contours, BREP_SOLID::counter, CreateContourByVector(), deleteNull(), CVCounter::GetUsableCounter(), CVCounter::isCanceled(), Max, BREP_SOLID::octree, CVCounter::PutFill(), CVCounter::ResetRate(), CVCounter::SetMax(), and CVCounter::StepIt().

Referenced by MeshFacetNode::computeVertexByBREP(), and MeshFacetNode::computeVertexByBREP().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ CreateWingsList()

DllExport void CreateWingsList ( BREP_SOLID * solid)

void jbxl::CreateWingsList(BREP_SOLID* solid)

全 Wingの Listを作る．(Contourに結び付けられていないものも含む)
CreateContoursList()に依存する．

Definition at line 58 of file TriBrep.cpp.

59{
60 solid->wings.clear();
61
62 BREP_CONTOUR_LIST::iterator icon;
63 for (icon=solid->contours.begin(); icon!=solid->contours.end(); icon++) {
64 BREP_WING* first = (*icon)->wing;
65 if (first!=NULL) {
66 BREP_WING* next = first;
67 do {
68 BREP_WING* wing = next;
69 next = wing->next;
70 solid->wings.push_back(wing);
71 if (!wing->edge->complete) solid->wings.push_back(GetWingOtherSide(wing));
72 } while(next!=first);
73 }
74 }
75}
jbxl::BREP_EDGE::complete
bool complete
完全なエッジ．２つの Wingは共に使用されている．
Definition Brep.h:239
jbxl::BREP_WING::edge
BREP_EDGE * edge
Definition Brep.h:214
jbxl::GetWingOtherSide
DllExport BREP_WING * GetWingOtherSide(BREP_WING *wing)
Definition Brep.cpp:1028

References BREP_EDGE::complete, BREP_SOLID::contours, BREP_WING::edge, GetWingOtherSide(), BREP_WING::next, and BREP_SOLID::wings.

Referenced by CloseTriSolid(), DeleteShortageWings(), DeleteStraightEdges(), FillShortageWings_Near(), FillShortageWings_Next(), JoinShortageWings(), and ReverseContours().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ CreateWingWithoutContour()

DllExport BREP_WING * CreateWingWithoutContour ( BREP_VERTEX * vertex1,
BREP_VERTEX * vertex2 )

BREP_WING* jbxl::CreateWingWithoutContour(BREP_VERTEX* vertex1, BREP_VERTEX* vertex2)

vertex1をスタートVertexとしたWingを（必要ならEdgeも）作成して返す．

Wingが作成された時点では，WingはContourには関連付けられていない．

Definition at line 817 of file Brep.cpp.

818{
819 BREP_WING* wing = NULL;
820
821 // vertex1 - vertex2 間にエッジが既に登録されているかどうかチェックする．
822 BREP_EDGE* edge = FindEdge(vertex1, vertex2);
823 if (edge==NULL) { // Edgeは存在しない．
824 edge = CreateEdge(vertex1, vertex2);
825 if (edge==NULL) return NULL; // vertex1==vertex2 なら NULL
826 wing = edge->wing1;
827 }
828 else{ // Edgeは既に存在する．
829 if (edge->wing1->vertex==vertex1) wing = edge->wing1;
830 else if (edge->wing2->vertex==vertex1) wing = edge->wing2;
831
832 // Wingが既に Contourで使われている場合，他の Wingを探す．
833 if (edge->edge_list!=NULL && wing!=NULL && wing->contour!=NULL) {
834 BREP_EDGE_LIST::iterator iedge=edge->edge_list->begin();
835 while (iedge!=edge->edge_list->end() && wing->contour!=NULL) {
836 if ((*iedge)->wing1->vertex==vertex1) wing = (*iedge)->wing1;
837 else if ((*iedge)->wing2->vertex==vertex1) wing = (*iedge)->wing2;
838 iedge++;
839 }
840 }
841
842 // このWingは既に Contourで使われているか？
843 if (wing!=NULL && wing->contour!=NULL){
844 // 新しくEdgeを作り直す
845 BREP_EDGE* new_edge = CreateEdge(vertex1, vertex2);
846 if (new_edge==NULL) return NULL;
847
848 if (edge->edge_list==NULL) {
849 edge->edge_list = new BREP_EDGE_LIST();
850 edge->edge_list->push_back(edge);
851 }
852 edge->edge_list->push_back(new_edge);
853 new_edge->edge_list = edge->edge_list;
854 wing = new_edge->wing1;
855 }
856 }
857
858 return wing;
859}
jbxl::BREP_EDGE::edge_list
BREP_EDGE_LIST * edge_list
多重エッジのリストへのポインタ
Definition Brep.h:237
jbxl::BREP_EDGE::wing2
BREP_WING * wing2
Definition Brep.h:234
jbxl::BREP_EDGE::wing1
BREP_WING * wing1
Definition Brep.h:233
jbxl::BREP_WING::contour
BREP_CONTOUR * contour
Definition Brep.h:215
jbxl::FindEdge
DllExport BREP_EDGE * FindEdge(BREP_VERTEX *vertex1, BREP_VERTEX *vertex2)
Definition Brep.cpp:889
jbxl::BREP_EDGE_LIST
std::list< BREP_EDGE * > BREP_EDGE_LIST
Definition Brep.h:45
jbxl::CreateEdge
DllExport BREP_EDGE * CreateEdge(BREP_VERTEX *v1, BREP_VERTEX *v2)
Definition Brep.cpp:988

References BREP_WING::contour, CreateEdge(), BREP_EDGE::edge_list, FindEdge(), BREP_WING::vertex, BREP_EDGE::wing1, and BREP_EDGE::wing2.

Referenced by BREP_CONTOUR::CreateWing().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ cut_object_MSGraph() [1/3]

template<typename T >
MSGraph< T > cut_object_MSGraph ( MSGraph< T > vp,
int mn,
int mx,
int blank = BOUNDARY_BLANK,
bool ecnt = false )

template <typename T> MSGraph<T> cut_object_MSGraph(MSGraph<T> vp, int mn, int mx, int blank=BOUNDARY_BLANK, bool ecnt=false)

グラフィックデータから mn〜mx の輝度値を持つ部分を抜き出す．

Parameters
vp操作対象となるグラフィックデータ構造体．
mn抜き出す画像の輝度値の最小値．
mx抜き出す画像の輝度値の最大値．
blank境界の余白．あそび．
ecntカウンタを使用するかどうか．デフォルトは false
Returns
抜き出されたグラフィックデータ．rboundメンバに境界情報が入る．

Definition at line 1435 of file Graph.h.

1436{
1437 int i, j, k, n;
1438 int cx, cy, cz, cp;
1439 int ax, ay, az, ap;
1440 MSGraph<T> xp; // = new MSGraph<T>();
1441
1442 xp.init();
1443 RBound<int> rb(vp.xs-1, 0, vp.ys-1, 0, vp.zs-1, 0);
1444 RBound<int> rx(0, vp.xs-1, 0, vp.ys-1, 0, vp.zs-1);
1445 CVCounter* counter = NULL;
1446
1447 if (ecnt) counter = GetUsableGlobalCounter();
1448 if (counter!=NULL) {
1449 if (counter->isCanceled()) {
1450 xp.state = JBXL_GRAPH_CANCEL;
1451 return xp;
1452 }
1453 counter->SetMax(vp.zs*2);
1454 }
1455
1456 ap = vp.xs*vp.ys;
1457 n = 0;
1458 for (k=0; k<vp.zs; k++) {
1459 az = ap*k;
1460 for (j=0; j<vp.ys; j++) {
1461 ay = az + vp.xs*j;
1462 for (i=0; i<vp.xs; i++) {
1463 ax = ay + i;
1464 if (vp.gp[ax]>=(T)mn && vp.gp[ax]<=(T)mx) {
1465 n++;
1466 rb.fusion(i, j, k);
1467 }
1468 }
1469 }
1470
1471 // Counter
1472 if (counter!=NULL) {
1473 counter->StepIt();
1474 if (counter->isCanceled()) {
1475 xp.state = JBXL_GRAPH_CANCEL;
1476 return xp;
1477 }
1478 }
1479 }
1480
1481 if (n==0) {
1482 xp.state = JBXL_GRAPH_NODATA_ERROR;
1483 return xp;
1484 }
1485
1486 if (blank>0) rb.enlarge(blank);
1487 rb.commonarea(rx);
1488
1489 xp.set(rb.xmax-rb.xmin+1, rb.ymax-rb.ymin+1, rb.zmax-rb.zmin+1, vp.zero, vp.base, vp.RZxy);
1490 if (xp.isNull()) {
1491 xp.state = JBXL_GRAPH_MEMORY_ERROR;
1492 return xp;
1493 }
1494 xp.rbound = rb;
1495 xp.min = (T)mx;
1496 xp.max = (T)mn;
1497 xp.color = vp.color;
1498
1499 cp = xp.xs*xp.ys;
1500 for (k=0; k<xp.zs; k++) {
1501 cz = cp*k;
1502 az = ap*(k+rb.zmin);
1503 for (j=0; j<xp.ys; j++) {
1504 cy = cz + xp.xs*j;
1505 ay = az + vp.xs*(j+rb.ymin);
1506 for (i=0; i<xp.xs; i++) {
1507 cx = cy + i;
1508 ax = ay + (i+rb.xmin);
1509 if (vp.gp[ax]>=(T)mn && vp.gp[ax]<=(T)mx) {
1510 xp.gp[cx] = vp.gp[ax];
1511 xp.max = Max(xp.max, xp.gp[cx]);
1512 xp.min = Min(xp.min, xp.gp[cx]);
1513 }
1514 }
1515 }
1516
1517 // Counter
1518 if (counter!=NULL) {
1519 counter->StepIt();
1520 if (counter->isCanceled()) {
1521 xp.state = JBXL_GRAPH_CANCEL;
1522 return xp;
1523 }
1524 }
1525 }
1526
1527 xp.rbound.cutdown(vp.rbound);
1528
1529 return xp;
1530}
jbxl::RBound::cutdown
void cutdown(RBound< T > bound)
切り出した場合の境界
Definition Vector.h:527
JBXL_GRAPH_NODATA_ERROR
#define JBXL_GRAPH_NODATA_ERROR
データが無い
Definition jbxl_state.h:171

References MSGraph< T >::base, MSGraph< T >::color, RBound< T >::commonarea(), RBound< T >::cutdown(), RBound< T >::enlarge(), RBound< T >::fusion(), GetUsableGlobalCounter(), MSGraph< T >::gp, MSGraph< T >::init(), CVCounter::isCanceled(), MSGraph< T >::isNull(), JBXL_GRAPH_CANCEL, JBXL_GRAPH_MEMORY_ERROR, JBXL_GRAPH_NODATA_ERROR, Max, MSGraph< T >::max, Min, MSGraph< T >::min, MSGraph< T >::rbound, MSGraph< T >::RZxy, MSGraph< T >::set(), CVCounter::SetMax(), MSGraph< T >::state, CVCounter::StepIt(), RBound< T >::xmax, RBound< T >::xmin, MSGraph< T >::xs, RBound< T >::ymax, RBound< T >::ymin, MSGraph< T >::ys, MSGraph< T >::zero, RBound< T >::zmax, RBound< T >::zmin, and MSGraph< T >::zs.

Here is the call graph for this function:

◆ cut_object_MSGraph() [2/3]

template<typename T >
MSGraph< T > cut_object_MSGraph ( MSGraph< T > vp,
int mn,
int mx,
RBound< int > rbound,
int blank = BOUNDARY_BLANK,
bool ecnt = false )

template <typename T> MSGraph<T> cut_object_MSGraph(MSGraph<T> vp, int mn, int mx, RBound<int> rbound, int blank=BOUNDARY_BLANK, bool ecnt=false)

グラフィックデータから rboundの範囲で mn〜mx の輝度値を持つ部分を抜き出す．

Parameters
vp操作対象となるグラフィックデータ構造体．
mn抜き出す画像の輝度値の最小値．
mx抜き出す画像の輝度値の最大値．
rbound切り抜き対象の範囲
blank境界の余白．余裕．
ecntカウンタを使用するかどうか．デフォルトは false
Returns
抜き出されたグラフィックデータ．rboundメンバに境界情報が入る．

Definition at line 1547 of file Graph.h.

1548{
1549 int i, j, k, n;
1550 int cx, cy, cz, cp;
1551 int ax, ay, az, ap;
1552 MSGraph<T> xp; // = new MSGraph<T>();
1553
1554 xp.init();
1555 RBound<int> rb(vp.xs-1, 0, vp.ys-1, 0, vp.zs-1, 0);
1556 RBound<int> rx(0, vp.xs-1, 0, vp.ys-1, 0, vp.zs-1);
1557 CVCounter* counter = NULL;
1558
1559 if (ecnt) counter = GetUsableGlobalCounter();
1560 if (counter!=NULL) {
1561 if (counter->isCanceled()) {
1562 xp.state = JBXL_GRAPH_CANCEL;
1563 return xp;
1564 }
1565 counter->SetMax(vp.zs*2);
1566 }
1567
1568 rbound.commonarea(rx);
1569 ap = vp.xs*vp.ys;
1570 n = 0;
1571 for (k=rbound.zmin; k<=rbound.zmax; k++) {
1572 az = ap*k;
1573 for (j=rbound.ymin; j<=rbound.ymax; j++) {
1574 ay = az + vp.xs*j;
1575 for (i=rbound.xmin; i<=rbound.xmax; i++) {
1576 ax = ay + i;
1577 if (vp.gp[ax]>=(T)mn && vp.gp[ax]<=(T)mx) {
1578 n++;
1579 rb.fusion(i, j, k);
1580 }
1581 }
1582 }
1583
1584 // Counter
1585 if (counter!=NULL) {
1586 counter->StepIt();
1587 if (counter->isCanceled()) {
1588 xp.state = JBXL_GRAPH_CANCEL;
1589 return xp;
1590 }
1591 }
1592 }
1593
1594 if (n==0) {
1595 xp.state = JBXL_GRAPH_NODATA_ERROR;
1596 return xp;
1597 }
1598
1599 if (blank>0) rb.enlarge(blank);
1600 rb.commonarea(rbound);
1601
1602 xp.set(rb.xmax-rb.xmin+1, rb.ymax-rb.ymin+1, rb.zmax-rb.zmin+1, vp.zero, vp.base, vp.RZxy);
1603 if (xp.isNull()) {
1604 xp.state = JBXL_GRAPH_MEMORY_ERROR;
1605 return xp;
1606 }
1607 xp.rbound = rb;
1608 xp.min = (T)mx;
1609 xp.max = (T)mn;
1610 xp.color = vp.color;
1611
1612 cp = xp.xs*xp.ys;
1613 for (k=0; k<xp.zs; k++) {
1614 cz = cp*k;
1615 az = ap*(k+rb.zmin);
1616 for (j=0; j<xp.ys; j++) {
1617 cy = cz + xp.xs*j;
1618 ay = az + vp.xs*(j+rb.ymin);
1619 for (i=0; i<xp.xs; i++) {
1620 cx = cy + i;
1621 ax = ay + i + rb.xmin;
1622 if (vp.gp[ax]>=(T)mn && vp.gp[ax]<=(T)mx) {
1623 xp.gp[cx] = vp.gp[ax];
1624 xp.max = Max(xp.max, xp.gp[cx]);
1625 xp.min = Min(xp.min, xp.gp[cx]);
1626 }
1627 }
1628 }
1629
1630 // Counter
1631 if (counter!=NULL) {
1632 counter->StepIt();
1633 if (counter->isCanceled()) {
1634 xp.state = JBXL_GRAPH_CANCEL;
1635 return xp;
1636 }
1637 }
1638 }
1639 xp.rbound.cutdown(vp.rbound);
1640
1641 return xp;
1642}
jbxl::RBound::commonarea
void commonarea(RBound< T > bound)
境界構造体 bound との共通領域 共通領域がない場合は，min>max になる
Definition Vector.h:516

References MSGraph< T >::base, MSGraph< T >::color, RBound< T >::commonarea(), RBound< T >::cutdown(), RBound< T >::enlarge(), RBound< T >::fusion(), GetUsableGlobalCounter(), MSGraph< T >::gp, MSGraph< T >::init(), CVCounter::isCanceled(), MSGraph< T >::isNull(), JBXL_GRAPH_CANCEL, JBXL_GRAPH_MEMORY_ERROR, JBXL_GRAPH_NODATA_ERROR, Max, MSGraph< T >::max, Min, MSGraph< T >::min, MSGraph< T >::rbound, MSGraph< T >::RZxy, MSGraph< T >::set(), CVCounter::SetMax(), MSGraph< T >::state, CVCounter::StepIt(), RBound< T >::xmax, RBound< T >::xmin, MSGraph< T >::xs, RBound< T >::ymax, RBound< T >::ymin, MSGraph< T >::ys, MSGraph< T >::zero, RBound< T >::zmax, RBound< T >::zmin, and MSGraph< T >::zs.

Here is the call graph for this function:

◆ cut_object_MSGraph() [3/3]

template<typename T >
MSGraph< T > cut_object_MSGraph ( MSGraph< T > vp,
RBound< int > rb,
bool ecnt = false )

template <typename T> MSGraph<T> cut_object_MSGraph(MSGraph<T> vp, RBound<int> rb, bool ecnt=false)

グラフィックデータから rbound の範囲を抜き出す．

Parameters
vp操作対象となるグラフィックデータ構造体．
rb切り抜き対象の範囲
ecntカウンタを使用するかどうか．デフォルトは false
Returns
抜き出されたグラフィックデータ．rboundメンバに境界情報が入る．

Definition at line 1656 of file Graph.h.

1657{
1658 int i, j, k;
1659 int cx, cy, cz, cp;
1660 int ax, ay, az, ap;
1661 MSGraph<T> xp; // = new MSGraph<T>();
1662
1663 xp.init();
1664 RBound<int> rx(0, vp.xs-1, 0, vp.ys-1, 0, vp.zs-1);
1665 CVCounter* counter = NULL;
1666
1667 if (ecnt) counter = GetUsableGlobalCounter();
1668 if (counter!=NULL) {
1669 if (counter->isCanceled()) {
1670 xp.state = JBXL_GRAPH_CANCEL;
1671 return xp;
1672 }
1673 counter->SetMax(vp.zs*2);
1674 }
1675
1676 rb.commonarea(rx);
1677 xp.set(rb.xmax-rb.xmin+1, rb.ymax-rb.ymin+1, rb.zmax-rb.zmin+1, vp.zero, vp.base, vp.RZxy);
1678 if (xp.isNull()) {
1679 xp.state = JBXL_GRAPH_MEMORY_ERROR;
1680 return xp;
1681 }
1682 xp.rbound = rb;
1683 xp.color = vp.color;
1684
1685 ap = vp.xs*vp.ys;
1686 cp = xp.xs*xp.ys;
1687
1688 for (k=0; k<xp.zs; k++) {
1689 cz = cp*k;
1690 az = ap*(k+rb.zmin);
1691 for (j=0; j<xp.ys; j++) {
1692 cy = cz + xp.xs*j;
1693 ay = az + vp.xs*(j+rb.ymin);
1694 for (i=0; i<xp.xs; i++) {
1695 cx = cy + i;
1696 ax = ay + i + rb.xmin;
1697 xp.gp[cx] = vp.gp[ax];
1698
1699 if (cx==0) xp.max = xp.min = xp.gp[cx];
1700 else {
1701 xp.max = Max(xp.max, xp.gp[cx]);
1702 xp.min = Min(xp.min, xp.gp[cx]);
1703 }
1704 }
1705 }
1706
1707 // Counter
1708 if (counter!=NULL) {
1709 counter->StepIt();
1710 if (counter->isCanceled()) {
1711 xp.state = JBXL_GRAPH_CANCEL;
1712 return xp;
1713 }
1714 }
1715 }
1716 xp.rbound.cutdown(vp.rbound);
1717
1718 return xp;
1719}

References MSGraph< T >::base, MSGraph< T >::color, RBound< T >::commonarea(), RBound< T >::cutdown(), GetUsableGlobalCounter(), MSGraph< T >::gp, MSGraph< T >::init(), CVCounter::isCanceled(), MSGraph< T >::isNull(), JBXL_GRAPH_CANCEL, JBXL_GRAPH_MEMORY_ERROR, Max, MSGraph< T >::max, Min, MSGraph< T >::min, MSGraph< T >::rbound, MSGraph< T >::RZxy, MSGraph< T >::set(), CVCounter::SetMax(), MSGraph< T >::state, CVCounter::StepIt(), RBound< T >::xmax, RBound< T >::xmin, MSGraph< T >::xs, RBound< T >::ymax, RBound< T >::ymin, MSGraph< T >::ys, MSGraph< T >::zero, RBound< T >::zmax, RBound< T >::zmin, and MSGraph< T >::zs.

Here is the call graph for this function:

◆ cvDetectObjects()

template<typename T >
rectangle * cvDetectObjects ( cv::CascadeClassifier cascade,
MSGraph< T > * vp,
int & num,
int sz = 0,
double scale = 1.0 )
Parameters
cascade識別エンジン
vp1plane(channel) MSGraphデータ（つまりモノクロ）へのポインタ
[out]num要素の数
sz検出する最小のサイズ
scale縮小スケール

Definition at line 59 of file OpenCVTool.h.

60{
61 num = 0;
62
63 cv::Mat imag = copyMSGraph2CvMat<uByte>(vp);
64 cv::equalizeHist(imag, imag);
65
66 cv::Mat simg = imag;
67 if (scale>1.0) {
68 simg = cv::Mat_<uByte>((int)(imag.rows/scale), (int)(imag.cols/scale));
69 cv::resize(imag, simg, simg.size(), 0, 0, cv::INTER_LINEAR);
70 }
71 else scale = 1.0;
72
73 std::vector<cv::Rect> faces;
74 if (sz>1) cascade.detectMultiScale(simg, faces, 1.1, 3, 0, cv::Size(sz, sz));
75 else cascade.detectMultiScale(simg, faces);
76
77 num = (int)faces.size();
78 if (num==0) return NULL;
79
80 int len = sizeof(rectangle)*num;
81 rectangle* data = (rectangle*)malloc(len);
82 if (data==NULL) return NULL;
83 memset(data, 0, len);
84
85 int n = 0;
86 std::vector<cv::Rect>::const_iterator r;
87 for (r=faces.begin(); r!=faces.end(); r++) {
88 data[n].x = (int)(r->x*scale);
89 data[n].y = (int)(r->y*scale);
90 data[n].xsize = (int)(r->width *scale);
91 data[n].ysize = (int)(r->height*scale);
92 n++;
93 }
94 return data;
95}

◆ del_tList_object()

template<typename T >
void del_tList_object ( tList ** lp)

Definition at line 224 of file tools++.h.

225{
226 tList* lt = *lp;
227
228 while(lt!=NULL) {
229 T* pp = (T*)lt->ldat.ptr;
230 pp->free();
231 delete(pp);
232 lt->ldat.ptr = NULL;
233 lt->ldat.sz = 0;
234 lt = lt->next;
235 }
236 del_tList(lp);
237}
del_tList
tList * del_tList(tList **pp)
指定したリストノード以降のリストを削除．
Definition tlist.cpp:735

References del_tList().

Here is the call graph for this function:

◆ deletable()

template<typename T >
bool deletable ( MSGraph< T > vp,
int n,
int c,
int d )

template <typename T> bool deletable(MSGraph<T> vp, int n, int c, int d)

n で示されるボクセルが削除可能かどうか判定する．

Parameters
vp画像データ
nボクセルのID
c近傍数
d次元数
Returns
true 削除可能
false 削除不能

Definition at line 268 of file Thinning.h.

269{
270 int i, j, k, l, m, lz, ly, mz, my;
271 int cn, mm, nh;
272 int v[27];
273 bool ret;
274
275 if (d<3) { // 2D- YET NO IMPLIMENT
276 mm = 9;
277 for (j=-1; j<=1; j++) {
278 ly = (j+1)*3;
279 my = n + j*vp.xs;
280 for (i=-1; i<=1; i++) {
281 l = ly + (i+1);
282 m = my + i;
283 if (vp.gp[m]!=0) v[l] = 1;
284 else v[l] = 0;
285 }
286 }
287 DEBUG_MODE PRINT_MESG("DELETABLE: 2D mode is not supported.\n");
288 return false;
289 }
290 else { // for 3D
291 mm = 27;
292 for (k=-1; k<=1; k++) {
293 lz = (k+1)*9;
294 mz = n + k*vp.xs*vp.ys;
295 for (j=-1; j<=1; j++) {
296 ly = lz + (j+1)*3;
297 my = mz + j*vp.xs;
298 for (i=-1; i<=1; i++) {
299 l = ly + (i+1);
300 m = my + i;
301 if (vp.gp[m]>0) v[l] = 1;
302 else v[l] = 0;
303 }
304 }
305 }
306 }
307
308 cn = connectNumber(v, c, d);
309 if (cn==-1 || cn!=1) return false;
310
311 if (c==26 || c==8) {
312 v[c/2] = 1 - v[c/2];
313 for(i=0; i<mm; i++) v[i] = 1 - v[i];
314 }
315
316 nh = v[10] + v[12] + v[14] + v[16] + v[4] + v[22];
317 if (nh<=3) ret = true;
318 else if (nh==4) ret = deletable_s(v);
319 else if (nh==5) ret = deletable_4(v);
320 else if (nh==6) ret = deletable_5(v);
321
322 return ret;
323}
jbxl::connectNumber
int connectNumber(int *w, int c, int d)
Definition Thinning.cpp:26
jbxl::deletable_4
bool deletable_4(int *v)
Definition Thinning.cpp:104
jbxl::deletable_5
bool deletable_5(int *v)
Definition Thinning.cpp:140
jbxl::deletable_s
bool deletable_s(int *v)
Definition Thinning.cpp:86
PRINT_MESG
#define PRINT_MESG(...)
環境依存用の出力関数．MS Windows用は未実装
Definition tools.h:469
DEBUG_MODE
#define DEBUG_MODE
Definition tools.h:502

References connectNumber(), DEBUG_MODE, deletable_4(), deletable_5(), deletable_s(), MSGraph< T >::gp, PRINT_MESG, MSGraph< T >::xs, and MSGraph< T >::ys.

Referenced by centerLine().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ deletable_4()

bool deletable_4 ( int * v)

Definition at line 104 of file Thinning.cpp.

105{
106 int i, w[6], u[6];
107
108 bool ret = deletable_s(v);
109 if (!ret) return false;
110
111 u[0] = v[ 4];
112 u[1] = v[10];
113 u[2] = v[12];
114 u[3] = v[14];
115 u[4] = v[16];
116 u[5] = v[22];
117
118 for(i=0; i<6; i++) w[i] = 0;
119
120 if (v[ 1]==1) w[0] = w[1] = 1;
121 if (v[ 3]==1) w[0] = w[2] = 1;
122 if (v[ 5]==1) w[0] = w[3] = 1;
123 if (v[ 7]==1) w[0] = w[4] = 1;
124 if (v[ 9]==1) w[1] = w[2] = 1;
125 if (v[11]==1) w[1] = w[3] = 1;
126 if (v[15]==1) w[2] = w[4] = 1;
127 if (v[17]==1) w[3] = w[4] = 1;
128 if (v[19]==1) w[1] = w[5] = 1;
129 if (v[21]==1) w[2] = w[5] = 1;
130 if (v[23]==1) w[3] = w[5] = 1;
131 if (v[25]==1) w[4] = w[5] = 1;
132
133 ret = true;
134 for(i=0; i<6; i++) if (w[i]==0 && u[i]==1) ret = false;
135
136 return ret;
137}

References deletable_s().

Referenced by deletable().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ deletable_5()

bool deletable_5 ( int * v)

Definition at line 140 of file Thinning.cpp.

141{
142 int i, j, k, m, s;
143 int mz[6][6], mx[6][6], mm[6][6];
144
145 mm[0][1] = mm[1][0] = v[ 3];
146 mm[0][2] = mm[2][0] = v[ 7];
147 mm[0][3] = mm[3][0] = v[ 1];
148 mm[0][4] = mm[4][0] = v[ 5];
149 mm[1][2] = mm[2][1] = v[15];
150 mm[1][3] = mm[3][1] = v[ 9];
151 mm[1][5] = mm[5][1] = v[21];
152 mm[2][4] = mm[4][2] = v[17];
153 mm[2][5] = mm[5][2] = v[25];
154 mm[3][4] = mm[4][3] = v[11];
155 mm[3][5] = mm[5][3] = v[19];
156 mm[4][5] = mm[5][4] = v[23];
157
158 for(i=0; i<6; i++) { // I+M
159 for(j=0; j<6; j++) {
160 mx[i][j] = mm[i][j];
161 if (i==j) mx[i][i]++;
162 }
163 }
164
165 for(i=0; i<6; i++) { // M(I+M)
166 for(j=0; j<6; j++) {
167 m = 0;
168 for(k=0; k<6; k++) {
169 m = m + mm[i][k]*mx[k][j];
170 }
171 mz[i][j] = m;
172 }
173 }
174
175 for(i=0; i<6; i++) { // I+M(I+M)
176 mz[i][i] = 1 + mz[i][i];
177 }
178
179 for(i=0; i<6; i++) { // M(I+M(I+M))
180 for(j=0; j<6; j++) {
181 m = 0;
182 for(k=0; k<6; k++) {
183 m = m + mm[i][k]*mz[k][j];
184 }
185 mx[i][j] = m;
186 }
187 }
188
189 for(i=0; i<6; i++) { // I+M(I+M(I+M))
190 mx[i][i] = 1 + mx[i][i];
191 }
192
193 for(i=0; i<6; i++) { // M(I+M(I+M(I+M)))
194 for(j=0; j<6; j++) {
195 m = 0;
196 for(k=0; k<6; k++) {
197 m = m + mm[i][k]*mx[k][j];
198 }
199 mz[i][j] = m;
200 }
201 }
202
203 for(i=0; i<6; i++) { // I+M(I+M(I+M(I+M)))
204 mz[i][i] = 1 + mz[i][i];
205 }
206
207 s = 1;
208 for(i=0; i<6; i++) { // M(I+M(I+M(I+M(I+M))))
209 for(j=0; j<6; j++) {
210 m = 0;
211 for(k=0; k<6; k++) {
212 m = m + mm[i][k]*mz[k][j];
213 }
214 s = s*m;
215 }
216 }
217
218 if (s==0) return false;
219 else return true;
220}

Referenced by deletable().

Here is the caller graph for this function:

◆ deletable_s()

bool deletable_s ( int * v)

Definition at line 86 of file Thinning.cpp.

87{
88 int s;
89
90 s = (1-v[ 6])*v[ 3]*v[ 7]*v[ 4]*v[12]*v[15]*v[16] +
91 (1-v[ 8])*v[ 7]*v[ 5]*v[ 4]*v[16]*v[17]*v[14] +
92 (1-v[ 2])*v[ 5]*v[ 1]*v[ 4]*v[14]*v[11]*v[10] +
93 (1-v[ 0])*v[ 1]*v[ 3]*v[ 4]*v[10]*v[ 9]*v[12] +
94 (1-v[24])*v[21]*v[25]*v[22]*v[12]*v[15]*v[16] +
95 (1-v[26])*v[25]*v[23]*v[22]*v[16]*v[17]*v[14] +
96 (1-v[20])*v[23]*v[19]*v[22]*v[14]*v[11]*v[10] +
97 (1-v[18])*v[19]*v[21]*v[22]*v[10]*v[ 9]*v[12];
98
99 if (s==1) return false;
100 else return true;
101}

Referenced by deletable(), and deletable_4().

Here is the caller graph for this function:

◆ delete_noise_MSGraph()

template<typename T >
void delete_noise_MSGraph ( MSGraph< T > vp,
int size,
int mode = 8,
int work_color = 0 )

template <typename T> void delete_noise_MSGraph(MSGraph<T> vp, int size, int mode=8, int work_color=0)

背景（vp.zero）に浮かぶ孤立ノイズを除去する．
-work_color〜-1, work_color〜 を作業領域として使用するので，この区間にデータがある場合は誤作動する．

Definition at line 2437 of file Graph.h.

2438{
2439 int i, j, k;
2440 int num, ps ,pp;
2441
2442 ps = vp.xs*vp.ys;
2443 if (work_color==0) {
2444 if (vp.max==0 || vp.max==vp.zero) vp.get_minmax();
2445 work_color = vp.max + 1;
2446 }
2447
2448 for(j=0; j<vp.ys; j++) {
2449 pp = j*vp.xs;
2450 for(i=0; i<vp.xs; i++) {
2451 if (vp.gp[i+pp]>vp.zero && vp.gp[i+pp]<work_color) {
2452 num = addPaint_MSGraph(vp, i, j, 1, work_color-1, work_color, mode);
2453 if (num<=size) {
2454 int n = 0;
2455 for (k=i+pp; k<ps; k++) {
2456 if (vp.gp[k]>=work_color) {
2457 vp.gp[k] = vp.zero;
2458 n++;
2459 if (n>=num) break;
2460 }
2461 }
2462 }
2463 else {
2464 int n = 0;
2465 for (k=i+pp; k<ps; k++) {
2466 if (vp.gp[k]>=work_color) {
2467 vp.gp[k] = -vp.gp[k];
2468 n++;
2469 if (n>=num) break;
2470 }
2471 }
2472 }
2473 }
2474 }
2475 }
2476
2477 for (i=0; i<ps; i++) {
2478 if (vp.gp[i]<vp.zero) vp.gp[i] = - vp.gp[i] - work_color;
2479 }
2480}
jbxl::MSGraph::get_minmax
void get_minmax(void)
min, max を獲得
Definition Gdata.h:298

References addPaint_MSGraph(), MSGraph< T >::get_minmax(), MSGraph< T >::gp, MSGraph< T >::max, MSGraph< T >::xs, MSGraph< T >::ys, and MSGraph< T >::zero.

Here is the call graph for this function:

◆ deleteNull()

template<typename T >
void deleteNull ( T & p)
inline

Definition at line 39 of file common++.h.

39{ delete p; p = (T)NULL;}

Referenced by BrepSolidList::addSolid(), AddVector2TriSolid(), CreateTriSolidFromSTL(), CreateTriSolidFromVector(), and BrepSolidList::getMerge().

Here is the caller graph for this function:

◆ DeleteShortageWings()

DllExport void DeleteShortageWings ( BREP_SOLID * solid)

void jbxl::DeleteShortageWings(BREP_SOLID* solid)

不完全 Wing(Edge)を持つFacet(Contour)を削除
Contours List と Wings Listの内容は保障される．

要求データ
  • ShortageWings List．CreateShortageWingsList()で作成しても良い

Definition at line 250 of file TriBrep.cpp.

251{
252 if (solid->shortage_wings.empty()) return;
253// DEBUG_MODE PRINT_MESG("Start DeleteShortageWings\n");
254
255 CVCounter* counter = NULL;
256 if (solid->counter!=NULL) counter = solid->counter->GetUsableCounter();
257 if (counter!=NULL) counter->SetMax((int)solid->shortage_wings.size());
258
259 BREP_WING_LIST::iterator iwing;
260 for (iwing=solid->shortage_wings.begin(); iwing!=solid->shortage_wings.end(); iwing++){
261 if ((*iwing)->contour!=NULL) (*iwing)->contour->facet->deletable = true;
262 BREP_WING* othwing = GetWingOtherSide(*iwing);
263 if (othwing->contour!=NULL) othwing->contour->facet->deletable = true;
264 if (counter!=NULL) counter->StepIt();
265 }
266
267 CreateContoursList(solid);
268 CreateWingsList(solid);
269// DEBUG_MODE PRINT_MESG("End DeleteShortageWings\n");
270 return;
271}
jbxl::BREP_CONTOUR::facet
BREP_FACET * facet
Definition Brep.h:170
jbxl::BREP_FACET::deletable
bool deletable
削除できる
Definition Brep.h:147

References BREP_WING::contour, BREP_SOLID::counter, CreateContoursList(), CreateWingsList(), BREP_FACET::deletable, BREP_CONTOUR::facet, CVCounter::GetUsableCounter(), GetWingOtherSide(), CVCounter::SetMax(), BREP_SOLID::shortage_wings, and CVCounter::StepIt().

Here is the call graph for this function:

◆ DeleteStraightEdges()

DllExport void DeleteStraightEdges ( BREP_SOLID * solid)

void jbxl::DeleteStraightEdges(BREP_SOLID* solid)

複数のVertexが直線に並んだ場合，両端のVertex間に作られた Edge(Wing)に関連する Contour(Facet)を削除．
Contours List と Wings Listの内容は保障される．

要求データ
  • 全てのWingの List（Wings List）．
    • 外側の関数で行う．CreateWingsList()を使用しても良い．
  • Contourに関連付けられていない（使用されていない）Wingが格納された作業List（ShortageWings List）．
    • 外側の関数で行う．CreateShortageWingsList() を使用しても良い．

Definition at line 210 of file TriBrep.cpp.

211{
212 if (solid->shortage_wings.empty()) return;
213// DEBUG_MODE PRINT_MESG("Start DeleteStraightEdges\n");
214
215 CVCounter* counter = NULL;
216 if (solid->counter!=NULL) counter = solid->counter->GetUsableCounter();
217 if (counter!=NULL) counter->SetMax((int)solid->shortage_wings.size());
218
219 BREP_WING_LIST::iterator wing1;
220 for (wing1=solid->shortage_wings.begin(); wing1!=solid->shortage_wings.end(); wing1++){
221 BREP_VERTEX* vert[3];
222 vert[0] = (*wing1)->vertex;
223 BREP_WING_LIST::iterator wing2;
224 for (wing2=solid->shortage_wings.begin(); wing2!=solid->shortage_wings.end(); wing2++){
225 if (IsConnectEdges(*wing1, *wing2)) {
226 vert[1] = (*wing2)->vertex;
227 vert[2] = GetWingOtherSide(*wing2)->vertex;
228 IsForbiddenEdge(vert); // 直線に並んだ Vertexを禁止する．
229 }
230 }
231 if (counter!=NULL) counter->StepIt();
232 }
233 CreateContoursList(solid); // 該当Contour(Facet)を削除し，全てのContour(Facet)の Listを作り直す．
234 CreateWingsList(solid); // WingsListを作り直す．
235
236// DEBUG_MODE PRINT_MESG("End DeleteStraightEdges\n");
237 return;
238}
jbxl::IsConnectEdges
DllExport bool IsConnectEdges(BREP_WING *wing1, BREP_WING *wing2)
Definition TriBrep.cpp:1489

References BREP_SOLID::counter, CreateContoursList(), CreateWingsList(), CVCounter::GetUsableCounter(), GetWingOtherSide(), IsConnectEdges(), IsForbiddenEdge(), CVCounter::SetMax(), BREP_SOLID::shortage_wings, CVCounter::StepIt(), and BREP_WING::vertex.

Referenced by CloseTriSolid().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ DeleteSurplusContours()

DllExport void DeleteSurplusContours ( BREP_SOLID * solid)

void jbxl::DeleteSurplusContours(BREP_SOLID* solid)

多重Edgeを持つ Contour(Facet)の削除
Contours List と Wings Listの内容は保障される．

要求データ
  • 全てのContour(Facet)の List (Contours List)．
    • 外側の関数で行う．CreateContoursList()を使用しても良い．
  • 多重エッジの数が１以上のContour(Facet)が格納された作業List（SurplusContours List）．
    • 外側の関数で行う．CreateSuplusContoursList()を使用しても良い
アルゴリズム
  1. 作業Listの中にある３辺が多重EdgeのFacetに削除マークをつける（高速化のため）
    • 該当Facet(Contour)を削除し，そのFacet(Contour)を裏返して登録する （ReverseContours）
    • 多重Edgeが一つでもある場合は登録を中止
  2. ２辺が多重Edgeの Facetに削除マークをつける．１と同様の処理を行う．
  3. １辺が多重Edgeの Facetに削除マークをつける．１と同様の処理を行う．
  4. この段階で，作業Listの中には Facetは存在しないはず．まだ存在する場合はエラー．

Definition at line 140 of file TriBrep.cpp.

141{
142 if (solid->surplus_contours.empty()) return;
143// DEBUG_MODE PRINT_MESG("Start DeleteSurplusContours\n");
144
145 CVCounter* counter = NULL;
146 if (solid->counter!=NULL) counter = solid->counter->GetUsableCounter();
147 if (counter!=NULL) counter->SetMax((int)solid->surplus_contours.size()*3);
148
149 BREP_CONTOUR_LIST::iterator icon;
150 // ３つの多重Edgeを持つ Facetの処理
151 for (icon=solid->surplus_contours.begin(); icon!=solid->surplus_contours.end(); icon++){
152 if ((*icon)->dup_edge==3) (*icon)->facet->deletable = true;
153 if (counter!=NULL) counter->StepIt();
154 }
155 ReverseContours(solid); // ３辺が多重Edgeの Facetを裏返す
156 CreateShortageWingsList(solid);
157 JoinShortageWings(solid); // 一つにまとまるEdgeは一つにまとめる．
158
159 CreateSurplusContoursList(solid);
160 if (solid->surplus_contours.empty()) {
161// DEBUG_MODE PRINT_MESG("End DeleteSurplusContours\n");
162 return;
163 }
164
165 // ２つの多重Edgeを持つ Facetの処理
166 for (icon=solid->surplus_contours.begin(); icon!=solid->surplus_contours.end(); icon++){
167 if ((*icon)->dup_edge==2) (*icon)->facet->deletable = true;
168 if (counter!=NULL) counter->StepIt();
169 }
170 ReverseContours(solid); // ２辺が多重Edgeの Facetを裏返す
171 CreateShortageWingsList(solid);
172 JoinShortageWings(solid);
173
174 CreateSurplusContoursList(solid);
175 if (solid->surplus_contours.empty()) {
176// DEBUG_MODE PRINT_MESG("End DeleteSurplusContours\n");
177 return;
178 }
179
180 // １つの多重Edgeを持つ Facetの処理
181 for (icon=solid->surplus_contours.begin(); icon!=solid->surplus_contours.end(); icon++){
182 if ((*icon)->dup_edge==1) (*icon)->facet->deletable = true;
183 if (counter!=NULL) counter->StepIt();
184 }
185 ReverseContours(solid); // １辺が多重Edgeの Facetを裏返す
186 CreateShortageWingsList(solid);
187 JoinShortageWings(solid);
188
189 CreateSurplusContoursList(solid);
190 if (!solid->surplus_contours.empty()) {
191// DEBUG_MODE PRINT_MESG("EraseSurplusContour: 多重Edgeを持つ Facetデータが残っている？\n");
192 }
193// DEBUG_MODE PRINT_MESG("End DeleteSurplusContours\n");
194 return;
195}
jbxl::ReverseContours
DllExport void ReverseContours(BREP_SOLID *solid)
Definition TriBrep.cpp:530
jbxl::JoinShortageWings
DllExport void JoinShortageWings(BREP_SOLID *solid)
Definition TriBrep.cpp:592

References BREP_SOLID::counter, CreateShortageWingsList(), CreateSurplusContoursList(), CVCounter::GetUsableCounter(), JoinShortageWings(), ReverseContours(), CVCounter::SetMax(), CVCounter::StepIt(), and BREP_SOLID::surplus_contours.

Referenced by CloseTriSolid().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ DelMeshFacetNode()

MeshFacetNode * DelMeshFacetNode ( MeshFacetNode * node)

Definition at line 489 of file MeshFacetNode.cpp.

490{
491 if (node==NULL) return NULL;
492
493 if (node->prev!=NULL) node->prev->next = node->next;
494 if (node->next!=NULL) node->next->prev = node->prev;
495
496 MeshFacetNode* next = node->next;
497 freeMeshFacetNode(node);
498
499 return next;
500}
jbxl::MeshFacetNode
MeshObject の Polygonデータ（1面）を格納するクラス．リスト構造を取る．
Definition MeshFacetNode.h:34
jbxl::freeMeshFacetNode
void freeMeshFacetNode(MeshFacetNode *&node)
Definition MeshFacetNode.h:89

References freeMeshFacetNode(), MeshFacetNode::next, and MeshFacetNode::prev.

Here is the call graph for this function:

◆ Density_Filter()

template<typename T >
MSGraph< T > Density_Filter ( MSGraph< T > vp,
int size,
double rate,
int mode = 8,
int work_color = 0 )

template <typename T> MSGraph<T> Density_Filter(MSGraph<T> vp, int size, double rate, int mode=8, int work_color=0)

密度フィルター
画像データの密度マスクを適用して返す．

Parameters
vp画像データ
sizeマスクのサイズ
rate密度の閾値
mode近傍(4 or 8)
work_color作業用輝度値
Returns
処理結果の画像データ

Definition at line 2381 of file Graph.h.

2382{
2383 MSGraph<T> pp, xp, wp;
2384 int hsize = size/2;
2385
2386 if (work_color==0) {
2387 if (vp.max==0 || vp.max==vp.zero) vp.get_minmax();
2388 work_color = vp.max + 1;
2389 }
2390
2391 if (hsize==0) hsize = 1;
2392 size = hsize*2 + 1;
2393 pp.set(size, size, 1, vp.zero, vp.base);
2394 wp.mimicry(vp);
2395
2396 for (int j=hsize; j<vp.ys-hsize; j++) {
2397 for (int i=hsize; i<vp.xs-hsize; i++) {
2398
2399 for (int m=-hsize; m<=hsize; m++) {
2400 int vx = (m+j)*vp.xs + i;
2401 int px = (m+hsize)*pp.xs + hsize;
2402
2403 for (int n=-hsize; n<=hsize; n++) {
2404 pp.gp[px+n] = vp.gp[vx+n];
2405 }
2406 }
2407
2408 xp = Density_Mask<T>(pp, rate, mode, work_color);
2409
2410 if (xp.state!=0) {
2411 for (int m=-hsize; m<=hsize; m++) {
2412 int wx = (m+j)*wp.xs + i;
2413 int xx = (m+hsize)*xp.xs + hsize;
2414
2415 for (int n=-hsize; n<=hsize; n++) {
2416 if (xp.gp[xx+n]!=vp.zero) {
2417 wp.gp[wx+n] = xp.gp[xx+n];
2418 }
2419 }
2420 }
2421 }
2422 xp.free();
2423 }
2424 }
2425
2426 pp.free();
2427 return wp;
2428}

References MSGraph< T >::base, MSGraph< T >::free(), MSGraph< T >::get_minmax(), MSGraph< T >::gp, MSGraph< T >::max, MSGraph< T >::mimicry(), MSGraph< T >::set(), MSGraph< T >::state, MSGraph< T >::xs, MSGraph< T >::ys, and MSGraph< T >::zero.

Here is the call graph for this function:

◆ Density_Mask()

template<typename T >
MSGraph< T > Density_Mask ( MSGraph< T > vp,
double rate,
int mode = 8,
int work_color = 0 )

template <typename T> MSGraph<T> Density_Mask(MSGraph<T> vp, double rate, int mode=8, int work_color=0)

密度マスク

区画の中で縁に接して，かつ zeroでない画素の数を数え，全体の画素の 数に対して rate 以上の比率の場合，その画素パターンを返す．
rateに満たない場合は zero で埋められたパターンを返す．

Parameters
vp画像データ
rate密度
modeモード． 8：8近傍の塗りつぶし． その他：4近傍の塗りつぶし
work_color作業用輝度値
Returns
処理結果の画像データ

Definition at line 2307 of file Graph.h.

2308{
2309 MSGraph<T> pp;
2310 int ps = vp.xs*vp.ys;
2311
2312 if (work_color==0) {
2313 if (vp.max==0 || vp.max==vp.zero) vp.get_minmax();
2314 work_color = vp.max + 1;
2315 }
2316 pp.mimicry(vp);
2317
2318 if ((int)(ps*rate+0.5)==ps) {
2319 int eflg = OFF;
2320 for (int i=0; i<ps; i++) {
2321 if (vp.gp[i]==vp.zero) {
2322 pp.state = 0;
2323 eflg = ON;
2324 break;
2325 }
2326 }
2327 if (eflg==OFF) {
2328 for (int i=0; i<ps; i++) pp.gp[i] = vp.gp[i];
2329 pp.state = ps;
2330 }
2331 return pp;
2332 }
2333
2334 MSGraph<T> xp;
2335 xp.set(vp.xs+2, vp.ys+2, 1, vp.zero, vp.base, vp.RZxy);
2336 xp.color = vp.color;
2337
2338 for (int j=0; j<vp.ys; j++) {
2339 for (int i=0; i<vp.xs; i++) {
2340 xp.gp[(j+1)*xp.xs+i+1] = vp.gp[j*vp.xs+i];
2341 }
2342 }
2343 set_around_MSGraph(xp, xp.zero+1);
2344 MSGraph_Paint(xp, 0, 0, xp.zero+1, work_color-1, work_color, mode);
2345
2346 int nn = 0;
2347 for (int j=0; j<vp.ys; j++) {
2348 for (int i=0; i<vp.xs; i++) {
2349 if (xp.gp[(j+1)*xp.xs+i+1]==work_color) {
2350 pp.gp[j*pp.xs+i] = vp.gp[j*vp.xs+i];
2351 nn++;
2352 }
2353 }
2354 }
2355 pp.state = nn;
2356
2357 if ((int)(ps*rate+0.5)>nn) {
2358 pp.state = 0;
2359 pp.clear();
2360 }
2361
2362 xp.free();
2363 return pp;
2364}
jbxl::MSGraph::clear
void clear(T v)
全空間を画素値 v にする
Definition Gdata.h:352
ON
#define ON
Definition common.h:230
jbxl::set_around_MSGraph
void set_around_MSGraph(MSGraph< T > vp, int cc=0, int size=1)
Definition Graph.h:2030

References MSGraph< T >::base, MSGraph< T >::clear(), MSGraph< T >::color, MSGraph< T >::free(), MSGraph< T >::get_minmax(), MSGraph< T >::gp, MSGraph< T >::max, MSGraph< T >::mimicry(), MSGraph_Paint(), OFF, ON, MSGraph< T >::RZxy, MSGraph< T >::set(), set_around_MSGraph(), MSGraph< T >::state, MSGraph< T >::xs, MSGraph< T >::ys, and MSGraph< T >::zero.

Here is the call graph for this function:

◆ DestroyWing()

DllExport void DestroyWing ( BREP_WING * wing)

void jbxl::DestroyWing(BREP_WING* wing)

Definition at line 865 of file Brep.cpp.

866{
867 wing->vertex->DisconnectWing(wing);
868 wing->contour->DisconnectWing(wing);
869
870 if (!wing->edge->wing1->contour && !wing->edge->wing2->contour) {
871 delete wing->edge;
872 }
873 else {
874 wing->edge->complete = false;
875 }
876}
jbxl::BREP_CONTOUR::DisconnectWing
void DisconnectWing(BREP_WING *wing)
Definition Brep.cpp:362
jbxl::BREP_VERTEX::DisconnectWing
void DisconnectWing(BREP_WING *wing)
Definition Brep.cpp:602

References BREP_EDGE::complete, BREP_WING::contour, BREP_CONTOUR::DisconnectWing(), BREP_VERTEX::DisconnectWing(), BREP_WING::edge, BREP_WING::vertex, BREP_EDGE::wing1, and BREP_EDGE::wing2.

Referenced by BREP_CONTOUR::DestroyWings().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ dgree_circle_MSGraph()

template<typename T >
Vector< double > dgree_circle_MSGraph ( MSGraph< T > vp)

template <typename T> Vector<double> dgree_circle_MSGraph(MSGraph<T> vp)

2D画像において，vp.zero以外の輝度値のオブジェクトの分散度（円形度の逆数）を計算する．
穴空きのオブジェクトも計算可能．独自アルゴリズム．

Parameters
vp画像データ
Return values
Vector.x外周
Vector.y面積
Vector.z分散度
Bug
縁にかかる画像にかんしては正確に外周を計算できない．=> 縁をvp.zeroで埋めること．

Definition at line 86 of file Graph.h.

87{
88 Vector<double> vt;
89 double fac = 1.113757;
90// double fac = 1.182;
91
92/*
93 MSGraph<T> pp;
94 pp.set(vp.xs+2, vp.ys+2, 1);
95 for (int j=0; j<vp.ys; j++) {
96 for (int i=0; i<vp.xs; i++) {
97 pp.gp[(j+1)*pp.xs+i+1] = vp.gp[j*vp.xs+i];
98 }
99 }
100*/
101 vt.z = -1.0;
102 vt.x = count_around_MSGraph(vp);
103 vt.y = count_area_MSGraph(vp);
104 if (vt.y!=0) vt.z = (vt.x*vt.x)/(4.*PI*vt.y)/fac;
105
106 //pp.free();
107
108 return vt;
109}
PI
#define PI
Definition common.h:182
jbxl::count_around_MSGraph
double count_around_MSGraph(MSGraph< T > vp)
Definition Graph.h:180
jbxl::count_area_MSGraph
int count_area_MSGraph(MSGraph< T > xp)
Definition Graph.h:223

References count_area_MSGraph(), count_around_MSGraph(), PI, Vector< T >::x, Vector< T >::y, and Vector< T >::z.

Here is the call graph for this function:

◆ dicomHeader()

int dicomHeader ( FILE * fp,
int fsize,
int * dsize,
int * xsize,
int * ysize,
int * depth,
double * rzxy )

int jbxl::dicomHeader(FILE* fp, int fsize, int* dsize, int* xsize, int* ysize, int* depth, double* rzxy)

DICOM型式のファイルからヘッダを読みだす．

Parameters
fpDICOM型式ファイルへのファイル識別子
fsizeファイルのサイズ．
[out]dsizeグラフィックデータの大きさが格納される．
[out]xsizeグラフィックデータの Xサイズが格納される．
[out]ysizeグラフィックデータの Yサイズが格納される．
[out]depthグラフィックデータのデプス(Bit)が格納される．
[out]rzxyZ軸の歪．0.0 なら不明．
Return values
>0読みこんだヘッダの大きさ (Byte単位)．
0ヘッダの区切りを識別できなかった．
JBXL_GRAPH_INVARG_ERROR不正な引数 (fp, fsize, dsize)
JBXL_GRAPH_MEMORY_ERRORメモリ不足

Definition at line 471 of file Gio.cpp.

472{
473 int i, j, sz, rp, ef;
474 int ln, hsize;
475 int xs = 0, ys = 0, dp = 0;
476 double rz = 0.0;
477
478#ifdef WIN32
479 uWord cn[2];
480#else
481 uWord cn[2] __attribute__((may_alias));
482#endif
483 uWord dt;
484 uWord* wp;
485
486 if (fp==NULL || fsize<=0 || dsize==NULL) return JBXL_GRAPH_IVDARG_ERROR;
487
488 *dsize = 0;
489 if (rzxy!=NULL) *rzxy = 0.0;
490 ef = OFF;
491 fseek(fp, 0, 0);
492
494 // ヘッダの区切りを検出
495 rp = (int)fread(&dt, sizeof(uWord), 1, fp);
496 while(!feof(fp) && ef!=ON) {
497 //if ((uWord)ntohs(dt)==0xe07f) {
498 if (dt==DICOM_PIXEL_GROUP) {
499 rp += (int)fread(&dt, sizeof(uWord), 1, fp);
500 //if ((uWord)ntohs(dt)==0x1000) {
501 if (dt==DICOM_PIXEL_ELEMENT) {
502 rp += (int)fread(&cn, sizeof(uWord), 2, fp);
503 //if ((uWord)ntohs(cn[0])==0x4f57 && cn[1]==0x0000) {
504 if (cn[0]==DICOM_PIXCEL_VR && cn[1]==0x0000) {
505 rp += (int)fread(&cn, sizeof(uWord), 2, fp);
506 }
507 //*dsize = *((int*)cn);
508 int* sizep = (int*)cn;
509 *dsize = *sizep;
510 hsize = rp*sizeof(uWord);
511 if (fsize>=*dsize+hsize) { // footer
512 ef = ON;
513 break;
514 }
515 }
516 }
517 rp += (int)fread(&dt, sizeof(uWord), 1, fp);
518 }
519
520 if (!ef) return 0;
521
522 sz = rp*sizeof(uWord);
523 wp = (uWord*)malloc(sz);
524 if (wp==NULL) return JBXL_GRAPH_MEMORY_ERROR;
525 memset(wp, 0, sz);
526
528 // ヘッダ読み込み
529 fseek(fp, 0, 0);
530 size_t ret = fread(wp, sz, 1, fp);
531 if (ret==0) {
532 return JBXL_FILE_READ_ERROR;
533 }
534
535 for (i=0; i<sz/2-3; i++) {
536 //if ((uWord)ntohs(wp[i])==0x2800 && (uWord)ntohs(wp[i+1])==0x3000) {
537 if (wp[i]==DICOM_IMAGE_GROUP) {
538
539 // Z方向の歪
540 if (wp[i+1]==DICOM_PXLSPC_ELEMENT) {
541 char rx[LNAME], ry[LNAME];
542 uByte* bp;
543
544 memset(rx, 0, LNAME);
545 memset(ry, 0, LNAME);
546
547 if (wp[i+2]==DICOM_STR_VR) ln = wp[i+3];
548 else ln = *(int*)&wp[i+2];
549
550 if (ln<LNAME-1) {
551 bp = (uByte*)&wp[i+4];
552 j = 0;
553 while (j<ln-1 && bp[j]!='\\') {
554 rx[j] = bp[j];
555 j++;
556 }
557 ln -= j + 1;
558 bp += j + 1;
559 j = 0;
560 while (j<ln-1 && bp[j]!=' ') {
561 ry[j] = bp[j];
562 j++;
563 }
564 if (!strcmp(rx, ry)) {
565 rz = atof(rx);
566 }
567 }
568 }
569
570 // X サイズ
571 else if (wp[i+1]==DICOM_XSIZE_ELEMENT) {
572 if (wp[i+2]==DICOM_INT_VR) ln = wp[i+3];
573 else ln = *(int*)&wp[i+2];
574 if (ln==2) {
575 xs = (int)*(sWord*)&wp[i+4];
576 }
577 else if (ln==4) {
578 xs = *(int*)&wp[i+4];
579 }
580 }
581
582 // Y サイズ
583 else if (wp[i+1]==DICOM_YSIZE_ELEMENT) {
584 if (wp[i+2]==DICOM_INT_VR) ln = wp[i+3];
585 else ln = *(int*)&wp[i+2];
586 if (ln==2) {
587 ys = (int)*(sWord*)&wp[i+4];
588 }
589 else if (ln==4) {
590 ys = *(int*)&wp[i+4];
591 }
592 }
593
594 // Depth
595 else if (wp[i+1]==DICOM_DEPTH_ELEMENT) {
596 if (wp[i+2]==DICOM_INT_VR) ln = wp[i+3];
597 else ln = *(int*)&wp[i+2];
598 if (ln==2) {
599 dp = (int)*(sWord*)&wp[i+4];
600 }
601 else if (ln==4) {
602 dp = *(int*)&wp[i+4];
603 }
604 }
605 }
606 }
607 free(wp);
608
609 if (rzxy!=NULL) *rzxy = rz;
610 if (xsize!=NULL) *xsize = xs;
611 if (ysize!=NULL) *ysize = ys;
612 if (depth!=NULL) *depth = dp;
613
614 return sz;
615}
LNAME
#define LNAME
Definition common.h:153
DICOM_STR_VR
#define DICOM_STR_VR
Z歪
Definition gheader.h:319
DICOM_PIXEL_GROUP
#define DICOM_PIXEL_GROUP
Definition gheader.h:309
DICOM_XSIZE_ELEMENT
#define DICOM_XSIZE_ELEMENT
Definition gheader.h:312
DICOM_INT_VR
#define DICOM_INT_VR
X, Y.
Definition gheader.h:320
DICOM_PXLSPC_ELEMENT
#define DICOM_PXLSPC_ELEMENT
Definition gheader.h:314
DICOM_YSIZE_ELEMENT
#define DICOM_YSIZE_ELEMENT
Definition gheader.h:313
DICOM_IMAGE_GROUP
#define DICOM_IMAGE_GROUP
Definition gheader.h:308
DICOM_DEPTH_ELEMENT
#define DICOM_DEPTH_ELEMENT
Definition gheader.h:315
DICOM_PIXEL_ELEMENT
#define DICOM_PIXEL_ELEMENT
Definition gheader.h:311
DICOM_PIXCEL_VR
#define DICOM_PIXCEL_VR
Not.
Definition gheader.h:318
JBXL_GRAPH_IVDARG_ERROR
#define JBXL_GRAPH_IVDARG_ERROR
無効な引数
Definition jbxl_state.h:178
JBXL_FILE_READ_ERROR
#define JBXL_FILE_READ_ERROR
ファイル読み込みエラー
Definition jbxl_state.h:45

References DICOM_DEPTH_ELEMENT, DICOM_IMAGE_GROUP, DICOM_INT_VR, DICOM_PIXCEL_VR, DICOM_PIXEL_ELEMENT, DICOM_PIXEL_GROUP, DICOM_PXLSPC_ELEMENT, DICOM_STR_VR, DICOM_XSIZE_ELEMENT, DICOM_YSIZE_ELEMENT, JBXL_FILE_READ_ERROR, JBXL_GRAPH_IVDARG_ERROR, JBXL_GRAPH_MEMORY_ERROR, LNAME, OFF, and ON.

Referenced by readDicomData(), and readXHead().

Here is the caller graph for this function:

◆ disJunctBounds()

template<typename T >
bool disJunctBounds ( RBound< T > b1,
RBound< T > b2 )
inline

template <typename T> inline bool disJunctBounds(RBound<T> b1, RBound<T> b2)

境界領域b1とb2が重なっているかどうかをチェック

Return values
true重なっていない
false重なっている

Definition at line 580 of file Vector.h.

581{
582 return (b1.xmin >= b2.xmax) || (b2.xmin >= b1.xmax) ||
583 (b1.ymin >= b2.ymax) || (b2.ymin >= b1.ymax) ||
584 (b1.zmin >= b2.zmax) || (b2.zmin >= b1.zmax);
585}

References RBound< T >::xmax, RBound< T >::xmin, RBound< T >::ymax, RBound< T >::ymin, RBound< T >::zmax, and RBound< T >::zmin.

Referenced by IsCollisionContours().

Here is the caller graph for this function:

◆ DisPatcher()

void DisPatcher ( int sno = 0,
... )

Windows用 ディスパッチャー

void WinDisPatcher(int sno=0, unsigned int signal1, unsigned int signal2, ...);

機能：シグナル（メッセージ）キューに溜まったシグナル（メッセージ）をディスパッチする． 引数に，無視する（ディスパッチしない）シグナル（メッセージ）を複数（可変）個指定可能． プログラム自体を終了させるシグナル（メッセージ）がキューにあった場合は，プログラムを 強制終了させる．Windowsの場合は WM_QUIT (0x0111)

Windows 用のみ実装．Linux の処理の仕方は知らない.......（不勉強です）

引数：無視するシグナル（メッセージ）の数，無視するシグナル１，無視するシグナル２，......... シグナル（メッセージ）自体は unsigned int で指定する． 無視するシグナル（メッセージ）を指定しない場合は，引数無しで呼び出し可能

例 ：DisPatcher(1, WM_NCLBUTTONDOWN); DisPatcher(); DisPatcher(0) と同じ

Definition at line 33 of file tools++.cpp.

34{
35 int i;
36 unsigned int* ign_signal = NULL;
37
38 va_list args;
39 va_start(args, signalno);
40
41 if (signalno>0) {
42 ign_signal = (unsigned int*)malloc(signalno*sizeof(int));
43 if (ign_signal!=NULL) memset(ign_signal, 0, signalno*sizeof(int));
44 }
45 if (ign_signal==NULL) signalno = 0;
46 for (i=0; i<signalno; i++) {
47 ign_signal[i] = va_arg(args, unsigned int);
48 }
49
50 MSG msg;
51 while (PeekMessage(&msg, 0, 0, 0, PM_REMOVE)){
52 TranslateMessage(&msg);
53 if (msg.message==WM_QUIT) exit(1); // 強制終了
54 for (i=0; i<signalno; i++) {
55 if (msg.message==ign_signal[i]) {
56 msg.message = WM_NULL;
57 break;
58 }
59 }
60 DispatchMessage(&msg);
61 }
62
63 free(ign_signal);
64 va_end(args);
65 return;
66}

◆ dup_Matrix()

template<typename T >
Matrix< T > dup_Matrix ( Matrix< T > a)

template <typename T> Matrix<T> dup_Matrix(Matrix<T> a)

同じ Matrixデータを作り出す．ただしメモリ部は共有しない

Definition at line 250 of file Matrix++.h.

251{
252 Matrix<T> mtx;
253
254 if (a.sz!=NULL) {
255 mtx.getm(a.n, a.sz);
256 if (a.mx!=NULL && mtx.r==a.r) {
257 for (int i=0; i<a.r; i++) {
258 mtx.mx[i] = a.mx[i];
259 }
260 }
261 }
262
263 mtx.d = a.d;
264 mtx.err = (T)(1);
265 //
266 return mtx;
267}
jbxl::Matrix::sz
int * sz
各次元の要素数 sz[0] 〜 sz[n-1]
Definition Matrix++.h:34
jbxl::Matrix::d
int d
汎用
Definition Matrix++.h:33
jbxl::Matrix::n
int n
次元数
Definition Matrix++.h:31
jbxl::Matrix::err
T err
エラー時にこれを参照用として返す．
Definition Matrix++.h:36
jbxl::Matrix::getm
void getm(int nn, int *size)
Definition Matrix++.h:157
jbxl::Matrix::mx
T * mx
要素 mx[0] 〜 mx[r-1]
Definition Matrix++.h:35
jbxl::Matrix::r
int r
全要素数 sz[0]*sz[1]*...*sz[n-1]
Definition Matrix++.h:32

References Matrix< T >::d, Matrix< T >::err, Matrix< T >::getm(), Matrix< T >::mx, Matrix< T >::n, Matrix< T >::r, and Matrix< T >::sz.

Referenced by Matrix< T >::dup().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ dup_MSGraph() [1/2]

template<typename T >
MSGraph< T > * dup_MSGraph ( MSGraph< T > * src)

template <typename T> MSGraph<T>* dup_MSGraph(MSGraph<T>* src)

MSGraph<T>型データのコピーを作成する．

Parameters
srcコピー元グラフィックデータ
Returns
コピーされた MSGraph<T>型のデータ

Definition at line 634 of file Graph.h.

635{
636 if (src==NULL) return NULL;
637 MSGraph<T>* vp = new MSGraph<T>();
638
639 vp->init();
640 if (src->isNull()) {
641 vp->state = JBXL_GRAPH_NODATA_ERROR;
642 return vp;
643 }
644
645 *vp = *src;
646 vp->getm(src->xs, src->ys, src->zs, src->zero);
647 if (vp->gp==NULL) {
648 vp->init();
649 vp->state = JBXL_GRAPH_MEMORY_ERROR;
650 return vp;
651 }
652
653 for (int i=0; i<vp->xs*vp->ys*vp->zs; i++) vp->gp[i] = src->gp[i];
654
655 return vp;
656}

References MSGraph< T >::getm(), MSGraph< T >::gp, MSGraph< T >::init(), MSGraph< T >::isNull(), JBXL_GRAPH_MEMORY_ERROR, JBXL_GRAPH_NODATA_ERROR, MSGraph< T >::state, MSGraph< T >::xs, MSGraph< T >::ys, MSGraph< T >::zero, and MSGraph< T >::zs.

Here is the call graph for this function:

◆ dup_MSGraph() [2/2]

template<typename T >
MSGraph< T > dup_MSGraph ( MSGraph< T > src)

template <typename T> MSGraph<T> dup_MSGraph(MSGraph<R> src)

MSGraph<T>型データのコピーを作成する．

Parameters
srcコピー元グラフィックデータ
Returns
コピーされた MSGraph<T>型のデータ

Definition at line 602 of file Graph.h.

603{
604 MSGraph<T> vp;
605
606 vp.init();
607 if (src.isNull()) {
608 vp.state = JBXL_GRAPH_NODATA_ERROR;
609 return vp;
610 }
611
612 vp = src;
613 vp.getm(src.xs, src.ys, src.zs, src.zero);
614 if (vp.gp==NULL) {
615 vp.init();
616 vp.state = JBXL_GRAPH_MEMORY_ERROR;
617 return vp;
618 }
619
620 for (int i=0; i<vp.xs*vp.ys*vp.zs; i++) vp.gp[i] = src.gp[i];
621
622 return vp;
623}

References MSGraph< T >::getm(), MSGraph< T >::gp, MSGraph< T >::init(), MSGraph< T >::isNull(), JBXL_GRAPH_MEMORY_ERROR, JBXL_GRAPH_NODATA_ERROR, MSGraph< T >::state, MSGraph< T >::xs, MSGraph< T >::ys, MSGraph< T >::zero, and MSGraph< T >::zs.

Here is the call graph for this function:

◆ DupEdgeNumber()

DllExport int DupEdgeNumber ( BREP_CONTOUR * contour)

int jbxl::DupEdgeNumber(BREP_CONTOUR* contour)

Contourの多重Edgeの数を数える．

Definition at line 651 of file TriBrep.cpp.

652{
653 contour->dup_edge = 0;
654
655 BREP_WING* first = contour->wing;
656 if (first!=NULL) {
657 BREP_WING* next = first;
658 do {
659 BREP_WING* wing = next;
660 next = wing->next;
661 if (wing->edge->edge_list!=NULL) contour->dup_edge++;
662 } while(next!=first);
663 }
664 return contour->dup_edge;
665}
jbxl::BREP_CONTOUR::dup_edge
int dup_edge
多重エッジの数．
Definition Brep.h:181

References BREP_CONTOUR::dup_edge, BREP_WING::edge, BREP_EDGE::edge_list, BREP_WING::next, and BREP_CONTOUR::wing.

Referenced by CreateSurplusContoursList(), PatchupContour(), and ReverseContours().

Here is the caller graph for this function:

◆ dupTriPolygonData()

TriPolygonData * dupTriPolygonData ( TriPolygonData * data,
int num )

Definition at line 267 of file ContourBaseData.cpp.

268{
269 if (data==NULL) return NULL;
270
271 TriPolygonData* dup = (TriPolygonData*)malloc(sizeof(TriPolygonData)*num);
272 if (dup==NULL) return NULL;
273 memset(dup, 0, sizeof(TriPolygonData)*num);
274
275 for (int i=0; i<num; i++) {
276 dup[i].dup(data[i]);
277 for (int j=0; j<3; j++) dup[i].weight[j].dup(data[i].weight[j]);
278 }
279 return dup;
280}
jbxl::TriPolygonData::dup
void dup(TriPolygonData a)
Definition ContourBaseData.cpp:218

References TriPolygonData::dup().

Here is the call graph for this function:

◆ dupVector()

template<typename T >
Vector< T > * dupVector ( Vector< T > * a,
int n )
inline

Definition at line 254 of file Vector.h.

255{
256 Vector<T>* v = (Vector<T>*)malloc(sizeof(Vector<T>)*n);
257 if (v==NULL) return NULL;
258
259 for (int i=0; i<n; i++) v[i] = a[i];
260
261 return v;
262}

◆ dupVector4()

template<typename T >
Vector4< T > * dupVector4 ( Vector4< T > * a,
int n )
inline

Definition at line 902 of file Vector.h.

903{
904 Vector4<T>* v = (Vector4<T>*)malloc(sizeof(Vector4<T>)*n);
905 if (v==NULL) return NULL;
906
907 for (int i=0; i<n; i++) v[i] = a[i];
908
909 return v;
910}

◆ edgeEnhance()

template<typename R , typename T >
MSGraph< R > edgeEnhance ( MSGraph< T > gd,
int mode = 0 )

template <typename R, typename T> MSGraph<R> edgeEnhance(MSGraph<T> gd, int mode=0)

グラフィックデータのラプラシアンを使ったエッジ強調．(2Dのみ)

Parameters
gd計算対象となるグラフィックデータ構造体．
modeモード．4: 4近傍ラプラシアン
8: 8近傍ラプラシアン 3x3
その他: Sobelのラプラシアン(24近傍) 5x5
Returns
処理されたグラフィックデータ．

Definition at line 768 of file Gmt.h.

769{
770 int i;
771 MSGraph<R> la, vp;
772
773 vp.mimicry(gd);
774 if (vp.isNull()) {
775 DEBUG_MODE PRINT_MESG("edgeEnhance: No More Memory!!\n");
776 vp.state = JBXL_GRAPH_MEMORY_ERROR;
777 return vp;
778 }
779
780 la = Laplacian<R>(gd, mode);
781 for (i=0; i<vp.xs*vp.ys*vp.zs; i++) {
782 vp.gp[i] = gd.gp[i] - la.gp[i];
783 }
784 la.free();
785
786 return vp;
787}

References DEBUG_MODE, MSGraph< T >::free(), MSGraph< T >::gp, MSGraph< T >::isNull(), JBXL_GRAPH_MEMORY_ERROR, MSGraph< T >::mimicry(), PRINT_MESG, MSGraph< T >::state, MSGraph< T >::xs, MSGraph< T >::ys, and MSGraph< T >::zs.

Here is the call graph for this function:

◆ euclidDistance()

template<typename T >
MSGraph< int > euclidDistance ( MSGraph< T > vp,
int bc,
int & rr )

template <typename T> MSGraph<int> euclidDistance(MSGraph<T> vp, int bc, int& rr)

WSGグラフィック上を 2値化し,各点における輝度値0の点からの ユークリッド距離の 2乗の最小を求める．

Parameters
vp操作対象となるグラフィックデータ構造体．
bc輝度値の 2値化の値．これより小さいものは０,これ以上は 1．
rr指定しない．画像中のユークリッド距離の 2乗の最大値が入る．
Returns
輝度値の代わりにユークリッド距離が記入されたグラフィックデータ．

Definition at line 864 of file Gmt.h.

865{
866 int i, j, k, l, df, d, w;
867 int rmax, rstart, rend;
868 int nx, ny, nz, pl;
869
870 rr = -1;
871 MSGraph<int> pp(vp.xs, vp.ys, vp.zs, (int)vp.zero, (int)vp.base, vp.RZxy);
872 if (pp.isNull()) {
873 DEBUG_MODE PRINT_MESG("euclidDistance: No More Memory!! E1\n");
874 pp.state = JBXL_GRAPH_MEMORY_ERROR;
875 return pp;
876 }
877
878 for (i=0; i<vp.xs*vp.ys*vp.zs; i++) {
879 if (vp.gp[i]>=bc) pp.gp[i] = 1;
880 else pp.gp[i] = 0;
881 }
882
883 pl = vp.xs*vp.ys;
884
885 for (k=0; k<vp.zs; k++) {
886 nz = k*pl;
887 for (j=0; j<vp.ys; j++) {
888 df = vp.xs;
889 ny = nz + j*vp.xs;
890 for (i=0; i<vp.xs; i++) {
891 nx = ny + i;
892 if (pp.gp[nx]!=0) df = df + 1;
893 else df = 0;
894 pp.gp[nx] = df*df;
895 }
896 }
897 }
898
899 for (k=0; k<vp.zs; k++) {
900 nz = k*pl;
901 for (j=0; j<vp.ys; j++) {
902 df = vp.xs;
903 ny = nz + j*vp.xs;
904 for (i=vp.xs-1; i>=0; i--) {
905 nx = ny + i;
906 if (pp.gp[nx]!=0) df = df + 1;
907 else df = 0;
908 pp.gp[nx] = Min(pp.gp[nx], df*df);
909 }
910 }
911 }
912
913 rmax = Max(vp.ys, vp.zs);
914 MSGraph<int> buf(rmax);
915 if (buf.isNull()) {
916 pp.free();
917 DEBUG_MODE PRINT_MESG("euclidDistance: No More Memory!! E2\n");
918 pp.state = JBXL_GRAPH_MEMORY_ERROR;
919 return pp;
920 }
921
922 for (k=0; k<vp.zs; k++) {
923 nz = k*pl;
924 for (i=0; i<vp.xs; i++) {
925 nx = nz + i;
926 for (j=0; j<vp.ys; j++) buf.gp[j] = pp.gp[nx+j*vp.xs];
927 for (j=0; j<vp.ys; j++) {
928 ny = nx + j*vp.xs;
929 d = buf.gp[j];
930 if (d!=0) {
931 rmax = (int)sqrt((double)d) + 1;
932 rstart = Min(rmax, j);
933 rend = Min(rmax, vp.ys-j-1);
934 for (l=-rstart; l<=rend; l++) {
935 w = buf.gp[j+l] + l*l;
936 if (w<d) d = w;
937 }
938 }
939 pp.gp[ny] = d;
940 }
941 }
942 }
943 buf.clear();
944
945 rr = 0;
946 for (j=0; j<vp.ys; j++) {
947 ny = j*vp.xs;
948 for (i=0; i<vp.xs; i++) {
949 nx = ny + i;
950 for (k=0; k<vp.zs; k++) buf.gp[k] = pp.gp[nx+k*pl];
951 for (k=0; k<vp.zs; k++) {
952 nz = nx + k*pl;
953 d = buf.gp[k];
954 if (d!=0) {
955 rmax = (int)sqrt((double)d) + 1;
956 rstart = Min(rmax, k);
957 rend = Min(rmax, vp.zs-k-1);
958 for (l=-rstart; l<=rend; l++) {
959 w = buf.gp[k+l] + l*l;
960 if (w<d) d = w;
961 }
962 rr = Max(rr, d);
963 }
964 pp.gp[nz] = d;
965 }
966 }
967 }
968 buf.free();
969
970 return pp;
971}

References MSGraph< T >::base, MSGraph< T >::clear(), DEBUG_MODE, MSGraph< T >::free(), MSGraph< T >::gp, MSGraph< T >::isNull(), JBXL_GRAPH_MEMORY_ERROR, Max, Min, PRINT_MESG, MSGraph< T >::RZxy, MSGraph< T >::state, MSGraph< T >::xs, MSGraph< T >::ys, MSGraph< T >::zero, and MSGraph< T >::zs.

Referenced by centerLine().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ ExtEulerXYZ2Quaternion()

template<typename T >
Quaternion< T > ExtEulerXYZ2Quaternion ( Vector< T > e)
inline

Definition at line 236 of file Rotation.h.

236{ Quaternion<T> q; q.setExtEulerXYZ(e); return q;}
jbxl::Quaternion::setExtEulerXYZ
void setExtEulerXYZ(Vector< T > e)
X->Y->Z.
Definition Rotation.h:356

References Quaternion< T >::setExtEulerXYZ().

Here is the call graph for this function:

◆ ExtEulerXYZ2RotMatrix()

template<typename T >
Matrix< T > ExtEulerXYZ2RotMatrix ( Vector< T > eul)

Definition at line 504 of file Rotation.h.

505{
506 Matrix<T> mtx(2, 3, 3);
507
508 T sinx = (T)sin(eul.element1());
509 T cosx = (T)cos(eul.element1());
510 T siny = (T)sin(eul.element2());
511 T cosy = (T)cos(eul.element2());
512 T sinz = (T)sin(eul.element3());
513 T cosz = (T)cos(eul.element3());
514
515 mtx.element(1, 1) = cosy*cosz;
516 mtx.element(1, 2) = sinx*siny*cosz - cosx*sinz;
517 mtx.element(1, 3) = cosx*siny*cosz + sinx*sinz;
518 mtx.element(2, 1) = cosy*sinz;
519 mtx.element(2, 2) = sinx*siny*sinz + cosx*cosz;
520 mtx.element(2, 3) = cosx*siny*sinz - sinx*cosz;
521 mtx.element(3, 1) = -siny;
522 mtx.element(3, 2) = sinx*cosy;
523 mtx.element(3, 3) = cosx*cosy;
524
525 return mtx;
526}
jbxl::Vector::element2
T & element2(void)
Definition Vector.h:79
jbxl::Vector::element1
T & element1(void)
Definition Vector.h:78
jbxl::Vector::element3
T & element3(void)
Definition Vector.h:80

References Matrix< T >::element(), Vector< T >::element1(), Vector< T >::element2(), and Vector< T >::element3().

Here is the call graph for this function:

◆ ExtEulerXZY2Quaternion()

template<typename T >
Quaternion< T > ExtEulerXZY2Quaternion ( Vector< T > e)
inline

Definition at line 238 of file Rotation.h.

238{ Quaternion<T> q; q.setExtEulerXZY(e); return q;}
jbxl::Quaternion::setExtEulerXZY
void setExtEulerXZY(Vector< T > e)
X->Z->Y.
Definition Rotation.h:390

References Quaternion< T >::setExtEulerXZY().

Here is the call graph for this function:

◆ ExtEulerXZY2RotMatrix()

template<typename T >
Matrix< T > ExtEulerXZY2RotMatrix ( Vector< T > eul)

Definition at line 554 of file Rotation.h.

555{
556 Matrix<T> mtx(2, 3, 3);
557
558 T sinx = (T)sin(eul.element1());
559 T cosx = (T)cos(eul.element1());
560 T sinz = (T)sin(eul.element2());
561 T cosz = (T)cos(eul.element2());
562 T siny = (T)sin(eul.element3());
563 T cosy = (T)cos(eul.element3());
564
565 mtx.element(1, 1) = cosy*cosz;
566 mtx.element(1, 2) = -cosx*cosy*sinz + sinx*siny;
567 mtx.element(1, 3) = sinx*cosy*sinz + cosx*siny;
568 mtx.element(2, 1) = sinz;
569 mtx.element(2, 2) = cosx*cosz;
570 mtx.element(2, 3) = -sinx*cosz;
571 mtx.element(3, 1) = -siny*cosz;
572 mtx.element(3, 2) = cosx*siny*sinz + sinx*cosy;
573 mtx.element(3, 3) = -sinx*siny*sinz + cosx*cosy;
574
575 return mtx;
576}

References Matrix< T >::element(), Vector< T >::element1(), Vector< T >::element2(), and Vector< T >::element3().

Here is the call graph for this function:

◆ ExtEulerYXZ2Quaternion()

template<typename T >
Quaternion< T > ExtEulerYXZ2Quaternion ( Vector< T > e)
inline

Definition at line 240 of file Rotation.h.

240{ Quaternion<T> q; q.setExtEulerYXZ(e); return q;}
jbxl::Quaternion::setExtEulerYXZ
void setExtEulerYXZ(Vector< T > e)
Y->X->Z.
Definition Rotation.h:407

References Quaternion< T >::setExtEulerYXZ().

Here is the call graph for this function:

◆ ExtEulerYXZ2RotMatrix()

template<typename T >
Matrix< T > ExtEulerYXZ2RotMatrix ( Vector< T > eul)

Definition at line 629 of file Rotation.h.

630{
631 Matrix<T> mtx(2, 3, 3);
632
633 T siny = (T)sin(eul.element1());
634 T cosy = (T)cos(eul.element1());
635 T sinx = (T)sin(eul.element2());
636 T cosx = (T)cos(eul.element2());
637 T sinz = (T)sin(eul.element3());
638 T cosz = (T)cos(eul.element3());
639
640 mtx.element(1, 1) = -sinx*siny*sinz + cosy*cosz;
641 mtx.element(1, 2) = -cosx*sinz;
642 mtx.element(1, 3) = sinx*cosy*sinz + siny*cosz;
643 mtx.element(2, 1) = sinx*siny*cosz + cosy*sinz;
644 mtx.element(2, 2) = cosx*cosz;
645 mtx.element(2, 3) = -sinx*cosy*cosz + siny*sinz;
646 mtx.element(3, 1) = -cosx*siny;
647 mtx.element(3, 2) = sinx;
648 mtx.element(3, 3) = cosx*cosy;
649
650 return mtx;
651}

References Matrix< T >::element(), Vector< T >::element1(), Vector< T >::element2(), and Vector< T >::element3().

Here is the call graph for this function:

◆ ExtEulerYZX2Quaternion()

template<typename T >
Quaternion< T > ExtEulerYZX2Quaternion ( Vector< T > e)
inline

Definition at line 239 of file Rotation.h.

239{ Quaternion<T> q; q.setExtEulerYZX(e); return q;}
jbxl::Quaternion::setExtEulerYZX
void setExtEulerYZX(Vector< T > e)
Y->Z->X.
Definition Rotation.h:339

References Quaternion< T >::setExtEulerYZX().

Here is the call graph for this function:

◆ ExtEulerYZX2RotMatrix()

template<typename T >
Matrix< T > ExtEulerYZX2RotMatrix ( Vector< T > eul)

Definition at line 579 of file Rotation.h.

580{
581 Matrix<T> mtx(2, 3, 3);
582
583 T siny = (T)sin(eul.element1());
584 T cosy = (T)cos(eul.element1());
585 T sinz = (T)sin(eul.element2());
586 T cosz = (T)cos(eul.element2());
587 T sinx = (T)sin(eul.element3());
588 T cosx = (T)cos(eul.element3());
589
590 mtx.element(1, 1) = cosy*cosz;
591 mtx.element(1, 2) = -sinz;
592 mtx.element(1, 3) = siny*cosz;
593 mtx.element(2, 1) = cosx*cosy*sinz + sinx*siny;
594 mtx.element(2, 2) = cosx*cosz;
595 mtx.element(2, 3) = cosx*siny*sinz - sinx*cosy;
596 mtx.element(3, 1) = sinx*cosy*sinz - cosx*siny;
597 mtx.element(3, 2) = sinx*cosz;
598 mtx.element(3, 3) = sinx*siny*sinz + cosx*cosy;
599
600 return mtx;
601}

References Matrix< T >::element(), Vector< T >::element1(), Vector< T >::element2(), and Vector< T >::element3().

Here is the call graph for this function:

◆ ExtEulerZXY2Quaternion()

template<typename T >
Quaternion< T > ExtEulerZXY2Quaternion ( Vector< T > e)
inline

Definition at line 241 of file Rotation.h.

241{ Quaternion<T> q; q.setExtEulerZXY(e); return q;}
jbxl::Quaternion::setExtEulerZXY
void setExtEulerZXY(Vector< T > e)
Z->X->Y.
Definition Rotation.h:424

References Quaternion< T >::setExtEulerZXY().

Here is the call graph for this function:

◆ ExtEulerZXY2RotMatrix()

template<typename T >
Matrix< T > ExtEulerZXY2RotMatrix ( Vector< T > eul)

Definition at line 604 of file Rotation.h.

605{
606 Matrix<T> mtx(2, 3, 3);
607
608 T sinz = (T)sin(eul.element1());
609 T cosz = (T)cos(eul.element1());
610 T sinx = (T)sin(eul.element2());
611 T cosx = (T)cos(eul.element2());
612 T siny = (T)sin(eul.element3());
613 T cosy = (T)cos(eul.element3());
614
615 mtx.element(1, 1) = sinx*siny*sinz + cosy*cosz;
616 mtx.element(1, 2) = sinx*siny*cosz - cosy*sinz;
617 mtx.element(1, 3) = cosx*siny;
618 mtx.element(2, 1) = cosx*sinz;
619 mtx.element(2, 2) = cosx*cosz;
620 mtx.element(2, 3) = -sinx;
621 mtx.element(3, 1) = sinx*cosy*sinz - siny*cosz;
622 mtx.element(3, 2) = sinx*cosy*cosz + siny*sinz;
623 mtx.element(3, 3) = cosx*cosy;
624
625 return mtx;
626}

References Matrix< T >::element(), Vector< T >::element1(), Vector< T >::element2(), and Vector< T >::element3().

Here is the call graph for this function:

◆ ExtEulerZYX2Quaternion()

template<typename T >
Quaternion< T > ExtEulerZYX2Quaternion ( Vector< T > e)
inline

Definition at line 237 of file Rotation.h.

237{ Quaternion<T> q; q.setExtEulerZYX(e); return q;}
jbxl::Quaternion::setExtEulerZYX
void setExtEulerZYX(Vector< T > e)
Z->Y->X.
Definition Rotation.h:373

References Quaternion< T >::setExtEulerZYX().

Here is the call graph for this function:

◆ ExtEulerZYX2RotMatrix()

template<typename T >
Matrix< T > ExtEulerZYX2RotMatrix ( Vector< T > eul)

Definition at line 529 of file Rotation.h.

530{
531 Matrix<T> mtx(2, 3, 3);
532
533 T sinz = (T)sin(eul.element1());
534 T cosz = (T)cos(eul.element1());
535 T siny = (T)sin(eul.element2());
536 T cosy = (T)cos(eul.element2());
537 T sinx = (T)sin(eul.element3());
538 T cosx = (T)cos(eul.element3());
539
540 mtx.element(1, 1) = cosy*cosz;
541 mtx.element(1, 2) = -cosy*sinz;
542 mtx.element(1, 3) = siny;
543 mtx.element(2, 1) = sinx*siny*cosz + cosx*sinz;
544 mtx.element(2, 2) = -sinx*siny*sinz + cosx*cosz;
545 mtx.element(2, 3) = -sinx*cosy;
546 mtx.element(3, 1) = -cosx*siny*cosz + sinx*sinz;
547 mtx.element(3, 2) = cosx*siny*sinz + sinx*cosz;
548 mtx.element(3, 3) = cosx*cosy;
549
550 return mtx;
551}

References Matrix< T >::element(), Vector< T >::element1(), Vector< T >::element2(), and Vector< T >::element3().

Here is the call graph for this function:

◆ FastDeleteFacet()

DllExport void FastDeleteFacet ( BREP_FACET * facet)

void jbxl::FastDeleteFacet(BREP_FACET* facet)

直前に生成した Facetを高速に削除する．

直前に生成したものでない Facetを指定した場合は誤作動する．
Facetの数が多い場合，delete(Facet) または ~BREP_FACET()を実行すると一々find()を呼び出すので時間が掛かる．

Definition at line 787 of file TriBrep.cpp.

788{
789 if (facet==NULL) return;
790 if (facet->shell!=NULL) {
791 facet->shell->facets.pop_back();
792 facet->shell = NULL;
793 }
794
795 // Destroy its contours
796 BREP_CONTOUR* bpcn;
797 BREP_CONTOUR_LIST::iterator contour = facet->outer_contours.begin();
798
799 while (contour!=facet->outer_contours.end()) {
800 bpcn = *contour;
801 contour = facet->outer_contours.erase(contour);
802 bpcn->facet = NULL;
803 delete (bpcn);
804 }
805 free(facet);
806
807 return;
808}
jbxl::BREP_FACET::outer_contours
BREP_CONTOUR_LIST outer_contours
Definition Brep.h:139
jbxl::BREP_SHELL::facets
BREP_FACET_LIST facets
Definition Brep.h:117

References BREP_CONTOUR::facet, BREP_SHELL::facets, BREP_FACET::outer_contours, and BREP_FACET::shell.

Referenced by PatchupContour(), and ReverseContours().

Here is the caller graph for this function:

◆ fat_object_morph()

template<typename T >
MSGraph< T > fat_object_morph ( MSGraph< T > vp,
MSGraph< T > xp,
int cc )

template <typename T> MSGraph<T> fat_object_morph(MSGraph<T> vp, MSGraph<T> xp, int cc)

画像を太らせる処理（何て言うんだっけ？）

Definition at line 171 of file Morph.h.

172{
173 int i, j, k, ps, cz, cy, cx;
174 bool err;
175 MSGraph<T> wp(vp.xs, vp.ys, vp.zs);
176 if (wp.isNull()) return wp;
177
178 ps = vp.xs*vp.ys;
179 for (k=0; k<vp.zs; k++) {
180 cz = k*ps;
181 for (j=0; j<vp.ys; j++) {
182 cy = cz + j*vp.xs;
183 for (i=0; i<vp.xs; i++) {
184 cx = cy + i;
185 if (vp.gp[cx]>=cc) {
186 err = point_fat_object_morph(vp, i, j, k, xp, cc);
187 if (err) copy_morph_element(wp, i, j, k, xp);
188 }
189 }
190 }
191 }
192 return wp;
193}
jbxl::copy_morph_element
void copy_morph_element(MSGraph< T > vp, int x, int y, int z, MSGraph< T > xp)
Definition Morph.h:140
jbxl::point_fat_object_morph
bool point_fat_object_morph(MSGraph< T > vp, int x, int y, int z, MSGraph< T > xp, int cc)
Definition Morph.h:199

References copy_morph_element(), MSGraph< T >::gp, MSGraph< T >::isNull(), point_fat_object_morph(), MSGraph< T >::xs, MSGraph< T >::ys, and MSGraph< T >::zs.

Here is the call graph for this function:

◆ FillShortageWings()

DllExport void FillShortageWings ( BREP_SOLID * solid,
int method,
bool mode )

void jbxl::FillShortageWings(BREP_SOLID* solid, int method, bool mode)

足りないContourを補充する（全ての不足Contourが無くなるか，補充不可能になるまで）．
Contours List, Wings List, SohrtageWins Listの内容は保障される．

要求データ
  • ShortageWings List．CreateShortageWingsList()で作成しても良い
Parameters
solidソリッドデータへのポインタ
method1: 三番目のVertexを探すアルゴリズムは Next.
method2: 三番目のVertexを探すアルゴリズムは Near.
modetrue : 多重Edgeを認める．
modefalse: 多重Edgeを認めない．

Definition at line 292 of file TriBrep.cpp.

293{
294 if (solid->shortage_wings.empty()) return;
295// DEBUG_MODE PRINT_MESG("Start FillShortageWings\n");
296
297 int wmax = (int)solid->shortage_wings.size();
298 CVCounter* counter = NULL;
299 if (solid->counter!=NULL) counter = solid->counter->GetUsableCounter();
300 if (counter!=NULL) counter->SetMax(wmax);
301
302 int lpc = 0;
303 int pno = 1;
304 while (solid->shortage_wings.size()>1 && pno!=0 && lpc<JBXL_BREP_MAX_LOOPCNT) {
305 if (method==1) pno = FillShortageWings_Next(solid, mode);
306 else if (method==2) pno = FillShortageWings_Near(solid, mode);
307 else {
308// DEBUG_MODE PRINT_MESG("FillShortageWings: 知らない手法が指定された %d\n", method);
309// DEBUG_MODE PRINT_MESG("End FillShortageWings\n");
310 return;
311 }
312 CreateShortageWingsList(solid);
313 //DEBUG_MODE PRINT_MESG("FillShortageWings: 不完全Wingデータは %d/%d 個 %d\n", solid->shortage_wings.size(), wmax, pno);
314 lpc++;
315 }
316
317// DEBUG_MODE PRINT_MESG("End FillShortageWings\n");
318 return;
319}
JBXL_BREP_MAX_LOOPCNT
#define JBXL_BREP_MAX_LOOPCNT
Definition TriBrep.cpp:274
jbxl::FillShortageWings_Next
DllExport int FillShortageWings_Next(BREP_SOLID *solid, bool mode)
Definition TriBrep.cpp:337
jbxl::FillShortageWings_Near
DllExport int FillShortageWings_Near(BREP_SOLID *solid, bool mode)
Definition TriBrep.cpp:383

References BREP_SOLID::counter, CreateShortageWingsList(), FillShortageWings_Near(), FillShortageWings_Next(), CVCounter::GetUsableCounter(), JBXL_BREP_MAX_LOOPCNT, CVCounter::SetMax(), and BREP_SOLID::shortage_wings.

Here is the call graph for this function:

◆ FillShortageWings_Near()

DllExport int FillShortageWings_Near ( BREP_SOLID * solid,
bool mode )

DllExport int jbxl::FillShortageWings_Near(BREP_SOLID* solid, bool mode)

足りないContourを補充する（一周期のみ）．Nearアルゴリズム

Edgeの中心から近いVertexを探して三角形(Contour)を作る．
Contours List と Wings Listの内容は保障される．

要求データ
  • ShortageWings List．CreateShortageWingsList()で作成しても良い
Parameters
solidソリッドデータへのポインタ
modetrue : 多重Edgeを認める．
modefalse: 多重Edgeを認めない．

Definition at line 383 of file TriBrep.cpp.

384{
385 int patchno = 0;
386 BREP_VERTEX_LIST vertex_list;
387
388 BREP_WING_LIST::iterator wing1;
389 for (wing1=solid->shortage_wings.begin(); wing1!=solid->shortage_wings.end(); wing1++){
390 if (!IsIncludeCompleteEdge(*wing1)) {
391 BREP_VERTEX* vert[3];
392 vert[0] = (*wing1)->vertex;
393 vert[1] = GetWingOtherSide(*wing1)->vertex;
394 vert[2] = NULL;
395 vertex_list.clear();
396
397 BREP_WING_LIST::iterator wing2;
398 for (wing2=solid->shortage_wings.begin(); wing2!=solid->shortage_wings.end(); wing2++){
399 if (wing1!=wing2) {
400 BREP_VERTEX* vrtx = (*wing2)->vertex;
401 if (vrtx!=vert[0] && vrtx!=vert[1]) {
402 /* int cnt = 0;
403 BREP_VERTEX* v = vert[1];
404 do {
405 v = FindConnectEdgeVertex(v);
406 cnt++;
407 } while (v!=vert[0] && v!=vert[1] && v!=vrtx && v!=NULL && cnt<100);
408 */
409 // if (v!=vrtx) {
410 Vector<double> vect = (*wing1)->edge->center - vrtx->point;
411 vrtx->distance2 = vect.norm2();
412 SetMinVertex(&vertex_list, vrtx);
413 // }
414 }
415 }
416 }
417
418 int cnt=0;
419 BREP_SHELL* shell = GetWingOtherSide(*wing1)->contour->facet->shell;
420 BREP_VERTEX_LIST::iterator ivert;
421 for (ivert=vertex_list.begin(); ivert!=vertex_list.end(); ivert++){
422 vert[2] = *ivert;
423 if (PatchupContour(shell, vert, mode)) {
424 patchno++;
425 break;
426 }
427 cnt++;
428 if (cnt>=JBXL_BREP_MAX_QUEUESIZE) break;
429 }
430
431 }
432 }
433 CreateContoursList(solid);
434 CreateWingsList(solid);
435
436 return patchno;
437}
JBXL_BREP_MAX_QUEUESIZE
#define JBXL_BREP_MAX_QUEUESIZE
Definition TriBrep.cpp:365
jbxl::BREP_VERTEX::distance2
double distance2
Definition Brep.h:269
jbxl::Vector::norm2
T norm2(void)
Definition Vector.h:70
jbxl::PatchupContour
DllExport bool PatchupContour(BREP_SHELL *shell, BREP_VERTEX **vert, bool mode)
Definition TriBrep.cpp:487
jbxl::SetMinVertex
DllExport void SetMinVertex(BREP_VERTEX_LIST *list, BREP_VERTEX *vrtx)
Definition TriBrep.cpp:445
jbxl::IsIncludeCompleteEdge
DllExport bool IsIncludeCompleteEdge(BREP_WING *wing)
Definition TriBrep.cpp:765

References BREP_WING::contour, CreateContoursList(), CreateWingsList(), BREP_VERTEX::distance2, BREP_CONTOUR::facet, GetWingOtherSide(), IsIncludeCompleteEdge(), JBXL_BREP_MAX_QUEUESIZE, Vector< T >::norm2(), PatchupContour(), BREP_VERTEX::point, SetMinVertex(), BREP_FACET::shell, BREP_SOLID::shortage_wings, and BREP_WING::vertex.

Referenced by FillShortageWings().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ FillShortageWings_Next()

DllExport int FillShortageWings_Next ( BREP_SOLID * solid,
bool mode )

int jbxl::FillShortageWings_Next(BREP_SOLID* solid, bool mode)

足りないContourを補充する（一周期のみ）．Nextアルゴリズム

Edgeに繋がっているEdgeを探してそのVertexから三角形(Contour)を作る．
Contours List と Wings Listの内容は保障される．

要求データ
  • ShortageWings List．CreateShortageWingsList()で作成しても良い
Parameters
solidソリッドデータへのポインタ
modetrue : 多重Edgeを認める．
modefalse: 多重Edgeを認めない．

Definition at line 337 of file TriBrep.cpp.

338{
339 int patchno = 0;
340
341 BREP_WING_LIST::iterator wing1;
342 for (wing1=solid->shortage_wings.begin(); wing1!=solid->shortage_wings.end(); wing1++){
343 if (!IsIncludeCompleteEdge(*wing1)) {
344 BREP_VERTEX* vert[3];
345
346 vert[0] = (*wing1)->vertex;
347 BREP_WING_LIST::iterator wing2;
348 for (wing2=solid->shortage_wings.begin(); wing2!=solid->shortage_wings.end(); wing2++){
349 if (!IsIncludeCompleteEdge(*wing2) && IsConnectEdges(*wing1, *wing2)) {
350 vert[1] = (*wing2)->vertex;
351 vert[2] = GetWingOtherSide(*wing2)->vertex; // vert[]: Contourを貼る頂点
352 BREP_SHELL* shell = GetWingOtherSide(*wing1)->contour->facet->shell;
353 if (PatchupContour(shell, vert, mode)) patchno++;
354 }
355 }
356 }
357 }
358 CreateContoursList(solid);
359 CreateWingsList(solid);
360
361 return patchno;
362}

References BREP_WING::contour, CreateContoursList(), CreateWingsList(), BREP_CONTOUR::facet, GetWingOtherSide(), IsConnectEdges(), IsIncludeCompleteEdge(), PatchupContour(), BREP_FACET::shell, BREP_SOLID::shortage_wings, and BREP_WING::vertex.

Referenced by FillShortageWings().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ FindConnectEdgeVertex()

DllExport BREP_VERTEX * FindConnectEdgeVertex ( BREP_VERTEX * vert)

BREP_VERTEX* jbxl::FindConnectEdgeVertex(BREP_VERTEX* vert)

vertexと Edgeで繋がった vertexの内，最初に見つけたものを返す．

Definition at line 465 of file TriBrep.cpp.

466{
467 BREP_WING_LIST::iterator iwing;
468 for (iwing=vert->wing_list.begin(); iwing!=vert->wing_list.end(); iwing++){
469 if ((*iwing)->contour==NULL) {
470 return GetWingOtherSide(*iwing)->vertex;
471 }
472 }
473 return NULL;
474}
jbxl::BREP_VERTEX::wing_list
BREP_WING_LIST wing_list
Definition Brep.h:258

References GetWingOtherSide(), BREP_WING::vertex, and BREP_VERTEX::wing_list.

Here is the call graph for this function:

◆ FindEdge()

DllExport BREP_EDGE * FindEdge ( BREP_VERTEX * vertex1,
BREP_VERTEX * vertex2 )

BREP_EDGE* jbxl::FindEdge(BREP_VERTEX* vertex1, BREP_VERTEX* vertex2)

vertex1と vertex2が既にエッジで結ばれているかどうかをチェックする．

もし結ばれていれば，最初に見つけた Edgeを返す．

vertex1--Wing1--Edge--Wing2--vertex2

Definition at line 889 of file Brep.cpp.

890{
891 BREP_WING_LIST list;
892 BREP_WING_LIST::iterator iwing;
893
894 list = vertex2->wing_list;
895 for (iwing=list.begin(); iwing!=list.end(); iwing++){
896 BREP_WING* wing = *iwing;
897 if (GetWingOtherSide(wing)->vertex==vertex1) return wing->edge;
898 }
899
900 list = vertex1->wing_list;
901 for (iwing=list.begin(); iwing!=list.end(); iwing++) {
902 BREP_WING* wing = *iwing;
903 if (GetWingOtherSide(wing)->vertex==vertex2) return wing->edge;
904 }
905
906 return NULL;
907}
jbxl::BREP_WING_LIST
std::list< BREP_WING * > BREP_WING_LIST
Definition Brep.h:46

References BREP_WING::edge, GetWingOtherSide(), BREP_WING::vertex, and BREP_VERTEX::wing_list.

Referenced by CreateWingWithoutContour(), and IsForbiddenEdge().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ free_CmnHead()

void free_CmnHead ( CmnHead * hd)

void jbxl::free_CmnHead(CmnHead* hd)

共通ヘッダのメモリ領域を開放する．cmnHead.kind は HEADER_ERRになる
initCmnHead()を内包している．

Parameters
hd開放する共通ヘッダ

Definition at line 25 of file Gdata.cpp.

26{
27 if (hd!=NULL) {
28 if (hd->buf!=NULL) free(hd->buf);
29 if (hd->grptr!=NULL) free(hd->grptr);
30 init_CmnHead(hd);
31 }
32}
jbxl::init_CmnHead
void init_CmnHead(CmnHead *hd)
Definition Gdata.cpp:42

References CmnHead::buf, CmnHead::grptr, and init_CmnHead().

Referenced by copyMSGraph2CmnHead(), ExCmnHead::ffree(), ExCmnHead::free(), ExCmnHead::mfree(), readCmnHeadFile(), readGraphicFile(), readGraphicSlices(), readUserSetData(), readXHead(), and readXHeadFile().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ freeAffineTrans()

template<typename T >
void freeAffineTrans ( AffineTrans< T > *& affine)
inline

Definition at line 141 of file AffineTrans.h.

142{
143 if (affine!=NULL){
144 affine->free();
145 delete(affine);
146 affine = NULL;
147 }
148}
jbxl::AffineTrans::free
void free(void)
Definition AffineTrans.h:49

References AffineTrans< T >::free().

Referenced by FBXData::delAffineTrans(), MeshObjectData::delAffineTrans(), OBJData::delAffineTrans(), and OBJFacetGeoNode::free().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ freeArrayParams()

template<typename T >
void freeArrayParams ( ArrayParam< T > * p,
int num )

void freeArrayParams(ArrayParam<T>* p, int num)

ArrayParam の配列を解放する．
この関数呼び出し後に，必ず p = NULL とすること．

Definition at line 155 of file tools++.h.

156{
157 if (p!=NULL) {
158 for (int i=0; i<num; i++) {
159 p[i].free();
160 }
161 ::free(p);
162 }
163}
jbxl::ArrayParam::free
void free(void)
Definition tools++.h:66

References ArrayParam< T >::free().

Here is the call graph for this function:

◆ freeBrepSolid()

void freeBrepSolid ( BREP_SOLID *& solid)
inline

Definition at line 105 of file Brep.h.

105{ if(solid!=NULL){ solid->FreeData(); delete solid; solid=NULL;} }
jbxl::BREP_SOLID::FreeData
void FreeData(void)
Definition Brep.cpp:56

References BREP_SOLID::FreeData().

Referenced by MeshFacetNode::computeVertexByBREP(), MeshFacetNode::computeVertexByBREP(), and BrepSolidList::free().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ freeBrepSolidList()

void freeBrepSolidList ( BrepSolidList *& solids)
inline

Definition at line 51 of file BrepLib.h.

51{ if(solids!=NULL){ solids->free(); delete solids; solids=NULL;} }
jbxl::BrepSolidList::free
void free(void)
Definition BrepLib.cpp:29

References BrepSolidList::free().

Here is the call graph for this function:

◆ freeColladaXML()

void freeColladaXML ( ColladaXML *& dae)
inline

Definition at line 145 of file ColladaTool.h.

145{ if(dae!=NULL) { dae->free(); delete dae; dae=NULL;} }

References ColladaXML::free().

Here is the call graph for this function:

◆ freeContourBaseData()

void freeContourBaseData ( ContourBaseData *& contour)
inline

Definition at line 178 of file ContourBaseData.h.

178{ if(contour!=NULL){ contour->free(); delete contour; contour = NULL;}}

References ContourBaseData::free().

Here is the call graph for this function:

◆ freeFBXData()

void freeFBXData ( FBXData * fbx)
inline

Definition at line 69 of file FBXDataTool.h.

69{ if(fbx!=NULL) { fbx->free(); delete fbx; fbx=NULL;} }
jbxl::FBXData::free
void free(void)
Definition FBXDataTool.cpp:41

References FBXData::free().

Here is the call graph for this function:

◆ freeGLTFData()

void freeGLTFData ( GLTFData * gltf)
inline

Definition at line 304 of file GLTFDataTool.h.

304{ if(gltf!=NULL) { gltf->free(); delete gltf; gltf=NULL;} }

References GLTFData::free().

Here is the call graph for this function:

◆ freeMeshFacetList()

void freeMeshFacetList ( MeshFacetNode *& node)

Definition at line 475 of file MeshFacetNode.cpp.

476{
477 if (node==NULL) return;
478
479 MeshFacetNode* next = node->next;
480 if (next!=NULL) freeMeshFacetList(next);
481
482 freeMeshFacetNode(node);
483
484 return;
485}
jbxl::freeMeshFacetList
void freeMeshFacetList(MeshFacetNode *&node)
Definition MeshFacetNode.cpp:475

References freeMeshFacetList(), freeMeshFacetNode(), and MeshFacetNode::next.

Referenced by MeshObjectData::free(), and freeMeshFacetList().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ freeMeshFacetNode()

void freeMeshFacetNode ( MeshFacetNode *& node)
inline

Definition at line 89 of file MeshFacetNode.h.

89{ if(node!=NULL) { node->free(); delete node; node=NULL;} }

References MeshFacetNode::free().

Referenced by DelMeshFacetNode(), and freeMeshFacetList().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ freeMeshObjectData()

void freeMeshObjectData ( MeshObjectData *& data)
inline

Definition at line 81 of file MeshObjectData.h.

81{ if(data!=NULL) { data->free(); delete data; data=NULL;} }

References MeshObjectData::free().

Referenced by MeshObjectData::joinData().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ freeNull()

template<typename T >
void freeNull ( T & p)
inline

Definition at line 37 of file common++.h.

37{ if (!jbxl::isNull(p)) ::free(p); p = (T)NULL;}
jbxl::isNull
bool isNull(void *p)
Definition common++.h:24

References isNull().

Referenced by ColladaXML::addGeometry(), MeshObjectData::addNode(), OBJData::addShell(), ContourBaseData::free(), SkinJointData::free(), MeshFacetNode::free_value(), MeshObjectData::free_value(), MeshObjectData::importTriData(), MeshObjectData::importTriData(), readGraphicSlices(), readMoonData(), readRasData(), and readUserSetData().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ freeOBJData()

void freeOBJData ( OBJData * obj)
inline

Definition at line 96 of file OBJDataTool.h.

96{ if(obj!=NULL) { obj->free(); delete obj; obj=NULL;} }
jbxl::OBJData::free
void free(void)
Definition OBJDataTool.cpp:34

References OBJData::free().

Here is the call graph for this function:

◆ freeSTL()

DllExport void freeSTL ( STLData * stldata)

Definition at line 429 of file STL.cpp.

430{
431 if (stldata!=NULL) free(stldata);
432}

◆ freeTriPolygonData() [1/2]

void freeTriPolygonData ( TriPolygonData *& tridata)
inline

Definition at line 139 of file ContourBaseData.h.

139{ if(tridata!=NULL){ tridata->free(); delete tridata; tridata = NULL;}}

References TriPolygonData::free().

Referenced by joinTriPolygonData().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ freeTriPolygonData() [2/2]

void freeTriPolygonData ( TriPolygonData *& tridata,
int n )

Definition at line 311 of file ContourBaseData.cpp.

312{
313 //DEBUG_MODE PRINT_MESG("JBXL::freeTriPolygonData(): start.\n");
314 if (n<=0) return;
315
316 if (tridata!=NULL) {
317 for (int i=0; i<n; i++) {
318 tridata[i].free();
319 }
320 ::free(tridata);
321 tridata = NULL;
322 }
323 //DEBUG_MODE PRINT_MESG("JBXL::freeTriPolygonData(): end.\n");
324}

References TriPolygonData::free().

Here is the call graph for this function:

◆ get_boundary_MSGraph()

template<typename T >
RBound< int > get_boundary_MSGraph ( MSGraph< T > vp,
T mn,
T mx )

template <typename T> RBound<int> get_boundary_MSGraph(MSGraph<T> vp, T mn, T mx)

3Dオブジェクト境界を得る．

Definition at line 386 of file Graph.h.

387{
388 int nx, ny, nz, ps;
389 RBound<int> rb;
390
391 rb.set(vp.xs, 0, vp.ys, 0, vp.zs, 0);
392
393 ps = vp.xs*vp.ys;
394 for (int k=0; k<vp.zs; k++) {
395 nz = k*ps;
396 for (int j=0; j<vp.ys; j++) {
397 ny = j*vp.xs + nz;
398 for (int i=0; i<vp.xs; i++) {
399 nx = i + ny;
400 if (vp.gp[nx]>=mn && vp.gp[nx]<=mx) {
401 rb.fusion((T)i, (T)j, (T)k);
402 }
403 }
404 }
405 }
406 rb.cutdown(vp.rbound);
407
408 return rb;
409}
jbxl::RBound::set
void set(T XMin=(T) 0, T XMax=(T) 0, T YMin=(T) 0, T YMax=(T) 0, T ZMin=(T) 0, T ZMax=(T) 0, T TMin=(T) 0, T TMax=(T) 0)
Definition Vector.h:444
jbxl::RBound::fusion
void fusion(RBound< T > bound)
境界構造体 bound と融合させる
Definition Vector.h:483

References RBound< T >::cutdown(), RBound< T >::fusion(), MSGraph< T >::gp, MSGraph< T >::rbound, RBound< T >::set(), MSGraph< T >::xs, MSGraph< T >::ys, and MSGraph< T >::zs.

Here is the call graph for this function:

◆ getinfo_CmnHead()

CmnHead getinfo_CmnHead ( CmnHead hd)

CmnHead jbxl::getinfo_CmnHead(CmnHead hd)

ヘッダ情報のみをコピーする．

Definition at line 58 of file Gdata.cpp.

59{
60 CmnHead cmnhd = hd;
61
62 cmnhd.bsize = 0;
63 cmnhd.buf = NULL;
64 cmnhd.grptr = NULL;
65
66 return cmnhd;
67}

References CmnHead::bsize, CmnHead::buf, and CmnHead::grptr.

Referenced by readGraphicSlices().

Here is the caller graph for this function:

◆ getMSGraphFromCvMat()

template<typename T >
MSGraph< T > * getMSGraphFromCvMat ( cv::Mat mat)

template <typename T> MSGraph<T>* getMSGraphFromCvMat(cv::Mat mat)

MSGraph<T> から OpenCV用の Matデータを作り出す．

T を cv::Mat の型と合わせるのは，呼び出し側の責任． cv::Matの型と（長さなどが）合わない型Tを指定した場合，戻り値のデータ内容は保障されない．

Mat のチャンネル数は 1と 3のみをサポート. 浮動小数点の depth（CV_32F, CV_64F）は変換できない．
T は uByte, sByte, uWord, sWord または unsigned int を指定する．

Parameters
mat元のMatデータ
Returns
MSGraph<>データ．失敗した場合は NULL
Attention
cv::imread()関数の戻り値のチャンネル数は通常3(RGB)となるので，モノクロデータを imread()関数で 読み込で，uWordのデータに変換するには場合は以下のようにする．
cv::Mat src_img = cv::imread("suba.ras");
MSGraph<uByte>* zp = getMSGraphFromCvMat<uByte>(src_img); // <uWord> にすると精度が落ちる
xp = new MSGraph<sWord>();
copy_MSGraph(*zp, *xp);
delete(zp);
または
cv::Mat gray, src_img = cv::imread("suba.ras");
cv::cvtColor(src_img, gray, CV_BGR2GRAY);
xp = getMSGraphFromCvMat<sWord>(gray);
jbxl::copy_MSGraph
void copy_MSGraph(MSGraph< R > src, MSGraph< T > &dst)
Definition Graph.h:530

Definition at line 203 of file OpenCVTool.h.

204{
205 MSGraph<T>* vp = NULL;
206
207 if (mat.channels()==1) {
208 if (mat.depth()==CV_8U) vp = _getMSGraph_CvMat_C1<T, uByte>(mat);
209 else if (mat.depth()==CV_8S) vp = _getMSGraph_CvMat_C1<T, sByte>(mat);
210 else if (mat.depth()==CV_16U) vp = _getMSGraph_CvMat_C1<T, uWord>(mat);
211 else if (mat.depth()==CV_16S) vp = _getMSGraph_CvMat_C1<T, sWord>(mat);
212 else if (mat.depth()==CV_32S) vp = _getMSGraph_CvMat_C1<T, int>(mat);
213 //else if (mat.depth()==CV_32F) vp = _getMSGraph_CvMat_C1<T, double>(mat);
214 //else if (mat.depth()==CV_64F) vp = _getMSGraph_CvMat_C1<T, double>(mat);
215 }
216
217 else if (mat.channels()==3) {
218 if (mat.depth()==CV_8U) vp = _getMSGraph_CvMat_C3<T, uByte>(mat);
219 else if (mat.depth()==CV_8S) vp = _getMSGraph_CvMat_C3<T, sByte>(mat);
220 else if (mat.depth()==CV_16U) vp = _getMSGraph_CvMat_C3<T, uWord>(mat);
221 else if (mat.depth()==CV_16S) vp = _getMSGraph_CvMat_C3<T, sWord>(mat);
222 else if (mat.depth()==CV_32S) vp = _getMSGraph_CvMat_C3<T, int>(mat);
223 //else if (mat.depth()==CV_32F) vp = getMSGraph_CvMatC3<T, double>(mat);
224 //else if (mat.depth()==CV_64F) vp = getMSGraph_CvMatC3<T, double>(mat);
225 }
226 return vp;
227}

◆ GetOctreeVertices()

DllExport BREP_VERTEX ** GetOctreeVertices ( OctreeNode * octree,
long int * vertexno )

要free

Definition at line 913 of file Brep.cpp.

914{
915 BREP_VERTEX** vindex = NULL;
916
917 long int num = OctreeGetter(octree, NULL, 0);
918
919 if (num>0) {
920 vindex = (BREP_VERTEX**)malloc(sizeof(BREP_VERTEX*)*num);
921 }
922 if (vindex!=NULL) {
923 memset(vindex, 0, sizeof(BREP_VERTEX*)*num);
924 OctreeGetter(octree, vindex, 0);
925 }
926 if (vertexno!=NULL) *vertexno = num;
927
928 return vindex;
929}
jbxl::OctreeGetter
DllExport long int OctreeGetter(OctreeNode *p, BREP_VERTEX **vtx, long int counter)
Definition Brep.cpp:932

References OctreeGetter().

Referenced by BrepSolidList::addSolid(), MeshFacetNode::computeVertexByBREP(), and MeshFacetNode::computeVertexByBREP().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ GetUsableGlobalCounter()

CVCounter * GetUsableGlobalCounter ( )
inline

Definition at line 185 of file ClassBox.h.

186{
187 if (GLCounter!=NULL) return GLCounter->GetUsableCounter();
188 else return NULL;
189}

References CVCounter::GetUsableCounter(), and GLCounter.

Referenced by copyCmnHead2MSGraph(), copyMSGraph2CmnHead(), cut_object_MSGraph(), cut_object_MSGraph(), cut_object_MSGraph(), readCmnHeadFile(), readGraphicFile(), readGraphicSlices(), readUserSetData(), readXHeadFile(), writeCmnHeadData(), writeGraphicFile(), x_reverse_MSGraph(), xSobel(), xxSobel(), ySobel(), yySobel(), zSobel(), and zzSobel().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ GetWingOtherSide()

DllExport BREP_WING * GetWingOtherSide ( BREP_WING * wing)

BREP_WING* jbxl::GetWingOtherSide(BREP_WING* wing)

Edgeに関連付けられたもう一方の Wing を返す．

Definition at line 1028 of file Brep.cpp.

1029{
1030 if (wing==wing->edge->wing1) return wing->edge->wing2;
1031 //
1032 return wing->edge->wing1;
1033}

References BREP_WING::edge, BREP_EDGE::wing1, and BREP_EDGE::wing2.

Referenced by BREP_CONTOUR::CreateWing(), CreateWingsList(), DeleteShortageWings(), DeleteStraightEdges(), FillShortageWings_Near(), FillShortageWings_Next(), FindConnectEdgeVertex(), FindEdge(), IsConnectEdges(), and JoinShortageWings().

Here is the caller graph for this function:

◆ grab_MSGraph() [1/2]

template<typename T >
MSGraph< T > * grab_MSGraph ( MSGraph< T > * vp,
int x1,
int y1,
int x2,
int y2,
int zs = 0,
int ze = 0 )

template <typename T> MSGraph<T>* grab_MSGraph(MSGraph<T>* vp, int x1, int y1, int x2, int y2, int zs=0, int ze=0)

MSGraph<T>型データvpの (x1,y1)-(x2,y2)の矩形部分だけを取り出す．
(x1,y1)-(x2,y2)が元のデータの範囲を越える場合は,元のデータに合わせられる．
輝度値の最大(max)，最小(min) も設定される．

Parameters
vp操作対象グラフィックデータ
(x1,y1),(x2,y2)矩形の対角の座標．
zs,zez軸の範囲
Returns
取り出したグラフィックデータ．bound メンバに切り出した範囲が入る．

Definition at line 2143 of file Graph.h.

2144{
2145 int i, j, k;
2146 int xs, xe, ys, ye;
2147 int xsize, ysize, zsize;
2148 MSGraph<T>* xp = new MSGraph<T>();
2149
2150 xp->init();
2151 xs = Min(x1, x2);
2152 xe = Max(x1, x2);
2153 xs = Max(xs, 0);
2154 xe = Min(xe, vp->xs-1);
2155 ys = Min(y1, y2);
2156 ye = Max(y1, y2);
2157 ys = Max(ys, 0);
2158 ye = Min(ye, vp->ys-1);
2159 zs = Max(zs, 0);
2160 ze = Min(ze, vp->zs-1);
2161
2162 xsize = xe - xs + 1;
2163 ysize = ye - ys + 1;
2164 zsize = ze - zs + 1;
2165
2166 xp->set(xsize, ysize, zsize, vp->zero, vp->base);
2167 xp->color = vp->color;
2168
2169 xp->max = vp->point(xs, ys, zs);
2170 xp->min = xp->max;
2171
2172 for (k=0; k<zsize; k++) {
2173 for (j=0; j<ysize; j++) {
2174 for (i=0; i<xsize; i++) {
2175 T point = vp->point(xs+i, ys+j, zs+k);
2176 xp->point(i, j, k) = point;
2177 if (point>xp->max) xp->max = point;
2178 else if (point<xp->min) xp->min = point;
2179 }
2180 }
2181 }
2182
2183 xp->rbound.xmin = vp->rbound.xmin + xs;
2184 xp->rbound.xmax = vp->rbound.xmin + xe;
2185 xp->rbound.ymin = vp->rbound.ymin + ys;
2186 xp->rbound.ymax = vp->rbound.ymin + ye;
2187 xp->rbound.zmin = vp->rbound.zmin + zs;
2188 xp->rbound.zmax = vp->rbound.zmin + ze;
2189 return xp;
2190}

References MSGraph< T >::base, MSGraph< T >::color, MSGraph< T >::init(), Max, MSGraph< T >::max, Min, MSGraph< T >::min, MSGraph< T >::point(), MSGraph< T >::rbound, MSGraph< T >::set(), RBound< T >::xmax, RBound< T >::xmin, MSGraph< T >::xs, RBound< T >::ymax, RBound< T >::ymin, MSGraph< T >::ys, MSGraph< T >::zero, RBound< T >::zmax, RBound< T >::zmin, and MSGraph< T >::zs.

Here is the call graph for this function:

◆ grab_MSGraph() [2/2]

template<typename T >
MSGraph< T > grab_MSGraph ( MSGraph< T > vp,
int x1,
int y1,
int x2,
int y2,
int zs = 0,
int ze = 0 )

template <typename T> MSGraph<T> grab_MSGraph(MSGraph<T> vp, int x1, int y1, int x2, int y2, int zs=0, int ze=0)

MSGraph<T>型データvpの (x1,y1)-(x2,y2)の矩形部分だけを取り出す．
(x1,y1)-(x2,y2)が元のデータの範囲を越える場合は,元のデータに合わせられる．

Parameters
vp操作対象グラフィックデータ
(x1,y1),(x2,y2)矩形の対角の座標．
zs,zez軸の範囲
Returns
取り出したグラフィックデータ．bound メンバに切り出した範囲が入る．

Definition at line 2079 of file Graph.h.

2080{
2081 int i, j, k;
2082 int xs, xe, ys, ye;
2083 int xsize, ysize, zsize;
2084 MSGraph<T> xp;
2085
2086 xp.init();
2087 xs = Min(x1, x2);
2088 xe = Max(x1, x2);
2089 xs = Max(xs, 0);
2090 xe = Min(xe, vp.xs-1);
2091 ys = Min(y1, y2);
2092 ye = Max(y1, y2);
2093 ys = Max(ys, 0);
2094 ye = Min(ye, vp.ys-1);
2095 zs = Max(zs, 0);
2096 ze = Min(ze, vp.zs-1);
2097
2098 xsize = xe - xs + 1;
2099 ysize = ye - ys + 1;
2100 zsize = ze - zs + 1;
2101
2102 xp.set(xsize, ysize, zsize, vp.zero, vp.base);
2103 if (xp.isNull()) return xp;
2104 xp.color = vp.color;
2105
2106 xp.max = vp.point(xs, ys, zs);
2107 xp.min = xp.max;
2108
2109 for (k=0; k<zsize; k++) {
2110 for (j=0; j<ysize; j++) {
2111 for (i=0; i<xsize; i++) {
2112 T point = vp.point(xs+i, ys+j, zs+k);
2113 xp.point(i, j, k) = point;
2114 if (point>xp.max) xp.max = point;
2115 else if (point<xp.min) xp.min = point;
2116 }
2117 }
2118 }
2119
2120 xp.rbound.xmin = vp.rbound.xmin + xs;
2121 xp.rbound.xmax = vp.rbound.xmin + xe;
2122 xp.rbound.ymin = vp.rbound.ymin + ys;
2123 xp.rbound.ymax = vp.rbound.ymin + ye;
2124 xp.rbound.zmin = vp.rbound.zmin + zs;
2125 xp.rbound.zmax = vp.rbound.zmin + ze;
2126 return xp;
2127}

References MSGraph< T >::base, MSGraph< T >::color, MSGraph< T >::init(), MSGraph< T >::isNull(), Max, MSGraph< T >::max, Min, MSGraph< T >::min, MSGraph< T >::point(), MSGraph< T >::rbound, MSGraph< T >::set(), RBound< T >::xmax, RBound< T >::xmin, MSGraph< T >::xs, RBound< T >::ymax, RBound< T >::ymin, MSGraph< T >::ys, MSGraph< T >::zero, RBound< T >::zmax, RBound< T >::zmin, and MSGraph< T >::zs.

Here is the call graph for this function:

◆ init_CmnHead()

void init_CmnHead ( CmnHead * hd)

void jbxl::init_CmnHead(CmnHead* hd)

共通ヘッダのメモリ領域を初期化する．cmnHead.kind は HEADER_ERRになる

Parameters
hd初期化する共通ヘッダ

Definition at line 42 of file Gdata.cpp.

43{
44 if (hd!=NULL) {
45 hd->buf = hd->grptr = NULL;
46 hd->kind = HEADER_NONE;
47 hd->xsize = hd->ysize = hd->zsize = 0;
48 hd->depth = hd->bsize = hd->lsize = 0;
49 }
50}

References CmnHead::bsize, CmnHead::buf, CmnHead::depth, CmnHead::grptr, HEADER_NONE, CmnHead::kind, CmnHead::lsize, CmnHead::xsize, CmnHead::ysize, and CmnHead::zsize.

Referenced by free_CmnHead(), ExCmnHead::getm(), ExCmnHead::init(), readUserSetData(), and ExCmnHead::set().

Here is the caller graph for this function:

◆ IsAtLine()

DllExport int IsAtLine ( BREP_VERTEX ** v)

Definition at line 853 of file TriBrep.cpp.

854{
855 TVector<double> vect = Vertex2TVector(v[0]);
856 TVector<double> vect1 = Vertex2TVector(v[1]);
857 TVector<double> vect2 = Vertex2TVector(v[2]) - vect;
858 TVector<double> vect3 = Vertex2TVector(v[2]) - vect1;
859 vect1 = vect1 - vect;
860
861 int mode = 0;
862 double tt;
863 double th = ProportionVector(vect2, vect1, tt);
864 tt = Max(tt, Zero_Eps);
865 if (th>1.-tt) mode = 1; // 0->1->2
866 else {
867 th = ProportionVector(vect1, vect2, tt);
868 tt = Max(tt, Zero_Eps);
869 if (th>1.-tt) mode = 2; // 0->2->1
870 else {
871 th = ProportionVector(vect3, vect2, tt);
872 tt = Max(tt, Zero_Eps);
873 if (th>1.-tt) mode = 3; // 1->0->2
874 }
875 }
876 return mode;
877}

References Max, ProportionVector(), Vertex2TVector(), and Zero_Eps.

Referenced by IsForbiddenEdge().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ IsCollisionContours()

DllExport bool IsCollisionContours ( BREP_SOLID * solid,
BREP_CONTOUR * contour,
BREP_CONTOUR ** collision )

bool jbxl::IsCollisionContours(BREP_SOLID* solid, BREP_CONTOUR* contour, BREP_CONTOUR** collision)

Contour が他の Contourと衝突しているかどうかをチェックする．

Note
処理スピードは遅い

Definition at line 930 of file TriBrep.cpp.

931{
932 *collision = NULL;
933
934 BREP_CONTOUR_LIST::iterator icon;
935 for (icon=solid->contours.begin(); icon!=solid->contours.end(); icon++){
936 if (!disJunctBounds(contour->facet->rbound, (*icon)->facet->rbound)) {
937 if (!(*icon)->facet->deletable || (*icon)->facet->notdelete) {
938 int svrtx = CommonVertex(*icon, contour);
939 if (svrtx==3) {
940 *collision = *icon;
941 return true;
942 }
943
944 int lineno;
945 if (SamePlaneContour(*icon, contour, lineno)) {
946 // ３角形の内部点
947 if (!contour->hasCollisionVector) contour->ComputeDirectRS();
948 if (IsInTriangle(*icon, contour)) {
949 *collision = *icon;
950 return true;
951 }
952 if (!(*icon)->hasCollisionVector) (*icon)->ComputeDirectRS();
953 if (IsInTriangle(contour, *icon)) {
954 *collision = *icon;
955 return true;
956 }
957
958 // 2D衝突検査
959 if (CollisionTriContour2D(*icon, contour)) {
960 *collision = *icon;
961 return true;
962 }
963 }
964 else {
965 if (lineno==1) continue;
966 // 3D衝突検査
967 if (!contour->hasCollisionVector) contour->ComputeDirectRS();
968 if (CollisionTriContour3D(*icon, contour)) {
969 *collision = *icon;
970 return true;
971 }
972 if (!(*icon)->hasCollisionVector) (*icon)->ComputeDirectRS();
973 if (CollisionTriContour3D(contour, *icon)) {
974 *collision = *icon;
975 return true;
976 }
977 }
978 }
979 }
980 }
981 return false;
982}
jbxl::BREP_CONTOUR::ComputeDirectRS
void ComputeDirectRS()
Definition Brep.cpp:479
jbxl::BREP_CONTOUR::hasCollisionVector
bool hasCollisionVector
Definition Brep.h:183
jbxl::BREP_FACET::rbound
RBound< double > rbound
Definition Brep.h:142
jbxl::disJunctBounds
bool disJunctBounds(RBound< T > b1, RBound< T > b2)
Definition Vector.h:580
jbxl::SamePlaneContour
DllExport bool SamePlaneContour(BREP_CONTOUR *contour1, BREP_CONTOUR *contour2, int &lineno)
Definition TriBrep.cpp:1167
jbxl::IsInTriangle
DllExport bool IsInTriangle(BREP_CONTOUR *contour1, BREP_CONTOUR *contour2)
Definition TriBrep.cpp:1132
jbxl::CollisionTriContour2D
DllExport bool CollisionTriContour2D(BREP_CONTOUR *contour1, BREP_CONTOUR *contour2)
Definition TriBrep.cpp:1053
jbxl::CommonVertex
DllExport int CommonVertex(BREP_CONTOUR *contour1, BREP_CONTOUR *contour2)
Definition TriBrep.cpp:1191
jbxl::CollisionTriContour3D
DllExport bool CollisionTriContour3D(BREP_CONTOUR *contour1, BREP_CONTOUR *contour2)
Definition TriBrep.cpp:991

References CollisionTriContour2D(), CollisionTriContour3D(), CommonVertex(), BREP_CONTOUR::ComputeDirectRS(), BREP_SOLID::contours, disJunctBounds(), BREP_CONTOUR::facet, BREP_CONTOUR::hasCollisionVector, IsInTriangle(), BREP_FACET::rbound, and SamePlaneContour().

Referenced by PatchupContour().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ IsConnectEdges()

DllExport bool IsConnectEdges ( BREP_WING * wing1,
BREP_WING * wing2 )

Definition at line 1489 of file TriBrep.cpp.

1490{
1491 if (GetWingOtherSide(wing1)->vertex==wing2->vertex) return true;
1492 return false;
1493}

References GetWingOtherSide(), and BREP_WING::vertex.

Referenced by DeleteStraightEdges(), and FillShortageWings_Next().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ IsForbiddenEdge()

DllExport bool IsForbiddenEdge ( BREP_VERTEX ** vert)

bool jbxl::IsForbiddenEdge(BREP_VERTEX** vert)

Vertex vert[0]〜vert[2] が一直線に並んでいるか調べる．
一直線の場合は，該当Edgeを禁止する．また，既にその Edgeがある場合は関連 Contourを削除する．

Definition at line 886 of file TriBrep.cpp.

887{
888 BREP_EDGE* edge = NULL;
889 int mode = IsAtLine(vert);
890 if (mode==1) { // 0->1->2
891 if (vert[0]->forbidden_list==NULL) vert[0]->forbidden_list = new BREP_VERTEX_LIST();
892 if (vert[2]->forbidden_list==NULL) vert[2]->forbidden_list = new BREP_VERTEX_LIST();
893 vert[0]->forbidden_list->push_back(vert[2]);
894 vert[2]->forbidden_list->push_back(vert[0]);
895 edge = FindEdge(vert[0], vert[2]);
896 }
897 else if (mode==2) { // 0->2->1
898 if (vert[0]->forbidden_list==NULL) vert[0]->forbidden_list = new BREP_VERTEX_LIST();
899 if (vert[1]->forbidden_list==NULL) vert[1]->forbidden_list = new BREP_VERTEX_LIST();
900 vert[0]->forbidden_list->push_back(vert[1]);
901 vert[1]->forbidden_list->push_back(vert[0]);
902 edge = FindEdge(vert[0], vert[1]);
903 }
904 else if (mode==3) { // 2->0->1
905 if (vert[1]->forbidden_list==NULL) vert[1]->forbidden_list = new BREP_VERTEX_LIST();
906 if (vert[2]->forbidden_list==NULL) vert[2]->forbidden_list = new BREP_VERTEX_LIST();
907 vert[1]->forbidden_list->push_back(vert[2]);
908 vert[2]->forbidden_list->push_back(vert[1]);
909 edge = FindEdge(vert[1], vert[2]);
910 }
911 if (edge!=NULL) SetDeletableContoursByEdge(edge);
912
913 if (mode==0) return false;
914 return true;
915}
jbxl::BREP_VERTEX::forbidden_list
BREP_VERTEX_LIST * forbidden_list
お互いに Edgeを張ることを禁止された Vertexの List
Definition Brep.h:272
jbxl::IsAtLine
DllExport int IsAtLine(BREP_VERTEX **v)
Definition TriBrep.cpp:853
jbxl::SetDeletableContoursByEdge
DllExport void SetDeletableContoursByEdge(BREP_EDGE *edge)
Definition TriBrep.cpp:816

References FindEdge(), BREP_VERTEX::forbidden_list, IsAtLine(), and SetDeletableContoursByEdge().

Referenced by CreateContourByVector(), CreateContourByVertex(), and DeleteStraightEdges().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ IsIncludeCompleteEdge()

DllExport bool IsIncludeCompleteEdge ( BREP_WING * wing)

bool jbxl::IsIncludeCompleteEdge(BREP_WING* wing)

Wingに関連したEdge及びその多重Edgeは完全か？
そこにあるEdgeの内，最低一つは閉じているか？

Definition at line 765 of file TriBrep.cpp.

766{
767 BREP_EDGE* edge = wing->edge;
768 if (edge->complete) return true;
769 if (edge->edge_list!=NULL) {
770 BREP_EDGE_LIST::iterator iedge;
771 for (iedge=edge->edge_list->begin(); iedge!=edge->edge_list->end(); iedge++){
772 if ((*iedge)->complete) return true;
773 }
774 }
775 return false;
776}

References BREP_EDGE::complete, BREP_WING::edge, and BREP_EDGE::edge_list.

Referenced by FillShortageWings_Near(), and FillShortageWings_Next().

Here is the caller graph for this function:

◆ IsInTriangle()

DllExport bool IsInTriangle ( BREP_CONTOUR * contour1,
BREP_CONTOUR * contour2 )

Definition at line 1132 of file TriBrep.cpp.

1133{
1134 double tc, uc, tt, ut;
1135 TVector<double> directS = contour2->directS;
1136 TVector<double> directRS = contour2->directRS;
1137 TVector<double> directQ, directT, directN;
1138 BREP_WING* wing = contour1->wing;
1139
1140 for (int i=0; i<3; i++) {
1141 for (int j=0; j<2; j++) {
1142 directN = Vertex2TVector(wing->vertex);
1143 if (j==0) directQ = Vertex2TVector(contour2->wing->vertex) - directN;
1144 else directQ = directQ - (Vertex2TVector(wing->next->vertex) - directN)*0.5;
1145
1146 TVector<double> directSQ = directS^directQ;
1147 TVector<double> directQR = directQ^contour2->directR;
1148 tc = ProportionVector(directQR, directSQ, tt);
1149 uc = ProportionVector(directSQ, directRS, ut);
1150 directT = contour2->directR + tc*directS;
1151 ut = Max(ut, Collision_Tolerance);
1152 tt = Max(tt, Collision_Tolerance);
1153 if (tc>tt && 1.-tc>tt && uc>ut && 1.-uc>ut &&
1154 tc*directS.n>directS.t && (1.-tc)*directS.n>directS.t &&
1155 uc*directT.n>directT.t && (1.-uc)*directT.n>directT.t) {
1156// DEBUG_MODE PRINT_MESG("三角形の内部 %d : %e %e %e %e\n", j+1, tc, uc, tt, ut);
1157 //PrintFacetAsciiSTL(contour1);
1158 //PrintFacetAsciiSTL(contour2);
1159 return true;
1160 }
1161 }
1162 }
1163 return false;
1164}

References Collision_Tolerance, BREP_CONTOUR::directR, BREP_CONTOUR::directRS, BREP_CONTOUR::directS, Max, Vector< T >::n, BREP_WING::next, ProportionVector(), TVector< T >::t, BREP_WING::vertex, Vertex2TVector(), and BREP_CONTOUR::wing.

Referenced by IsCollisionContours().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ isNull()

bool isNull ( void * p)
inline

Definition at line 24 of file common++.h.

24 {
25 if (p==NULL) return true;
26
27#ifdef WIN32
28 if (p==WIN_DD_NULL) return true;
29#endif
30
31 return false;
32}
WIN_DD_NULL
#define WIN_DD_NULL
Definition common.h:96

References WIN_DD_NULL.

Referenced by ExMSGraph< T >::ffree(), CRingBuffer::free(), ExMSGraph< T >::free(), freeNull(), and ExMSGraph< T >::operator=().

Here is the caller graph for this function:

◆ isSameDimension()

template<typename T >
bool isSameDimension ( const Matrix< T > v1,
const Matrix< T > v2 )
inline

Definition at line 443 of file Matrix++.h.

444{
445 if (v1.n!=v2.n || v1.r!=v2.r) return false;
446 for (int i=0; i<v1.n; i++) if (v1.sz[i]!=v2.sz[i]) return false;
447 return true;
448}

References Matrix< T >::n, Matrix< T >::r, and Matrix< T >::sz.

Referenced by operator+(), operator-(), and operator==().

Here is the caller graph for this function:

◆ isSameMaterial()

bool isSameMaterial ( MaterialParam a,
MaterialParam b )

マテリアルのパラメータを比べる．

Definition at line 420 of file MaterialParam.cpp.

421{
422 if (!isSameTexture(a.texture, b.texture)) return false;
423 if (!isSameTexture(a.bumpmap, b.bumpmap)) return false;
424 if (!isSameTexture(a.specmap, b.specmap)) return false;
425
426 //
427 bool ret = true;
428
429 char* a_param = a.getBase64Params();
430 char* b_param = b.getBase64Params();
431 //
432 if (a_param!=NULL && b_param!=NULL) {
433 if (strcmp(a_param, b_param)) ret = false;
434 }
435 else if (a_param!=NULL || b_param!=NULL) {
436 ret = false;
437 }
438 if (a_param!=NULL) ::free(a_param);
439 if (b_param!=NULL) ::free(b_param);
440
441 return ret;
442}
jbxl::MaterialParam::bumpmap
TextureParam bumpmap
Bumpmap テクスチャ
Definition MaterialParam.h:177
jbxl::MaterialParam::getBase64Params
char * getBase64Params(unsigned char cc='-')
Definition MaterialParam.cpp:362
jbxl::MaterialParam::texture
TextureParam texture
テクスチャ
Definition MaterialParam.h:175
jbxl::MaterialParam::specmap
TextureParam specmap
Specular マップ テクスチャ
Definition MaterialParam.h:176
jbxl::isSameTexture
bool isSameTexture(TextureParam a, TextureParam b)
compare texture ma,e and color
Definition MaterialParam.cpp:182

References MaterialParam::bumpmap, MaterialParam::getBase64Params(), isSameTexture(), MaterialParam::specmap, and MaterialParam::texture.

Referenced by MeshFacetNode::setMaterialParam().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ isSameTexture()

bool isSameTexture ( TextureParam a,
TextureParam b )

テクスチャ名，カラーを比べる

Definition at line 182 of file MaterialParam.cpp.

183{
184 char* a_name = a.getName();
185 char* b_name = b.getName();
186 if (a_name!=NULL && b_name!=NULL) {
187 if (strcmp(a_name, b_name)) return false;
188 }
189 else if (a_name!=NULL || b_name!=NULL) return false;
190
191 //
192 for (int i=0; i<4; i++) {
193 if (a.getColor(i)!=b.getColor(i)) return false;
194 }
195
196 return true;
197}
jbxl::TextureParam::getName
char * getName(void)
Definition MaterialParam.h:94
jbxl::TextureParam::getColor
Vector< double > getColor(void)
Definition MaterialParam.h:113

References TextureParam::getColor(), and TextureParam::getName().

Referenced by isSameMaterial().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ JoinShortageWings()

DllExport void JoinShortageWings ( BREP_SOLID * solid)

void jbxl::JoinShortageWings(BREP_SOLID* solid)

不完全かつ多重Edgeになっているが，実は一つのEdgeにまとめることができるものを一つにまとめる．
Contours List と Wings Listの内容は保障される．

要求データ
  • ShortageWings List．CreateShortageWingsList()で作成しても良い

Definition at line 592 of file TriBrep.cpp.

593{
594 if (solid->shortage_wings.empty()) return;
595// DEBUG_MODE PRINT_MESG("Start JoinShortageWings\n");
596
597 BREP_WING_LIST::iterator iwing;
598 for (iwing=solid->shortage_wings.begin(); iwing!=solid->shortage_wings.end(); iwing++){
599 BREP_WING* wingA = (*iwing);
600
601 if (GetWingOtherSide(wingA)->contour==NULL) { // 両方NULL
602 delete (wingA->edge);
603 continue;
604 }
605
606 if (wingA->edge->edge_list!=NULL) {
607 BREP_EDGE_LIST* edge_list = wingA->edge->edge_list;
608 BREP_EDGE_LIST::iterator iedge;
609 for (iedge=edge_list->begin(); iedge!=edge_list->end(); iedge++){
610 if (wingA==(*iedge)->wing1 || wingA==(*iedge)->wing2) continue;
611 if ((*iedge)->wing1->contour!=NULL && (*iedge)->wing2->contour!=NULL) continue;
612
613 BREP_WING* wingB;
614 if ((*iedge)->wing1->contour!=NULL) wingB = (*iedge)->wing1;
615 else if ((*iedge)->wing2->contour!=NULL) wingB = (*iedge)->wing2;
616 else continue; // 両方NULLをこちらが先に見つけた．→ 上のdeleteコードに任せる．
617
618 if (wingA->vertex==wingB->vertex) {
619 if (wingA->edge->wing1==wingA) wingA->edge->wing1 = wingB;
620 else if (wingA->edge->wing2==wingA) wingA->edge->wing2 = wingB;
621 if (wingB->edge->wing1==wingB) wingB->edge->wing1 = wingA;
622 else if (wingB->edge->wing2==wingB) wingB->edge->wing2 = wingA;
623
624 BREP_EDGE* sedge = wingB->edge;
625 wingB->edge = wingA->edge;
626 wingA->edge = sedge;
627 wingB->edge->complete = true;
628 wingA->edge->complete = false;
629 break;
630 }
631 }
632 }
633 }
634 CreateContoursList(solid);
635 CreateWingsList(solid);
636
637// DEBUG_MODE PRINT_MESG("End JoinShortageWings\n");
638 return;
639}

References BREP_EDGE::complete, BREP_WING::contour, CreateContoursList(), CreateWingsList(), BREP_WING::edge, BREP_EDGE::edge_list, GetWingOtherSide(), BREP_SOLID::shortage_wings, BREP_WING::vertex, BREP_EDGE::wing1, and BREP_EDGE::wing2.

Referenced by DeleteSurplusContours().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ joinTriPolygonData()

TriPolygonData * joinTriPolygonData ( TriPolygonData *& first,
int num_f,
TriPolygonData *& next,
int num_n )

Definition at line 283 of file ContourBaseData.cpp.

284{
285 if (first==NULL) return next;
286 if (next ==NULL) return first;
287
288 TriPolygonData* join = (TriPolygonData*)malloc(sizeof(TriPolygonData)*(num_p+num_n));
289 if (join==NULL) return NULL;
290 memset(join, 0, sizeof(TriPolygonData)*(num_p+num_n));
291
292 int num = 0;
293 for (int i=0; i<num_p; i++) {
294 join[i].dup(first[i]);
295 if (join[i].polygonNum>num) num = join[i].polygonNum;
296 }
297 num += 1;
298
299 for (int i=0; i<num_n; i++) {
300 join[num_p+i].dup(next[i]);
301 join[num_p+i].polygonNum += num;
302 }
303
304 freeTriPolygonData(first, num_p);
305 freeTriPolygonData(next, num_n);
306
307 return join;
308}
jbxl::TriPolygonData::polygonNum
int polygonNum
ポリゴン番号
Definition ContourBaseData.h:110
jbxl::freeTriPolygonData
void freeTriPolygonData(TriPolygonData *&tridata)
Definition ContourBaseData.h:139

References TriPolygonData::dup(), freeTriPolygonData(), and TriPolygonData::polygonNum.

Here is the call graph for this function:

◆ Laplacian()

template<typename R , typename T >
MSGraph< R > Laplacian ( MSGraph< T > vp,
int mode = 0 )

template <typename R, typename T> MSGraph<R> Laplacian(MSGraph<T> vp, int mode=0)

2Dグラフィックデータのラプラシアンを計算する．

Parameters
vp計算対象となるグラフィックデータ構造体．
modeモード．4: 4近傍ラプラシアン
8: 8近傍ラプラシアン
その他: Sobelのラプラシアン(24近傍)
Returns
処理されたグラフィックデータ．
Note
3D化したい．

Definition at line 58 of file Gmt.h.

59{
60 int i, j;
61 int nx, ny, xs, xs2;
62 R da, db, dc, dd, de, df, dg, dh;
63 MSGraph<R> lp;
64
65 lp.mimicry(vp);
66 lp.base = lp.zero = 0;
67
68 if (lp.isNull()) {
69 DEBUG_MODE PRINT_MESG("LAPLACIAN: No More Memory!!!\n");
70 lp.state = JBXL_GRAPH_MEMORY_ERROR;
71 return lp;
72 }
73
74 xs = vp.xs;
75 xs2 = 2*xs;
76
77 if (mode==4) {
78 for (j=1; j<vp.ys-1; j++) {
79 ny = j*vp.xs;
80 for (i=1; i<vp.xs-1; i++) {
81 nx = ny + i;
82 da = vp.gp[nx+1] + vp.gp[nx-1];
83 db = vp.gp[nx];
84 dc = vp.gp[nx+xs] + vp.gp[nx-xs];
85 lp.gp[nx] = (R)(da - 4.*db + dc);
86 //da = vp.point(i+1, j) + vp.point(i-1, j);
87 //db = vp.point(i, j);
88 //dc = vp.point(i, j+1) + vp.point(i, j-1);
89 //lp.point(i, j) = (R)(da - 4.*db + dc);
90 }
91 }
92 }
93
94 else if (mode==8) {
95 for (j=1; j<vp.ys-1; j++) {
96 ny = j*vp.xs;
97 for (i=1; i<vp.xs-1; i++) {
98 nx = ny + i;
99 da = vp.gp[nx+1] + vp.gp[nx-1];
100 db = vp.gp[nx+xs] + vp.gp[nx-xs];
101 dc = vp.gp[nx];
102 dd = vp.gp[nx+1+xs] + vp.gp[nx-1+xs];
103 de = vp.gp[nx+1-xs] + vp.gp[nx-1-xs];
104 lp.gp[nx] = (R)(da + db - 8.*dc + dd + de);
105 //da = vp.point(i+1, j) + vp.point(i-1, j);
106 //db = vp.point(i, j+1) + vp.point(i, j-1);
107 //dc = vp.point(i, j);
108 //dd = vp.point(i+1, j+1) + vp.point(i-1, j+1);
109 //de = vp.point(i+1, j-1) + vp.point(i-1, j-1);
110 //lp.point(i, j) = (R)(da + db - 8.*dc + dd + de);
111 }
112 }
113 }
114
115 else {
116 for (j=2; j<vp.ys-2; j++) {
117 ny = j*vp.xs;
118 for (i=2; i<vp.xs-2; i++) {
119 nx = ny + i;
120 da = vp.gp[nx];
121 db = vp.gp[nx+1] + vp.gp[nx-1] + vp.gp[nx+xs] + vp.gp[nx-xs];
122 dc = vp.gp[nx-1-xs2] + vp.gp[nx-xs2] + vp.gp[nx+1-xs2];
123 dd = vp.gp[nx-1+xs2] + vp.gp[nx+xs2] + vp.gp[nx+1+xs2];
124 de = vp.gp[nx-2-xs ] + vp.gp[nx-2] + vp.gp[nx-2+xs];
125 df = vp.gp[nx+2-xs ] + vp.gp[nx+2] + vp.gp[nx+2+xs];
126 dg = vp.gp[nx-2-xs2] + vp.gp[nx+2-xs2];
127 dh = vp.gp[nx-2+xs2] + vp.gp[nx+2+xs2];
128 lp.gp[nx] = (R)((-12.*da - 4.*db + 2.*(dc+dd+de+df) + dg + dh)/32.);
129
130 //da = vp.point(i, j);
131 //db = vp.point(i+1, j) + vp.point(i-1, j) + vp.point(i, j+1) + vp.point(i, j-1);
132 //dc = vp.point(i-1, j-2) + vp.point(i, j-2) + vp.point(i+1, j-2);
133 //dd = vp.point(i-1, j+2) + vp.point(i, j+2) + vp.point(i+1, j+2);
134 //de = vp.point(i-2, j-1) + vp.point(i-2, j) + vp.point(i-2, j+1);
135 //df = vp.point(i+2, j-1) + vp.point(i+2, j) + vp.point(i+2, j+1);
136 //dg = vp.point(i-2, j-2) + vp.point(i+2, j-2);
137 //dh = vp.point(i-2, j+2) + vp.point(i+2, j+2);
138 //lp.point(i, j) = (R)((-12.*da - 4.*db + 2.*(dc+dd+de+df) + dg + dh)/32.);
139 }
140 }
141 }
142 return lp;
143}

References MSGraph< T >::base, DEBUG_MODE, MSGraph< T >::gp, MSGraph< T >::isNull(), JBXL_GRAPH_MEMORY_ERROR, MSGraph< T >::mimicry(), PRINT_MESG, MSGraph< T >::state, MSGraph< T >::xs, MSGraph< T >::ys, and MSGraph< T >::zero.

Here is the call graph for this function:

◆ Local2World()

template<typename T , typename R >
void Local2World ( MSGraph< T > gd,
MSGraph< T > vp,
Vector< R > oq,
Vector< R > op,
Vector< R > ex,
double * pcsf = NULL,
double * psnf = NULL )

template <typename T, typename R>
void Local2World(MSGraph<T> gd, MSGraph<T> vp, Vector<R> oq, Vector<R> op, Vector<R> ex, double pcsf=0.0, double psnf=1.0)

ローカルな観測座標系のグラフィック vpをグローバル座標系のグラフィック gd に埋めこむ．

ローカルな観測座標系　→　ローカルな極座標系　→　グローバル座標系
変換先の点の周りの格子点全てに値を設定する．

Parameters
gdグローバル座標系のグラフィック空間．
vp観測座標系のグラフィックデータ（左上が原点）．
oqグローバル座標系から見たローカルな極座標系の原点の座標．
op観測座標系から見たローカルな極座標系の原点の座標．
exローカルな極座標系から見た観測座標系のx軸（ローカルな極座標系でのz軸）の向き．
pcsfsinθ≒0 の場合に *csfに代入される．連続計算の場合に直前の cosφの値を指定する．
psnfsinθ≒0 の場合に *snfに代入される．連続計算の場合に直前の sinφの値を指定する．

Definition at line 730 of file Graph.h.

731{
732 int x, y, z, cx, cy, cz;
733 double px, py, pz, xx, yy, zz;
734 double cst, snt, csf=0.0, snf=1.0;
735
736 if (pcsf!=NULL && psnf!=NULL) {
737 csf = *pcsf;
738 snf = *psnf;
739 }
740
741 ToPola(ex, cst, snt, csf, snf, csf, snf);
742
743 for (z=0; z<vp.zs; z++) {
744 cz = z*vp.xs*vp.ys;
745 for (y=0; y<vp.ys; y++) {
746 cy = cz + y*vp.xs;
747 for (x=0; x<vp.xs; x++) {
748 cx = cy + x;
749 if (vp.gp[cx]!=vp.zero) {
750 px = z - op.z; // ローカルな極座標系の原点へ
751 py = op.x - x;
752 pz = op.y - y;
753 xx = px*snt*csf - py*snf - pz*cst*csf + oq.x;
754 yy = px*snt*snf + py*csf - pz*cst*snf + oq.y;
755 zz = px*cst + pz*snt + oq.z;
756 gd.set_vPoint(xx, yy, zz, vp.gp[cx], ON);
757 }
758 }
759 }
760 }
761
762 if (pcsf!=NULL && psnf!=NULL) {
763 *pcsf = csf;
764 *psnf = snf;
765 }
766}
jbxl::MSGraph::set_vPoint
void set_vPoint(double x, double y=0., double z=0., T cc=(T) 0, int mode=OFF)
Definition Gdata.h:447

References MSGraph< T >::gp, ON, MSGraph< T >::set_vPoint(), ToPola(), Vector< T >::x, MSGraph< T >::xs, Vector< T >::y, MSGraph< T >::ys, Vector< T >::z, MSGraph< T >::zero, and MSGraph< T >::zs.

Referenced by MSGraph_Circle3D(), MSGraph_Pool(), and MSGraph_Torus().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ make_element_morph()

template<typename T >
MSGraph< T > make_element_morph ( Parameter32 x)

template <typename T> MSGraph<T> make_element_morph(Parameter x)

モルフォロジー演算のエレメントを生成する．

Definition at line 235 of file Morph.h.

236{
237 int *p, n, m, r, c, i, j, k, z;
238 int nn, xs, ir;
239 double s, sn, cs, dr, dt, df, th, fi, rx, zz;
240 MSGraph<T> vp, xp;
241
242 p = (int*)x.pm;
243 m = p[0]; // mode
244 r = p[1]; // hankei
245 c = p[2]; // color
246 s = p[3]/p[4]; // RZxy;
247
248 if (m==SPHERE_ELEMENT) {
249 xs = 2*r + 1;
250 vp.getm(xs, xs, (int)(xs*s+0.5));
251 if (vp.isNull()) return vp;
252
253 xp.xs = xs;
254 xp.ys = xs;
255 xp.zs = 1;
256
257 for (z=0; z<vp.zs; z++) {
258 xp.gp = &vp.gp[z*vp.xs*vp.ys];
259 zz = Min(r, Xabs(((vp.zs-1.)/2.-z)/s));
260 ir = (int)(sqrt(Max(r*r-zz*zz, 0.0))+0.5);
261 circle(xp, r, r, ir, c, ON);
262 }
263 }
264 else {
265 DEBUG_MODE PRINT_MESG("MAKE_ELEMENT_MORPH: no support mode = %d\n",m);
266 exit(1);
267 }
268 return vp;
269}
SPHERE_ELEMENT
#define SPHERE_ELEMENT
Definition Morph.h:24
Parameter32::pm
sByte pm[32]
Definition common.h:345

References DEBUG_MODE, MSGraph< T >::getm(), MSGraph< T >::gp, MSGraph< T >::isNull(), Max, Min, ON, Parameter32::pm, PRINT_MESG, SPHERE_ELEMENT, Xabs, MSGraph< T >::xs, MSGraph< T >::ys, and MSGraph< T >::zs.

Here is the call graph for this function:

◆ medianFilter()

template<typename T >
MSGraph< T > medianFilter ( MSGraph< T > xp,
int ms = 3 )

template <typename T> MSGraph<T> medianFilter(WSGraph<T> xp, int ms=3)

メディアンフィルタ処理を行なう．３D処理可．

Parameters
xp対象となるグラフィックデータ構造体．
msフィルタの大きさ．
Returns
メディアンフィルタ処理されたグラフィックデータ．

Definition at line 800 of file Gmt.h.

801{
802 int i, j, x, y, z, cx;
803 int xx, yy, zz, cw, ux, mz;
804 int kc, xc, zc, xs, ps;
805 T* me;
806 MSGraph<T> vp;
807
808 mz = Min(ms, xp.zs);
809 me = (T*)malloc(ms*ms*mz*sizeof(T));
810 if (me!=NULL) memset(me, 0, ms*ms*mz*sizeof(T));
811
812 vp.mimicry(xp);
813 if (vp.isNull()) {
814 free(me);
815 DEBUG_MODE PRINT_MESG("medianFilter: No More Memory!!\n");
816 vp.state = JBXL_GRAPH_MEMORY_ERROR;
817 return vp;
818 }
819
820 kc = ms*ms*mz/2;
821 xc = ms/2;
822 zc = mz/2;
823 xs = xp.xs;
824 ps = xp.xs*xp.ys;
825 z = xp.zs/2;
826 for(y=xc; y<xp.ys-xc; y++)
827 for(x=xc; x<xp.xs-xc; x++) {
828 cx = z*ps + y*xs + x;
829 i = 0;
830 for (zz=-zc; zz<=zc; zz++)
831 for (yy=-xc; yy<=xc; yy++)
832 for (xx=-xc; xx<=xc; xx++) {
833 cw = cx + xx + yy*xs + zz*ps;
834 me[i++] = xp.gp[cw];
835 }
836 for (i=0; i<ms*ms*mz-1; i++)
837 for (j=i+1; j<ms*ms*mz; j++) {
838 if (me[i]<me[j]) {
839 ux = me[i];
840 me[i] = me[j];
841 me[j] = ux;
842 }
843 }
844 vp.gp[cx-z*ps] = me[kc];
845 }
846
847 free(me);
848 return vp;
849}

References DEBUG_MODE, MSGraph< T >::gp, MSGraph< T >::isNull(), JBXL_GRAPH_MEMORY_ERROR, MSGraph< T >::mimicry(), Min, PRINT_MESG, MSGraph< T >::state, MSGraph< T >::xs, MSGraph< T >::ys, and MSGraph< T >::zs.

Here is the call graph for this function:

◆ MidPoint() [1/2]

template<typename T >
Vector4< T > MidPoint ( const Vector4< T > a,
const Vector4< T > b )
inline

Definition at line 859 of file Vector.h.

860{ return 0.5*(a+b); }

◆ MidPoint() [2/2]

template<typename T >
Vector< T > MidPoint ( const Vector< T > a,
const Vector< T > b )
inline

Definition at line 213 of file Vector.h.

214{ return 0.5*(a+b); }

◆ Morphology()

template<typename T >
MSGraph< T > Morphology ( MSGraph< T > vp,
MSGraph< T > xp,
int cc,
int mode )

template <typename T> MSGraph<T> Morphology(MSGraph<T> vp, MSGraph<T> xp, int cc, int mode)

画像vpに対して，エレメントxpで，modeのモルフォロジー演算を行う．
現在は OPENING のmodeしかサポートしていない．

Parameters
vp処理対象の元データ
xpエレメント画像
cc閾値．この輝度値以上の画素に対して演算を行う
mode演算の種類を指定
Returns
処理結果の画像

Definition at line 51 of file Morph.h.

52{
53 MSGraph<T> wp;
54
55 if (mode==OPENING) wp = opening_morph(vp, xp, cc);
56 else {
57 DEBUG_MODE PRINT_MESG("MORPHOLOGY: サポートしていない演算です = %d\n", mode);
58 }
59 return wp;
60}
OPENING
#define OPENING
Definition Morph.h:20
jbxl::opening_morph
MSGraph< T > opening_morph(MSGraph< T > vp, MSGraph< T > xp, int cc)
Definition Morph.h:75

References DEBUG_MODE, OPENING, opening_morph(), and PRINT_MESG.

Here is the call graph for this function:

◆ MSGraph2TGAImage()

template<typename T >
TGAImage MSGraph2TGAImage ( MSGraph< T > vp,
bool rle )

template <typename T> TGAImage MSGraph2TGAImage(MSGraph<T> vp, bool rle)

MSGraph型イメージデータを TGAイメージデータに変換する ヘッダ情報は変換しない（別途変換する）．

Parameters
vpMSGraph型イメージデータ
rleRLE（連長圧縮）を行うかどうか
Returns
TGAイメージデータ
Return values
JBXL_GRAPH_NODATA_ERRORstate データ無し
JBXL_GRAPH_MEMORY_ERRORstate メモリ確保エラー

Definition at line 168 of file TgaTool.h.

169{
170 TGAImage tga;
171 tga.init();
172
173 if (vp.isNull()) {
174 tga.state = JBXL_GRAPH_NODATA_ERROR;
175 return tga;
176 }
177
178 tga.setzero(vp.xs, vp.ys, vp.zs);
179 tga.length = tga.xs*tga.ys*tga.col;
180 if (tga.isNull()) return tga;
181
182 if (vp.color==GRAPH_COLOR_UNKNOWN) {
183 if (vp.zs==1) vp.color = GRAPH_COLOR_GRAY;
184 else if (vp.zs==2) vp.color = GRAPH_COLOR_MA;
185 else if (vp.zs==3) vp.color = GRAPH_COLOR_RGB;
186 else if (vp.zs==4) vp.color = GRAPH_COLOR_RGBA;
187 }
188
189 //
190 if (vp.color==GRAPH_COLOR_BGRA || vp.color==GRAPH_COLOR_BGR || vp.color==GRAPH_COLOR_GRAY || vp.color==GRAPH_COLOR_MA) {
191 for (int k=0; k<tga.col; k++) {
192 int zp = k*tga.xs*tga.ys;
193 for (int j=0; j<tga.ys; j++) {
194 int yp = zp + j*tga.xs;
195 for (int i=0; i<tga.xs; i++) {
196 tga.point(i, j, k) = (uByte)vp.gp[yp + i];
197 }
198 }
199 }
200 }
201 //
202 else if (vp.color==GRAPH_COLOR_RGB || vp.color==GRAPH_COLOR_RGBA) {
203 for (int k=0; k<3; k++) {
204 int zp = (2-k)*tga.xs*tga.ys;
205 for (int j=0; j<tga.ys; j++) {
206 int yp = zp + j*tga.xs;
207 for (int i=0; i<tga.xs; i++) {
208 tga.point(i, j, k) = (uByte)vp.gp[yp + i];
209 }
210 }
211 }
212 if (vp.color==GRAPH_COLOR_RGBA) { // αチャンネル
213 int zp = 3*tga.xs*tga.ys;
214 for (int j=0; j<tga.ys; j++) {
215 int yp = zp + j*tga.xs;
216 for (int i=0; i<tga.xs; i++) {
217 tga.point(i, j, 3) = (uByte)vp.gp[yp + i];
218 }
219 }
220 }
221 }
222 //
223 else if (vp.color==GRAPH_COLOR_ABGR) {
224 for (int j=0; j<tga.ys; j++) { // αチャンネル
225 int yp = j*tga.xs;
226 for (int i=0; i<tga.xs; i++) {
227 tga.point(i, j, 3) = (uByte)vp.gp[yp + i];
228 }
229 }
230 for (int k=1; k<4; k++) {
231 int zp = k*tga.xs*tga.ys;
232 for (int j=0; j<tga.ys; j++) {
233 int yp = zp + j*tga.xs;
234 for (int i=0; i<tga.xs; i++) {
235 tga.point(i, j, k-1) = (uByte)vp.gp[yp + i];
236 }
237 }
238 }
239 }
240 //
241 else if (vp.color==GRAPH_COLOR_ARGB) {
242 for (int j=0; j<tga.ys; j++) { // αチャンネル
243 int yp = j*tga.xs;
244 for (int i=0; i<tga.xs; i++) {
245 tga.point(i, j, 3) = (uByte)vp.gp[yp + i];
246 }
247 }
248 for (int k=1; k<4; k++) {
249 int zp = (4-k)*tga.xs*tga.ys;
250 for (int j=0; j<tga.ys; j++) {
251 int yp = zp + j*tga.xs;
252 for (int i=0; i<tga.xs; i++) {
253 tga.point(i, j, k-1) = (uByte)vp.gp[yp + i];
254 }
255 }
256 }
257 }
258 else {
259 tga.state = JBXL_GRAPH_IVDARG_ERROR;
260 tga.free();
261 }
262
263 if (tga.state==0) setupTGAData(&tga, rle);
264
265 return tga;
266}
jbxl::TGAImage::init
void init(void)
グラフィックデータは解放しない
Definition TgaTool.cpp:20
jbxl::TGAImage::point
uByte & point(int x, int y, int c)
Definition TgaTool.h:50
jbxl::TGAImage::setzero
void setzero(int x, int y, int c)
Definition TgaTool.cpp:89
jbxl::TGAImage::free
void free(void)
グラフィックデータを開放する
Definition TgaTool.cpp:77
jbxl::TGAImage::isNull
bool isNull(void)
グラフィックデータを持っていないか？
Definition TgaTool.cpp:45
GRAPH_COLOR_UNKNOWN
#define GRAPH_COLOR_UNKNOWN
0x0070
Definition gheader.h:302
GRAPH_COLOR_RGBA
#define GRAPH_COLOR_RGBA
Definition gheader.h:283
GRAPH_COLOR_BGRA
#define GRAPH_COLOR_BGRA
Definition gheader.h:295
GRAPH_COLOR_ARGB
#define GRAPH_COLOR_ARGB
Definition gheader.h:279
GRAPH_COLOR_MA
#define GRAPH_COLOR_MA
0x0014
Definition gheader.h:260
GRAPH_COLOR_BGR
#define GRAPH_COLOR_BGR
Definition gheader.h:274
GRAPH_COLOR_GRAY
#define GRAPH_COLOR_GRAY
Definition gheader.h:244
jbxl::setupTGAData
int setupTGAData(TGAImage *tga, bool rle)
Definition TgaTool.cpp:390

References TGAImage::col, MSGraph< T >::color, TGAImage::free(), MSGraph< T >::gp, GRAPH_COLOR_ABGR, GRAPH_COLOR_ARGB, GRAPH_COLOR_BGR, GRAPH_COLOR_BGRA, GRAPH_COLOR_GRAY, GRAPH_COLOR_MA, GRAPH_COLOR_RGB, GRAPH_COLOR_RGBA, GRAPH_COLOR_UNKNOWN, TGAImage::init(), MSGraph< T >::isNull(), TGAImage::isNull(), JBXL_GRAPH_IVDARG_ERROR, JBXL_GRAPH_NODATA_ERROR, TGAImage::length, TGAImage::point(), setupTGAData(), TGAImage::setzero(), TGAImage::state, MSGraph< T >::xs, TGAImage::xs, MSGraph< T >::ys, TGAImage::ys, and MSGraph< T >::zs.

Here is the call graph for this function:

◆ MSGraph_Box()

template<typename T >
void MSGraph_Box ( MSGraph< T > vp,
int x1,
int y1,
int x2,
int y2,
int cc,
int mode = OFF )

template <typename T> void MSGraph_Box(MSGraph<T> vp, int x1, int y1, int x2, int y2, int cc, int mode=OFF)

点(x1,y1)-(x2,y2)を対角とした四角形を描く．線の濃度は cc．
modeが 1以上なら，四角形の内部を塗りつぶす．

Parameters
vp操作対象となるグラフィックデータ構造体．
(x1,y1),(x2,y2)四角形の対角の座標．
cc線の濃度．
modeON なら四角形の内部の vp.zero〜cc-1 をccで塗りつぶす．
使用例
box(vp, 100, 100, 200, 200, 1000, 0); // 100,100),(200,200)を対角とした四角形を描く

Definition at line 1036 of file Graph.h.

1037{
1038 MSGraph_Line(vp, x1, y1, x2, y1, cc);
1039 MSGraph_Line(vp, x2, y1, x2, y2, cc);
1040 MSGraph_Line(vp, x2, y2, x1, y2, cc);
1041 MSGraph_Line(vp, x1, y2, x1, y1, cc);
1042
1043 if (mode==ON) {
1044 MSGraph_Paint(vp, (x1+x2)/2, (y1+y2)/2, (int)vp.zero, cc-1, cc, 4);
1045 }
1046 return;
1047}
jbxl::MSGraph_Line
void MSGraph_Line(MSGraph< T > vp, int x1, int y1, int x2, int y2, int cc)
Definition Graph.h:939

References MSGraph_Line(), MSGraph_Paint(), ON, and MSGraph< T >::zero.

Here is the call graph for this function:

◆ MSGraph_changeColor()

template<typename T >
void MSGraph_changeColor ( MSGraph< T > vp,
int f,
int t )

Definition at line 769 of file Graph.h.

770{
771 for (int i=0; i<vp.xs*vp.ys*vp.zs; i++) {
772 if (vp.gp[i]==(T)f) vp.gp[i] = (T)t;
773 }
774}

References MSGraph< T >::gp, MSGraph< T >::xs, MSGraph< T >::ys, and MSGraph< T >::zs.

◆ MSGraph_Circle()

template<typename T >
void MSGraph_Circle ( MSGraph< T > vp,
int x,
int y,
int r,
int cc,
int mode = OFF )

template <typename T> void MSGraph_Circle(MSGraph<T> vp, int x, int y, int r, int cc, int mode=OFF)

2Dの円の描画．点(x,y)を中心に半径rで濃度 ccの円を書く．

Parameters
vp操作対象となるグラフィックデータ構造体．
x,y円の中心の座標．
r円の半径．
cc線の濃度．
modeON なら円の内部の vp.zero〜cc-1 をccで塗りつぶす．

Definition at line 1160 of file Graph.h.

1161{
1162 double yy, dy, dt;
1163 int i, nn, cx;
1164 int ix, iy, ux=1;
1165 int *px, *py;
1166
1167 if (r<=0) return;
1168
1169 px = (int*)malloc(sizeof(int)*(r+1));
1170 py = (int*)malloc(sizeof(int)*(r+1));
1171 if (px==NULL || py==NULL) {
1172 if (px!=NULL) free(px);
1173 if (py!=NULL) free(py);
1174 return;
1175 }
1176 memset(px, 0, sizeof(int)*(r+1));
1177 memset(py, 0, sizeof(int)*(r+1));
1178
1179 ix = 0;
1180 iy = r;
1181 yy = (double)r;
1182 nn = 0;
1183 px[0] = ix;
1184 py[0] = iy;
1185
1186 cx = (y+iy)*vp.xs + (x+ix);
1187 if (x+ix>=0 && x+ix<vp.xs && y+iy>=0 && y+iy<vp.ys) vp.gp[cx] = (T)cc;
1188 while(iy>=ix) {
1189 ix = ix + ux;
1190 dt = -ux/yy;
1191 dy = ix*dt;
1192 yy = yy + dy;
1193 iy = (int)yy;
1194
1195 if (x+ix>=0 && x+ix<vp.xs && y+iy>=0 && y+iy<vp.ys) vp.point(x+ix, y+iy) = (T)cc;
1196 nn++;
1197 px[nn] = ix;
1198 py[nn] = iy;
1199 }
1200
1201 for (i=0; i<=nn; i++) {
1202 ix = py[nn-i];
1203 iy = px[nn-i];
1204 if (x+ix>=0 && x+ix<vp.xs && y+iy>=0 && y+iy<vp.ys) vp.point(x+ix, y+iy) = (T)cc;
1205 }
1206
1207 for (i=0; i<=nn; i++) {
1208 ix = py[i];
1209 iy = -px[i];
1210 if (x+ix>=0 && x+ix<vp.xs && y+iy>=0 && y+iy<vp.ys) vp.point(x+ix, y+iy) = (T)cc;
1211 }
1212
1213 for (i=0; i<=nn; i++) {
1214 ix = px[nn-i];
1215 iy = -py[nn-i];
1216 if (x+ix>=0 && x+ix<vp.xs && y+iy>=0 && y+iy<vp.ys) vp.point(x+ix, y+iy) = (T)cc;
1217 }
1218
1219 for (i=0; i<=nn; i++) {
1220 ix = -px[i];
1221 iy = -py[i];
1222 if (x+ix>=0 && x+ix<vp.xs && y+iy>=0 && y+iy<vp.ys) vp.point(x+ix, y+iy) = (T)cc;
1223 }
1224
1225 for (i=0; i<=nn; i++) {
1226 ix = -py[nn-i];
1227 iy = -px[nn-i];
1228 if (x+ix>=0 && x+ix<vp.xs && y+iy>=0 && y+iy<vp.ys) vp.point(x+ix, y+iy) = (T)cc;
1229 }
1230
1231 for (i=0; i<=nn; i++) {
1232 ix = -py[i];
1233 iy = px[i];
1234 if (x+ix>=0 && x+ix<vp.xs && y+iy>=0 && y+iy<vp.ys) vp.point(x+ix, y+iy) = (T)cc;
1235 }
1236
1237 for (i=0; i<=nn; i++) {
1238 ix = -px[nn-i];
1239 iy = py[nn-i];
1240 if (x+ix>=0 && x+ix<vp.xs && y+iy>=0 && y+iy<vp.ys) vp.point(x+ix, y+iy) = (T)cc;
1241 }
1242
1243 if (mode==ON) MSGraph_Paint(vp, x, y, (int)vp.zero, cc-1, cc, 4);
1244
1245 free(px);
1246 free(py);
1247}

References MSGraph< T >::gp, MSGraph_Paint(), ON, MSGraph< T >::point(), MSGraph< T >::xs, MSGraph< T >::ys, and MSGraph< T >::zero.

Referenced by MSGraph_Circle3D(), MSGraph_Pool(), and MSGraph_Sphere().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ MSGraph_Circle3D()

template<typename T >
void MSGraph_Circle3D ( MSGraph< T > vp,
Vector<> ox,
Vector<> ex,
int rr,
int cc,
int mode = OFF )

template <typename T> void MSGraph_Circle3D(MSGraph<T> vp, Vector<> ox, Vector<> ex, int rr, int cc, int mode=OFF)

3D円の描画．

Parameters
vp操作対象となるグラフィックデータ構造体．
ox円の中心の座標ベクトル．
ex円の中心の法線ベクトル．
rr円の半径．
cc線の濃度．
modeON なら円の内部の vp.zero〜cc-1 をccで塗りつぶす．

Definition at line 1263 of file Graph.h.

1264{
1265 MSGraph<T> xp(2*rr+3, 2*rr+3);
1266 if (xp.gp==NULL) return;
1267
1268 Vector<> oz((xp.xs-1)/2., (xp.ys-1)/2., 0.0);
1269
1270 MSGraph_Circle(xp, rr+1, rr+1, rr, cc, mode);
1271 Local2World(vp, xp, ox, oz, ex);
1272 xp.free();
1273}
jbxl::Local2World
void Local2World(MSGraph< T > gd, MSGraph< T > vp, Vector< R > oq, Vector< R > op, Vector< R > ex, double *pcsf=NULL, double *psnf=NULL)
Definition Graph.h:730
jbxl::MSGraph_Circle
void MSGraph_Circle(MSGraph< T > vp, int x, int y, int r, int cc, int mode=OFF)
Definition Graph.h:1160

References MSGraph< T >::free(), MSGraph< T >::gp, Local2World(), MSGraph_Circle(), MSGraph< T >::xs, and MSGraph< T >::ys.

Referenced by MSGraph_Torus(), and wCircle3D().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ MSGraph_Line()

template<typename T >
void MSGraph_Line ( MSGraph< T > vp,
int x1,
int y1,
int x2,
int y2,
int cc )

template <typename T> void MSGraph_Line(MSGraph<T> vp, int x1, int y1, int x2, int y2, int cc)

2Dのラインの描画．点(x1,y1) から点(x2,y2)へ濃度 cc の線を引く．
座標の範囲チェックあり．

Parameters
vp操作対象となるグラフィックデータ構造体．
x1,y1線の始点の座標．
x2,y2線の終点の座標．
cc線の濃度．
使用例
MSGraph_Line(vp, 100, 200, 300, 300, 200); // (100,200)から(300,300)へ濃度 200の線を引く

Definition at line 939 of file Graph.h.

940{
941 int thresh=0, index;
942 int xunit=1;
943 int yunit=1;
944 int xdiff=x2-x1;
945 int ydiff=y2-y1;
946
947 if (xdiff<0) {
948 xdiff = -xdiff;
949 xunit = -1;
950 }
951 if (ydiff<0) {
952 ydiff = -ydiff;
953 yunit = -1;
954 }
955
956 if (xdiff>ydiff) {
957 for (index=0; index<xdiff+1; index++) {
958 if (x1>=0 && x1<vp.xs && y1>=0 && y1<vp.ys) {
959 vp.point(x1, y1) = (T)cc;
960 }
961 x1 = x1 + xunit;
962 thresh = thresh + ydiff;
963 if (thresh>=xdiff) {
964 thresh = thresh - xdiff;
965 y1 = y1 + yunit;
966 }
967 }
968 }
969 else {
970 for (index=0; index<ydiff+1; index++) {
971 if (x1>=0 && x1<vp.xs && y1>=0 && y1<vp.ys) {
972 vp.point(x1, y1) = (T)cc;
973 }
974 y1 = y1 + yunit;
975 thresh = thresh + xdiff;
976 if (thresh>=ydiff) {
977 thresh = thresh - ydiff;
978 x1 = x1 + xunit;
979 }
980 }
981 }
982}

References MSGraph< T >::point(), and MSGraph< T >::ys.

Referenced by MSGraph_Box(), and MSGraph_Triangle().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ MSGraph_Line3D()

template<typename T >
void MSGraph_Line3D ( MSGraph< T > vp,
int x1,
int y1,
int z1,
int x2,
int y2,
int z2,
int cc )

template <typename T> void MSGraph_Line3D(MSGraph<T> vp, int x1, int y1, int z1, int x2, int y2, int z2, int cc)

3Dのラインの描画．点(x1,y1,z1)から点(x2,y2,z2)へ濃度 ccの線を引く．
座標の範囲チェックあり．

Parameters
vp操作対象となるグラフィックデータ構造体．
x1,y1,z1線の始点の座標．
x2,y2,z2線の終点の座標．
cc線の濃度．

Definition at line 1061 of file Graph.h.

1062{
1063 int i;
1064 int xx, yy, zz, dx, dy, dz;
1065 int ux=1, uy=1, uz=1;
1066 int sx=0, sy=0, sz=0;
1067
1068 dx = x2 - x1;
1069 dy = y2 - y1;
1070 dz = z2 - z1;
1071
1072 if (dx<0) {
1073 dx = -dx;
1074 ux = -1;
1075 }
1076 if (dy<0) {
1077 dy = -dy;
1078 uy = -1;
1079 }
1080 if (dz<0) {
1081 dz = -dz;
1082 uz = -1;
1083 }
1084
1085 xx = x1;
1086 yy = y1;
1087 zz = z1;
1088
1089 if (xx>=0 && xx<vp.xs && yy>=0 && yy<vp.ys && zz>=0 && zz<vp.zs) {
1090 vp.point(xx, yy, zz) = (T)cc;
1091 }
1092 if (dx>=dy && dx>=dz) {
1093 for (i=1; i<=dx; i++) {
1094 xx = xx + ux;
1095 sy = sy + dy;
1096 sz = sz + dz;
1097 if (sy>dx) {
1098 sy = sy - dx;
1099 yy = yy + uy;
1100 }
1101 if (sz>dx) {
1102 sz = sz - dx;
1103 zz = zz + uz;
1104 }
1105 if (xx>=0 && xx<vp.xs && yy>=0 && yy<vp.ys && zz>=0 && zz<vp.zs) {
1106 vp.point(xx, yy, zz) = (T)cc;
1107 }
1108 }
1109 }
1110 else if (dy>dx && dy>=dz) {
1111 for (i=1; i<=dy; i++) {
1112 yy = yy + uy;
1113 sx = sx + dx;
1114 sz = sz + dz;
1115 if (sx>dy) {
1116 sx = sx - dy;
1117 xx = xx + ux;
1118 }
1119 if (sz>dy) {
1120 sz = sz - dy;
1121 zz = zz + uz;
1122 }
1123 if (xx>=0 && xx<vp.xs && yy>=0 && yy<vp.ys && zz>=0 && zz<vp.zs) {
1124 vp.point(xx, yy, zz) = (T)cc;
1125 }
1126 }
1127 }
1128 else {
1129 for (i=1; i<=dz; i++) {
1130 zz = zz + uz;
1131 sx = sx + dx;
1132 sy = sy + dy;
1133 if (sx>dz) {
1134 sx = sx - dz;
1135 xx = xx + ux;
1136 }
1137 if (sy>dz) {
1138 sy = sy - dz;
1139 yy = yy + uy;
1140 }
1141 if (xx>=0 && xx<vp.xs && yy>=0 && yy<vp.ys && zz>=0 && zz<vp.zs) {
1142 vp.point(xx, yy, zz) = (T)cc;
1143 }
1144 }
1145 }
1146}

References MSGraph< T >::point(), and MSGraph< T >::zs.

Here is the call graph for this function:

◆ MSGraph_Paint()

template<typename T >
int MSGraph_Paint ( MSGraph< T > vp,
int x,
int y,
int mn,
int mx,
int cc,
int mode = 8 )

template <typename T> int MSGraph_Paint(MSGraph<T> vp, int x, int y, int mn, int mx, int cc, int mode=8)

2Dグラフィックの塗りつぶし．
2Dグラフィック vpの点(x,y)から始めて, mn〜mx の輝度値を cc で塗りつぶす．

Parameters
vpグラフィックデータ構造体．
x塗りつぶしを始める点の x座標．
y塗りつぶしを始める点の y座標．
mn塗りつぶされる輝度値の最小値
mx塗りつぶされる輝度値の最大値．
cc塗りつぶしの輝度値．
modeモード． 8：8近傍の塗りつぶし． その他：4近傍の塗りつぶし
Returns
塗りつぶした面積（ピクセル数）

Definition at line 793 of file Graph.h.

794{
795 int i, j, k, ss;
796
797 if (cc<=mx && cc>=mn) {
798 DEBUG_MODE PRINT_MESG("WARNING: MSGraph_Paint: c = %d. Not be %d< c <%d\n", cc, mn, mx);
799 return 0;
800 }
801
802 if (x<0 || x>=vp.xs || y<0 || y>=vp.ys) return 0;
803 if (vp.gp[y*vp.xs+x]>(T)mx || vp.gp[y*vp.xs+x]<(T)mn) return 0;
804
805 while(x>0) {
806 if (vp.gp[y*vp.xs+x-1]>(T)mx || vp.gp[y*vp.xs+x-1]<(T)mn) break;
807 x--;
808 }
809 k = x;
810
811 ss = 0;
812 while(k<vp.xs) {
813 if (vp.gp[y*vp.xs+k]>(T)mx || vp.gp[y*vp.xs+k]<(T)mn) break;
814 vp.gp[y*vp.xs+k] = (T)cc;
815 ss++;
816 k++;
817 }
818 k--;
819
820 for (i=x; i<=k; i++){
821 if (y-1>=0 && y-1<vp.ys){
822 j = (y-1)*vp.xs+i;
823 if (vp.gp[j]<=(T)mx && vp.gp[j]>=(T)mn) {
824 ss += MSGraph_Paint(vp, i, y-1, mn, mx, cc, mode);
825 }
826
827 if (Xabs(mode)==8) { // 8-neighborhood
828 if (i-1>=0) {
829 if (vp.gp[j-1]<=(T)mx && vp.gp[j-1]>=(T)mn) {
830 ss += MSGraph_Paint(vp, i-1, y-1, mn, mx, cc, mode);
831 }
832 }
833 if (i+1<vp.xs) {
834 if (vp.gp[j+1]<=(T)mx && vp.gp[j+1]>=(T)mn) {
835 ss += MSGraph_Paint(vp, i+1, y-1, mn, mx, cc, mode);
836 }
837 }
838 }
839 }
840
841 if (y+1>=0 && y+1<vp.ys){
842 j = (y+1)*vp.xs+i;
843 if (vp.gp[j]<=(T)mx && vp.gp[j]>=(T)mn) {
844 ss += MSGraph_Paint(vp, i, y+1, mn, mx, cc, mode);
845 }
846
847 if (Xabs(mode)==8) { // 8-neighborhood
848 if (i-1>=0) {
849 if (vp.gp[j-1]<=(T)mx && vp.gp[j-1]>=(T)mn) {
850 ss += MSGraph_Paint(vp, i-1, y+1, mn, mx, cc, mode);
851 }
852 }
853 if (i+1<vp.xs) {
854 if (vp.gp[j+1]<=(T)mx && vp.gp[j+1]>=(T)mn) {
855 ss += MSGraph_Paint(vp, i+1, y+1, mn, mx, cc, mode);
856 }
857 }
858 }
859 }
860 }
861 return ss;
862}

References DEBUG_MODE, MSGraph< T >::gp, MSGraph_Paint(), PRINT_MESG, Xabs, MSGraph< T >::xs, and MSGraph< T >::ys.

Referenced by count_object_MSGraph(), Density_Mask(), MSGraph_Box(), MSGraph_Circle(), MSGraph_Paint(), MSGraph_Paint3D(), MSGraph_Triangle(), and object_feature_MSGraph().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ MSGraph_Paint3D()

template<typename T >
int MSGraph_Paint3D ( MSGraph< T > vp,
int x,
int y,
int z,
int mn,
int mx,
int cc,
int mode = 8 )

template <typename T> int MSGraph_Paint3D(MSGraph<T> vp, int x, int y, int z, int mn, int mx, int cc, int mode=8)

3Dグラフィックの塗りつぶし．
3Dグラフィック vpの点(x,y,z)から始めて, mn〜mx の輝度値を cc で塗りつぶす．

Parameters
vpグラフィックデータ構造体．
x塗りつぶしを始める点の x座標．
y塗りつぶしを始める点の y座標．
z塗りつぶしを始める点の z座標．
mn塗りつぶされる輝度値の最小値
mx塗りつぶされる輝度値の最大値．
cc塗りつぶしの輝度値．
modeモード．マイナスの場合は途中経過（z）を表示．
+-8：平面上で8近傍の塗りつぶし． その他：平面上で4近傍の塗りつぶし
Returns
塗りつぶした体積（ボクセル数）

Definition at line 883 of file Graph.h.

884{
885 int i, j, ps, ss;
886 MSGraph<T> xp;
887
888 ss = 0;
889 ps = vp.xs*vp.ys;
890 xp = vp;
891 xp.zs = 1;
892 xp.gp = &(vp.gp[z*ps]);
893
894 if (xp.gp[y*xp.xs+x]>(T)mx || xp.gp[y*xp.xs+x]<(T)mn) return 0;
895 ss += MSGraph_Paint(xp, x, y, mn, mx, cc, mode);
896 if (mode<0) {
897 DEBUG_MODE PRINT_MESG("WARNING: MSGraph_Paint3D: zz = %d\n", z);
898 }
899
900 for (i=0; i<ps; i++) {
901 if (xp.gp[i]==(T)cc) {
902 x = i%vp.xs;
903 y = i/vp.xs;
904 if (z-1>=0) {
905 j = (z-1)*ps+y*vp.xs+x;
906 if (vp.gp[j]<=(T)mx && vp.gp[j]>=(T)mn) {
907 ss += MSGraph_Paint3D(vp, x, y, z-1, mn, mx, cc, mode);
908 }
909 }
910 if (z+1<vp.zs) {
911 j = (z+1)*ps+y*vp.xs+x;
912 if (vp.gp[j]<=(T)mx && vp.gp[j]>=(T)mn) {
913 ss += MSGraph_Paint3D(vp, x, y, z+1, mn, mx, cc, mode);
914 }
915 }
916 }
917 }
918
919 return ss;
920}
jbxl::MSGraph_Paint3D
int MSGraph_Paint3D(MSGraph< T > vp, int x, int y, int z, int mn, int mx, int cc, int mode=8)
Definition Graph.h:883

References DEBUG_MODE, MSGraph< T >::gp, MSGraph_Paint(), MSGraph_Paint3D(), PRINT_MESG, MSGraph< T >::xs, MSGraph< T >::ys, and MSGraph< T >::zs.

Referenced by MSGraph_Paint3D().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ MSGraph_Pool()

template<typename T >
void MSGraph_Pool ( MSGraph< T > vp,
Vector<> a,
Vector<> b,
int rr,
int cc )

template <typename T> void MSGraph_Pool(MSGraph<T> vp, Vector<> a, Vector<> b, int rr, int cc)

3D円柱の描画．中身はccで塗りつぶされる．

Parameters
vp操作対象となるグラフィックデータ構造体．
a円柱上面の円の中心の座標ベクトル．
b円柱底面の円の中心の座標ベクトル．
rr円柱の半径．
cc線と塗りつぶしの濃度．

Definition at line 1288 of file Graph.h.

1289{
1290 int i, cz;
1291 Vector<> ox, oz;
1292 MSGraph<T> xp, pp;
1293
1294 ox = a - b;
1295 ox.norm();
1296 xp.set(2*rr+3, 2*rr+3, (int)(ox.n + 0.5));
1297 if (xp.gp==NULL) return;
1298
1299 pp = xp;
1300 for (i=0; i<xp.zs; i++) {
1301 cz = i*xp.xs*xp.ys;
1302 pp.gp = &(xp.gp[cz]);
1303 MSGraph_Circle(pp, rr+1, rr+1, rr, cc, ON);
1304 }
1305
1306 oz.set((xp.xs-1)/2.0, (xp.ys-1)/2.0, (xp.zs-1)/2.0);
1307 Local2World(vp, xp, (a+b)/2.0, oz, ox);
1308 xp.free();
1309 return;
1310}
jbxl::Vector::set
void set(T X, T Y=0, T Z=0, double N=0.0, double C=1.0, int D=0)
Definition Vector.h:110

References MSGraph< T >::free(), MSGraph< T >::gp, Local2World(), MSGraph_Circle(), Vector< T >::n, Vector< T >::norm(), ON, MSGraph< T >::set(), Vector< T >::set(), MSGraph< T >::xs, MSGraph< T >::ys, and MSGraph< T >::zs.

Here is the call graph for this function:

◆ MSGraph_Sphere()

template<typename T >
void MSGraph_Sphere ( MSGraph< T > vp,
Vector<> a,
int r,
int cc,
int mode = 1 )

template <typename T> void MSGraph_Sphere(MSGraph<T> vp, Vector<> a, int r, int cc, int mode=1)

球の描画．境界チェックあり．

Parameters
vp操作対象となるグラフィックデータ構造体．
a球の中心の座標ベクトル．
r球の半径．
cc線と塗りつぶしの濃度(mode=1のとき)
modeモード．
1: 円を重ねて球を作る．中身はccで塗りつぶされる．それぞれの円の中心が，領域内にないと塗りつぶしに失敗する．
-1: 極座標で球を作る．vpとの境界に壁を作る．set_vPoint()を使用．
それ以外: 極座標で球を作る．set_vPoint()を使用．

Definition at line 1373 of file Graph.h.

1374{
1375 int i, j, k, rx, nn, s=1; // s: 壁を作る場合の境界からの距離
1376 double th, fi, cs, sn, cf, sf, dt;
1377 double xx, yy, zz;
1378 MSGraph<T> xp;
1379
1380 if (mode==1) {
1381 xp = vp;
1382 for (k=(int)(a.z-r+0.5); k<=(int)(a.z+r+0.5); k++) {
1383 if (k>=0 && k<vp.zs) {
1384 xp.gp = &vp.gp[k*vp.xs*vp.ys];
1385 rx = (int)(sqrt(r*r-(a.z-k)*(a.z-k))+0.5);
1386 MSGraph_Circle(xp, (int)(a.x+0.5), (int)(a.y+0.5), rx, cc, ON);
1387 }
1388 }
1389 }
1390 else {
1391 nn = (int)(2*PI*r + 0.5)*2;
1392 dt = PI/nn;
1393 for (i=0; i<=nn; i++) {
1394 th = dt*i;
1395 sn = sin(th);
1396 cs = cos(th);
1397 zz = r*cs + a.z;
1398 if (mode==-1) {
1399 if (zz<s) zz = s;
1400 if (zz>vp.zs-s-1) zz = vp.zs - s - 1;
1401 }
1402 for (j=0; j<=2*nn; j++) {
1403 fi = dt*j;
1404 cf = cos(fi);
1405 sf = sin(fi);
1406 xx = r*sn*cf + a.x;
1407 yy = r*sn*sf + a.y;
1408 if (mode==-1) {
1409 if (xx<s) xx = s;
1410 if (yy<s) yy = s;
1411 if (xx>vp.xs-s-1) xx = vp.xs - s - 1;
1412 if (yy>vp.ys-s-1) yy = vp.ys - s - 1;
1413 }
1414 vp.set_vPoint(xx, yy, zz, (T)cc, ON);
1415 }
1416 }
1417 }
1418 return;
1419}

References MSGraph< T >::gp, MSGraph_Circle(), ON, PI, MSGraph< T >::set_vPoint(), Vector< T >::x, MSGraph< T >::xs, Vector< T >::y, MSGraph< T >::ys, Vector< T >::z, and MSGraph< T >::zs.

Here is the call graph for this function:

◆ MSGraph_Torus()

template<typename T >
void MSGraph_Torus ( MSGraph< T > vp,
Vector<> ox,
Vector<> ex,
int rr,
int ra,
int cc )

template <typename T>
void MSGraph_Torus(MSGraph<T> vp, Vector<> ox, Vector<> ex, int rr, int ra, int cc)

3Dトーラスの描画．中身はccで塗りつぶされる．

Parameters
vp操作対象となるグラフィックデータ構造体．
oxトーラスの中心の座標ベクトル．
exトーラスの中心の法線ベクトル．
rrトーラスの半径(トーラスの中心から断面の円の中心まで)．
raトーラスの断面の円の半径
cc線と塗りつぶしの濃度．

Definition at line 1327 of file Graph.h.

1328{
1329 int i, nn;
1330 double dt, th, xx, yy, zz, sn, cs;
1331 MSGraph<T> xp;
1332 Vector<> ve, vo, vz;
1333
1334 xp.set(2*(rr+ra)+3, 2*(rr+ra)+3, 2*ra+3);
1335 if (xp.gp==NULL) return;
1336 nn = (int)(2.0*PI*(rr+ra)*2 + 0.5);
1337 dt = 2.0*PI/nn;
1338
1339 zz = (xp.zs-1)/2.0;
1340 for (i=0; i<nn; i++) {
1341 th = dt*i;
1342 sn = sin(th);
1343 cs = cos(th);
1344 xx = (xp.xs-1)/2.0 + rr*cs;
1345 yy = (xp.ys-1)/2.0 - rr*sn;
1346 vo.set(xx, yy, zz);
1347 ve.set(sn, cs, 0.0);
1348 MSGraph_Circle3D(xp, vo, ve, ra, cc, ON);
1349 }
1350 vz.set((xp.xs-1)/2., (xp.ys-1)/2., (xp.zs-1)/2.);
1351
1352 Local2World(vp, xp, ox, vz, ex);
1353 xp.free();
1354
1355 return;
1356}
jbxl::MSGraph_Circle3D
void MSGraph_Circle3D(MSGraph< T > vp, Vector<> ox, Vector<> ex, int rr, int cc, int mode=OFF)
Definition Graph.h:1263

References MSGraph< T >::free(), MSGraph< T >::gp, Local2World(), MSGraph_Circle3D(), ON, PI, MSGraph< T >::set(), Vector< T >::set(), MSGraph< T >::xs, MSGraph< T >::ys, and MSGraph< T >::zs.

Here is the call graph for this function:

◆ MSGraph_Triangle()

template<typename T >
void MSGraph_Triangle ( MSGraph< T > vp,
int x1,
int y1,
int x2,
int y2,
int x3,
int y3,
int cc,
int mode = OFF )

template <typename T> void MSGraph_Triangle(MSGraph<T> vp, int x1, int y1, int x2, int y2, int x3, int y3, int cc, int mode=OFF)

2Dの三角形の描画．

点(x1,y1),(x2,y2),(x3,y3)の三点を頂点とした三角形を描く．
線の濃度は cc． modeが 1以上なら，三角形の内部を塗りつぶす．

Parameters
vp操作対象となるグラフィックデータ構造体．
x1,y1三角形の頂点1の座標．
x2,y2三角形の頂点2の座標．
x3,y3三角形の頂点3の座標．
cc線の濃度．
modeON なら三角形の内部の vp.zero〜cc-1 をccで塗りつぶす．
使用例
// (100,100),(100,200),(200,100)を頂点とした三角形(直角三角形)を描き，内部を塗りつぶす
triangle(vp, 100, 100, 100, 200, 200, 100, 1000, 1);

Definition at line 1007 of file Graph.h.

1008{
1009 MSGraph_Line(vp, x1, y1, x2, y2, cc);
1010 MSGraph_Line(vp, x2, y2, x3, y3, cc);
1011 MSGraph_Line(vp, x3, y3, x1, y1, cc);
1012
1013 if (mode==ON) {
1014 MSGraph_Paint(vp, (x1+x2+x3)/3, (y1+y2+y3)/3, (int)vp.zero, cc-1, cc, 4);
1015 }
1016 return;
1017}

References MSGraph_Line(), MSGraph_Paint(), ON, and MSGraph< T >::zero.

Here is the call graph for this function:

◆ MSMaskFilter()

template<typename R , typename T >
MSGraph< R > MSMaskFilter ( MSGraph< R > vp,
MSGraph< T > filter,
int mode = FILTER_NON )

Definition at line 988 of file Gmt.h.

989{
990 MSGraph<R> xp;
991
992 if (vp.xs<filter.xs || vp.ys<filter.ys || vp.zs<filter.zs) {
993 DEBUG_MODE PRINT_MESG("MSMaskFilter: Error: mismach filter dimension!!\n");
994 xp.state = JBXL_GRAPH_NODATA_ERROR;
995 return xp;
996 }
997 if (filter.norm==0.0) {
998 DEBUG_MODE PRINT_MESG("MSMaskFilter: Error: norm of filter is zero!!\n");
999 xp.state = JBXL_GRAPH_NODATA_ERROR;
1000 return xp;
1001 }
1002
1003 xp.mimicry(vp);
1004
1005 int xs = filter.xs/2;
1006 int ys = filter.ys/2;
1007 int zs = filter.zs/2;
1008
1009 for (int k=zs; k<xp.zs-zs; k++) {
1010 for (int j=ys; j<xp.ys-ys; j++) {
1011 for (int i=xs; i<xp.xs-xs; i++) {
1012
1013 T conv = (T)0;
1014 for (int n=-zs; n<=zs; n++) {
1015 for (int m=-ys; m<=ys; m++) {
1016 for (int l=-xs; l<=xs; l++) {
1017 conv += filter.point(xs+l, ys+m, zs+n) * vp.point(i+l, j+m, k+n);
1018 }
1019 }
1020 }
1021
1022 R pt = (R)(conv/filter.norm);
1023
1024 if (mode==FILTER_ABS && pt<(R)0) pt = -pt;
1025 else if (mode==FILTER_MINMAX) {
1026 if (pt<(R)vp.min) pt = (R)vp.min;
1027 else if (pt>(R)vp.max) pt = (R)vp.max;
1028 }
1029 xp.point(i, j, k) = pt;
1030 }
1031 }
1032 }
1033
1034 xp.get_minmax();
1035 if (mode==FILTER_NORM && xp.max!=xp.min) {
1036 for (int i=0; i<xp.xs*xp.ys*xp.zs; i++) {
1037 xp.gp[i] = (R)(((T)(xp.gp[i]-xp.min)*(vp.max-vp.min))/(xp.max-xp.min) + vp.min);
1038 }
1039 xp.get_minmax();
1040 }
1041
1042 return xp;
1043}
FILTER_MINMAX
#define FILTER_MINMAX
元のデータの範囲に限定
Definition Gmt.h:981
FILTER_NORM
#define FILTER_NORM
元のデータの範囲に伸張
Definition Gmt.h:982
FILTER_ABS
#define FILTER_ABS
絶対値
Definition Gmt.h:980
jbxl::MSGraph::norm
double norm
規格化定数．フィルタのときに使用．
Definition Gdata.h:93

References DEBUG_MODE, FILTER_ABS, FILTER_MINMAX, FILTER_NORM, MSGraph< T >::get_minmax(), MSGraph< T >::gp, JBXL_GRAPH_NODATA_ERROR, MSGraph< T >::max, MSGraph< T >::mimicry(), MSGraph< T >::min, MSGraph< T >::norm, MSGraph< T >::point(), PRINT_MESG, MSGraph< T >::state, MSGraph< T >::xs, MSGraph< T >::ys, and MSGraph< T >::zs.

Here is the call graph for this function:

◆ Nabla()

template<typename R , typename T >
MSGraph< R > Nabla ( MSGraph< T > vp)

template <typename R, typename T> MSGraph<R> Nabla(MSGraph<T> vp)

グラフィックデータの ナブラの絶対値を計算する(Sobel)．

Parameters
vp計算対象となるグラフィックデータ構造体．
Returns
ナブラ．スカラ型グラフィックデータ．

Definition at line 707 of file Gmt.h.

708{
709 int i;
710 R xx, yy, zz;
711 MSGraph<R> px, py, pz, nv;
712
713 nv.mimicry(vp);
714 if (nv.isNull()) {
715 DEBUG_MODE PRINT_MESG("Nabla: No More Memory!!\n");
716 nv.state = JBXL_GRAPH_MEMORY_ERROR;
717 return nv;
718 }
719
720 px = xSobel<R>(vp);
721 if (px.gp==NULL) {
722 nv.state = px.state;
723 return nv;
724 }
725
726 py = ySobel<R>(vp);
727 if (py.gp==NULL) {
728 px.free();
729 nv.state = py.state;
730 return nv;
731 }
732
733 pz = zSobel<R>(vp);
734 if (pz.gp==NULL) {
735 px.free();
736 py.free();
737 nv.state = pz.state;
738 return nv;
739 }
740
741 for (i=0; i<vp.xs*vp.ys*vp.zs; i++) {
742 xx = px.gp[i];
743 yy = py.gp[i];
744 zz = pz.gp[i];
745 nv.gp[i] = (R)sqrt((double)xx*xx + yy*yy + zz*zz);
746 }
747
748 px.free();
749 py.free();
750 pz.free();
751
752 return nv;
753}

References DEBUG_MODE, MSGraph< T >::free(), MSGraph< T >::gp, MSGraph< T >::isNull(), JBXL_GRAPH_MEMORY_ERROR, MSGraph< T >::mimicry(), PRINT_MESG, MSGraph< T >::state, MSGraph< T >::xs, MSGraph< T >::ys, and MSGraph< T >::zs.

Here is the call graph for this function:

◆ newAffineTrans()

template<typename T >
AffineTrans< T > * newAffineTrans ( AffineTrans< T > p)
inline

Definition at line 151 of file AffineTrans.h.

152{
153 AffineTrans<T>* a = new AffineTrans<T>();
154 a->dup(p);
155 return a;
156}
jbxl::AffineTrans::dup
void dup(AffineTrans a)

References AffineTrans< T >::dup().

Here is the call graph for this function:

◆ NewellMethod()

template<typename T >
Vector< T > NewellMethod ( Vector< T > v1,
Vector< T > v2,
Vector< T > v3 )
inline

Definition at line 288 of file Vector.h.

289{
290 Vector<T> vect;
291
292 vect.x = (v1.y-v2.y)*(v1.z+v2.z) + (v2.y-v3.y)*(v2.z+v3.z) + (v3.y-v1.y)*(v3.z+v1.z);
293 vect.y = (v1.z-v2.z)*(v1.x+v2.x) + (v2.z-v3.z)*(v2.x+v3.x) + (v3.z-v1.z)*(v3.x+v1.x);
294 vect.z = (v1.x-v2.x)*(v1.y+v2.y) + (v2.x-v3.x)*(v2.y+v3.y) + (v3.x-v1.x)*(v3.y+v1.y);
295 vect.n = 0.0;
296 vect.c = Min(v1.c, v2.c);
297 vect.c = Min(v3.c, vect.c);
298
299 return vect;
300}

References Vector< T >::c, Min, Vector< T >::n, Vector< T >::x, Vector< T >::y, and Vector< T >::z.

Referenced by ContourTriData::ComputeTriNormal(), TriPolygonData::ComputeTriNormal(), and NewellMethod3().

Here is the caller graph for this function:

◆ NewellMethod3()

template<typename T >
Vector< T > NewellMethod3 ( Vector< T > v1,
Vector< T > v2,
Vector< T > v3 )
inline

Definition at line 303 of file Vector.h.

304{
305 return NewellMethod(v1, v2, v3);
306}
jbxl::NewellMethod
Vector< T > NewellMethod(Vector< T > v1, Vector< T > v2, Vector< T > v3)
Normal Vector of 3 Vectors with Newell Mothod.
Definition Vector.h:288

References NewellMethod().

Here is the call graph for this function:

◆ NewellMethod4()

template<typename T >
Vector< T > NewellMethod4 ( Vector< T > v1,
Vector< T > v2,
Vector< T > v3,
Vector< T > v4 )
inline

Definition at line 309 of file Vector.h.

310{
311 Vector<T> vect;
312
313 vect.x = (v1.y-v2.y)*(v1.z+v2.z) + (v2.y-v3.y)*(v2.z+v3.z) + (v3.y-v4.y)*(v3.z+v4.z) + (v4.y-v1.y)*(v4.z+v1.z);
314 vect.y = (v1.z-v2.z)*(v1.x+v2.x) + (v2.z-v3.z)*(v2.x+v3.x) + (v3.z-v4.z)*(v3.x+v4.x) + (v4.z-v1.z)*(v4.x+v1.x);
315 vect.z = (v1.x-v2.x)*(v1.y+v2.y) + (v2.x-v3.x)*(v2.y+v3.y) + (v3.x-v4.x)*(v3.y+v4.y) + (v4.x-v1.x)*(v4.y+v1.y);
316 vect.n = 0.0;
317 vect.c = Min(v1.c, v2.c);
318 vect.c = Min(v3.c, vect.c);
319 vect.c = Min(v4.c, vect.c);
320 return vect;
321}

References Vector< T >::c, Min, Vector< T >::n, Vector< T >::x, Vector< T >::y, and Vector< T >::z.

◆ newMaterialParam()

MaterialParam * newMaterialParam ( MaterialParam p)
inline

Definition at line 243 of file MaterialParam.h.

243{ MaterialParam* m = new MaterialParam(); m->dup(p); return m;}
jbxl::MaterialParam::dup
void dup(MaterialParam m)
Definition MaterialParam.cpp:244

References MaterialParam::dup().

Here is the call graph for this function:

◆ nonZeroBoxel()

template<typename T >
int nonZeroBoxel ( MSGraph< T > vp,
int n )

Definition at line 216 of file Thinning.h.

217{
218 int m, xs, ps;
219
220 ps = vp.xs*vp.ys;
221 xs = vp.xs;
222
223 m = 0;
224 if (vp.gp[n+1] !=0) m++;
225 if (vp.gp[n-1] !=0) m++;
226 if (vp.gp[n+xs] !=0) m++;
227 if (vp.gp[n-xs] !=0) m++;
228 if (vp.gp[n+ps] !=0) m++;
229 if (vp.gp[n-ps] !=0) m++;
230 if (vp.gp[n+1+xs] !=0) m++;
231 if (vp.gp[n+1-xs] !=0) m++;
232 if (vp.gp[n-1+xs] !=0) m++;
233 if (vp.gp[n-1-xs] !=0) m++;
234 if (vp.gp[n+1+ps] !=0) m++;
235 if (vp.gp[n+1-ps] !=0) m++;
236 if (vp.gp[n-1+ps] !=0) m++;
237 if (vp.gp[n-1-ps] !=0) m++;
238 if (vp.gp[n+xs+ps] !=0) m++;
239 if (vp.gp[n+xs-ps] !=0) m++;
240 if (vp.gp[n-xs+ps] !=0) m++;
241 if (vp.gp[n-xs-ps] !=0) m++;
242 if (vp.gp[n+1+xs+ps]!=0) m++;
243 if (vp.gp[n+1+xs-ps]!=0) m++;
244 if (vp.gp[n+1-xs+ps]!=0) m++;
245 if (vp.gp[n+1-xs-ps]!=0) m++;
246 if (vp.gp[n-1+xs+ps]!=0) m++;
247 if (vp.gp[n-1+xs-ps]!=0) m++;
248 if (vp.gp[n-1-xs+ps]!=0) m++;
249 if (vp.gp[n-1-xs-ps]!=0) m++;
250
251 return m;
252}

References MSGraph< T >::gp, MSGraph< T >::xs, and MSGraph< T >::ys.

Referenced by centerLine().

Here is the caller graph for this function:

◆ object_feature_MSGraph()

template<typename T >
Vector< double > object_feature_MSGraph ( MSGraph< T > vp,
int mn,
int mx )

template <typename T> Vector<double> object_feature_MSGraph(MSGraph<T> vp, int mn, int mx)

2D画像において，mn〜mxの輝度値のオブジェクトの分散度（円形度の逆数）を計算する．
穴空きのオブジェクトも計算可能．独自アルゴリズム．

Parameters
vp画像データ
mn輝度値の最小
mx輝度値の最大
Return values
Vector<double>.x領域の個数
Vector<double>.y全面積
Vector<double>.z分散度

Definition at line 126 of file Graph.h.

127{
128 int cnt = 0;
129 int nx, ny;
130 MSGraph<T> pp;
131 Vector<double> vt;
132
133 pp.mimicry(vp);
134 for (int i=0; i<pp.xs*pp.ys*pp.zs; i++) pp.gp[i] = vp.gp[i];
135
136 MSGraph_Paint(pp, 0, 0, pp.zero, pp.zero, mx+1, 4);
137
138 for (int j=0; j<pp.ys; j++) {
139 ny = pp.xs*j;
140 for (int i=0; i<pp.xs; i++) {
141 nx = ny + i;
142 if (pp.gp[nx]==pp.zero) {
143 MSGraph_Paint(pp, i, j, pp.zero, pp.zero, mx, 8);
144 }
145 }
146 }
147
148 MSGraph_Paint(pp, 0, 0, mx+1, mx+1, pp.zero, 4);
149
150 vt = dgree_circle_MSGraph<T>(pp);
151
152 for (int j=0; j<pp.ys; j++) {
153 ny = pp.xs*j;
154 for (int i=0; i<pp.xs; i++) {
155 nx = ny + i;
156 if (pp.gp[nx]>=mn && pp.gp[nx]<=mx) {
157 MSGraph_Paint(pp, i, j, mn, mx, pp.zero, 8);
158 cnt++;
159 }
160 }
161 }
162 pp.free();
163 vt.x = (double)cnt;
164
165 return vt;
166}

References MSGraph< T >::free(), MSGraph< T >::gp, MSGraph< T >::mimicry(), MSGraph_Paint(), Vector< T >::x, MSGraph< T >::xs, MSGraph< T >::ys, MSGraph< T >::zero, and MSGraph< T >::zs.

Here is the call graph for this function:

◆ OctreeGetter()

long int OctreeGetter ( OctreeNode * p,
BREP_VERTEX ** vtx,
long int counter )

Definition at line 932 of file Brep.cpp.

933{
934 if (p->vertex!=NULL) {
935 if (vtx!=NULL && p->vertex->index>=0) vtx[p->vertex->index] = p->vertex;
936 counter++;
937 }
938
939 for (int i=0; i<8; i++) {
940 if (p->child[i]!=NULL) {
941 counter = OctreeGetter(p->child[i], vtx, counter);
942 }
943 }
944
945 return counter;
946}
jbxl::BREP_VERTEX::index
long int index
シーケンシャルに増加する一意的な番号．Octree に格納されるときに設定される．
Definition Brep.h:266
jbxl::OctreeNode::child
OctreeNode * child[8]
Definition Brep.h:298

References OctreeNode::child, BREP_VERTEX::index, OctreeGetter(), and OctreeNode::vertex.

Referenced by GetOctreeVertices(), and OctreeGetter().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ opening_morph()

template<typename T >
MSGraph< T > opening_morph ( MSGraph< T > vp,
MSGraph< T > xp,
int cc )

template <typename T> MSGraph<T> opening_morph(MSGraph<T> vp, MSGraph<T> xp, int cc)

画像vpに対して，エレメントxpで，modeのモルフォロジー演算のオープニングを行う．
元画像は保持される．

Parameters
vp処理対象の元データ
xpエレメント画像
cc閾値．この輝度値以上の画素に対して演算を行う
Returns
処理結果の画像

Definition at line 75 of file Morph.h.

76{
77 int i, j, k, ks, cz, cy, cx, ps;
78 bool err;
79 MSGraph<T> wp(vp.xs, vp.ys, vp.zs);
80 if (wp.isNull()) return wp;
81
82 ps = vp.xs*vp.ys;
83 for (k=0; k<vp.zs; k++) {
84 cz = k*ps;
85 for (j=0; j<vp.ys; j++) {
86 cy = cz + j*vp.xs;
87 for (i=0; i<vp.xs; i++) {
88 cx = cy + i;
89 if (vp.gp[cx]>=cc) {
90 err = point_open_morph(vp, i, j, k, xp, cc);
91 if (err) copy_morph_element(wp, i, j, k, xp);
92 }
93 }
94 }
95 }
96 return wp;
97}
jbxl::point_open_morph
bool point_open_morph(MSGraph< T > vp, int x, int y, int z, MSGraph< T > xp, int cc)
Definition Morph.h:105

References copy_morph_element(), MSGraph< T >::gp, MSGraph< T >::isNull(), point_open_morph(), MSGraph< T >::xs, MSGraph< T >::ys, and MSGraph< T >::zs.

Referenced by Morphology().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ operator!=() [1/5]

template<typename T >
bool operator!= ( const Quaternion< T > q1,
const Quaternion< T > q2 )
inline

Definition at line 109 of file Rotation.h.

References Quaternion< T >::s, Quaternion< T >::x, Quaternion< T >::y, and Quaternion< T >::z.

◆ operator!=() [2/5]

template<typename T >
bool operator!= ( const TVector< T > v1,
const TVector< T > v2 )
inline

Definition at line 154 of file TVector.h.

155{
156 T dst = (v1.x-v2.x)*(v1.x-v2.x) + (v1.y-v2.y)*(v1.y-v2.y) + (v1.z-v2.z)*(v1.z-v2.z);
157 T err = (v1.t+v2.t)*(v1.t+v2.t);
158 if (dst>err) return true;
159 return false;
160}

References TVector< T >::t, Vector< T >::x, Vector< T >::y, and Vector< T >::z.

◆ operator!=() [3/5]

template<typename T >
bool operator!= ( const UVMap< T > a,
const UVMap< T > b )
inline

Definition at line 676 of file Vector.h.

677{ return (a.u != b.u || a.v != b.v); }

References UVMap< T >::u, and UVMap< T >::v.

◆ operator!=() [4/5]

template<typename T >
bool operator!= ( const Vector4< T > v1,
const Vector4< T > v2 )
inline

Definition at line 855 of file Vector.h.

856{ return (v1.x != v2.x || v1.y != v2.y || v1.z != v2.z || v1.t != v2.t); }

References Vector4< T >::t, Vector4< T >::x, Vector4< T >::y, and Vector4< T >::z.

◆ operator!=() [5/5]

template<typename T >
bool operator!= ( const Vector< T > v1,
const Vector< T > v2 )
inline

Definition at line 209 of file Vector.h.

210{ return (v1.x != v2.x || v1.y != v2.y || v1.z != v2.z); }

References Vector< T >::x, Vector< T >::y, and Vector< T >::z.

◆ operator*() [1/21]

template<typename T >
AffineTrans< T > operator* ( AffineTrans< T > a,
AffineTrans< T > b )
inline

変換の合成：A*B => Bの変換 -> Aの変換

Definition at line 163 of file AffineTrans.h.

164{
165 a.computeMatrix();
166 b.computeMatrix();
167
168 AffineTrans<T> affine;
169 for (int i=1; i<=4; i++) {
170 for (int j=1; j<=4; j++) {
171 T sum = (T)0.0;
172 for (int k=1; k<=4; k++) {
173 sum += a.element(i, k) * b.element(k, j);
174 }
175 affine.element(i, j, sum);
176 }
177 }
178 affine.computeComponents();
179
180 return affine;
181}
jbxl::AffineTrans::computeMatrix
void computeMatrix(bool with_scale=true)
Definition AffineTrans.h:326
jbxl::AffineTrans::computeComponents
void computeComponents(void)
Definition AffineTrans.h:369
jbxl::AffineTrans::element
void element(int i, int j, T v)
Definition AffineTrans.h:88

References AffineTrans< T >::computeComponents(), AffineTrans< T >::computeMatrix(), and AffineTrans< T >::element().

Here is the call graph for this function:

◆ operator*() [2/21]

template<typename T >
Matrix< T > operator* ( const Matrix< T > a,
const Matrix< T > b )

template <typename T> Matrix<T> operator * (const Matrix<T> a, const Matrix<T> b)

マトリックスの掛け算．
マトリックス a, bを掛け算して，結果のマトリックスを返す．

Parameters
a掛けられるマトリックス．
b掛けるマトリックス．
Returns
掛け算結果のマトリックス．掛け算不能，または失敗の場合は空のマトリックス．

Definition at line 285 of file Matrix++.h.

286{
287 int i, j, k, n, ii, aa, bb;
288 int *sz, *sa, *sb, *sc, *cx;
289 T st;
290 Matrix<T> c;
291
292 if (a.mx==NULL || b.mx==NULL) return c;
293 if (a.sz[a.n-1]!=b.sz[0]) return c;
294
295 n = a.n + b.n - 2;
296 sz = (int*)malloc(n*sizeof(int));
297 if (sz==NULL) return c;
298 sa = (int*)malloc(a.n*sizeof(int));
299 if (sa==NULL) {free(sz); return c;}
300 sb = (int*)malloc(b.n*sizeof(int));
301 if (sb==NULL) {free(sz); free(sa); return c;}
302 sc = (int*)malloc(n*sizeof(int));
303 if (sc==NULL) {free(sz); free(sa); free(sb); return c;}
304 cx = (int*)malloc(n*sizeof(int));
305 if (cx==NULL) {free(sz); free(sa); free(sb); free(sc); return c;}
306
307 for (i=0; i<a.n-1; i++) sz[i] = a.sz[i];
308 for (i=1; i<b.n; i++) sz[a.n-2+i] = b.sz[i];
309
310 sa[a.n-1] = sb[b.n-1] = sc[n-1] = 1;
311 for (i=a.n-2; i>=0; i--) sa[i] = sa[i+1]*a.sz[i+1];
312 for (i=b.n-2; i>=0; i--) sb[i] = sb[i+1]*b.sz[i+1];
313 for (i=n-2; i>=0; i--) sc[i] = sc[i+1]*sz[i+1];
314
315 c.getm(n, sz);
316
317 if (c.sz!=NULL) {
318 for (i=0; i<c.r; i++) {
319 ii = i;
320 for (j=0; j<c.n; j++) {
321 cx[j] = ii / sc[j];
322 ii = ii % sc[j];
323 }
324 aa = bb = 0;
325 for (j=0; j<a.n-1; j++) aa = aa + sa[j]*cx[j];
326 for (j=1; j<b.n; j++) bb = bb + sb[j]*cx[j+a.n-2];
327
328 st = (T)0;
329 for (k=0; k<b.sz[0]; k++) st = st + a.mx[k+aa]*b.mx[bb+sb[0]*k];
330 c.mx[i] = st;
331 }
332 }
333
334 free(sz);
335 free(sa);
336 free(sb);
337 free(sc);
338 free(cx);
339
340 return c;
341}

References Matrix< T >::getm(), Matrix< T >::mx, Matrix< T >::n, Matrix< T >::r, and Matrix< T >::sz.

Here is the call graph for this function:

◆ operator*() [3/21]

template<typename T , typename R >
Matrix< T > operator* ( const Matrix< T > a,
const R d )
inline

Definition at line 418 of file Matrix++.h.

419{
420 Matrix<T> c(a.n, a.sz);
421 if (c.mx!=NULL) for (int i=0; i<a.r; i++) c.mx[i] = a.mx[i]*(T)d;
422 return c;
423}

References Matrix< T >::mx, Matrix< T >::n, Matrix< T >::r, and Matrix< T >::sz.

◆ operator*() [4/21]

template<typename T >
Vector< T > operator* ( const Matrix< T > a,
const Vector< T > v )

template <typename T> Matrix<T> operator * (const Matrix<T> a, const Matrix<T> b)

マトリックスとベクトルの掛け算．
マトリックス a と 3Dベクトル vを掛け算して，結果のベクトルを返す．

Parameters
a掛けられるマトリックス．
v掛けるベクトル．
Returns
掛け算結果のベクトル．掛け算不能，または失敗の場合は 0ベクトル．

Definition at line 355 of file Matrix++.h.

356{
357 Vector<T> vct(0.0, 0.0, 0.0, 0.0, -1.0);
358
359 Matrix<T> b(1, 3);
360 b.mx[0] = v.x;
361 b.mx[1] = v.y;
362 b.mx[2] = v.z;
363
364 Matrix<T> c = a*b;
365 b.free();
366
367 if (c.mx==NULL) return vct;
368 vct.x = c.mx[0];
369 vct.y = c.mx[1];
370 vct.z = c.mx[2];
371 vct.c = v.c;
372 c.free();
373
374 return vct;
375}
jbxl::Matrix::free
void free()
free() は手動で呼び出す．
Definition Matrix++.h:52

References Vector< T >::c, Matrix< T >::free(), Matrix< T >::mx, Vector< T >::x, Vector< T >::y, and Vector< T >::z.

Here is the call graph for this function:

◆ operator*() [5/21]

template<typename T >
Quaternion< T > operator* ( const Quaternion< T > a,
const Quaternion< T > b )
inline

演算順序 A*B = Bの回転 -> Aの回転

Definition at line 146 of file Rotation.h.

147{
148 Quaternion<T> quat;
149 if (a.c<(T)0.0 || b.c<(T)0.0) quat.init(-(T)1.0);
150 else quat.set(a.s*b.s-a.x*b.x-a.y*b.y-a.z*b.z, a.s*b.x+a.x*b.s+a.y*b.z-a.z*b.y,
151 a.s*b.y+a.y*b.s+a.z*b.x-a.x*b.z, a.s*b.z+a.z*b.s+a.x*b.y-a.y*b.x, (T)1.0, Min(a.c, b.c));
152 return quat;
153}
jbxl::Quaternion::c
T c
信頼度
Definition Rotation.h:52
jbxl::Quaternion::y
T y
y 成分
Definition Rotation.h:48
jbxl::Quaternion::set
void set(T S, T X, T Y, T Z, T N=(T) 0.0, T C=(T) 1.0)
Definition Rotation.h:273
jbxl::Quaternion::init
void init(T C=(T) 1.0)
Definition Rotation.h:64
jbxl::Quaternion::x
T x
x 成分
Definition Rotation.h:47
jbxl::Quaternion::z
T z
z 成分
Definition Rotation.h:49
jbxl::Quaternion::s
T s
cos(θ/2)
Definition Rotation.h:46

References Quaternion< T >::c, Quaternion< T >::init(), Min, Quaternion< T >::s, Quaternion< T >::set(), Quaternion< T >::x, Quaternion< T >::y, and Quaternion< T >::z.

Here is the call graph for this function:

◆ operator*() [6/21]

template<typename T , typename R >
Quaternion< T > operator* ( const Quaternion< T > a,
const R d )
inline

Definition at line 135 of file Rotation.h.

136{ return Quaternion<T>(a.s*(T)d, a.x*(T)d, a.y*(T)d, a.z*(T)d, a.n*(T)d, a.c); }
jbxl::Quaternion::n
T n
ノルム
Definition Rotation.h:51

References Quaternion< T >::c, Quaternion< T >::n, Quaternion< T >::s, Quaternion< T >::x, Quaternion< T >::y, and Quaternion< T >::z.

◆ operator*() [7/21]

template<typename T >
Quaternion< T > operator* ( const Quaternion< T > q,
const Vector< T > v )
inline

Definition at line 157 of file Rotation.h.

158{
159 Quaternion<T> quat;
160 if (q.c<(T)0.0 || v.c<(T)0.0) quat.init(-(T)1.0);
161 else quat.set(-q.x*v.x-q.y*v.y-q.z*v.z, q.s*v.x+q.y*v.z-q.z*v.y,
162 q.s*v.y+q.z*v.x-q.x*v.z, q.s*v.z+q.x*v.y-q.y*v.x, v.n, Min(q.c, v.c));
163 return quat;
164}

References Quaternion< T >::c, Vector< T >::c, Quaternion< T >::init(), Min, Vector< T >::n, Quaternion< T >::s, Quaternion< T >::set(), Quaternion< T >::x, Vector< T >::x, Quaternion< T >::y, Vector< T >::y, Quaternion< T >::z, and Vector< T >::z.

Here is the call graph for this function:

◆ operator*() [8/21]

template<typename T , typename R >
Matrix< T > operator* ( const R d,
const Matrix< T > a )
inline

Definition at line 409 of file Matrix++.h.

410{
411 Matrix<T> c(a.n, a.sz);
412 if (c.mx!=NULL) for (int i=0; i<a.r; i++) c.mx[i] = (T)(d)*a.mx[i];
413 return c;
414}

References Matrix< T >::mx, Matrix< T >::n, Matrix< T >::r, and Matrix< T >::sz.

◆ operator*() [9/21]

template<typename T , typename R >
Quaternion< T > operator* ( const R d,
const Quaternion< T > a )
inline

Definition at line 131 of file Rotation.h.

132{ return Quaternion<T>((T)d*a.s, (T)d*a.x, (T)d*a.y, (T)d*a.z, (T)d*a.n, a.c); }

References Quaternion< T >::c, Quaternion< T >::n, Quaternion< T >::s, Quaternion< T >::x, Quaternion< T >::y, and Quaternion< T >::z.

◆ operator*() [10/21]

template<typename T , typename R >
TVector< T > operator* ( const R d,
const TVector< T > a )
inline

Definition at line 129 of file TVector.h.

130{ return TVector<T>(a.x*(T)d, a.y*(T)d, a.z*(T)d, a.t*Xabs((T)d));}

References TVector< T >::t, Vector< T >::x, Xabs, Vector< T >::y, and Vector< T >::z.

◆ operator*() [11/21]

template<typename T , typename R >
UVMap< T > operator* ( const R d,
const UVMap< T > a )
inline

Definition at line 656 of file Vector.h.

657{ return UVMap<T>((T)d*a.u, (T)d*a.v, a.d); }

References UVMap< T >::d, UVMap< T >::u, and UVMap< T >::v.

◆ operator*() [12/21]

template<typename T , typename R >
Vector4< T > operator* ( const R d,
const Vector4< T > a )
inline

Definition at line 815 of file Vector.h.

816{ return Vector4<T>((T)d*a.x, (T)d*a.y, (T)d*a.z, (T)d*a.t, (T)d*a.n, a.c, a.d); }

References Vector4< T >::c, Vector4< T >::d, Vector4< T >::n, Vector4< T >::t, Vector4< T >::x, Vector4< T >::y, and Vector4< T >::z.

◆ operator*() [13/21]

template<typename T , typename R >
Vector< T > operator* ( const R d,
const Vector< T > a )
inline

Definition at line 160 of file Vector.h.

161{ return Vector<T>((T)d*a.x, (T)d*a.y, (T)d*a.z, (T)d*a.n, a.c, a.d); }

References Vector< T >::c, Vector< T >::d, Vector< T >::n, Vector< T >::x, Vector< T >::y, and Vector< T >::z.

◆ operator*() [14/21]

template<typename T , typename R >
TVector< T > operator* ( const TVector< T > a,
const R d )
inline

Definition at line 133 of file TVector.h.

134{ return TVector<T>(a.x*(T)d, a.y*(T)d, a.z*(T)d, a.t*Xabs((T)d));}

References TVector< T >::t, Vector< T >::x, Xabs, Vector< T >::y, and Vector< T >::z.

◆ operator*() [15/21]

template<typename T >
T operator* ( const TVector< T > a,
const TVector< T > b )
inline

Definition at line 178 of file TVector.h.

179{ return (T)(a.x*b.x + a.y*b.y + a.z*b.z);}

References Vector< T >::x, Vector< T >::y, and Vector< T >::z.

◆ operator*() [16/21]

template<typename T , typename R >
UVMap< T > operator* ( const UVMap< T > a,
const R d )
inline

Definition at line 660 of file Vector.h.

661{ return UVMap<T>(a.u*(T)d, a.v*(T)d, a.d); }

References UVMap< T >::d, UVMap< T >::u, and UVMap< T >::v.

◆ operator*() [17/21]

template<typename T , typename R >
Vector4< T > operator* ( const Vector4< T > a,
const R d )
inline

Definition at line 819 of file Vector.h.

820{ return Vector4<T>(a.x*(T)d, a.y*(T)d, a.z*(T)d, a.t*(T)d, a.n*(T)d, a.c, a.d); }

References Vector4< T >::c, Vector4< T >::d, Vector4< T >::n, Vector4< T >::t, Vector4< T >::x, Vector4< T >::y, and Vector4< T >::z.

◆ operator*() [18/21]

template<typename T >
T operator* ( const Vector4< T > a,
const Vector4< T > b )
inline

Definition at line 847 of file Vector.h.

848{ return (a.x*b.x + a.y*b.y + a.z*b.z + a.t*b.t); }

References Vector4< T >::t, Vector4< T >::x, Vector4< T >::y, and Vector4< T >::z.

◆ operator*() [19/21]

template<typename T , typename R >
Vector< T > operator* ( const Vector< T > a,
const R d )
inline

Definition at line 164 of file Vector.h.

165{ return Vector<T>(a.x*(T)d, a.y*(T)d, a.z*(T)d, a.n*(T)d, a.c, a.d); }

References Vector< T >::c, Vector< T >::d, Vector< T >::n, Vector< T >::x, Vector< T >::y, and Vector< T >::z.

◆ operator*() [20/21]

template<typename T >
T operator* ( const Vector< T > a,
const Vector< T > b )
inline

Definition at line 201 of file Vector.h.

202{ return (a.x*b.x + a.y*b.y + a.z*b.z); }

References Vector< T >::x, Vector< T >::y, and Vector< T >::z.

◆ operator*() [21/21]

template<typename T >
Quaternion< T > operator* ( const Vector< T > v,
const Quaternion< T > q )
inline

Definition at line 168 of file Rotation.h.

169{
170 Quaternion<T> quat;
171 if (q.c<(T)0.0 || v.c<(T)0.0) quat.init(-(T)1.0);
172 else quat.set(-v.x*q.x-v.y*q.y-v.z*q.z, v.x*q.s+v.y*q.z-v.z*q.y,
173 v.y*q.s+v.z*q.x-v.x*q.z, v.z*q.s+v.x*q.y-v.y*q.x, (T)v.n, (T)Min(v.c, q.c));
174 return quat;
175}

References Quaternion< T >::c, Vector< T >::c, Quaternion< T >::init(), Min, Vector< T >::n, Quaternion< T >::s, Quaternion< T >::set(), Quaternion< T >::x, Vector< T >::x, Quaternion< T >::y, Vector< T >::y, Quaternion< T >::z, and Vector< T >::z.

Here is the call graph for this function:

◆ operator+() [1/14]

template<typename T >
Matrix< T > operator+ ( const Matrix< T > a,
const Matrix< T > b )
inline

Definition at line 386 of file Matrix++.h.

387{
388 Matrix<T> c;
389 if (!isSameDimension(a, b)) return c;
390
391 c.getm(a.n, a.sz);
392 if (c.mx!=NULL) for (int i=0; i<a.r; i++) c.mx[i] = a.mx[i] + b.mx[i];
393 return c;
394}
jbxl::isSameDimension
bool isSameDimension(const Matrix< T > v1, const Matrix< T > v2)
Definition Matrix++.h:443

References Matrix< T >::getm(), isSameDimension(), Matrix< T >::mx, Matrix< T >::n, Matrix< T >::r, and Matrix< T >::sz.

Here is the call graph for this function:

◆ operator+() [2/14]

template<typename T >
Quaternion< T > operator+ ( const Quaternion< T > a,
const Quaternion< T > b )
inline

Definition at line 123 of file Rotation.h.

124{ return Quaternion<T>(a.s+b.s, a.x+b.x, a.y+b.y, a.z+b.z, (T)0.0, Min(a.c, b.c)); }

References Quaternion< T >::c, Min, Quaternion< T >::s, Quaternion< T >::x, Quaternion< T >::y, and Quaternion< T >::z.

◆ operator+() [3/14]

template<typename T , typename R >
UVMap< T > operator+ ( const R c,
UVMap< T > a )
inline

Definition at line 640 of file Vector.h.

641{ return UVMap<T>((T)c + a.u, (T)c + a.v, a.d); }

References UVMap< T >::d, UVMap< T >::u, and UVMap< T >::v.

◆ operator+() [4/14]

template<typename T , typename R >
Vector4< T > operator+ ( const R c,
Vector4< T > a )
inline

Definition at line 799 of file Vector.h.

800{ return Vector4<T>((T)c + a.x, (T)c + a.y, (T)c + a.z, (T)c + a.t, 0.0, a.c, a.d); }

References Vector4< T >::c, Vector4< T >::d, Vector4< T >::t, Vector4< T >::x, Vector4< T >::y, and Vector4< T >::z.

◆ operator+() [5/14]

template<typename T , typename R >
Vector< T > operator+ ( const R c,
Vector< T > a )
inline

Definition at line 144 of file Vector.h.

145{ return Vector<T>((T)c + a.x, (T)c + a.y, (T)c + a.z, 0.0, a.c, a.d); }

References Vector< T >::c, Vector< T >::d, Vector< T >::x, Vector< T >::y, and Vector< T >::z.

◆ operator+() [6/14]

template<typename T , typename R >
TVector< T > operator+ ( const R d,
const TVector< T > a )
inline

Definition at line 100 of file TVector.h.

101{ return TVector<T>((T)d+a.x, (T)d+a.y, (T)d+a.z, a.t);}

References TVector< T >::t, Vector< T >::x, Vector< T >::y, and Vector< T >::z.

◆ operator+() [7/14]

template<typename T , typename R >
TVector< T > operator+ ( const TVector< T > a,
const R d )
inline

Definition at line 104 of file TVector.h.

105{ return TVector<T>(a.x+(T)d, a.y+(T)d, a.z+(T)d, a.t);}

References TVector< T >::t, Vector< T >::x, Vector< T >::y, and Vector< T >::z.

◆ operator+() [8/14]

template<typename T >
TVector< T > operator+ ( const TVector< T > a,
const TVector< T > b )
inline

Definition at line 87 of file TVector.h.

88{
89 T xx = a.x + b.x;
90 T yy = a.y + b.y;
91 T zz = a.z + b.z;
92 T tt = a.t + b.t;
93 if (Xabs(xx)<tt) xx = (T)0.0;
94 if (Xabs(yy)<tt) yy = (T)0.0;
95 if (Xabs(zz)<tt) zz = (T)0.0;
96 return TVector<T>(xx, yy, zz, tt);
97}

References TVector< T >::t, Vector< T >::x, Xabs, Vector< T >::y, and Vector< T >::z.

◆ operator+() [9/14]

template<typename T >
UVMap< T > operator+ ( const UVMap< T > a,
const UVMap< T > b )
inline

Definition at line 632 of file Vector.h.

633{ return UVMap<T>(a.u + b.u, a.v + b.v, a.d); }

References UVMap< T >::d, UVMap< T >::u, and UVMap< T >::v.

◆ operator+() [10/14]

template<typename T , typename R >
UVMap< T > operator+ ( const UVMap< T > a,
R c )
inline

Definition at line 636 of file Vector.h.

637{ return UVMap<T>(a.u + (T)c, a.v + (T)c, a.d); }

References UVMap< T >::d, UVMap< T >::u, and UVMap< T >::v.

◆ operator+() [11/14]

template<typename T >
Vector4< T > operator+ ( const Vector4< T > a,
const Vector4< T > b )
inline

Definition at line 791 of file Vector.h.

792{ return Vector4<T>(a.x + b.x, a.y + b.y, a.z + b.z, a.t + b.t, 0.0, Min(a.c, b.c), a.d); }

References Vector4< T >::c, Vector4< T >::d, Min, Vector4< T >::t, Vector4< T >::x, Vector4< T >::y, and Vector4< T >::z.

◆ operator+() [12/14]

template<typename T , typename R >
Vector4< T > operator+ ( const Vector4< T > a,
R c )
inline

Definition at line 795 of file Vector.h.

796{ return Vector4<T>(a.x + (T)c, a.y + (T)c, a.z + (T)c, a.t + (T)c, 0.0, a.c, a.d); }

References Vector4< T >::c, Vector4< T >::d, Vector4< T >::t, Vector4< T >::x, Vector4< T >::y, and Vector4< T >::z.

◆ operator+() [13/14]

template<typename T >
Vector< T > operator+ ( const Vector< T > a,
const Vector< T > b )
inline

Definition at line 136 of file Vector.h.

137{ return Vector<T>(a.x + b.x, a.y + b.y, a.z + b.z, 0.0, Min(a.c, b.c), a.d); }

References Vector< T >::c, Vector< T >::d, Min, Vector< T >::x, Vector< T >::y, and Vector< T >::z.

◆ operator+() [14/14]

template<typename T , typename R >
Vector< T > operator+ ( const Vector< T > a,
R c )
inline

Definition at line 140 of file Vector.h.

141{ return Vector<T>(a.x + (T)c, a.y + (T)c, a.z + (T)c, 0.0, a.c, a.d); }

References Vector< T >::c, Vector< T >::d, Vector< T >::x, Vector< T >::y, and Vector< T >::z.

◆ operator+=() [1/6]

template<typename T , typename R >
UVMap< T > operator+= ( UVMap< T > & a,
const UVMap< R > b )
inline

Definition at line 684 of file Vector.h.

685{ a = a + Cast<T>(b); return a; }

◆ operator+=() [2/6]

template<typename T >
UVMap< T > operator+= ( UVMap< T > & a,
const UVMap< T > b )
inline

Definition at line 680 of file Vector.h.

681{ a = a + b; return a; }

◆ operator+=() [3/6]

template<typename T , typename R >
Vector4< T > operator+= ( Vector4< T > & a,
const Vector4< R > b )
inline

Definition at line 835 of file Vector.h.

836{ a = a + Cast<T>(b); return a; }

◆ operator+=() [4/6]

template<typename T >
Vector4< T > operator+= ( Vector4< T > & a,
const Vector4< T > b )
inline

Definition at line 831 of file Vector.h.

832{ a = a + b; return a; }

◆ operator+=() [5/6]

template<typename T , typename R >
Vector< T > operator+= ( Vector< T > & a,
const Vector< R > b )
inline

Definition at line 183 of file Vector.h.

184{ a = a + Cast<T>(b); return a; }

◆ operator+=() [6/6]

template<typename T >
Vector< T > operator+= ( Vector< T > & a,
const Vector< T > b )
inline

Definition at line 179 of file Vector.h.

180{ a = a + b; return a; }

◆ operator-() [1/20]

template<typename T >
Matrix< T > operator- ( const Matrix< T > a)
inline

Definition at line 378 of file Matrix++.h.

379{
380 Matrix<T> c(a.n, a.sz);
381 if (c.mx!=NULL) for (int i=0; i<a.r; i++) c.mx[i] = -a.mx[i];
382 return c;
383}

References Matrix< T >::mx, Matrix< T >::n, Matrix< T >::r, and Matrix< T >::sz.

◆ operator-() [2/20]

template<typename T >
Matrix< T > operator- ( const Matrix< T > a,
const Matrix< T > b )
inline

Definition at line 397 of file Matrix++.h.

398{
399 Matrix<T> c;
400 if (!isSameDimension(a, b)) return c;
401
402 c.getm(a.n, a.sz);
403 if (c.mx!=NULL) for (int i=0; i<a.r; i++) c.mx[i] = a.mx[i] - b.mx[i];
404 return c;
405}

References Matrix< T >::getm(), isSameDimension(), Matrix< T >::mx, Matrix< T >::n, Matrix< T >::r, and Matrix< T >::sz.

Here is the call graph for this function:

◆ operator-() [3/20]

template<typename T >
Quaternion< T > operator- ( const Quaternion< T > a)
inline

Definition at line 119 of file Rotation.h.

120{ return Quaternion<T>(-a.s, -a.x, -a.y, -a.z, a.n, a.c); }

References Quaternion< T >::c, Quaternion< T >::n, Quaternion< T >::s, Quaternion< T >::x, Quaternion< T >::y, and Quaternion< T >::z.

◆ operator-() [4/20]

template<typename T >
Quaternion< T > operator- ( const Quaternion< T > a,
const Quaternion< T > b )
inline

Definition at line 127 of file Rotation.h.

128{ return Quaternion<T>(a.s-b.s, a.x-b.x, a.y-b.y, a.z-b.z, (T)0.0, Min(a.c, b.c)); }

References Quaternion< T >::c, Min, Quaternion< T >::s, Quaternion< T >::x, Quaternion< T >::y, and Quaternion< T >::z.

◆ operator-() [5/20]

template<typename T , typename R >
UVMap< T > operator- ( const R c,
UVMap< T > a )
inline

Definition at line 652 of file Vector.h.

653{ return UVMap<T>((T)c - a.u, (T)c - a.v, a.d); }

References UVMap< T >::d, UVMap< T >::u, and UVMap< T >::v.

◆ operator-() [6/20]

template<typename T , typename R >
TVector< T > operator- ( const R d,
const TVector< T > a )
inline

Definition at line 121 of file TVector.h.

122{ return TVector<T>((T)d-a.x, (T)d-a.y, (T)d-a.z, a.t);}

References TVector< T >::t, Vector< T >::x, Vector< T >::y, and Vector< T >::z.

◆ operator-() [7/20]

template<typename T >
TVector< T > operator- ( const TVector< T > a)
inline

Definition at line 83 of file TVector.h.

84{ return TVector<T>(-a.x, -a.y, -a.z, a.t, a.n); }

References Vector< T >::n, TVector< T >::t, Vector< T >::x, Vector< T >::y, and Vector< T >::z.

◆ operator-() [8/20]

template<typename T , typename R >
TVector< T > operator- ( const TVector< T > a,
const R d )
inline

Definition at line 125 of file TVector.h.

126{ return TVector<T>(a.x-(T)d, a.y-(T)d, a.z-(T)d, a.t);}

References TVector< T >::t, Vector< T >::x, Vector< T >::y, and Vector< T >::z.

◆ operator-() [9/20]

template<typename T >
TVector< T > operator- ( const TVector< T > a,
const TVector< T > b )
inline

Definition at line 108 of file TVector.h.

109{
110 T xx = a.x - b.x;
111 T yy = a.y - b.y;
112 T zz = a.z - b.z;
113 T tt = a.t + b.t;
114 if (Xabs(xx)<tt) xx = (T)0.0;
115 if (Xabs(yy)<tt) yy = (T)0.0;
116 if (Xabs(zz)<tt) zz = (T)0.0;
117 return TVector<T>(xx, yy, zz, tt);
118}

References TVector< T >::t, Vector< T >::x, Xabs, Vector< T >::y, and Vector< T >::z.

◆ operator-() [10/20]

template<typename T >
UVMap< T > operator- ( const UVMap< T > a)
inline

Definition at line 628 of file Vector.h.

629{ return UVMap<T>(-a.u, -a.v, a.d); }

References UVMap< T >::d, UVMap< T >::u, and UVMap< T >::v.

◆ operator-() [11/20]

template<typename T >
UVMap< T > operator- ( const UVMap< T > a,
const UVMap< T > b )
inline

Definition at line 644 of file Vector.h.

645{ return UVMap<T>(a.u - b.u, a.v - b.v, a.d); }

References UVMap< T >::d, UVMap< T >::u, and UVMap< T >::v.

◆ operator-() [12/20]

template<typename T , typename R >
UVMap< T > operator- ( const UVMap< T > a,
R c )
inline

Definition at line 648 of file Vector.h.

649{ return UVMap<T>(a.u - (T)c, a.v - (T)c, a.d); }

References UVMap< T >::d, UVMap< T >::u, and UVMap< T >::v.

◆ operator-() [13/20]

template<typename T >
Vector4< T > operator- ( const Vector4< T > a)
inline

Definition at line 787 of file Vector.h.

788{ return Vector4<T>(-a.x, -a.y, -a.z, -a.t, a.n, a.c, a.d); }

References Vector4< T >::c, Vector4< T >::d, Vector4< T >::n, Vector4< T >::t, Vector4< T >::x, Vector4< T >::y, and Vector4< T >::z.

◆ operator-() [14/20]

template<typename T >
Vector4< T > operator- ( const Vector4< T > a,
const Vector4< T > b )
inline

Definition at line 803 of file Vector.h.

804{ return Vector4<T>(a.x - b.x, a.y - b.y, a.z - b.z, a.t - b.t, 0.0, Min(a.c, b.c), a.d); }

References Vector4< T >::c, Vector4< T >::d, Min, Vector4< T >::t, Vector4< T >::x, Vector4< T >::y, and Vector4< T >::z.

◆ operator-() [15/20]

template<typename T , typename R >
Vector4< T > operator- ( const Vector4< T > a,
R c )
inline

Definition at line 807 of file Vector.h.

808{ return Vector4<T>(a.x - (T)c, a.y - (T)c, a.z - (T)c, a.t - (T)c, 0.0, a.c, a.d); }

References Vector4< T >::c, Vector4< T >::d, Vector4< T >::t, Vector4< T >::x, Vector4< T >::y, and Vector4< T >::z.

◆ operator-() [16/20]

template<typename T >
Vector< T > operator- ( const Vector< T > a)
inline

Definition at line 132 of file Vector.h.

133{ return Vector<T>(-a.x, -a.y, -a.z, a.n, a.c, a.d); }

References Vector< T >::c, Vector< T >::d, Vector< T >::n, Vector< T >::x, Vector< T >::y, and Vector< T >::z.

◆ operator-() [17/20]

template<typename T >
Vector< T > operator- ( const Vector< T > a,
const Vector< T > b )
inline

Definition at line 148 of file Vector.h.

149{ return Vector<T>(a.x - b.x, a.y - b.y, a.z - b.z, 0.0, Min(a.c, b.c), a.d); }

References Vector< T >::c, Vector< T >::d, Min, Vector< T >::x, Vector< T >::y, and Vector< T >::z.

◆ operator-() [18/20]

template<typename T , typename R >
Vector< T > operator- ( const Vector< T > a,
R c )
inline

Definition at line 152 of file Vector.h.

153{ return Vector<T>(a.x - (T)c, a.y - (T)c, a.z - (T)c, 0.0, a.c, a.d); }

References Vector< T >::c, Vector< T >::d, Vector< T >::x, Vector< T >::y, and Vector< T >::z.

◆ operator-() [19/20]

template<typename T , typename R >
Vector4< T > operator- ( R c,
const Vector4< T > a )
inline

Definition at line 811 of file Vector.h.

812{ return Vector4<T>((T)c - a.x, (T)c - a.y, (T)c - a.z, (T)c - a.t, 0.0, a.c, a.d); }

References Vector4< T >::c, Vector4< T >::d, Vector4< T >::t, Vector4< T >::x, Vector4< T >::y, and Vector4< T >::z.

◆ operator-() [20/20]

template<typename T , typename R >
Vector< T > operator- ( R c,
const Vector< T > a )
inline

Definition at line 156 of file Vector.h.

157{ return Vector<T>((T)c - a.x, (T)c - a.y, (T)c - a.z, 0.0, a.c, a.d); }

References Vector< T >::c, Vector< T >::d, Vector< T >::x, Vector< T >::y, and Vector< T >::z.

◆ operator-=() [1/6]

template<typename T , typename R >
UVMap< T > operator-= ( UVMap< T > & a,
const UVMap< R > b )
inline

Definition at line 691 of file Vector.h.

692{ a = a - Cast<T>(b); return a; }

◆ operator-=() [2/6]

template<typename T >
UVMap< T > operator-= ( UVMap< T > & a,
const UVMap< T > b )
inline

Definition at line 688 of file Vector.h.

689{ a = a - b; return a; }

◆ operator-=() [3/6]

template<typename T , typename R >
Vector4< T > operator-= ( Vector4< T > & a,
const Vector4< R > b )
inline

Definition at line 842 of file Vector.h.

843{ a = a - Cast<T>(b); return a; }

◆ operator-=() [4/6]

template<typename T >
Vector4< T > operator-= ( Vector4< T > & a,
const Vector4< T > b )
inline

Definition at line 839 of file Vector.h.

840{ a = a - b; return a; }

◆ operator-=() [5/6]

template<typename T , typename R >
Vector< T > operator-= ( Vector< T > & a,
const Vector< R > b )
inline

Definition at line 191 of file Vector.h.

192{ a = a - Cast<T>(b); return a; }

◆ operator-=() [6/6]

template<typename T >
Vector< T > operator-= ( Vector< T > & a,
const Vector< T > b )
inline

Definition at line 187 of file Vector.h.

188{ a = a - b; return a; }

◆ operator/() [1/10]

template<typename T , typename R >
Matrix< T > operator/ ( const Matrix< T > a,
const R d )
inline

Definition at line 427 of file Matrix++.h.

428{
429 Matrix<T> c(a.n, a.sz);
430 if (c.mx!=NULL) for (int i=0; i<a.r; i++) c.mx[i] = a.mx[i]/(T)d;
431 return c;
432}

References Matrix< T >::mx, Matrix< T >::n, Matrix< T >::r, and Matrix< T >::sz.

◆ operator/() [2/10]

template<typename T , typename R >
Quaternion< T > operator/ ( const Quaternion< T > a,
const R d )
inline

Definition at line 139 of file Rotation.h.

140{ return Quaternion<T>(a.s/(T)d, a.x/(T)d, a.y/(T)d, a.z/(T)d, a.n/(T)d, a.c); }

References Quaternion< T >::c, Quaternion< T >::n, Quaternion< T >::s, Quaternion< T >::x, Quaternion< T >::y, and Quaternion< T >::z.

◆ operator/() [3/10]

template<typename T , typename R >
TVector< T > operator/ ( const R d,
const TVector< T > a )
inline

Definition at line 141 of file TVector.h.

142{ return TVector<T>((T)d/a.x, (T)d/a.y, (T)d/a.z, Xabs((T)d)*a.t/a.norm2());}

References Vector< T >::norm2(), TVector< T >::t, Vector< T >::x, Xabs, Vector< T >::y, and Vector< T >::z.

Here is the call graph for this function:

◆ operator/() [4/10]

template<typename T , typename R >
UVMap< T > operator/ ( const R d,
const UVMap< T > a )
inline

Definition at line 668 of file Vector.h.

669{ return UVMap<T>((T)d/a.u, (T)d/a.v, a.d); }

References UVMap< T >::d, UVMap< T >::u, and UVMap< T >::v.

◆ operator/() [5/10]

template<typename T , typename R >
Vector4< T > operator/ ( const R d,
const Vector4< T > a )
inline

Definition at line 827 of file Vector.h.

828{ return Vector4<T>((T)d/a.x, (T)d/a.y, (T)d/a.z, (T)d/a.t, 0.0, a.c, a.d) ;}

References Vector4< T >::c, Vector4< T >::d, Vector4< T >::t, Vector4< T >::x, Vector4< T >::y, and Vector4< T >::z.

◆ operator/() [6/10]

template<typename T , typename R >
Vector< T > operator/ ( const R d,
const Vector< T > a )
inline

Definition at line 172 of file Vector.h.

173{ return Vector<T>((T)d/a.x, (T)d/a.y, (T)d/a.z, 0.0, a.c, a.d); }

References Vector< T >::c, Vector< T >::d, Vector< T >::x, Vector< T >::y, and Vector< T >::z.

◆ operator/() [7/10]

template<typename T , typename R >
TVector< T > operator/ ( const TVector< T > a,
const R d )
inline

Definition at line 137 of file TVector.h.

138{ return TVector<T>(a.x/(T)d, a.y/(T)d, a.z/(T)d, a.t/Xabs((T)d));}

References TVector< T >::t, Vector< T >::x, Xabs, Vector< T >::y, and Vector< T >::z.

◆ operator/() [8/10]

template<typename T , typename R >
UVMap< T > operator/ ( const UVMap< T > a,
const R d )
inline

Definition at line 664 of file Vector.h.

665{ return UVMap<T>(a.u/(T)d, a.v/(T)d, a.d); }

References UVMap< T >::d, UVMap< T >::u, and UVMap< T >::v.

◆ operator/() [9/10]

template<typename T , typename R >
Vector4< T > operator/ ( const Vector4< T > a,
const R d )
inline

Definition at line 823 of file Vector.h.

824{ return Vector4<T>(a.x/(T)d, a.y/(T)d, a.z/(T)d, a.t/(T)d, a.n/(T)d, a.c, a.d); }

References Vector4< T >::c, Vector4< T >::d, Vector4< T >::n, Vector4< T >::t, Vector4< T >::x, Vector4< T >::y, and Vector4< T >::z.

◆ operator/() [10/10]

template<typename T , typename R >
Vector< T > operator/ ( const Vector< T > a,
const R d )
inline

Definition at line 168 of file Vector.h.

169{ return Vector<T>(a.x/(T)d, a.y/(T)d, a.z/(T)d, a.n/(T)d, a.c, a.d); }

References Vector< T >::c, Vector< T >::d, Vector< T >::n, Vector< T >::x, Vector< T >::y, and Vector< T >::z.

◆ operator<() [1/2]

template<typename T >
bool operator< ( const Vector4< T > v1,
const Vector4< T > v2 )
inline

Definition at line 872 of file Vector.h.

873{
874 if (v1.x != v2.x) return v1.x < v2.x;
875 if (v1.y != v2.y) return v1.y < v2.y;
876 if (v1.z != v2.z) return v1.z < v2.z;
877 if (v1.t != v2.t) return v1.t < v2.t;
878 return false;
879}

References Vector4< T >::t, Vector4< T >::x, Vector4< T >::y, and Vector4< T >::z.

◆ operator<() [2/2]

template<typename T >
bool operator< ( const Vector< T > v1,
const Vector< T > v2 )
inline

Definition at line 225 of file Vector.h.

226{
227 if (v1.x != v2.x) return v1.x < v2.x;
228 if (v1.y != v2.y) return v1.y < v2.y;
229 if (v1.z != v2.z) return v1.z < v2.z;
230 return false;
231}

References Vector< T >::x, Vector< T >::y, and Vector< T >::z.

◆ operator==() [1/6]

template<typename T >
bool operator== ( const Matrix< T > v1,
const Matrix< T > v2 )
inline

Definition at line 435 of file Matrix++.h.

436{
437 if (!isSameDimension(v1, v2)) return false;
438 for (int i=0; i<v1.r; i++) if (v1.mx[i]!=v2.mx[i]) return false;
439 return true;
440}

References isSameDimension(), Matrix< T >::mx, and Matrix< T >::r.

Here is the call graph for this function:

◆ operator==() [2/6]

template<typename T >
bool operator== ( const Quaternion< T > q1,
const Quaternion< T > q2 )
inline

Definition at line 105 of file Rotation.h.

106{ return (q1.s==q2.s && q1.x==q2.x && q1.y==q2.y && q1.z==q2.z); }

References Quaternion< T >::s, Quaternion< T >::x, Quaternion< T >::y, and Quaternion< T >::z.

◆ operator==() [3/6]

template<typename T >
bool operator== ( const TVector< T > v1,
const TVector< T > v2 )
inline

Definition at line 145 of file TVector.h.

146{
147 T dst = (v1.x-v2.x)*(v1.x-v2.x) + (v1.y-v2.y)*(v1.y-v2.y) + (v1.z-v2.z)*(v1.z-v2.z);
148 T err = (v1.t+v2.t)*(v1.t+v2.t);
149 if (dst<=err) return true;
150 return false;
151}

References TVector< T >::t, Vector< T >::x, Vector< T >::y, and Vector< T >::z.

◆ operator==() [4/6]

template<typename T >
bool operator== ( const UVMap< T > a,
const UVMap< T > b )
inline

Definition at line 672 of file Vector.h.

673{ return (a.u == b.u && a.v == b.v); }

References UVMap< T >::u, and UVMap< T >::v.

◆ operator==() [5/6]

template<typename T >
bool operator== ( const Vector4< T > v1,
const Vector4< T > v2 )
inline

Definition at line 851 of file Vector.h.

852{ return (v1.x == v2.x && v1.y == v2.y && v1.z == v2.z && v1.t == v2.t); }

References Vector4< T >::t, Vector4< T >::x, Vector4< T >::y, and Vector4< T >::z.

◆ operator==() [6/6]

template<typename T >
bool operator== ( const Vector< T > v1,
const Vector< T > v2 )
inline

Definition at line 205 of file Vector.h.

206{ return (v1.x == v2.x && v1.y == v2.y && v1.z == v2.z); }

References Vector< T >::x, Vector< T >::y, and Vector< T >::z.

◆ operator^() [1/2]

template<typename T >
TVector< T > operator^ ( const TVector< T > a,
const TVector< T > b )
inline

Definition at line 164 of file TVector.h.

165{
166 T xx = a.y*b.z - a.z*b.y;
167 T yy = a.z*b.x - a.x*b.z;
168 T zz = a.x*b.y - a.y*b.x;
169 T tt = (T)(a.n*b.t + a.t*b.n);
170 if (Xabs(xx)<tt) xx = (T)0.0;
171 if (Xabs(yy)<tt) yy = (T)0.0;
172 if (Xabs(zz)<tt) zz = (T)0.0;
173 return TVector<T>(xx, yy, zz, tt);
174}

References Vector< T >::n, TVector< T >::t, Vector< T >::x, Xabs, Vector< T >::y, and Vector< T >::z.

◆ operator^() [2/2]

template<typename T >
Vector< T > operator^ ( const Vector< T > a,
const Vector< T > b )
inline

Definition at line 196 of file Vector.h.

197{ return Vector<T>(a.y*b.z-a.z*b.y, a.z*b.x-a.x*b.z, a.x*b.y-a.y*b.x, 0.0, Min(a.c, b.c)); }

References Vector< T >::c, Min, Vector< T >::x, Vector< T >::y, and Vector< T >::z.

◆ operator~()

template<typename T >
Quaternion< T > operator~ ( const Quaternion< T > a)
inline

Definition at line 114 of file Rotation.h.

115{ return Quaternion<T>(a.s, -a.x, -a.y, -a.z, a.n, a.c); }

References Quaternion< T >::c, Quaternion< T >::n, Quaternion< T >::s, Quaternion< T >::x, Quaternion< T >::y, and Quaternion< T >::z.

◆ out_around_MSGraph()

template<typename T >
RBound< int > out_around_MSGraph ( MSGraph< T > vp,
int x,
int y,
int mode = 8 )

template <typename T> RBound<int> out_around_MSGraph(MSGraph<T> vp, int x, int y, int mode=8)

2Dグラフィックデータ構造体 vpの(x,y)にあるオブジェクトの周囲長を得る．

Parameters
vp操作対象となる 2D グラフィックデータ構造体．
x,y情報を得たいオブジェクト内の左上縁（境界）の座標．
　 または，左上方向のオブジェクト外の座標（この場合，上記の座標を探す）
この座標の左横に情報を得たいオブジェクトの一部が在ってはいけない．
modeモード．4: 4近傍探索．その他:8近傍探索．
Returns
境界構造体rb
Return values
rb.xmaxオブジェクトの x座標の最大値．
rb.xminオブジェクトの x座標の最小値．
rb.ymaxオブジェクトの y座標の最大値．
rb.yminオブジェクトの y座標の最小値．
rb.zmax8近傍モード時の斜めの距離の回数．
rb.zminオブジェクトの周囲長．ただし，8近傍モードの場合，斜めの距離も1と数える．
周囲長を rb.zmin + rb.zmax*{sqrt(2.)-1} で計算する場合もある．
Attention
1ドットの長さは 1と数える．

Definition at line 295 of file Graph.h.

296{
297 int i, j, sp, cp, w, ll, ss;
298 int xx, yy, vx, vy, ix;
299 bool eflg=false;
300
301 int r8[8]={-1, 1, -1, -1, 1, -1, 1, 1};
302 int r4[8]={ 0, 1, -1, 0, 0, -1, 1, 0};
303 int* cc;
304
305 i = x;
306 // オブジェクトを探す
307 for (j=y; j<vp.ys-1; j++) {
308 for (i=x; i<vp.xs-1; i++) {
309 if (vp.gp[i+(j)*vp.xs]!=vp.zero) {
310 eflg = true;
311 break;
312 }
313 }
314 if (eflg) break;
315 }
316 x = i;
317 y = j;
318 eflg = false;
319
320 RBound<int> rb(x, x, y, y);
321 i = y*vp.xs + x;
322
323 sp = cp = i;
324 ss = ll = 0;
325 vx = 1;
326 vy = 0;
327
328 if (mode==4) {
329 ix = 4;
330 cc = r4;
331 }
332 else {
333 ix = 8;
334 cc = r8;
335 }
336
337 do {
338 w = abs(vx)+abs(vy);
339 xx = (vx*cc[0]+vy*cc[1])/w;
340 yy = (vx*cc[2]+vy*cc[3])/w;
341 for (j=1; j<=ix; j++) {
342 if (vp.gp[cp+yy*vp.xs+xx]!=vp.zero) {
343 vx = xx;
344 vy = yy;
345 cp = cp + yy*vp.xs + xx;
346 xx = cp%vp.xs;
347 yy = (cp-xx)/vp.xs;
348 rb.xmax = Max(rb.xmax, xx);
349 rb.ymax = Max(rb.ymax, yy);
350 rb.xmin = Min(rb.xmin, xx);
351 rb.ymin = Min(rb.ymin, yy);
352 break;
353 }
354 else {
355 if(sp==cp && xx==-1 && yy==vp.zero) {
356 eflg = true;
357 break;
358 }
359 w = abs(xx)+abs(yy);
360 vx = (xx*cc[4]+yy*cc[5])/w;
361 vy = (xx*cc[6]+yy*cc[7])/w;
362 xx = vx;
363 yy = vy;
364 }
365 }
366 ll++;
367 if (abs(vx)+abs(vy)==2) ss++;
368 } while(!eflg);
369
370 if (mode==4) ss = 0;
371 (rb.xmax)++;
372 (rb.ymax)++;
373 (rb.xmin)--;
374 (rb.ymin)--;
375 rb.zmax = ss;
376 rb.zmin = ll;
377 return rb;
378}

References MSGraph< T >::gp, Max, Min, RBound< T >::xmax, RBound< T >::xmin, MSGraph< T >::xs, RBound< T >::ymax, RBound< T >::ymin, MSGraph< T >::ys, MSGraph< T >::zero, RBound< T >::zmax, and RBound< T >::zmin.

◆ PatchupContour()

DllExport bool PatchupContour ( BREP_SHELL * shell,
BREP_VERTEX ** vert,
bool mode )

bool jbxl::PatchupContour(BREP_SHELL* shell, BREP_VERTEX** vert, bool mode)

Shellに対して，vert[0]〜vert[2]の三角形Contourを補充する．

Parameters
shellシェルデータへのポインタ
[in,out]vert頂点情報．補填された三角形の頂点情報が追加される．
modetrue: 多重Edgeを認める．
modefalse: 多重Edgeを認めない．

Definition at line 487 of file TriBrep.cpp.

488{
489 if (vert[0]->forbidden_list!=NULL) {
490 BREP_VERTEX_LIST::iterator vertex;
491 vertex = std::find(vert[0]->forbidden_list->begin(), vert[0]->forbidden_list->end(), vert[2]);
492 if (vertex!=vert[0]->forbidden_list->end()) return false; // 禁止Listの中に見つけた．
493 }
494
495 BREP_SOLID* solid = shell->solid;
496 CVCounter* counter = NULL;
497 if (solid->counter!=NULL) counter = solid->counter->GetUsableCounter();
498
499 BREP_FACET* facet = new BREP_FACET(shell);
500 BREP_CONTOUR* contour = CreateContourByVertex(facet, vert);
501 if (contour!=NULL) {
502 if (DupEdgeNumber(contour)==0 || mode) {
503 BREP_CONTOUR* collision;
504 facet->CloseData();
505 if (!IsCollisionContours(solid, contour, &collision)) {
506 solid->contours.push_back(contour);
507// PrintFacetAsciiSTL(contour);
508 if (counter!=NULL) counter->StepIt();
509 return true;
510 }
511 else FastDeleteFacet(facet);
512 }
513 else FastDeleteFacet(facet);
514 }
515 else FastDeleteFacet(facet);
516
517 return false;
518}
jbxl::BREP_FACET::CloseData
void CloseData()
Definition Brep.cpp:240
jbxl::FastDeleteFacet
DllExport void FastDeleteFacet(BREP_FACET *facet)
Definition TriBrep.cpp:787
jbxl::IsCollisionContours
DllExport bool IsCollisionContours(BREP_SOLID *solid, BREP_CONTOUR *contour, BREP_CONTOUR **collision)
Definition TriBrep.cpp:930

References BREP_FACET, BREP_FACET::CloseData(), BREP_SOLID::contours, BREP_SOLID::counter, CreateContourByVertex(), DupEdgeNumber(), FastDeleteFacet(), BREP_VERTEX::forbidden_list, CVCounter::GetUsableCounter(), IsCollisionContours(), BREP_SHELL::solid, and CVCounter::StepIt().

Referenced by FillShortageWings_Near(), and FillShortageWings_Next().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ point_fat_object_morph()

template<typename T >
bool point_fat_object_morph ( MSGraph< T > vp,
int x,
int y,
int z,
MSGraph< T > xp,
int cc )

template <typename T> bool point_fat_object_morph(MSGraph<T> vp, int x, int y, int z, MSGraph<T> xp, int cc)

Definition at line 199 of file Morph.h.

200{
201 int i, j, k, cx, cy, cz;
202 int xx, yy, zz, ax, ay, az;
203
204 for (k=0; k<xp.zs; k++) {
205 zz = z + k - xp.zs/2;
206 if (zz<0) zz = 0;
207 if (zz>vp.zs-1) zz = vp.zs-1;
208 az = vp.xs*vp.ys*zz;
209 cz = xp.xs*xp.ys*k;
210 for (j=0; j<xp.ys; j++) {
211 yy = y + j - xp.ys/2;
212 ay = az + vp.xs*yy;
213 cy = cz + xp.xs*j;
214 for (i=0; i<xp.xs; i++) {
215 xx = x + i - xp.xs/2;
216 ax = ay + xx;
217 cx = cy + i;
218 if (xp.gp[cx]>0) {
219 if (xx>=0&&xx<vp.xs&&yy>=0&&yy<vp.ys) {
220 if (vp.gp[ax]>=cc) return true;
221 }
222 }
223 }
224 }
225 }
226 return false;
227}

References MSGraph< T >::gp, MSGraph< T >::xs, MSGraph< T >::ys, and MSGraph< T >::zs.

Referenced by fat_object_morph().

Here is the caller graph for this function:

◆ point_open_morph()

template<typename T >
bool point_open_morph ( MSGraph< T > vp,
int x,
int y,
int z,
MSGraph< T > xp,
int cc )

template <typename T> bool point_open_morph(MSGraph<T> vp, int x, int y, int z, MSGraph<T> xp, int cc)

オープニング可能かどうかチェックする．

Definition at line 105 of file Morph.h.

106{
107 int i, j, k, cx, cy, cz;
108 int xx, yy, zz, ax, ay, az;
109
110 for (k=0; k<xp.zs; k++) {
111 zz = z + k - xp.zs/2;
112 if (zz<0) zz = 0;
113 if (zz>vp.zs-1) zz = vp.zs-1;
114 az = vp.xs*vp.ys*zz;
115 cz = xp.xs*xp.ys*k;
116 for (j=0; j<xp.ys; j++) {
117 yy = y + j - xp.ys/2;
118 ay = az + vp.xs*yy;
119 cy = cz + xp.xs*j;
120 for (i=0; i<xp.xs; i++) {
121 xx = x + i - xp.xs/2;
122 ax = ay + xx;
123 cx = cy + i;
124 if (xp.gp[cx]>0) {
125 if (!(xx>=0&&xx<vp.xs&&yy>=0&&yy<vp.ys)) return false;
126 if (vp.gp[ax]<cc) return false;
127 }
128 }
129 }
130 }
131 return true;
132}

References MSGraph< T >::gp, MSGraph< T >::xs, MSGraph< T >::ys, and MSGraph< T >::zs.

Referenced by opening_morph().

Here is the caller graph for this function:

◆ PPPQuaternion()

template<typename T >
Quaternion< T > PPPQuaternion ( Vector< T > a,
Vector< T > b,
Vector< T > c )

Definition at line 1320 of file Rotation.h.

1321{
1322 Quaternion<T> qut((T)1.0, (T)0.0, (T)0.0, (T)0.0, (T)1.0);
1323
1324 if (a.c<(T)0.0 || b.c<(T)0.0 || c.c<(T)0.0) return qut;
1325
1326 qut = V2VQuaternion<T>(b-a, c-b);
1327 return qut;
1328}

References Vector< T >::c.

◆ PPVQuaternion()

template<typename T >
Quaternion< T > PPVQuaternion ( Vector< T > a,
Vector< T > b,
Vector< T > c )

Definition at line 1342 of file Rotation.h.

1343{
1344 Quaternion<T> qut((T)1.0, (T)0.0, (T)0.0, (T)0.0, (T)1.0);
1345
1346 if (a.c<(T)0.0 || b.c<(T)0.0 || c.c<(T)0.0) return qut;
1347
1348 qut = V2VQuaternion<T>(b-a, c);
1349 return qut;
1350}

References Vector< T >::c.

◆ print_Matrix()

template<typename T >
void print_Matrix ( FILE * fp,
Matrix< T > a )

template <typename T> void print_Matrix(FILE* fp, Matrix<T> a)

実数マトリックスの要素を標準出力に書き出す．デバッグ用．

Parameters
fp出力先のファイルディスクリプタ
aプリントするマトリックス

Definition at line 236 of file Matrix++.h.

237{
238 for (int i=0; i<a.r; i++) {
239 fprintf(fp, " %15lf", (double)a.mx[i]);
240 if ((i+1)%a.sz[a.n-1]==0) fprintf(fp, "\n");
241 }
242}

References Matrix< T >::mx, Matrix< T >::n, Matrix< T >::r, and Matrix< T >::sz.

◆ println_FacetAsciiSTL()

DllExport void println_FacetAsciiSTL ( BREP_CONTOUR * contour)

void jbxl::println_FacetAsciiSTL(BREP_CONTOUR* contour)

contourの情報を STLのアスキー形式で表示する readSTLFileA()で読み込み可

Definition at line 413 of file STL.cpp.

414{
415 BREP_WING* wing = contour->wing;
416
417 PRINT_MESG("facet normal %g %g %g\n", contour->normal.x, contour->normal.y, contour->normal.z);
418 PRINT_MESG("outer loop\n");
419 for (int i=0; i<3; i++) {
420 Vector<double> vect = wing->vertex->point;
421 PRINT_MESG("vertex %g %g %g\n", vect.x, vect.y, vect.z);
422 wing = wing->next;
423 }
424 PRINT_MESG("endloop\n");
425 PRINT_MESG("endfacet\n");
426}
jbxl::BREP_CONTOUR::normal
Vector< double > normal
Definition Brep.h:174

References BREP_WING::next, BREP_CONTOUR::normal, BREP_VERTEX::point, PRINT_MESG, BREP_WING::vertex, BREP_CONTOUR::wing, Vector< T >::x, Vector< T >::y, and Vector< T >::z.

◆ ProportionVector()

template<typename T >
double ProportionVector ( TVector< T > v1,
TVector< T > v2,
T & t )

template <typename T> double ProportionVector(TVector<T> v1, TVector<T> v2, T& t)

ベクトルv1, v2が一直線上にあるかどうかをチェックする．
v1 = c*v2 の cを返す. tには誤差が入る．

Definition at line 62 of file TVector.h.

63{
64 double cc = 0.0;
65 T tt = (T)(Max(v2.t, Zero_Eps));
66 if (v2.n>=tt) cc = (v1*v2)/(double)(v2.n*v2.n);
67
68 TVector<T> dif = v1 - cc*v2;
69 T tolerance = (T)Max(dif.t, Zero_Eps);
70 if (dif.n>=tolerance) {
71 t = 0.0;
72 return -HUGE_VALF;
73 }
74 t = (T)((v1.n*v2.t + v2.n*v1.t)/(v2.n*v2.n)); // 誤差
75 return cc;
76}

References Max, Vector< T >::n, TVector< T >::t, and Zero_Eps.

Referenced by CollisionTriContour2D(), IsAtLine(), and IsInTriangle().

Here is the caller graph for this function:

◆ Quaternion2ExtEulerXYZ()

template<typename T >
Vector< T > Quaternion2ExtEulerXYZ ( Quaternion< T > qut,
Vector< T > * vct = NULL )

Definition at line 1100 of file Rotation.h.

1101{
1102 Matrix<T> mtx = qut.getRotMatrix();
1103 Vector<T> eul = RotMatrix2ExtEulerXYZ<T>(mtx, vct);
1104 mtx.free();
1105
1106 return eul;
1107}
jbxl::Quaternion::getRotMatrix
Matrix< T > getRotMatrix()
Definition Rotation.h:445

References Matrix< T >::free(), and Quaternion< T >::getRotMatrix().

Here is the call graph for this function:

◆ Quaternion2ExtEulerXZY()

template<typename T >
Vector< T > Quaternion2ExtEulerXZY ( Quaternion< T > qut,
Vector< T > * vct = NULL )

Definition at line 1122 of file Rotation.h.

1123{
1124 Matrix<T> mtx = qut.getRotMatrix();
1125 Vector<T> eul = RotMatrix2ExtEulerXZY(mtx, vct);
1126 mtx.free();
1127
1128 return eul;
1129}
jbxl::RotMatrix2ExtEulerXZY
Vector< T > RotMatrix2ExtEulerXZY(Matrix< T > mtx, Vector< T > *vct=NULL)
Definition Rotation.h:1033

References Matrix< T >::free(), Quaternion< T >::getRotMatrix(), and RotMatrix2ExtEulerXZY().

Here is the call graph for this function:

◆ Quaternion2ExtEulerYXZ()

template<typename T >
Vector< T > Quaternion2ExtEulerYXZ ( Quaternion< T > qut,
Vector< T > * vct = NULL )

Definition at line 1144 of file Rotation.h.

1145{
1146 Matrix<T> mtx = qut.getRotMatrix();
1147 Vector<T> eul = RotMatrix2ExtEulerYXZ(mtx, vct);
1148 mtx.free();
1149
1150 return eul;
1151}
jbxl::RotMatrix2ExtEulerYXZ
Vector< T > RotMatrix2ExtEulerYXZ(Matrix< T > mtx, Vector< T > *vct=NULL)
Definition Rotation.h:1065

References Matrix< T >::free(), Quaternion< T >::getRotMatrix(), and RotMatrix2ExtEulerYXZ().

Here is the call graph for this function:

◆ Quaternion2ExtEulerYZX()

template<typename T >
Vector< T > Quaternion2ExtEulerYZX ( Quaternion< T > qut,
Vector< T > * vct = NULL )

Definition at line 1133 of file Rotation.h.

1134{
1135 Matrix<T> mtx = qut.getRotMatrix();
1136 Vector<T> eul = RotMatrix2ExtEulerYZX(mtx, vct);
1137 mtx.free();
1138
1139 return eul;
1140}
jbxl::RotMatrix2ExtEulerYZX
Vector< T > RotMatrix2ExtEulerYZX(Matrix< T > mtx, Vector< T > *vct=NULL)
Definition Rotation.h:1049

References Matrix< T >::free(), Quaternion< T >::getRotMatrix(), and RotMatrix2ExtEulerYZX().

Here is the call graph for this function:

◆ Quaternion2ExtEulerZXY()

template<typename T >
Vector< T > Quaternion2ExtEulerZXY ( Quaternion< T > qut,
Vector< T > * vct = NULL )

Definition at line 1155 of file Rotation.h.

1156{
1157 Matrix<T> mtx = qut.getRotMatrix();
1158 Vector<T> eul = RotMatrix2ExtEulerZXY(mtx, vct);
1159 mtx.free();
1160
1161 return eul;
1162}
jbxl::RotMatrix2ExtEulerZXY
Vector< T > RotMatrix2ExtEulerZXY(Matrix< T > mtx, Vector< T > *vct=NULL)
Definition Rotation.h:1081

References Matrix< T >::free(), Quaternion< T >::getRotMatrix(), and RotMatrix2ExtEulerZXY().

Here is the call graph for this function:

◆ Quaternion2ExtEulerZYX()

template<typename T >
Vector< T > Quaternion2ExtEulerZYX ( Quaternion< T > qut,
Vector< T > * vct = NULL )

Definition at line 1111 of file Rotation.h.

1112{
1113 Matrix<T> mtx = qut.getRotMatrix();
1114 Vector<T> eul = RotMatrix2ExtEulerZYX(mtx, vct);
1115 mtx.free();
1116
1117 return eul;
1118}
jbxl::RotMatrix2ExtEulerZYX
Vector< T > RotMatrix2ExtEulerZYX(Matrix< T > mtx, Vector< T > *vct)
Definition Rotation.h:1017

References Matrix< T >::free(), Quaternion< T >::getRotMatrix(), and RotMatrix2ExtEulerZYX().

Here is the call graph for this function:

◆ readCmnHeadFile()

CmnHead readCmnHeadFile ( const char * fn,
CmnHead * chd,
bool cnt = false )

CmnHead jbxl::readCmnHeadFile(const char* fn, CmnHead* chd, bool cnt=false)

データ種別を chdで指定して，グラフィックデータを読み込み，Common 形式に変換する．

サポートしているデータ形式は,

  • Common 形式 : Common 形式にしたがって読み込む．(CT_RGN_SLは未サポート)
  • Sun Raster　 : Common 形式に変換する．ヘッダは RAS_DATA になる
  • Moon(CT)　　 : Common 形式に変換する．ヘッダは MOON_DATA になる．
  • DICOM : Common 形式に変換する．512x512xZ固定．ヘッダは DICOM_DATAになる．
  • USERSET_DATA : CmnHead* chd でヘッダ情報を指定して，読み込みを行う．ヘッダは USERSET_DATAになる．
  • Jpeg : Common 形式に変換する．ヘッダは JPEG_RGB_DATAになる．ただしモノクロJPEGの場合は JPEG_MONO_DATA
  • Tiff : 未サポート．Common 形式に変換する．ヘッダは TIFF_DATAになる．
Parameters
fn読み込むを行うファイル名．
[in,out]chdファイルのヘッダ情報を入れる．
cnt仮想カウンタを使用するか？
Returns
読み込んだグラフィックデータを記述する共通ヘッダ．
エラーなら kind = HEADER_NONE となる．またエラーの種類により xsizeが変化する．
Return values
JBXL_GRAPH_OPFILE_ERRORxsize ファイルオープンエラー．
JBXL_GRAPH_MEMORY_ERRORxsize メモリエラー．
JBXL_GRAPH_CANCELxsize キャンセル by ユーザ
Bug
Common形式の画素深度が 24,32bitの場合のエンディアン処理が未実装

Definition at line 1314 of file Gio.cpp.

1315{
1316 FILE* fp;
1317 int kind, fsz;
1318 bool no_ntoh = false;
1319 CmnHead hd;
1320 CVCounter* counter = NULL;
1321
1322 memset(&hd, 0, sizeof(CmnHead));
1323 hd.kind = HEADER_NONE;
1324 hd.xsize = JBXL_GRAPH_HEADER_ERROR;
1325
1326 if (chd==NULL) return hd;
1327
1328 fsz = (int)file_size(fn);
1329 if (fsz==0) {
1330 hd.xsize = JBXL_GRAPH_NOFILE_ERROR;
1331 return hd;
1332 }
1333
1334 if ((fp=fopen(fn,"rb"))==NULL) {
1335 hd.xsize = JBXL_GRAPH_OPFILE_ERROR;
1336 return hd;
1337 }
1338
1339 // ファイルとCPUのエンディアンが同じ
1340 if (checkBit(chd->kind, HAS_LENDIAN) && is_little_endian()) {
1341 no_ntoh = true;
1342 }
1343 kind = chd->kind & 0x00ff;
1344
1345 // オペレータ指定のデータ形式．カウンタ未サポート
1346 if (kind == USERSET_DATA) {
1347 if (chd->zsize<=0) chd->zsize = 1;
1348 chd->lsize = chd->xsize*chd->ysize*chd->zsize*((chd->depth+7)/8);
1349 if (fsz==(int)(chd->bsize+chd->lsize)) { // ファイルサイズのチェック
1350 DEBUG_MODE PRINT_MESG("JBXL::readCmnHeadFile: オペレータ指定のデータ形式\n");
1351 hd = readUserSetData(fp, chd, true); // カウンタ有効
1352
1353 // 24, 32bit 未対応
1354 if (hd.depth==16 && !no_ntoh) {
1355 sWord* wptr = (sWord*)hd.grptr;
1356 for (int i=0; i<hd.xsize*hd.ysize*hd.zsize; i++) {
1357 wptr[i] = ntohs(wptr[i]);
1358 }
1359 }
1360 }
1361 }
1362
1363 // DICOMファイル．
1364 else if (kind==DICOM_DATA) {
1365 MSGraph<sWord> vp = readDicomData(fp, fsz);
1366 if (vp.gp!=NULL) {
1367 DEBUG_MODE PRINT_MESG("JBXL::readCmnHeadFile: DICOMデータ形式\n");
1368 hd.kind = DICOM_DATA;
1369 hd.xsize = vp.xs;
1370 hd.ysize = vp.ys;
1371 hd.zsize = vp.zs;
1372 hd.depth = 16;
1373 hd.bsize = sizeof(CTHead);
1374 hd.lsize = vp.xs*vp.ys*vp.zs*2;
1375 hd.buf = (uByte*)malloc(hd.bsize);
1376 hd.grptr = (uByte*)vp.gp;
1377
1378 CTHead* pcthd = (CTHead*)hd.buf;
1379 memset(pcthd, 0, hd.bsize);
1380 pcthd->xsize = (sWord)hd.xsize;
1381 pcthd->ysize = (sWord)hd.ysize;
1382 //pcthd->ctmin = 0;
1383 //pcthd->ctmax = 0;
1384 //pcthd->cutup = 0;
1385 //pcthd->cutdown = 0;
1386 //pcthd->cutleft = 0;
1387 //pcthd->cutright = 0;
1388
1389 if (vp.RZxy>0.0) {
1390 pcthd->anydata[0] = (sWord)(vp.RZxy*RZXY_RATE);
1391 pcthd->anydata[1] = RZXY_RATE;
1392 hd.kind |= HAS_RZXY;
1393 }
1394
1395 if (!no_ntoh) {
1396 sWord* wptr = (sWord*)hd.grptr;
1397 for (int i=0; i<hd.xsize*hd.ysize*hd.zsize; i++) {
1398 wptr[i] = ntohs(wptr[i]);
1399 }
1400 }
1401 }
1402 }
1403
1404 // Sun Raster
1405 else if (kind==RAS_DATA) {
1406 DEBUG_MODE PRINT_MESG("JBXL::readCmnHeadFile: Sun Rasterデータ形式\n");
1407 hd = readRasData(fp);
1408 }
1409
1410 // Moon形式 16bit
1411 else if (kind==MOON_DATA) {
1412 DEBUG_MODE PRINT_MESG("JBXL::readCmnHeadFile: Moonデータ形式\n");
1413 hd = readMoonData(fp, fsz, no_ntoh);
1414 }
1415
1416#ifdef ENABLE_JPEGLIB
1417 // JPEG
1418 else if (kind==JPEG_RGB_DATA || kind==JPEG_MONO_DATA) {
1419 DEBUG_MODE PRINT_MESG("JBXL::readCmnHeadFile: JPEGデータ形式\n");
1420 JPEGImage jpg = readJPEGData(fp);
1421 hd = JPEGImage2CmnHead(jpg);
1422 jpg.free();
1423 }
1424#endif
1425
1426 // TIFF
1427 /*else if (kind == TIFF_DATA) {
1428
1429 }*/
1430
1431 // Common形式
1432 else if (kind!=UN_KNOWN_DATA) {
1433 // データ読み取りでは hd.lsize==0 のファイルサイズ無効（CT_RGN_SL）はまだサポートされていない
1434 DEBUG_MODE PRINT_MESG("JBXL::readCmnHeadFile: Commonデータ形式\n");
1435
1436 int hsz = sizeof(CmnHead_Entry);
1437 fseek(fp, 0, 0);
1438 size_t ret = fread(&hd.entry, hsz, 1, fp);
1439 hd.buf = NULL;
1440 hd.grptr = NULL;
1441 ntoh_st(&hd, 4);
1442 if (ret==0) {
1443 hd.xsize = JBXL_FILE_READ_ERROR;
1444 hd.kind = HEADER_NONE;
1445 fclose(fp);
1446 return hd;
1447 }
1448 if (hd.zsize<=0) hd.zsize = 1;
1449
1450 if (fsz == (int)(hsz + hd.bsize + hd.lsize) + 4 ) hsz = 36; // x86 file
1451 if (fsz == (int)(hsz + hd.bsize + hd.lsize) + 16) hsz = 48; // x64 file
1452
1453 // カウンタ
1454 if (hd.zsize>=10 && cnt) {
1455 counter = GetUsableGlobalCounter();
1456 if (counter!=NULL) {
1457 //counter->SetTitle("Commonファイル読み込み中");
1458 counter->SetMax(hd.zsize/10);
1459 counter->SetPos(0);
1460 }
1461 }
1462
1463 if (hd.bsize>0) {
1464 hd.buf = (uByte*)malloc(hd.bsize);
1465 if (hd.buf!=NULL) memset(hd.buf, 0, hd.bsize);
1466 }
1467 hd.grptr = (uByte*)malloc(hd.lsize);
1468 if ((hd.bsize>0&&hd.buf==NULL) || hd.grptr==NULL) {
1469 free_CmnHead(&hd);
1470 hd.xsize = JBXL_GRAPH_MEMORY_ERROR;
1471 hd.kind = HEADER_NONE;
1472 fclose(fp);
1473 return hd;
1474 }
1475 memset(hd.grptr, 0, hd.lsize);
1476
1477 fseek(fp, hsz, 0);
1478 if (hd.bsize>0) {
1479 ret = fread(hd.buf, hd.bsize, 1, fp);
1480 ntoh_ar((sWord*)hd.buf, hd.bsize);
1481 if (ret==0) {
1482 hd.xsize = JBXL_FILE_READ_ERROR;
1483 hd.kind = HEADER_NONE;
1484 fclose(fp);
1485 return hd;
1486 }
1487 }
1488
1489 // ヘッダのみ
1490 if (hd.lsize==0) {
1491 if (counter!=NULL) counter->PutFill();
1492 }
1493 else {
1494 // データ本体
1495 if (counter==NULL) {
1496 ret = fread(hd.grptr, hd.lsize, 1, fp);
1497 if (ret==0) {
1498 hd.xsize = JBXL_FILE_READ_ERROR;
1499 hd.kind = HEADER_NONE;
1500 fclose(fp);
1501 return hd;
1502 }
1503 }
1504 else {
1505 int psize = hd.xsize*hd.ysize*((hd.depth+7)/8);
1506 for (int i=0; i<hd.zsize; i++) {
1507 ret = fread(hd.grptr+i*psize, psize, 1, fp);
1508 if (ret==0) {
1509 hd.xsize = JBXL_FILE_READ_ERROR;
1510 hd.kind = HEADER_NONE;
1511 fclose(fp);
1512 return hd;
1513 }
1514 if (i%10==0) {
1515 counter->StepIt();
1516 if (counter->isCanceled()) { // キャンセル
1517 //counter->Stop();
1518 free_CmnHead(&hd);
1519 hd.xsize = JBXL_GRAPH_CANCEL;
1520 hd.kind = HEADER_NONE;
1521 fclose(fp);
1522 return hd;
1523 }
1524 }
1525 }
1526 }
1527
1528 // 24, 32bit 未対応
1529 if (hd.depth==16 && !no_ntoh) {
1530 sWord* wptr = (sWord*)hd.grptr;
1531 for (int i=0; i<hd.xsize*hd.ysize*hd.zsize; i++) {
1532 wptr[i] = ntohs(wptr[i]);
1533 }
1534 }
1535
1536 if (counter!=NULL) counter->PutFill();
1537 }
1538 }
1539
1540 else {
1541 PRINT_MESG("JBXL::readCmnHeadFile: 未知のデータ形式が指定された．(%04x, %04x)\n", chd->kind, (uWord)kind);
1542 }
1543
1544 fclose(fp);
1545 return hd;
1546}
jbxl::CVCounter::SetPos
virtual void SetPos(int p)
カウンタの現在位置を設定
Definition ClassBox.h:163
MOON_DATA
#define MOON_DATA
0x0003 // CT DATA
Definition gheader.h:172
USERSET_DATA
#define USERSET_DATA
0x0005 // ユーザ指定のデータ形式（ヘッダ形式指定の場合，使用する）
Definition gheader.h:174
RAS_DATA
#define RAS_DATA
0x0070 // SUN RASTER 8bit
Definition gheader.h:198
DICOM_DATA
#define DICOM_DATA
0x0004 // DICOM Header
Definition gheader.h:173
HAS_LENDIAN
#define HAS_LENDIAN
0x4000 // リトルエンディアン
Definition gheader.h:210
JBXL_GRAPH_OPFILE_ERROR
#define JBXL_GRAPH_OPFILE_ERROR
ファイルのオープンエラー
Definition jbxl_state.h:173
JBXL_GRAPH_NOFILE_ERROR
#define JBXL_GRAPH_NOFILE_ERROR
ファイルが存在しない
Definition jbxl_state.h:172
jbxl::readDicomData
MSGraph< sWord > readDicomData(FILE *fp, int fsz)
Definition Gio.cpp:654
jbxl::readRasData
CmnHead readRasData(FILE *fp)
read_ras_data() for C // SUN RASTER形式のファイルを読み込む
Definition Gio.cpp:30
jbxl::readMoonData
CmnHead readMoonData(FILE *fp, unsigned int fsz=0, bool no_ntoh=false)
Definition Gio.cpp:388
jbxl::readUserSetData
CmnHead readUserSetData(FILE *fp, CmnHead *ch, bool cnt=false)
read_user_data() for C // ユーザ指定(ch)のデータ形式でファイルを読み込む
Definition Gio.cpp:235
CmnHead_Entry
Definition gheader.h:110
CmnHead::entry
CmnHead_Entry entry
Definition gheader.h:125
file_size
unsigned long int file_size(const char *fn)
ファイルの大きさを返す．
Definition tools.cpp:2309
is_little_endian
int is_little_endian(void)
エンディアンの動的チェック
Definition tools.cpp:80
ntoh_ar
#define ntoh_ar(p, s)
network形式から host形式へ．長さsバイトの配列pに対して変換
Definition tools.h:427
ntoh_st
#define ntoh_st(p, s)
network形式から host形式へ．構造体pに対して sバイトづつ変換．
Definition tools.h:425

References CTHead::anydata, CmnHead::bsize, CmnHead::buf, checkBit, DEBUG_MODE, CmnHead::depth, DICOM_DATA, CmnHead::entry, file_size(), free_CmnHead(), GetUsableGlobalCounter(), MSGraph< T >::gp, CmnHead::grptr, HAS_LENDIAN, HAS_RZXY, HEADER_NONE, is_little_endian(), CVCounter::isCanceled(), JBXL_FILE_READ_ERROR, JBXL_GRAPH_CANCEL, JBXL_GRAPH_HEADER_ERROR, JBXL_GRAPH_MEMORY_ERROR, JBXL_GRAPH_NOFILE_ERROR, JBXL_GRAPH_OPFILE_ERROR, JPEG_MONO_DATA, JPEG_RGB_DATA, CmnHead::kind, CmnHead::lsize, MOON_DATA, ntoh_ar, ntoh_st, PRINT_MESG, CVCounter::PutFill(), RAS_DATA, readDicomData(), readMoonData(), readRasData(), readUserSetData(), MSGraph< T >::RZxy, RZXY_RATE, CVCounter::SetMax(), CVCounter::SetPos(), CVCounter::StepIt(), UN_KNOWN_DATA, USERSET_DATA, MSGraph< T >::xs, CTHead::xsize, CmnHead::xsize, MSGraph< T >::ys, CTHead::ysize, CmnHead::ysize, MSGraph< T >::zs, and CmnHead::zsize.

Referenced by readGraphicSlices().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ readDicomData()

MSGraph< sWord > readDicomData ( FILE * fp,
int fsz )

Definition at line 654 of file Gio.cpp.

655{
656 int sz, dsize;
657 int xsize, ysize, depth;
658 double rzxy;
659 MSGraph<sWord> vp;
660
661 memset(&vp, 0, sizeof(MSGraph<sWord>));
662
663 sz = dicomHeader(fp, fsize, &dsize, &xsize, &ysize, &depth, &rzxy);
664 if (sz<=0) {
665 vp.xs = JBXL_GRAPH_HEADER_ERROR;
666 return vp;
667 }
668
669 if (dsize!=xsize*ysize*((depth+7)/8)) {
670 vp.xs = JBXL_GRAPH_HEADER_ERROR;
671 return vp;
672 }
673
674 if ((depth+7)/8!=2) {
675 vp.xs = JBXL_GRAPH_HEADER_ERROR;
676 return vp;
677 }
678
679 vp.set(xsize, ysize, 1, 0, 0, rzxy);
680
681 fseek(fp, sz, 0);
682 size_t ret = fread(vp.gp, dsize, 1, fp);
683 if (ret==0) vp.xs = JBXL_FILE_READ_ERROR;
684
685 return vp;
686}
jbxl::dicomHeader
int dicomHeader(FILE *fp, int fsize, int *dsize, int *xsize, int *ysize, int *depth, double *rzxy)
Definition Gio.cpp:471

References dicomHeader(), MSGraph< T >::gp, JBXL_FILE_READ_ERROR, JBXL_GRAPH_HEADER_ERROR, MSGraph< T >::set(), and MSGraph< T >::xs.

Referenced by readCmnHeadFile(), readDicomFile(), and readXHeadFile().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ readDicomFile()

MSGraph< sWord > readDicomFile ( const char * fn)

MSGraph<sWord> jbxl::readDicomFile(const char* fn)

DICOM形式のデータを読み込む．

Attention
現在はまだ限定的な機能しか持たない．
Bug
depth = 16bit 固定

Definition at line 628 of file Gio.cpp.

629{
630 int fsize;
631 FILE* fp;
632 MSGraph<sWord> vp;
633
634 memset(&vp, 0, sizeof(MSGraph<sWord>));
635
636 fsize = file_size(fn);
637 if (fsize<=0) {
638 vp.xs = JBXL_GRAPH_NOFILE_ERROR;
639 return vp;
640 }
641
642 if ((fp=fopen(fn,"r"))==NULL) {
643 vp.xs = JBXL_GRAPH_OPFILE_ERROR;
644 return vp;
645 }
646
647 vp = readDicomData(fp, fsize);
648
649 fclose(fp);
650 return vp;
651}

References file_size(), JBXL_GRAPH_NOFILE_ERROR, JBXL_GRAPH_OPFILE_ERROR, readDicomData(), and MSGraph< T >::xs.

Here is the call graph for this function:

◆ readGraphicFile()

template<typename T >
MSGraph< T > readGraphicFile ( const char * fname,
CmnHead * chd = NULL,
bool cnt = false )

template <typename T> MSGraph<T> readGraphicFile(const char* fname, CmnHead* chd=NULL, bool cnt=false)

色々なグラフィックファイルを読み込んで，MSGraph<T>に格納．
サポートしているデータ形式は,

  • Common 形式 : Common 形式にしたがって読み込む．(CT_RGN_SLは未サポート)
  • Sun Raster : Common 形式に変換する．ヘッダは RAS_DATA になる
  • Moon(CT) : Common 形式に変換する．ヘッダは MOON_DATA になる．
  • USERSET_DATA : CmnHead* chd でヘッダ情報を指定して，読み込みを行う．ヘッダは USERSET_DATAになる．
  • DICOM_DATA : DICOM ファイル
  • JPEG_RGB_DATA : JPEG ファイル
  • JPEG_MONO_DATA : モノクロ JPEG
  • unkonwn : ファイルをそのまま，hd->grptrへ読み込む．ヘッダは UN_KNOWN_DATA になる．

ただし，UN_KNOWN_DATAの場合は CmnHaedの hd->kind, hd->lsize, hd->gptr のみ有効．

Parameters
fname読み込むを行うファイル名．
[in]chdUSERSET_DATA指定の場合，ファイルのヘッダ情報を入れた CmnHead
[out]chdCmnHeadにも格納したい場合は，そのアドレスを指定．
cntカウンタ（プログレスバー）を使用するかどうか？
Returns
読み込んだグラフィックデータと，それを記述する共通ヘッダ．

エラーなら MSGraph.isNull()が真，または CmnHead.kind = HEADER_NONE となる．
またエラーの種類により MSGraph.stateが変化する.

Return values
JBXL_GRAPH_HEADER_ERRORstate ファイルのヘッダ読み取りエラー．
JBXL_GRAPH_MEMORY_ERRORstate メモリエラー．
CmnHeadのヘッダ情報 (chd!=NULLのときのみ) chd->kind
  • HEADER_NONE: データ読み込み失敗．
  • UN_KNOWN_DATA: ヘッダが解析できないのでファイルイメージのまま chd->grptrに格納した．
    • chd->kind, chd->lsize, chd->gptrのみ有効．MSGraph<T>.gp は NULL．
  • その他: MSGraph<T> に画像データが入る．*chd にはヘッダ情報のみが入る．
    • chd->buf, chd->gptr は NULL. CT_DATA, RAS_DATA, CT_3DM など．
Bug
Common 形式の画素深度が 24,32bitの場合のエンディアン処理が未実装

Definition at line 169 of file Gio.h.

170{
171 MSGraph<T> vp;
172 CmnHead hd;
173 CVCounter* counter = NULL;
174
175 counter = GetUsableGlobalCounter();
176 if (counter!=NULL) {
177 counter->SetMax(100);
178 counter->MakeChildCounter(80);
179 }
180
181 vp.init();
182
183 hd = readXHeadFile(fname, chd, cnt);
184 if (counter!=NULL) counter->DeleteChildCounter();
185
186 // Error
187 if (hd.kind==HEADER_NONE) {
188 free_CmnHead(&hd);
189 if (hd.xsize<0) vp.state = hd.xsize;
190 else vp.state = JBXL_GRAPH_HEADER_ERROR;
191 return vp;
192 }
193
194 // Unknown Data
195 int chk = hd.kind & 0x00ff;
196 if (chk==UN_KNOWN_DATA) {
197 if (chd!=NULL) *chd = hd;
198 else free_CmnHead(&hd);
199 vp.state = JBXL_GRAPH_HEADER_ERROR;
200 return vp;
201 }
202
203 if (counter!=NULL) counter->MakeChildCounter(80);
204
205 if (cnt) {
206 CVCounter* counter = GetUsableGlobalCounter();
207 if (counter!=NULL) counter->SetTitle("画像データへ変換");
208 }
209
210 if (chd!=NULL) {
211 *chd = hd;
212 chd->grptr = chd->buf = NULL;
213 }
214
215 vp = copyCmnHead2MSGraph<T>(hd, CH2MG_NORMAL, cnt);
216 free_CmnHead(&hd);
217 if (vp.gp==NULL) return vp;
218
219 if (ZeroBase!=0) {
220 vp.base += ZeroBase;
221 for (int i=0; i<vp.xs*vp.ys*vp.zs; i++) vp.gp[i] += (T)ZeroBase;
222 }
223
224 if (counter!=NULL){
225 counter->DeleteChildCounter();
226 counter->PutFill();
227 }
228
229 return vp;
230}
CH2MG_NORMAL
#define CH2MG_NORMAL
Definition Gdata.h:624
jbxl::ZeroBase
int ZeroBase
Definition Gdata.cpp:13

References MSGraph< T >::base, CH2MG_NORMAL, CVCounter::DeleteChildCounter(), free_CmnHead(), GetUsableGlobalCounter(), MSGraph< T >::gp, CmnHead::grptr, HEADER_NONE, MSGraph< T >::init(), JBXL_GRAPH_HEADER_ERROR, CmnHead::kind, CVCounter::MakeChildCounter(), CVCounter::PutFill(), readXHeadFile(), CVCounter::SetMax(), CVCounter::SetTitle(), MSGraph< T >::state, UN_KNOWN_DATA, MSGraph< T >::xs, CmnHead::xsize, MSGraph< T >::ys, ZeroBase, and MSGraph< T >::zs.

Here is the call graph for this function:

◆ readGraphicSlices()

template<typename T >
MSGraph< T > readGraphicSlices ( const char * fmt,
int fst,
int fnd,
CmnHead * chd = NULL,
bool cnt = false )

template <typename T> MSGraph<T> readGraphicSlices(const char* fmt, int fst, int fnd, CmnHead* chd=NULL, bool cnt=false)

色々なグラフィックファイルをスライスデータとして読み込んで，3D画像として MSGraph<T>に格納．また，chd!=NULL ならCommon(CmnHead)形式にも変換する．

Z方向の歪率をサポート（CmnHead, Moon形式のファイルのみ）
グローバルカウンタが使用可能．カウンタによるキャンセル機能を持つ．

readGraphicFile()と殆ど同じ手法を用いているので，その他は readGraphicFile()に準じる．

Parameters
fmt読み込むを行うファイル名（dなどの入った書式）．
fst最初に読み込むファイルの番号（ファイル名の中にその数字がなければならない）
fnd最後に読み込むファイルの番号（ファイル名の中にその数字がなければならない）
chdCmnHeadにもデータを格納したい場合はそのアドレスを指定．
または DICOM_DATA, USERSET_DATA指定時のヘッダ情報を格納する．
cnt仮想カウンタを使用するか?
Returns
MSGraph型の読み込んだ画像データ
例
vp = readGraphicSlices("i%02d", 0, 10); // i00 〜 i10 までの11枚の画像データを読み込んで，vpに格納．
jbxl::readGraphicSlices
MSGraph< T > readGraphicSlices(const char *fmt, int fst, int fnd, CmnHead *chd=NULL, bool cnt=false)
Definition Gio.h:258

Definition at line 258 of file Gio.h.

259{
260 int i, k, l, m, chk, kind;
261 int xsize, ysize, zsize, nsize, psize; // zsize: 1枚の画像のZサイズ．
262 // nsize: 出来上がりの 3D画像のZサイズ
263 char* fr_name;
264 CmnHead dhd, hd;
265 MSGraph<T> vp, gd;
266
267 if (chd!=NULL) {
268 DEBUG_MESG("readGraphicSlices: Called with kind = 0x%04x\n", chd->kind);
269 }
270 else {
271 DEBUG_MESG("readGraphicSlices: Called with NULL Header\n");
272 }
273
274 gd.init();
275 vp.init();
276
277 // 1枚目（ヘッダ情報）の読み出し
278 fr_name = numbering_name(fmt, fst);
279 dhd = readXHead(fr_name, chd);
280 freeNull(fr_name);
281
282 chk = dhd.kind & 0x00ff;
283 if (dhd.kind==HEADER_NONE || chk==UN_KNOWN_DATA) {
284 DEBUG_MODE PRINT_MESG("readGraphicSlices: ヘッダ読み込みエラー： kind = %d\n", dhd.kind);
285 free_CmnHead(&dhd);
286 vp.state = JBXL_GRAPH_HEADER_ERROR;
287 vp.zs = fst;
288 return vp;
289 }
290 kind = dhd.kind;
291 xsize = dhd.xsize;
292 ysize = dhd.ysize;
293 zsize = Max(dhd.zsize, 1);
294 nsize = zsize*(Xabs(fnd - fst) + 1);
295 psize = xsize*ysize*zsize;
296 if (dhd.depth==16) gd.color = GRAPH_COLOR_MONO16;
297 else gd.color = GRAPH_COLOR_MONO;
298
299 // カウンタ
300 CVCounter* counter = NULL;
301 if (nsize>=10 && cnt) {
302 counter = GetUsableGlobalCounter();
303 if (counter!=NULL) {
304 //counter->SetTitle("マルチファイル読み込み中");
305 counter->SetMax(nsize/10);
306 counter->SetPos(1);
307 }
308 }
309
310 // Z軸の歪, ベース，rbound の設定
311 if (dhd.buf!=NULL && (chk==CT_DATA || chk==CT_3DM || chk==DICOM_DATA)) {
312 sWord* rz = (sWord*)dhd.buf;
313 if (rz[9]==RZXY_RATE || checkBit(dhd.kind, HAS_RZXY)) {
314 double rzm = rz[8]/(double)rz[9];
315 if (rzm<5.0 && rzm>0.) gd.RZxy = rzm;
316 }
317
318 if (rz[10]!=0 && checkBit(dhd.kind, HAS_BASE)) {
319 gd.base = (T)rz[10];
320 }
321
322 if (checkBit(dhd.kind, HAS_RBOUND)) {
323 gd.rbound.xmin = rz[6];
324 gd.rbound.xmax = rz[7];
325 gd.rbound.ymin = rz[4];
326 gd.rbound.ymax = rz[5];
327 gd.rbound.zmin = rz[2];
328 gd.rbound.zmax = rz[3];
329 }
330 }
331 free_CmnHead(&dhd);
332
333 dhd.kind = kind;
334 if (chd!=NULL) dhd.kind |= chd->kind & 0xff00; // オプション
335 *chd = getinfo_CmnHead(dhd);
336
337 // データ読み込み（Z軸方向） 1枚目から
338 gd.getm(xsize, ysize, nsize);
339 if (gd.isNull()) return gd;
340
341 l = 0;
342 k = fst;
343 m = Sign(fnd - fst);
344 while(k != fnd+m){
345 fr_name = numbering_name(fmt, k);
346 hd = readCmnHeadFile(fr_name, &dhd, false); // カウンタ無効
347 free(fr_name);
348
349 chk = hd.kind & 0x00ff;
350 if (hd.kind==HEADER_NONE || chk==UN_KNOWN_DATA) {
351 DEBUG_MESG("readGraphicSlices: データ読み込みエラー： n = %d, kind = %d\n", k, hd.kind);
352 free_CmnHead(&hd);
353 if (l==0) { // 1枚目でエラー
354 gd.free();
355 vp.state = JBXL_GRAPH_HEADER_ERROR;
356 vp.zs = k;
357 return vp;
358 }
359 else { // 途中までは読み込み完了
360 gd.state = l;
361 gd.zs = l*zsize;
362 break;
363 }
364 }
365
366 vp = copyCmnHead2MSGraph<T>(hd, CH2MG_NOPARM, false); // カウンタ無効
367 if (vp.isNull()) {
368 free_CmnHead(&hd);
369 gd.free();
370 vp.free();
371 vp.state = JBXL_GRAPH_MEMORY_ERROR;
372 vp.zs = k;
373 return vp;
374 }
375
376 // gd へコピー
377 for (i=0; i<psize; i++) gd.gp[i + psize*l] = vp.gp[i] + ZeroBase;
378 if (l==0) {
379 gd.min = vp.min;
380 gd.max = vp.max;
381 }
382 else {
383 gd.min = Min(gd.min, vp.min);
384 gd.max = Max(gd.max, vp.max);
385 }
386
387 // 後始末
388 free_CmnHead(&hd);
389 vp.free();
390 k += m;
391 l++;
392
393 // カウンタ
394 if (counter!=NULL && l%10==0) {
395 counter->StepIt();
396 if (counter->isCanceled()) { // キャンセル
397 gd.free();
398 vp.state = JBXL_GRAPH_CANCEL;
399 vp.zs = k;
400 return vp;
401 }
402 }
403 }
404 gd.state = l;
405 gd.base += ZeroBase;
406
407 if (!checkBit(kind, HAS_RBOUND)) gd.rbound.set(0, gd.xs-1, 0, gd.ys-1, 0, gd.zs-1);
408 if (chd!=NULL) {
409 if ((chd->kind&0x00ff)==USERSET_DATA) {
410 CVCounter* counter = GetUsableGlobalCounter();
411 if (counter!=NULL) counter->SetTitle("Converting Data");
412 *chd = copyMSGraph2CmnHead(gd);
413 }
414 }
415 if (counter!=NULL) {
416 counter->PutFill();
417 //counter->Stop();
418 }
419
420 return gd;
421}
Sign
#define Sign(x)
Definition common.h:253
jbxl::getinfo_CmnHead
CmnHead getinfo_CmnHead(CmnHead hd)
ヘッダ情報のみをコピーする
Definition Gdata.cpp:58
jbxl::readCmnHeadFile
CmnHead readCmnHeadFile(const char *fn, CmnHead *ch, bool cnt=false)
拡張read関数．ファイル種別を指定して読み込む．
Definition Gio.cpp:1314
jbxl::freeNull
void freeNull(T &p)
Definition common++.h:37
jbxl::readXHead
CmnHead readXHead(const char *fn, CmnHead *ch=NULL)
ヘッダ部分のみ読み込み
Definition Gio.cpp:708
jbxl::copyMSGraph2CmnHead
CmnHead copyMSGraph2CmnHead(MSGraph< T > &vp, unsigned int mode=MG2CH_NORMAL, bool cnt=false)
Definition Gdata.h:805
numbering_name
char * numbering_name(const char *fmt, int n)
フォーマット fmtに従って，nを含む文字列を作り出す．要 free()
Definition tools.cpp:2598
DEBUG_MESG
#define DEBUG_MESG
デバッグ用出力関数．コンパイル時に削除可能
Definition tools.h:514

References MSGraph< T >::base, CmnHead::buf, CH2MG_NOPARM, checkBit, MSGraph< T >::color, copyMSGraph2CmnHead(), CT_3DM, CT_DATA, DEBUG_MESG, DEBUG_MODE, CmnHead::depth, DICOM_DATA, MSGraph< T >::free(), free_CmnHead(), freeNull(), getinfo_CmnHead(), MSGraph< T >::getm(), GetUsableGlobalCounter(), MSGraph< T >::gp, GRAPH_COLOR_MONO, GRAPH_COLOR_MONO16, HAS_BASE, HAS_RBOUND, HAS_RZXY, HEADER_NONE, MSGraph< T >::init(), CVCounter::isCanceled(), MSGraph< T >::isNull(), JBXL_GRAPH_CANCEL, JBXL_GRAPH_HEADER_ERROR, JBXL_GRAPH_MEMORY_ERROR, CmnHead::kind, Max, MSGraph< T >::max, Min, MSGraph< T >::min, numbering_name(), PRINT_MESG, CVCounter::PutFill(), MSGraph< T >::rbound, readCmnHeadFile(), readXHead(), MSGraph< T >::RZxy, RZXY_RATE, RBound< T >::set(), CVCounter::SetMax(), CVCounter::SetPos(), CVCounter::SetTitle(), Sign, MSGraph< T >::state, CVCounter::StepIt(), UN_KNOWN_DATA, USERSET_DATA, Xabs, RBound< T >::xmax, RBound< T >::xmin, MSGraph< T >::xs, CmnHead::xsize, RBound< T >::ymax, RBound< T >::ymin, MSGraph< T >::ys, CmnHead::ysize, ZeroBase, RBound< T >::zmax, RBound< T >::zmin, MSGraph< T >::zs, and CmnHead::zsize.

Here is the call graph for this function:

◆ readMoonData()

CmnHead readMoonData ( FILE * fp,
unsigned int fsz = 0,
bool no_ntoh = false )

CmnHead jbxl::readMoonData(FILE* fp, unsigned int fsz, bool no_ntoh)

MOON_DATA形式（16bit）のグラフィックファイルを読み込む．

Parameters
fp読み込むを行うファイルのファイル識別子．
fszファイルのサイズ（チェックに使用, 0以下ならチェックしない）
no_ntohtrueの場合，エンディアンの変換を行わない．
Returns
読み込んだグラフィックデータの共通ヘッダ．
エラー場合 kindメンバは HEADER_NONEとなる．またエラーの種類により xsizeが変化する．
Return values
-2xsize メモリエラー．

Definition at line 388 of file Gio.cpp.

389{
390 int i;
391 size_t ret;
392 CTHead chd;
393 CmnHead hd;
394
395 hd.kind = HEADER_NONE;
396 hd.bsize = 64; // Moon形式のヘッダサイズ
397
398 // ヘッダ読み込み
399 fseek(fp, 0, 0);
400 ret = fread((void*)&chd, hd.bsize, 1, fp);
401 ntoh_st(&chd, 2);
402 if (ret==0) {
403 hd.xsize = JBXL_FILE_READ_ERROR;
404 hd.kind = HEADER_NONE;
405 return hd;
406 }
407
408 hd.xsize = chd.xsize - chd.cutleft - chd.cutright;
409 hd.ysize = chd.ysize - chd.cutup - chd.cutdown;
410 hd.zsize = 1;
411 hd.depth = 16;
412 hd.lsize = hd.xsize*hd.ysize*(hd.depth/8);
413 hd.buf = NULL;
414 hd.grptr = NULL;
415 if (fsz>0 && fsz!=hd.bsize+hd.lsize) return hd;
416
417 hd.buf = (uByte*)malloc(hd.bsize);
418 if (hd.buf==NULL) {
419 hd.xsize = JBXL_GRAPH_MEMORY_ERROR;
420 return hd;
421 }
422 memcpy(hd.buf, &chd, hd.bsize);
423 hd.kind = MOON_DATA;
424
425 hd.grptr = (uByte*)malloc(hd.lsize);
426 if (hd.grptr==NULL) {
427 freeNull(hd.buf);
428 hd.xsize = JBXL_GRAPH_MEMORY_ERROR;
429 hd.kind = HEADER_NONE;
430 return hd;
431 }
432 memset(hd.grptr, 0, hd.lsize);
433
434 fseek(fp, hd.bsize, 0);
435 ret = fread(hd.grptr, hd.lsize, 1, fp);
436 if (ret==0) {
437 hd.xsize = JBXL_FILE_READ_ERROR;
438 hd.kind = HEADER_NONE;
439 return hd;
440 }
441 if (!no_ntoh) {
442 sWord* wptr = (sWord*)hd.grptr;
443 for (i=0; i<hd.xsize*hd.ysize; i++) wptr[i] = ntohs(wptr[i]);
444 }
445 return hd;
446}
CTHead::cutup
sWord cutup
Definition gheader.h:69
CTHead::cutleft
sWord cutleft
Definition gheader.h:71

References CmnHead::bsize, CmnHead::buf, CTHead::cutdown, CTHead::cutleft, CTHead::cutright, CTHead::cutup, CmnHead::depth, freeNull(), CmnHead::grptr, HEADER_NONE, JBXL_FILE_READ_ERROR, JBXL_GRAPH_MEMORY_ERROR, CmnHead::kind, CmnHead::lsize, MOON_DATA, ntoh_st, CTHead::xsize, CmnHead::xsize, CTHead::ysize, CmnHead::ysize, and CmnHead::zsize.

Referenced by readCmnHeadFile(), readMoonFile(), and readXHeadFile().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ readMoonFile()

CmnHead readMoonFile ( const char * fn,
bool no_ntoh = false )

CmnHead jbxl::readMoonFile(const char* fn, bool no_ntoh)

MOON_DATA形式（16bit）のグラフィックファイルを読み込む．

Parameters
fn読み込むを行うファイル名．
no_ntohtrueの場合，エンディアンの変換を行わない．
Returns
読み込んだグラフィックデータの共通ヘッダ．
エラー場合 kindメンバは HEADER_NONEとなる．またエラーの種類により xsizeが変化する．
Return values
JBXL_GRAPH_MEMORY_ERRORxsize メモリエラー．

Definition at line 350 of file Gio.cpp.

351{
352 CmnHead hd;
353 FILE* fp;
354 unsigned int fsz;
355
356 memset(&hd, 0, sizeof(CmnHead));
357 hd.kind = HEADER_NONE;
358
359 fsz = file_size(fn);
360 if (fsz==0) {
361 hd.xsize = JBXL_GRAPH_NOFILE_ERROR;
362 return hd;
363 }
364 if ((fp=fopen(fn,"rb"))==NULL) {
365 hd.xsize = JBXL_GRAPH_OPFILE_ERROR;
366 return hd;
367 }
368
369 hd = readMoonData(fp, fsz, no_ntoh);
370 fclose(fp);
371 return hd;
372}

References file_size(), HEADER_NONE, JBXL_GRAPH_NOFILE_ERROR, JBXL_GRAPH_OPFILE_ERROR, CmnHead::kind, readMoonData(), and CmnHead::xsize.

Here is the call graph for this function:

◆ readRasData()

CmnHead readRasData ( FILE * fp)

CmnHead jbxl::readRasData(FILE* fp)

SUN RASTER形式のグラフィックファイルを読み込む．

Parameters
fp読み込むを行うファイルのファイル識別子．
Returns
読み込んだグラフィックデータの共通ヘッダ．エラー場合 kindメンバは HEADER_NONEとなる．
Return values
JBXL_GRAPH_MEMORY_ERRORxsize メモリエラー．
Bug
24ビット以上のエンディアン処理は未実装

Definition at line 30 of file Gio.cpp.

31{
32 RasHead rhd;
33 CmnHead hd;
34 int i, linebyte, databyte;
35 uByte null[2], *buf;
36 sWord* wptr;
37
38 hd.kind = RAS_DATA;
39 hd.bsize = 32;
40 hd.buf = NULL;
41 hd.grptr = NULL;
42
43 fseek(fp, 0, 0);
44 size_t ret = fread(&rhd, hd.bsize, 1, fp);
45 ntoh_st(&rhd, 4);
46 if (ret==0) {
47 hd.xsize = JBXL_FILE_READ_ERROR;
48 hd.kind = HEADER_NONE;
49 return hd;
50 }
51
52 hd.xsize = rhd.ras_width;
53 hd.ysize = rhd.ras_height;
54 hd.zsize = 1;
55 hd.depth = rhd.ras_depth;
56 hd.lsize = hd.xsize*hd.ysize*((hd.depth+7)/8);
57 hd.buf = (uByte*)malloc(hd.bsize);
58 if (hd.buf==NULL) {
59 hd.xsize = JBXL_GRAPH_MEMORY_ERROR;
60 hd.kind = HEADER_NONE;
61 return hd;
62 }
63 memcpy(hd.buf, (uByte*)&rhd, hd.bsize);
64
65 hd.grptr = (uByte*)malloc(hd.lsize);
66 if (hd.grptr==NULL) {
67 freeNull(hd.buf);
68 hd.xsize = JBXL_GRAPH_MEMORY_ERROR;
69 hd.kind = HEADER_NONE;
70 return hd;
71 }
72 memset(hd.grptr, 0, hd.lsize);
73 buf = (uByte*)hd.grptr;
74
75 fseek(fp, rhd.ras_maplength, 1);
76 databyte = hd.xsize*((hd.depth+7)/8);
77 linebyte = rhd.ras_length/hd.ysize;
78
79 if (databyte==linebyte) {
80 ret = fread(buf, hd.lsize, 1, fp);
81 if (ret==0) {
82 hd.xsize = JBXL_FILE_READ_ERROR;
83 hd.kind = HEADER_NONE;
84 return hd;
85 }
86 }
87 else {
88 for (i=0; i<hd.ysize; i++) {
89 ret = fread(buf, databyte, 1, fp);
90 if (ret>0) ret = fread(null, linebyte - databyte, 1, fp);
91 if (ret==0) {
92 hd.xsize = JBXL_FILE_READ_ERROR;
93 hd.kind = HEADER_NONE;
94 return hd;
95 }
96 buf += databyte;
97 }
98 }
99
100 if (hd.depth==16){
101 wptr = (sWord*)hd.grptr;
102 for(i=0; i<hd.xsize*hd.ysize; i++) wptr[i] = ntohs(wptr[i]);
103 }
104
105 return hd;
106}
RasHead::ras_length
int ras_length
Definition gheader.h:87
RasHead::ras_height
int ras_height
Definition gheader.h:85
RasHead::ras_depth
int ras_depth
Definition gheader.h:86
RasHead::ras_maplength
int ras_maplength
Definition gheader.h:90
RasHead::ras_width
int ras_width
Definition gheader.h:84

References CmnHead::bsize, CmnHead::buf, CmnHead::depth, freeNull(), CmnHead::grptr, HEADER_NONE, JBXL_FILE_READ_ERROR, JBXL_GRAPH_MEMORY_ERROR, CmnHead::kind, CmnHead::lsize, ntoh_st, RAS_DATA, RasHead::ras_depth, RasHead::ras_height, RasHead::ras_length, RasHead::ras_maplength, RasHead::ras_width, CmnHead::xsize, CmnHead::ysize, and CmnHead::zsize.

Referenced by readCmnHeadFile(), readRasFile(), and readXHeadFile().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ readRasFile()

template<typename T >
MSGraph< T > readRasFile ( const char * fname)

template <typename T> MSGraph<T> readRasFile(const char *fname)

Definition at line 583 of file Gio.h.

584{
585 MSGraph<T> vp;
586 CmnHead hd;
587 FILE* fp;
588
589 vp.init();
590 fp = fopen(fname, "rb");
591 if (fp==NULL) return vp;
592
593 hd = readRasData(fp);
594 fclose(fp);
595
596 vp = copyCmnHead2MSGraph<T>(hd, CH2MG_NORMAL);
597 return vp;
598}

References CH2MG_NORMAL, MSGraph< T >::init(), and readRasData().

Here is the call graph for this function:

◆ readSTLFile()

DllExport STLData * readSTLFile ( char * fname,
long int * fno )

STLData* jbxl::readSTLFile(char* fname, unsigned int* fno)

STLファイルを読み込むラッパー関数．アスキー，バイナリを自動判別．

読み込んだファセットの数(fno)を返す．

Definition at line 23 of file STL.cpp.

24{
25 FILE* fp;
26 struct stat stbuf;
27 STLData* stldata;
28 unsigned int temp;
29
30 fp = fopen(fname, "rb");
31 if (fp==NULL) {
32 PRINT_MESG("JBXL::readSTLFile: ERROR: File open Error! (%s)\n", fname);
33 return NULL;
34 }
35
36 fseek(fp, 80, SEEK_SET);
37 fread(&temp, 4, 1, fp);
38 fclose(fp);
39 *fno = (long int)temp;
40
41 stat(fname, &stbuf);
42 if (stbuf.st_size == (*fno)*50+84) { // ファイルサイズのチェック
43 stldata = readSTLFileB(fname, fno); // バイナリファイル
44 }
45 else {
46 stldata = readSTLFileA(fname, fno); // アスキーファイル
47 }
48
49 if (stldata==NULL) {
50 if (*fno!=0) {
51 DEBUG_MODE PRINT_MESG("readSTLFile: メモリの確保に失敗．\n");
52 }
53 else {
54 DEBUG_MODE PRINT_MESG("readSTLFile: データの読み込みに失敗．\n");
55 }
56 }
57 else {
58 DEBUG_MODE PRINT_MESG("readSTLFile: file name = %s\n", fname);
59 DEBUG_MODE PRINT_MESG("readSTLFile: read facet No. = %d\n", *fno);
60 }
61
62 return stldata;
63}
jbxl::readSTLFileB
DllExport STLData * readSTLFileB(char *fname, long int *fno)
Definition STL.cpp:186
jbxl::readSTLFileA
DllExport STLData * readSTLFileA(char *fname, long int *fno)
Definition STL.cpp:112

References DEBUG_MODE, PRINT_MESG, readSTLFileA(), and readSTLFileB().

Here is the call graph for this function:

◆ readSTLFileA()

DllExport STLData * readSTLFileA ( char * fname,
long int * fno )

STLData* jbxl::readSTLFileA(char* fname, long int* fno)

アスキー形式の STLファイルを読み込み，読み込んだファセットの数を返す．
ファイル中の facet, vertex 以外は無視．

Definition at line 112 of file STL.cpp.

113{
114 FILE* fp;
115 STLData* stldata = NULL;
116 float vect[3];
117 char buffer[LBUF], dummy[LBUF], *pbuf;
118 int vno=0;
119
120 // ファイルをオープンしてデータ数を数える．
121 *fno = 0;
122 fp = fopen(fname, "r");
123 if (fp==NULL) {
124 PRINT_MESG("JBXL::readSTLFileA: ERROR: File open Error! (%s)\n", fname);
125 return NULL;
126 }
127
128 fgets(buffer, LBUF, fp);
129 while (!feof(fp)) {
130 pbuf = buffer;
131 while(*pbuf==' '||*pbuf==CHAR_TAB) pbuf++;
132
133 if (!strncasecmp(pbuf, "facet ", 6)) (*fno)++;
134 if (!strncasecmp(pbuf, "vertex ", 7)) vno++;
135 fgets(buffer, LBUF, fp);
136 }
137 fclose(fp);
138
139 // メモリの確保
140 if (vno!=0 && vno==(*fno)*3) {
141 stldata = (STLData*)malloc(sizeof(STLData)*(*fno));
142 if (stldata!=NULL) memset(stldata, 0, sizeof(STLData)*(*fno));
143 }
144 if (stldata==NULL) {
145 *fno = 0;
146 return NULL;
147 }
148
149 // もう一度ファイルをオープンして，データを読み込む．
150 int i = 0, j = 0;
151 fp = fopen(fname, "r");
152 if (fp==NULL) {
153 PRINT_MESG("JBXL::readSTLFileA: ERROR: File re-open Error! (%s)\n", fname);
154 return NULL;
155 }
156
157 fgets(buffer, LBUF, fp);
158 while (!feof(fp)) {
159 pbuf = buffer;
160 while(*pbuf==' '||*pbuf==CHAR_TAB) pbuf++;
161
162 if (!strncasecmp(pbuf, "facet ", 6)) { // 法線ベクトル
163 sscanf(buffer, "%s %s %f %f %f", dummy, dummy, &vect[0], &vect[1], &vect[2]);
164 for (int k=0; k<3; k++) stldata[i].vect[k] = vect[k];
165 j = 3;
166 }
167 else if (!strncasecmp(pbuf, "vertex ", 7) && j>=3 && j<12) {// 座標
168 sscanf(buffer, "%s %f %f %f", dummy, &vect[0], &vect[1], &vect[2]);
169 for (int k=0; k<3; k++) stldata[i].vect[j+k] = vect[k];
170 j += 3;
171 if (j==12) i++;
172 }
173 fgets(buffer, LBUF, fp);
174 }
175 fclose(fp);
176
177 return stldata;
178}
LBUF
#define LBUF
Definition common.h:146
strncasecmp
#define strncasecmp
Definition common.h:59
CHAR_TAB
#define CHAR_TAB
タブ
Definition tools.h:80

References CHAR_TAB, LBUF, PRINT_MESG, and strncasecmp.

Referenced by readSTLFile().

Here is the caller graph for this function:

◆ readSTLFileB()

DllExport STLData * readSTLFileB ( char * fname,
long int * fno )

STLData* jbxl::readSTLFileB(char* fname, long int* fno)

バイナリ形式の STLファイルを読み込み，読み込んだファセットの数を返す．

Definition at line 186 of file STL.cpp.

187{
188 FILE* fp;
189 char message[81]; // STLのファイルメッセージ
190 tmpSTLData* tmp_stldata;
191 STLData* stldata;
192 STLData* exdata;
193
194 fp = fopen(fname, "rb");
195 if (fp==NULL) {
196 PRINT_MESG("JBXL::readSTLFileB: ERROR: File open Error! (%s)\n", fname);
197 return NULL;
198 }
199 fread(message, 80, 1, fp);
200 message[80] = '\0'; // STLのファイルメッセージ(message[]）80Byteは未使用
201
202 fread(fno, 4, 1, fp);
203 tmp_stldata = (tmpSTLData*)malloc(sizeof(tmpSTLData)*(*fno));
204 if (tmp_stldata==NULL) return NULL;
205 memset(tmp_stldata, 0, sizeof(tmpSTLData)*(*fno));
206 fread(tmp_stldata, sizeof(tmpSTLData), *fno, fp);
207 fclose(fp);
208
209 stldata = (STLData*)malloc(sizeof(STLData)*(*fno));
210 if (stldata==NULL) {
211 free(tmp_stldata);
212 return NULL;
213 }
214 memset(stldata, 0, sizeof(STLData)*(*fno));
215
216 for (int i=0; i<(*fno); i++) {
217 exdata = (STLData*)(&tmp_stldata[i]); // アドレスの読み替え（50Byteの構造体を作れないため）
218 for (int j=0; j<12; j++) {
219 stldata[i].vect[j] = exdata->vect[j]; // データの移動
220 }
221 }
222
223 free(tmp_stldata);
224 return stldata;
225}
jbxl::tmpSTLData
データ読み込み用一時データ
Definition STL.h:20

References PRINT_MESG, and STLData::vect.

Referenced by readSTLFile().

Here is the caller graph for this function:

◆ readTGAData()

TGAImage readTGAData ( FILE * fp)

TGAImage jbxl::readTGAData(FILE* fp)

TGAファイルを読み込んで，TGAImage構造体へデータを格納する． 読み込んだデータは非圧縮状態．

Parameters
fp読み込むファイルの記述子
Returns
TGAImage データ．gp==NULL の場合，state に情報が入る．
Return values
JBXL_GRAPH_OPFILE_ERRORstate: ファイルオープンエラー
JBXL_GRAPH_HEADER_ERRORstate: 不正ファイル（TGAファイルでない？）
JBXL_GRAPH_MEMORY_ERRORstate: メモリエラー
JBXL_GRAPH_IVDFMT_ERRORstate: サポート外のデータ形式

Definition at line 169 of file TgaTool.cpp.

170{
171 TGAImage tga;
172 int rle = FALSE;
173
174 fseek(fp, 0, 0);
175 tga.free();
176
177 size_t ret = fread(&tga.hd, TGA_HEADER_SIZE, 1, fp);
178 if (ret<=0) {
179 DEBUG_MODE PRINT_MESG("JBXL::readTGAData: ERROR: File read Error\n");
180 tga.state = JBXL_FILE_READ_ERROR;
181 return tga;
182 }
183
184 int kind = (int)tga.hd[2];
185 if (kind == 2) {
186 tga.col = 3;
187 }
188 else if (kind == 3) {
189 tga.col = 1;
190 }
191 else if (kind == 10) {
192 tga.col = 3;
193 rle = TRUE;
194 }
195 else if (kind == 11) {
196 tga.col = 1;
197 rle = TRUE;
198 }
199 else {
200 DEBUG_MODE PRINT_MESG("JBXL::readTGAData: ERROR: no supported File Format (%d)\n", kind);
201 tga.state = JBXL_GRAPH_IVDFMT_ERROR;
202 return tga;
203 }
204
205 if (is_little_endian()) {
206 tga.xs = tga.hd[12] + tga.hd[13]*256;
207 tga.ys = tga.hd[14] + tga.hd[15]*256;
208 }
209 else {
210 tga.xs = tga.hd[12]*256 + tga.hd[13];
211 tga.ys = tga.hd[14]*256 + tga.hd[15];
212 }
213
214 uByte alpha = tga.hd[17] & 0x0f; // αチャンネル
215 if (alpha != 0x08 && alpha != 0x00) {
216 DEBUG_MODE PRINT_MESG("JBXL::readTGAData: ERROR: unkonwn Alpha Channel (0x%02x)\n", alpha);
217 tga.state = JBXL_GRAPH_IVDFMT_ERROR;
218 return tga;
219 }
220 else if (alpha == 0x08) {
221 tga.col++;
222 }
223 if (tga.col*8 != (int)tga.hd[16]) {
224 tga.col = (int)tga.hd[16]/8;
225 PRINT_MESG("JBXL::readTGAData: Warning: Not Match Color Num! set color num = %d\n", tga.col);
226 }
227 PRINT_MESG("JBXL::readTGAData: TGA File (%d, %d, %d)\n", tga.xs, tga.ys, tga.col);
228
229 int datasize = tga.xs*tga.ys*tga.col;
230 tga.length = datasize;
231
232 tga.gp = (uByte*)malloc(datasize);
233 if (tga.gp==NULL) {
234 PRINT_MESG("JBXL::readTGAData: ERROR: out of Memory!\n");
235 tga.state = JBXL_GRAPH_MEMORY_ERROR;
236 return tga;
237 }
238 memset(tga.gp, 0, datasize);
239
240 fseek(fp, (int)tga.hd[0], SEEK_CUR);
241 if (rle) {
242 // RLE
243 int size = 0;
244 uByte chunk;
245 uByte buf[LBUF];
246
247 while (size<datasize && !feof(fp)) {
248 ret = fread(&chunk, 1, 1, fp);
249 if (ret<=0) {
250 DEBUG_MODE PRINT_MESG("JBXL::readTGAData: ERROR: File read Error\n");
251 tga.state = JBXL_FILE_READ_ERROR;
252 return tga;
253 }
254 int rep = (int)(chunk & 0x7f) + 1;
255 if (chunk & 0x80) {
256 ret = fread(buf, tga.col, 1, fp);
257 if (ret<=0) {
258 tga.state = JBXL_FILE_READ_ERROR;
259 return tga;
260 }
261 for (int j=0; j<rep; j++) {
262 for (int i=0; i<tga.col; i++) tga.gp[size++] = buf[i];
263 }
264 }
265 else {
266 if (tga.col*rep<LBUF) {
267 ret = fread(buf, tga.col*rep, 1, fp);
268 if (ret<=0) {
269 tga.state = JBXL_FILE_READ_ERROR;
270 return tga;
271 }
272 for (int i=0; i<tga.col*rep; i++) tga.gp[size++] = buf[i];
273 }
274 else {
275 for (int j=0; j<rep; j++) {
276 ret = fread(buf, tga.col, 1, fp);
277 if (ret<=0) {
278 tga.state = JBXL_FILE_READ_ERROR;
279 return tga;
280 }
281 for (int i=0; i<tga.col; i++) tga.gp[size++] = buf[i];
282 }
283 }
284 }
285 }
286 if (size!=datasize) {
287 DEBUG_MODE PRINT_MESG("JBXL::readTGAData: ERROR: unpack RLE failed. (%d != %d), format = %d\n", size, datasize, kind);
288 tga.state = JBXL_GRAPH_FILESZ_ERROR;
289 return tga;
290 }
291 tga.hd[2] &= ~0x08; // 非圧縮状態
292 }
293 else {
294 ret = fread(tga.gp, datasize, 1, fp);
295 if (ret<=0) {
296 tga.state = JBXL_FILE_READ_ERROR;
297 return tga;
298 }
299 }
300 if (!feof(fp)) {
301 ret = fread(tga.ft, TGA_FOOTER_SIZE, 1, fp);
302 if (ret<=0) {
303 tga.state = JBXL_FILE_READ_ERROR;
304 return tga;
305 }
306 }
307 tga.state = 0;
308 return tga;
309}
TGA_HEADER_SIZE
#define TGA_HEADER_SIZE
Definition TgaTool.h:16
TGA_FOOTER_SIZE
#define TGA_FOOTER_SIZE
Definition TgaTool.h:17
jbxl::TGAImage::gp
uByte * gp
Definition TgaTool.h:38
jbxl::TGAImage::ft
uByte ft[TGA_FOOTER_SIZE]
Definition TgaTool.h:37
jbxl::TGAImage::hd
uByte hd[TGA_HEADER_SIZE]
Definition TgaTool.h:36
TRUE
#define TRUE
Definition common.h:226
FALSE
#define FALSE
Definition common.h:223
JBXL_GRAPH_IVDFMT_ERROR
#define JBXL_GRAPH_IVDFMT_ERROR
無効なデータ形式
Definition jbxl_state.h:182
JBXL_GRAPH_FILESZ_ERROR
#define JBXL_GRAPH_FILESZ_ERROR
ファイルサイズのエラー
Definition jbxl_state.h:176

References TGAImage::col, DEBUG_MODE, FALSE, TGAImage::free(), TGAImage::ft, TGAImage::gp, TGAImage::hd, is_little_endian(), JBXL_FILE_READ_ERROR, JBXL_GRAPH_FILESZ_ERROR, JBXL_GRAPH_IVDFMT_ERROR, JBXL_GRAPH_MEMORY_ERROR, LBUF, TGAImage::length, PRINT_MESG, TGAImage::state, TGA_FOOTER_SIZE, TGA_HEADER_SIZE, TRUE, TGAImage::xs, and TGAImage::ys.

Referenced by readTGAFile().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ readTGAFile()

TGAImage readTGAFile ( const char * fname)

TGAImage jbxl::readTGAFile(const char* fname)

TGAファイルを読み込んで，TGAImage構造体へデータを格納する．

Parameters
fname読み込むファイル名
Returns
TGAImage データ．gp==NULL の場合，state に情報が入る．
Return values
JBXL_GRAPH_OPFILE_ERRORstate: ファイルオープンエラー
JBXL_GRAPH_HEADER_ERRORstate: 不正ファイル（TGAファイルでない？）
JBXL_GRAPH_MEMORY_ERRORstate: メモリエラー

Definition at line 136 of file TgaTool.cpp.

137{
138 TGAImage tga;
139 FILE* fp;
140
141 fp = fopen(fname, "rb");
142 if (fp==NULL) {
143 tga.gp = NULL;
144 tga.state = JBXL_GRAPH_OPFILE_ERROR;
145 return tga;
146 }
147
148 tga = readTGAData(fp);
149 fclose(fp);
150
151 return tga;
152}
jbxl::readTGAData
TGAImage readTGAData(FILE *fp)
Definition TgaTool.cpp:169

References TGAImage::gp, JBXL_GRAPH_OPFILE_ERROR, readTGAData(), and TGAImage::state.

Here is the call graph for this function:

◆ readUserSetData()

CmnHead readUserSetData ( FILE * fp,
CmnHead * chd,
bool cnt = false )

CmnHead jbxl::readUserSetData(FILE* fp, CmnHead* chd, bool cnt=false);

オペレータ指定のヘッダ形式にしたがってグラフィックファイルを読み込む．

ヘッダ形式のチェック（ファイルサイズの整合性など）は行わないので，それらは呼び出し側の責任となる．
リトルエンディアン対応．カウンタ制御の場合は遅くなる．

Parameters
fp読み込むを行うファイルのファイル識別子．
[in]chd読み込むファイルのヘッダ情報を入れた CmnHead.
カウンタを使用する場合： kind, xsize, ysize, zsize, bsize 必須．
カウンタを使用しない場合：kind, bsize, lseize 必須．
cnt読み込み状況カウンタを使用するかどうか．true: 使用する．
Returns
読み込んだグラフィックデータの共通ヘッダ．
エラー場合 kindメンバは HEADER_NONEとなる．またエラーの種類により xsizeが変化する．
Return values
JBXL_GRAPH_HEADER_ERRORxsize オペレータ指定のヘッダがない．
JBXL_GRAPH_MEMORY_ERRORxsize メモリエラー．
JBXL_GRAPH_CANCELxsize キャンセル．
Bug
24ビット以上のエンディアン処理は未実装

Definition at line 235 of file Gio.cpp.

236{
237 CmnHead hd;
238 init_CmnHead(&hd);
239 CVCounter* counter = NULL;
240
241 if (chd==NULL) {
242 hd.xsize = JBXL_GRAPH_MEMORY_ERROR;
243 return hd;
244 }
245 else if ((chd->kind&0x0ff)!=USERSET_DATA) {
246 hd.xsize = JBXL_GRAPH_MEMORY_ERROR;
247 return hd;
248 }
249 hd = *chd;
250
251 // ヘッダ読み込み
252 fseek(fp, 0, 0);
253 hd.buf = (uByte*)malloc(hd.bsize);
254 if (hd.buf==NULL) {
255 hd.xsize = JBXL_GRAPH_MEMORY_ERROR;
256 hd.kind = HEADER_NONE;
257 return hd;
258 }
259 memset(hd.buf, 0, hd.bsize);
260 size_t ret = fread((void*)hd.buf, hd.bsize, 1, fp);
261 if (ret==0) {
262 hd.xsize = JBXL_FILE_READ_ERROR;
263 hd.kind = HEADER_NONE;
264 return hd;
265 }
266
267 // カウンタ
268 if (hd.zsize>=10 && cnt) {
269 counter = GetUsableGlobalCounter();
270 if (counter!=NULL) {
271 //counter->SetTitle("ユーザ指定ファイル読み込み中");
272 counter->SetMax((hd.zsize+1)/10);
273 counter->SetPos(1);
274 }
275 }
276
277 hd.grptr = (uByte*)malloc(hd.lsize);
278 if (hd.grptr==NULL) {
279 freeNull(hd.buf);
280 hd.xsize = JBXL_GRAPH_MEMORY_ERROR;
281 hd.kind = HEADER_NONE;
282 return hd;
283 }
284 memset(hd.grptr, 0, hd.lsize);
285
286 fseek(fp, hd.bsize, 0);
287
288 if (counter==NULL) {
289 ret = fread(hd.grptr, hd.lsize, 1, fp);
290 if (ret==0) {
291 hd.xsize = JBXL_FILE_READ_ERROR;
292 hd.kind = HEADER_NONE;
293 return hd;
294 }
295 }
296 else {
297 int psize = hd.xsize*hd.ysize*((hd.depth+7)/8);
298 for (int i=0; i<hd.zsize; i++) {
299 ret = fread(hd.grptr+i*psize, psize, 1, fp);
300 if (ret==0) {
301 hd.xsize = JBXL_FILE_READ_ERROR;
302 hd.kind = HEADER_NONE;
303 return hd;
304 }
305 if (i%10==0) {
306 counter->StepIt();
307 if (counter->isCanceled()) { // キャンセル
308 free_CmnHead(&hd);
309 hd.xsize = JBXL_GRAPH_CANCEL;
310 hd.kind = HEADER_NONE;
311 return hd;
312 }
313 }
314 }
315 }
316
317 if (hd.depth==16) {
318 if (checkBit(chd->kind, HAS_LENDIAN) && is_little_endian()) {
319 // CPU とファイルが同じ Little Endianなので，何もしない．
320 }
321 else {
322 sWord* wptr = (sWord*)hd.grptr;
323 for (int i=0; i<hd.xsize*hd.ysize*hd.zsize; i++) wptr[i] = ntohs(wptr[i]);
324 }
325 }
326
327 if (counter!=NULL) counter->PutFill();
328 return hd;
329}

References CmnHead::bsize, CmnHead::buf, checkBit, CmnHead::depth, free_CmnHead(), freeNull(), GetUsableGlobalCounter(), CmnHead::grptr, HAS_LENDIAN, HEADER_NONE, init_CmnHead(), is_little_endian(), CVCounter::isCanceled(), JBXL_FILE_READ_ERROR, JBXL_GRAPH_CANCEL, JBXL_GRAPH_MEMORY_ERROR, CmnHead::kind, CmnHead::lsize, CVCounter::PutFill(), CVCounter::SetMax(), CVCounter::SetPos(), CVCounter::StepIt(), USERSET_DATA, CmnHead::xsize, CmnHead::ysize, and CmnHead::zsize.

Referenced by readCmnHeadFile(), and readXHeadFile().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ readXHead()

CmnHead readXHead ( const char * fn,
CmnHead * chd = NULL )

CmnHead jbxl::readXHead(const char* fn, CmnHead* chd)

ファイルの Commonヘッダ情報を読み込む．データ本体は読み込まない． ファイル種別の識別に使用する．

Parameters
fnヘッダの読み込みを行うファイル名．
[out]chdヘッダ情報を格納する．
Return values
読み込んだグラフィックデータを記述する共通ヘッダ（データ本体は無し）．

n エラーなら kind=HEADER_ERROR となる．

Definition at line 708 of file Gio.cpp.

709{
710 FILE *fp;
711 int fsz, csz;
712 CmnHead hd;
713
714 memset(&hd, 0, sizeof(CmnHead));
715 hd.kind = HEADER_NONE;
716
717 fsz = (int)file_size(fn);
718 if (fsz<=0) {
719 hd.xsize = JBXL_GRAPH_NOFILE_ERROR;
720 return hd;
721 }
722
724 // オペレータ指定のデータ形式を確認（予めヘッダに情報が設定されている）
725 //
726 if (chd!=NULL && (chd->kind&0x00ff)==USERSET_DATA) {
727 if (chd->zsize<=0) chd->zsize = 1;
728 chd->lsize = chd->xsize*chd->ysize*chd->zsize*((chd->depth+7)/8);
729 if (fsz==(int)(chd->bsize+chd->lsize)) { // ファイルサイズのチェック
730 return *chd;
731 }
732 }
733
734 if ((fp=fopen(fn,"rb"))==NULL) {
735 hd.xsize = JBXL_GRAPH_OPFILE_ERROR;
736 return hd;
737 }
738
740 // 共通ヘッダの読み込み
741 //
742
743 int hsz = sizeof(CmnHead_Entry);
744 fseek(fp, 0, 0);
745 size_t ret = fread(&hd.entry, hsz, 1, fp);
746 hd.buf = NULL;
747 hd.grptr = NULL;
748 ntoh_st(&hd, 4);
749 if (ret==0) {
750 hd.xsize = JBXL_FILE_READ_ERROR;
751 hd.kind = HEADER_NONE;
752 fclose(fp);
753 return hd;
754 }
755
756 // Sun Raster
757 if (hd.kind==RAS_MAGIC) {
758 hd.kind = RAS_DATA;
759 DEBUG_MODE PRINT_MESG("JBXL::readXHead: Sun Raster File\n");
760 hd.depth = hd.zsize;
761 hd.zsize = 1;
762 hd.lsize = file_size(fn) - sizeof(RasHead);
763 hd.bsize = 0;
764 fclose(fp);
765 return hd;
766 }
767
768 // Common ヘッダ
769 if (hd.kind > 0 && hd.kind <= NUM_KDATA) {
770 if (fsz == (int)(hsz + hd.bsize + hd.lsize) + 4 ) hsz = 36; // x86 file
771 if (fsz == (int)(hsz + hd.bsize + hd.lsize) + 16) hsz = 48; // x64 file
772 //
773 if (fsz == (int)(hsz + hd.bsize + hd.lsize)) {
774 if (hd.zsize<=0) hd.zsize = 1;
775 if (hd.bsize>0) {
776 hd.buf = (uByte*)malloc(hd.bsize);
777 if (hd.buf==NULL) {
778 free_CmnHead(&hd);
779 hd.xsize = JBXL_GRAPH_MEMORY_ERROR;
780 hd.kind = HEADER_NONE;
781 fclose(fp);
782 return hd;
783 }
784 memset(hd.buf, 0, hd.bsize);
785
786 fseek(fp, hsz, 0);
787 ret = fread(hd.buf, hd.bsize, 1, fp);
788 ntoh_ar((sWord*)hd.buf, hd.bsize);
789 hd.grptr = NULL;
790 if (ret==0) {
791 hd.xsize = JBXL_FILE_READ_ERROR;
792 hd.kind = HEADER_NONE;
793 fclose(fp);
794 return hd;
795 }
796 }
797
798 DEBUG_MODE {
799 PRINT_MESG("JBXL::readXHead: Common ヘッダ\n");
800 PRINT_MESG("JBXL::readXHead: ヘッダ種別 kind = %d\n", hd.kind);
801 PRINT_MESG("JBXL::readXHead: ファイルサイズ fsz = %d\n", fsz);
802 PRINT_MESG("JBXL::readXHead: ヘッダサイズ hsz = %d\n", sizeof(CmnHead_Entry));
803 PRINT_MESG("JBXL::readXHead: ヘッダバッファ bsize = %d\n", hd.bsize);
804 PRINT_MESG("JBXL::readXHead: データサイズ lsize = %d\n", hd.lsize);
805 PRINT_MESG("JBXL::readXHead: サイズ %dx%dx%d %d\n", hd.xsize, hd.ysize, hd.zsize, hd.depth);
806 }
807 fclose(fp);
808 return hd;
809 }
810 }
811 memset(&hd, 0, sizeof(CmnHead));
812
814 // CT File (Moon)
815 //
816 CTHead cthd;
817 csz = sizeof(CTHead);
818 fseek(fp, 0, 0);
819 ret = fread(&cthd, csz, 1, fp);
820 ntoh_st(&cthd, 2);
821 if (ret==0) {
822 hd.xsize = JBXL_FILE_READ_ERROR;
823 hd.kind = HEADER_NONE;
824 fclose(fp);
825 return hd;
826 }
827 hd.xsize = cthd.xsize - cthd.cutleft - cthd.cutright;
828 hd.ysize = cthd.ysize - cthd.cutup - cthd.cutdown;
829 hd.zsize = 1;
830 hd.depth = 16;
831 hd.bsize = csz;
832 hd.lsize = hd.xsize*hd.ysize*hd.zsize*((hd.depth+7)/8);
833
834 if (fsz==(int)(hd.bsize+hd.lsize)) {
835 hd.kind = MOON_DATA;
836 hd.buf = (uByte*)malloc(csz);
837 if (hd.buf==NULL) {
838 free_CmnHead(&hd);
839 hd.xsize = JBXL_GRAPH_MEMORY_ERROR;
840 hd.kind = HEADER_NONE;
841 fclose(fp);
842 return hd;
843 }
844 memcpy(hd.buf, &cthd, csz);
845
846 DEBUG_MODE {
847 PRINT_MESG("JBXL::readXHead: CT ファイル\n");
848 PRINT_MESG("JBXL::readXHead: ヘッダ種別 kind = %d\n", hd.kind);
849 PRINT_MESG("JBXL::readXHead: ファイルサイズ fsz = %d\n", fsz);
850 PRINT_MESG("JBXL::readXHead: ヘッダサイズ hsz = %d\n", sizeof(CmnHead_Entry));
851 PRINT_MESG("JBXL::readXHead: ヘッダバッファ bsize = %d\n", hd.bsize);
852 PRINT_MESG("JBXL::readXHead: データサイズ lsize = %d\n", hd.lsize);
853 PRINT_MESG("JBXL::readXHead: サイズ %dx%dx%d %d\n", hd.xsize, hd.ysize, hd.zsize, hd.depth);
854 }
855 fclose(fp);
856 return hd;
857 }
858 memset(&hd, 0, sizeof(CmnHead));
859
861 // Dicom
862 //
863 int ls, sz, dsize, xsize, ysize, depth;
864 double rzxy;
865
866 sz = dicomHeader(fp, fsz, &dsize, &xsize, &ysize, &depth, &rzxy);
867 ls = xsize*ysize*((depth+7)/8);
868 if (sz>0 && dsize==ls) {
869 hd.kind = DICOM_DATA;
870 hd.xsize = xsize;
871 hd.ysize = ysize;
872 hd.zsize = 1;
873 hd.depth = depth;
874 hd.bsize = sizeof(CTHead);
875 hd.lsize = ls;
876 hd.buf = (uByte*)malloc(hd.bsize);
877 hd.grptr = NULL;
878
879 CTHead* pcthd = (CTHead*)hd.buf;
880 memset(pcthd, 0, hd.bsize);
881 pcthd->xsize = hd.xsize;
882 pcthd->ysize = hd.ysize;
883
884 if (rzxy>0.0) {
885 pcthd->anydata[0] = (sWord)(rzxy*RZXY_RATE);
886 pcthd->anydata[1] = RZXY_RATE;
887 hd.kind |= HAS_RZXY;
888 }
889
890 fclose(fp);
891 return hd;
892 }
893
895 // Well Known ファイル
896 //
897 fseek(fp, 0, 0);
898 Buffer buf = read_Buffer_data(fp, 32);
899
900 // TIFF
901 /*
902 if (head[0]=='I' && head[1]=='I') {
903 if (head[2]==0x2a && head[3]==0x00) {
904 DEBUG_MODE PRINT_MESG("JBXL::readXHead: TIFFデータ形式\n");
905 hd.kind = TIFF_DATA;
906 fclose(fp);
907 return hd;
908 }
909 }
910 if (head[0]=='M' && head[1]=='M') {
911 if (head[2]==0x00 && head[3]==0x2a) {
912 DEBUG_MODE PRINT_MESG("JBXL::readXHead: TIFFデータ形式\n");
913 hd.kind = TIFF_DATA;
914 fclose(fp);
915 return hd;
916 }
917 }*/
918
919#ifdef ENABLE_JPEGLIB
920 // JPEG
921 if (isJPEGHeader(buf)) {
922 DEBUG_MODE PRINT_MESG("JBXL::readXHead: JPEGデータ形式\n");
923 hd.kind = JPEG_RGB_DATA; // JPEG_RGB_DATA or JPEG_MONO_DATA
924 free_Buffer(&buf);
925 fclose(fp);
926 return hd;
927 }
928#endif
929
930 free_Buffer(&buf);
931
933 // Another Unknown File Format
934 //
935 DEBUG_MODE PRINT_MESG("JBXL::readXHead: 未知のデータ形式\n");
936 memset(&hd, 0, sizeof(CmnHead));
937 hd.kind = UN_KNOWN_DATA;
938 hd.lsize = fsz;
939
940 fclose(fp);
941 return hd;
942}
free_Buffer
void free_Buffer(Buffer *buf)
Buffer型変数のバッファ部を解放する
Definition buffer.cpp:128
read_Buffer_data
Buffer read_Buffer_data(FILE *fp, int sz)
ファイルポインタ fp から szバイトをBuffer型変数に読み込む．
Definition buffer.cpp:1497
RAS_MAGIC
#define RAS_MAGIC
Definition gheader.h:94
NUM_KDATA
#define NUM_KDATA
0x7fff // Max Numver of Data Format
Definition gheader.h:213

References CTHead::anydata, CmnHead::bsize, CmnHead::buf, CTHead::cutdown, CTHead::cutleft, CTHead::cutright, CTHead::cutup, DEBUG_MODE, CmnHead::depth, DICOM_DATA, dicomHeader(), CmnHead::entry, file_size(), free_Buffer(), free_CmnHead(), CmnHead::grptr, HAS_RZXY, HEADER_NONE, JBXL_FILE_READ_ERROR, JBXL_GRAPH_MEMORY_ERROR, JBXL_GRAPH_NOFILE_ERROR, JBXL_GRAPH_OPFILE_ERROR, JPEG_RGB_DATA, CmnHead::kind, CmnHead::lsize, MOON_DATA, ntoh_ar, ntoh_st, NUM_KDATA, PRINT_MESG, RAS_DATA, RAS_MAGIC, read_Buffer_data(), RZXY_RATE, UN_KNOWN_DATA, USERSET_DATA, CTHead::xsize, CmnHead::xsize, CTHead::ysize, CmnHead::ysize, and CmnHead::zsize.

Referenced by readGraphicSlices().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ readXHeadFile()

CmnHead readXHeadFile ( const char * fn,
CmnHead * chd = NULL,
bool cnt = false )

CmnHead jbxl::readXHeadFile(const char* fn, CmnHead* chd, bool cnt=false)

データ種別を自動判定して，グラフィックデータを読み込み，Common 形式に変換する．

USERSET_DATAの場合は chd を指定する．また chdの kind にはオプションの情報も入れられる（現在はエンディアンのみ）

サポートしているデータ形式は,

  • Common 形式 : Common 形式にしたがって読み込む．(CT_RGN_SLは未サポート)
  • Sun Raster　 : Common 形式に変換する．ヘッダは RAS_DATA になる
  • Moon(CT)　　 : Common 形式に変換する．ヘッダは MOON_DATA になる．
  • DICOM : Common 形式に変換する．512x512xZ固定．ヘッダは DICOM_DATAになる．
  • USERSET_DATA : CmnHead* chd でヘッダ情報を指定して，読み込みを行う．ヘッダは USERSET_DATAになる．
  • Unkonwn 　　 : ファイルをそのまま，hd->grptrへ読み込む．ヘッダは UN_KNOWN_DATA になる．

ただし，UN_KNOWN_DATAの場合は CmnHaedの hd->kind, hd->lsize(ファイル長), hd->gptrのみ有効．

Parameters
fn読み込むを行うファイル名．
[in,out]chdUSERSET_DATA指定の場合，ファイルのヘッダ情報を入れる．
またはファイルに関するオプション情報も指定できる（現在はエンディアンの情報のみ）．
cnt仮想カウンタを使用するか？
Returns
読み込んだグラフィックデータを記述する共通ヘッダ．
エラーなら kind = HEADER_NONE となる．またエラーの種類により xsizeが変化する．
Return values
JBXL_GRAPH_OPFILE_ERRORxsize ファイルオープンエラー．
JBXL_GRAPH_MEMORY_ERRORxsize メモリエラー．
JBXL_GRAPH_CANCELxsize キャンセル by ユーザ
Bug
Common形式の画素深度が 24,32bitの場合のエンディアン処理が未実装

Definition at line 975 of file Gio.cpp.

976{
977 FILE* fp;
978 int fsz;
979 bool no_ntoh = false;
980 CmnHead hd;
981 CVCounter* counter = NULL;
982
983 memset(&hd, 0, sizeof(CmnHead));
984 hd.kind = HEADER_NONE;
985
986 fsz = (int)file_size(fn);
987 if (fsz==0) {
988 hd.xsize = JBXL_GRAPH_NOFILE_ERROR;
989 return hd;
990 }
991
992 if ((fp=fopen(fn,"rb"))==NULL) {
993 hd.xsize = JBXL_GRAPH_OPFILE_ERROR;
994 return hd;
995 }
996
998 // オペレータ指定のデータ形式を確認（予めヘッダに情報が設定されている）
999 //
1000 if (chd!=NULL) {
1001 // ファイルとCPUのエンディアンが同じ
1002 if (checkBit(chd->kind, HAS_LENDIAN) && is_little_endian()) {
1003 no_ntoh = true;
1004 }
1005
1006 // オペレータ指定のデータ形式．カウンタ未サポート
1007 if ((chd->kind&0x00ff)==USERSET_DATA) {
1008 if (chd->zsize<=0) chd->zsize = 1;
1009 chd->lsize = chd->xsize*chd->ysize*chd->zsize*((chd->depth+7)/8);
1010 if (fsz==(int)(chd->bsize+chd->lsize)) { // ファイルサイズのチェック
1011 DEBUG_MODE PRINT_MESG("JBXL::readXHeadFile: オペレータ指定のデータ形式\n");
1012 hd = readUserSetData(fp, chd, true); // カウンタ有効
1013
1014 // 24, 32bit 未対応
1015 if (hd.depth==16 && !no_ntoh) {
1016 sWord* wptr = (sWord*)hd.grptr;
1017 for (int i=0; i<hd.xsize*hd.ysize*hd.zsize; i++) {
1018 wptr[i] = ntohs(wptr[i]);
1019 }
1020 }
1021
1022 fclose(fp);
1023 return hd;
1024 }
1025 }
1026 }
1027
1029 // 共通ヘッダの読み込み
1030 //
1031 int hsz = sizeof(CmnHead_Entry);
1032 fseek(fp, 0, 0);
1033 size_t ret = fread(&hd.entry, hsz, 1, fp);
1034 hd.buf = NULL;
1035 hd.grptr = NULL;
1036 ntoh_st(&hd, 4);
1037 if (ret==0) {
1038 hd.xsize = JBXL_FILE_READ_ERROR;
1039 hd.kind = HEADER_NONE;
1040 fclose(fp);
1041 return hd;
1042 }
1043
1044 // Sun Raster
1045 if (hd.kind==RAS_MAGIC) {
1046 DEBUG_MODE PRINT_MESG("JBXL::readXHeadFile: Sun Rasterデータ形式\n");
1047 hd = readRasData(fp);
1048 fclose(fp);
1049 return hd;
1050 }
1051
1052 // Common形式
1053 // データ読み取りでは hd.lsize==0 のファイルサイズ無効（CT_RGN_SL）はまだサポートされていない
1054 if (hd.kind>0 && hd.kind<=NUM_KDATA) {
1055 if (fsz == (int)(hsz + hd.bsize + hd.lsize) + 4 ) hsz = 36; // x86 file
1056 if (fsz == (int)(hsz + hd.bsize + hd.lsize) + 16) hsz = 48; // x64 file
1057 //
1058 if (fsz == (int)(hsz + hd.bsize + hd.lsize)) {
1059 DEBUG_MODE PRINT_MESG("JBXL::readXHeadFile: Commonデータ形式\n");
1060 if (hd.zsize <= 0) hd.zsize = 1;
1061
1062 // カウンタ
1063 if (hd.zsize >= 10 && cnt) {
1064 counter = GetUsableGlobalCounter();
1065 if (counter != NULL) {
1066 //counter->SetTitle("Commonファイル読み込み中");
1067 counter->SetMax(hd.zsize / 10);
1068 counter->SetPos(0);
1069 }
1070 }
1071
1072 if (hd.bsize > 0) {
1073 hd.buf = (uByte*)malloc(hd.bsize);
1074 if (hd.buf!=NULL) memset(hd.buf, 0, hd.bsize);
1075 }
1076 hd.grptr = (uByte*)malloc(hd.lsize);
1077 if ((hd.bsize > 0 && hd.buf == NULL) || hd.grptr == NULL) {
1078 free_CmnHead(&hd);
1079 hd.xsize = JBXL_GRAPH_MEMORY_ERROR;
1080 hd.kind = HEADER_NONE;
1081 fclose(fp);
1082 return hd;
1083 }
1084 memset(hd.grptr, 0, hd.lsize);
1085 fseek(fp, hsz, 0);
1086 if (hd.bsize > 0) {
1087 size_t ret = fread(hd.buf, hd.bsize, 1, fp);
1088 ntoh_ar((sWord*)hd.buf, hd.bsize);
1089 if (ret==0) {
1090 hd.xsize = JBXL_FILE_READ_ERROR;
1091 hd.kind = HEADER_NONE;
1092 fclose(fp);
1093 return hd;
1094 }
1095 }
1096 }
1097
1098 // ヘッダのみ
1099 if (hd.lsize==0) {
1100 if (counter!=NULL) counter->PutFill();
1101 fclose(fp);
1102 return hd;
1103 }
1104
1105 // データ本体
1106 if (counter==NULL) {
1107 size_t ret = fread(hd.grptr, hd.lsize, 1, fp);
1108 if (ret==0) {
1109 hd.xsize = JBXL_FILE_READ_ERROR;
1110 hd.kind = HEADER_NONE;
1111 fclose(fp);
1112 return hd;
1113 }
1114 }
1115 else {
1116 int psize = hd.xsize*hd.ysize*((hd.depth+7)/8);
1117 for (int i=0; i<hd.zsize; i++) {
1118 size_t ret = fread(hd.grptr+i*psize, psize, 1, fp);
1119 if (ret==0) {
1120 hd.xsize = JBXL_FILE_READ_ERROR;
1121 hd.kind = HEADER_NONE;
1122 fclose(fp);
1123 return hd;
1124 }
1125 if (i%10==0) {
1126 counter->StepIt();
1127 if (counter->isCanceled()) { // キャンセル
1128 //counter->Stop();
1129 free_CmnHead(&hd);
1130 hd.xsize = JBXL_GRAPH_CANCEL;
1131 hd.kind = HEADER_NONE;
1132 fclose(fp);
1133 return hd;
1134 }
1135 }
1136 }
1137 }
1138
1139 // 24, 32bit 未対応
1140 if (hd.depth==16 && !no_ntoh) {
1141 sWord* wptr = (sWord*)hd.grptr;
1142 for (int i=0; i<hd.xsize*hd.ysize*hd.zsize; i++) {
1143 wptr[i] = ntohs(wptr[i]);
1144 }
1145 }
1146
1147 if (counter!=NULL) counter->PutFill();
1148 fclose(fp);
1149 return hd;
1150 }
1151 memset(&hd, 0, sizeof(CmnHead));
1152
1154 // Moon形式 16bit
1155 //
1156 hd = readMoonData(fp, fsz, no_ntoh);
1157 if ((hd.kind & 0x00ff)==MOON_DATA) {
1158 DEBUG_MODE PRINT_MESG("JBXL::readXHeadFile: Moonデータ形式\n");
1159 fclose(fp);
1160 return hd;
1161 }
1162 memset(&hd, 0, sizeof(CmnHead));
1163
1165 // DICOMファイル
1166 //
1167 MSGraph<sWord> vp = readDicomData(fp, fsz);
1168 if (vp.gp!=NULL) {
1169 DEBUG_MODE PRINT_MESG("JBXL::readXHeadFile: DICOMデータ形式\n");
1170 hd.kind = DICOM_DATA;
1171 hd.xsize = vp.xs;
1172 hd.ysize = vp.ys;
1173 hd.zsize = vp.zs;
1174 hd.depth = 16;
1175 hd.bsize = sizeof(CTHead);
1176 hd.lsize = vp.xs*vp.ys*vp.zs*2;
1177 hd.buf = (uByte*)malloc(hd.bsize);
1178 hd.grptr = (uByte*)vp.gp;
1179
1180 CTHead* pcthd = (CTHead*)hd.buf;
1181 memset(pcthd, 0, hd.bsize);
1182 pcthd->xsize = (sWord)hd.xsize;
1183 pcthd->ysize = (sWord)hd.ysize;
1184 //pcthd->ctmin = 0;
1185 //pcthd->ctmax = 0;
1186 //pcthd->cutup = 0;
1187 //pcthd->cutdown = 0;
1188 //pcthd->cutleft = 0;
1189 //pcthd->cutright = 0;
1190
1191 if (vp.RZxy>0.0) {
1192 pcthd->anydata[0] = (sWord)(vp.RZxy*RZXY_RATE);
1193 pcthd->anydata[1] = RZXY_RATE;
1194 hd.kind |= HAS_RZXY;
1195 }
1196
1197 if (!no_ntoh) {
1198 sWord* wptr = (sWord*)hd.grptr;
1199 for (int i=0; i<hd.xsize*hd.ysize*hd.zsize; i++) {
1200 wptr[i] = ntohs(wptr[i]);
1201 }
1202 }
1203
1204 fclose(fp);
1205 return hd;
1206 }
1207
1209 // Well Known ファイル
1210 //
1211 fseek(fp, 0, 0);
1212 Buffer buf = read_Buffer_data(fp, 32);
1213
1215 // TIFF
1216 /*
1217 size_t ret = fread(head, 32, 1, fp);
1218 if (ret==0) {
1219 hd.xsize = JBXL_FILE_READ_ERROR;
1220 hd.kind = HEADER_NONE;
1221 fclose(fp);
1222 return hd;
1223 }
1224 if (head[0]=='I' && head[1]=='I') {
1225 if (head[2]==0x2a && head[3]==0x00) {
1226 DEBUG_MODE PRINT_MESG("JBXL::readXHeadFile: TIFFデータ形式\n");
1227 hd.kind = TIFF_DATA;
1228 //fclose(fp);
1229 //return hd;
1230 }
1231 }
1232 if (head[0]=='M' && head[1]=='M') {
1233 if (head[2]==0x00 && head[3]==0x2a) {
1234 DEBUG_MODE PRINT_MESG("JBXL::readXHeadFile: TIFFデータ形式\n");
1235 hd.kind = TIFF_DATA;
1236 //fclose(fp);
1237 //return hd;
1238 }
1239 }*/
1240
1241#ifdef ENABLE_JPEGLIB
1242 // JPEG
1243 if (isJPEGHeader(buf)) {
1244 DEBUG_MODE PRINT_MESG("JBXL::readXHeadFile: JPEGデータ形式\n");
1245 JPEGImage jpg = readJPEGData(fp);
1246 hd = JPEGImage2CmnHead(jpg);
1247
1248 if (hd.zsize==1) hd.kind = JPEG_MONO_DATA;
1249 jpg.free();
1250 free_Buffer(&buf);
1251 fclose(fp);
1252 return hd;
1253 }
1254#endif
1255
1256 free_Buffer(&buf);
1257
1259 // 解析不能．データのまま読み込み　UN_KNOWN_DATA
1260 //
1261 DEBUG_MODE PRINT_MESG("JBXL::readXHeadFile: 未知のデータ形式\n");
1262 memset(&hd, 0, sizeof(CmnHead));
1263
1264 hd.grptr = (uByte*)malloc(fsz);
1265 if (hd.grptr==NULL) {
1266 hd.xsize = JBXL_GRAPH_MEMORY_ERROR;
1267 hd.kind = HEADER_NONE;
1268 fclose(fp);
1269 return hd;
1270 }
1271 memset(hd.grptr, 0, fsz);
1272
1273 fseek(fp, 0, 0);
1274 ret = fread(hd.grptr, fsz, 1, fp);
1275 if (ret>0) {
1276 hd.kind = UN_KNOWN_DATA;
1277 hd.lsize = fsz;
1278 }
1279 else {
1280 hd.xsize = JBXL_FILE_READ_ERROR;
1281 hd.kind = HEADER_NONE;
1282 }
1283
1284 fclose(fp);
1285 return hd;
1286}

References CTHead::anydata, CmnHead::bsize, CmnHead::buf, checkBit, DEBUG_MODE, CmnHead::depth, DICOM_DATA, CmnHead::entry, file_size(), free_Buffer(), free_CmnHead(), GetUsableGlobalCounter(), MSGraph< T >::gp, CmnHead::grptr, HAS_LENDIAN, HAS_RZXY, HEADER_NONE, is_little_endian(), CVCounter::isCanceled(), JBXL_FILE_READ_ERROR, JBXL_GRAPH_CANCEL, JBXL_GRAPH_MEMORY_ERROR, JBXL_GRAPH_NOFILE_ERROR, JBXL_GRAPH_OPFILE_ERROR, JPEG_MONO_DATA, CmnHead::kind, CmnHead::lsize, MOON_DATA, ntoh_ar, ntoh_st, NUM_KDATA, PRINT_MESG, CVCounter::PutFill(), RAS_MAGIC, read_Buffer_data(), readDicomData(), readMoonData(), readRasData(), readUserSetData(), MSGraph< T >::RZxy, RZXY_RATE, CVCounter::SetMax(), CVCounter::SetPos(), CVCounter::StepIt(), UN_KNOWN_DATA, USERSET_DATA, MSGraph< T >::xs, CTHead::xsize, CmnHead::xsize, MSGraph< T >::ys, CTHead::ysize, CmnHead::ysize, MSGraph< T >::zs, and CmnHead::zsize.

Referenced by readGraphicFile().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ reduce_MSGraph()

template<typename T >
MSGraph< T > reduce_MSGraph ( MSGraph< T > vp,
double rc,
int mode = ON )

Definition at line 1814 of file Graph.h.

1815{
1816 int xss, yss, ps, pz, py;
1817 MSGraph<T> vx;
1818
1819 vx.init();
1820
1821 if (vp.gp==NULL) {
1822 vx.state = JBXL_GRAPH_NODATA_ERROR;
1823 return vx;
1824 }
1825 if (rc==0.0) {
1826 vx.state = JBXL_GRAPH_IVDARG_ERROR;
1827 return vx;
1828 }
1829 else if (rc<0.0) rc = -rc;
1830
1831 xss = (int)(vp.xs/rc);
1832 yss = (int)(vp.ys/rc);
1833
1834 vx.set(xss, yss, vp.zs);
1835 if (vx.isNull()) return vx;
1836 vx.color = vp.color;
1837
1838 ps = xss*yss;
1839
1840 if (mode==ON) {
1841 int ii, jj, kk, ll, ss, nn;
1842
1843 for(int z=0; z<vx.zs; z++) {
1844 pz = z*ps;
1845 for(int j=0; j<yss; j++) {
1846 py = pz + j*xss;
1847 for(int i=0; i<xss; i++) {
1848 ii = (int)(i*rc);
1849 jj = (int)(j*rc);
1850 if (ii>=vp.xs) ii = vp.xs - 1;
1851 if (jj>=vp.ys) jj = vp.ys - 1;
1852
1853 ss = nn = 0;
1854 for(int l=jj; l<jj+(int)rc; l++) {
1855 ll = l;
1856 if (ll>=vp.ys) ll = vp.ys - 1;
1857 for(int k=ii; k<ii+(int)rc; k++) {
1858 kk = k;
1859 if (kk>=vp.xs) kk = vp.xs - 1;
1860 ss += vp.point(kk, ll, z);
1861 nn++;
1862 }
1863 }
1864 vx.gp[py+i] = ss/nn;
1865 }
1866 }
1867 }
1868 }
1869
1870 else {
1871 int ii, jj;
1872
1873 for(int k=0; k<vx.zs; k++) {
1874 pz = k*ps;
1875 for(int j=0; j<yss; j++) {
1876 py = pz + j*xss;
1877 for(int i=0; i<xss; i++) {
1878 ii = (int)(i*rc);
1879 jj = (int)(j*rc);
1880 if (ii>=vp.xs) ii = vp.xs - 1;
1881 if (jj>=vp.ys) jj = vp.ys - 1;
1882 vx.gp[py+i] = vp.point(ii, jj, k);
1883 }
1884 }
1885 }
1886 }
1887
1888 return vx;
1889}

References MSGraph< T >::color, MSGraph< T >::gp, MSGraph< T >::init(), MSGraph< T >::isNull(), JBXL_GRAPH_IVDARG_ERROR, JBXL_GRAPH_NODATA_ERROR, ON, MSGraph< T >::point(), MSGraph< T >::set(), MSGraph< T >::state, MSGraph< T >::xs, MSGraph< T >::ys, and MSGraph< T >::zs.

Here is the call graph for this function:

◆ ReverseContours()

DllExport void ReverseContours ( BREP_SOLID * solid)

void jbxl::ReverseContours(BREP_SOLID* solid)

削除マークの付いたFacet(Contour)を削除し，同じ頂点を持つContourを裏返して登録する. もし，登録した Contourに多重 Edgeがある場合は登録を中止する．
ただし，読み込み（初期）データは削除しない．

Contours List と Wings Listの内容は保障される．

Definition at line 530 of file TriBrep.cpp.

531{
532 // 全ての Facetに対して
533 BREP_SHELL_LIST shells = solid->shells;
534 BREP_SHELL_LIST::iterator ishell;
535 for (ishell=shells.begin(); ishell!=shells.end(); ishell++){
536 BREP_FACET_LIST::iterator ifacet;
537 for (ifacet =(*ishell)->facets.begin(); ifacet!=(*ishell)->facets.end(); ifacet++){
538 // 削除マークが付いているなら
539 if ((*ifacet)->deletable && !(*ifacet)->notdelete) {
540 // 逆周りで頂点を Vector vに格納
541 BREP_VERTEX* v[3];
542 BREP_FACET* pbfc;
543 BREP_CONTOUR* pbcn;
544 BREP_CONTOUR_LIST::iterator icon;
545 for (icon=(*ifacet)->outer_contours.begin(); icon!=(*ifacet)->outer_contours.end(); icon++) {
546 BREP_WING* wing = (*icon)->wing;
547 for (int i=0; i<3; i++) {
548 v[i] = wing->vertex;
549 wing = wing->prev;
550 }
551 }
552
553 // 削除マークが付いている Facetを削除
554 pbfc = *ifacet;
555 ifacet = (*ishell)->facets.erase(ifacet);
556 ifacet--;
557 pbfc->shell = NULL;
558 delete(pbfc);
559
560 // 裏返しの Contourを登録
561 pbfc = new BREP_FACET(*ishell);
562 pbcn = CreateContourByVertex(pbfc, v);
563 if (pbcn!=NULL) {
564 if (DupEdgeNumber(pbcn)==0) {
565 pbfc->CloseData();
566 }
567 else {
568 FastDeleteFacet(pbfc);
569 }
570 }
571 else {
572 FastDeleteFacet(pbfc);
573 }
574 }
575 }
576 }
577
578 CreateContoursList(solid);
579 CreateWingsList(solid);
580}
jbxl::BREP_WING::prev
BREP_WING * prev
Definition Brep.h:211

References BREP_FACET, BREP_FACET::CloseData(), CreateContourByVertex(), CreateContoursList(), CreateWingsList(), DupEdgeNumber(), FastDeleteFacet(), BREP_WING::prev, BREP_FACET::shell, BREP_SOLID::shells, and BREP_WING::vertex.

Referenced by DeleteSurplusContours().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ RGB2Word()

uWord RGB2Word ( uWord r,
uWord g,
uWord b )
inline

Definition at line 1050 of file Gdata.h.

1051{
1052 r = (int)(((r&0x00ff)>>3)<<11);
1053 g = (int)(((g&0x00ff)>>2)<<5);
1054 b = (int) ((b&0x00ff)>>3);
1055 uWord c = (uWord)(r + g + b);
1056
1057 if (isLittleEndian) swap_byte(&c, 2, 2);
1058 return c;
1059}
swap_byte
void swap_byte(void *p, int s, int c)
sの長さのpのバイト順序をbバイト毎に逆順にする．
Definition tools.cpp:1854
isLittleEndian
#define isLittleEndian
Definition tools.h:423

References isLittleEndian, and swap_byte().

Referenced by _linecopy_MAT2MSG_C3().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ rotate_MSGraph() [1/2]

template<typename T >
MSGraph< T > rotate_MSGraph ( MSGraph< T > vp,
double th,
int mode = ON )

Definition at line 1956 of file Graph.h.

1957{
1958 MSGraph<T> vs;
1959 double cst = cos(th);
1960 double snt = cos(th);
1961 int xys = (int)sqrt(vp.xs*vp.xs+vp.ys*vp.ys) + 1;
1962
1963 vs = rotate_MSGraph<T>(vp, xys, xys, cst, snt, mode);
1964 return vs;
1965}

References MSGraph< T >::xs, and MSGraph< T >::ys.

◆ rotate_MSGraph() [2/2]

template<typename T >
MSGraph< T > rotate_MSGraph ( MSGraph< T > vp,
int xs,
int ys,
double cst,
double snt,
int mode = ON )

template <typename T> MSGraph<T> rotate_MSGraph(MSGraph<T> vp, int xs, int ys, double cst, double snt, int mode=ON)

反時計回りに画像を回転させる

Definition at line 1897 of file Graph.h.

1898{
1899 MSGraph<T> vs;
1900 T pt;
1901 int i, j, m, n;
1902 int ps, px, pz;
1903 double u, t, x, y, a, b;
1904
1905 vs.set(xs, ys, vp.zs, vp.zero, vp.base);
1906 if (vs.isNull()) return vs;
1907 vs.color = vp.color;
1908
1909 ps = vs.xs*vs.ys;
1910
1911 for (int k=0; k<vs.zs; k++) {
1912 pz = k*ps;
1913 for (int jj=0; jj<vs.ys; jj++) {
1914 px = pz + jj*vs.xs;
1915 for (int ii=0; ii<vs.xs; ii++) {
1916 u = ii - (vs.xs-1)/2.;
1917 t = (vs.ys-1)/2. - jj;
1918 x = u*cst + t*snt;
1919 y = - u*snt + t*cst;
1920 a = x + (vp.xs-1)/2.;
1921 b = (vp.ys-1)/2. - y;
1922 i = (int)a;
1923 j = (int)b;
1924
1925 if (i<0 || i>=vp.xs || j<0 || j>=vp.ys) {
1926 pt = vs.zero;
1927 }
1928 else {
1929 if (mode==ON) {
1930 if (a>=0.) a = a - i;
1931 else a = 0.;
1932 if (b>=0.) b = b - j;
1933 else b = 0.;
1934
1935 m = i + 1;
1936 n = j + 1;
1937 if (m>=vp.xs) m = vp.xs - 1;
1938 if (n>=vp.ys) n = vp.ys - 1;
1939 pt = (T)((1.-a)*(1.-b)*vp.point(i, j, k) + (1.-a)*b*vp.point(i, n, k)
1940 + a*(1.-b)*vp.point(m, j, k) + a*b*vp.point(m, n, k) + 0.5);
1941 }
1942 else {
1943 pt = vp.point(i, j, k);
1944 }
1945 }
1946 vs.gp[px+ii] = pt;
1947 }
1948 }
1949 }
1950 return vs;
1951}

References MSGraph< T >::base, MSGraph< T >::color, MSGraph< T >::gp, MSGraph< T >::isNull(), ON, MSGraph< T >::point(), MSGraph< T >::set(), MSGraph< T >::xs, MSGraph< T >::ys, MSGraph< T >::zero, and MSGraph< T >::zs.

Here is the call graph for this function:

◆ rotate_point()

void rotate_point ( int & x,
int & y,
double sxc,
double syc,
double dxc,
double dyc,
double cst,
double snt )

void jbxl::rotate_point(int& x, int& y, double sxc, double syc, double dxc, double dyc, double cst, double snt)

Parameters
[in,out]xin: X座標．out: 回転後のX座標．
[in,out]yin: Y座標．out: 回転後のY座標．
sxc回転前の座標の中心の X座標
syc回転前の座標の中心の Y座標
dxc回転後の座標の中心の X座標
dyc回転後の座標の中心の Y座標
cst回転角 cosθ
snt回転角 sinθ

Definition at line 26 of file Graph.cpp.

27{
28 double a, b, u, t;
29
30 a = x - sxc;
31 b = syc - y;
32 u = a*cst - b*snt;
33 t = a*snt + b*cst;
34 x = (int)(u + dxc + 0.5);
35 y = (int)(dyc - t + 0.5);
36
37 return;
38}

Referenced by rotate_point_angle().

Here is the caller graph for this function:

◆ rotate_point_angle()

void rotate_point_angle ( int & x,
int & y,
double sxc,
double syc,
double dxc,
double dyc,
double th )

void jbxl::rotate_point_angle(int& x, int& y, double sxc, double syc, double dxc, double dyc, double th)

Parameters
[in,out]xin: X座標．out: 回転後のX座標．
[in,out]yin: Y座標．out: 回転後のY座標．
sxc回転前の座標の中心の X座標
syc回転前の座標の中心の Y座標
dxc回転後の座標の中心の X座標
dyc回転後の座標の中心の Y座標
th回転角（ラジアン）

Definition at line 52 of file Graph.cpp.

53{
54 double cst = (double)cos(th);
55 double snt = (double)sin(th);
56
57 rotate_point(x, y, sxc, syc, dxc, dyc, cst, snt);
58
59 return;
60}
jbxl::rotate_point
void rotate_point(int &x, int &y, double sxc, double syc, double dxc, double dyc, double cst, double snt)
Definition Graph.cpp:26

References rotate_point().

Here is the call graph for this function:

◆ RotMatrix2ExtEulerXYZ()

template<typename T >
Vector< T > RotMatrix2ExtEulerXYZ ( Matrix< T > mtx,
Vector< T > * vct = NULL )

Definition at line 1000 of file Rotation.h.

1001{
1002 T m11 = mtx.element(1, 1);
1003 T m12 = mtx.element(1, 2);
1004 T m13 = mtx.element(1, 3);
1005 T m21 = mtx.element(2, 1);
1006 T m31 = mtx.element(3, 1);
1007 T m32 = mtx.element(3, 2);
1008 T m33 = mtx.element(3, 3);
1009
1010 Vector<T> eul = RotMatrixElements2ExtEulerXYZ<T>(m11, m12, m13, m21, m31, m32, m33, vct);
1011
1012 return eul;
1013}
jbxl::Matrix::element
T & element(int i,...)
Definition Matrix++.h:204

References Matrix< T >::element().

Referenced by RotMatrix2Quaternion().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ RotMatrix2ExtEulerXZY()

template<typename T >
Vector< T > RotMatrix2ExtEulerXZY ( Matrix< T > mtx,
Vector< T > * vct = NULL )

Definition at line 1033 of file Rotation.h.

1034{
1035 T m11 = mtx.element(1, 1);
1036 T m12 = mtx.element(1, 2);
1037 T m13 = mtx.element(1, 3);
1038 T m21 = mtx.element(2, 1);
1039 T m22 = mtx.element(2, 2);
1040 T m23 = mtx.element(2, 3);
1041 T m31 = mtx.element(3, 1);
1042
1043 Vector<T> eul = RotMatrixElements2ExtEulerXZY<T>(m11, m12, m13, m21, m22, m23, m31, vct);
1044
1045 return eul;
1046}

References Matrix< T >::element().

Referenced by Quaternion2ExtEulerXZY().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ RotMatrix2ExtEulerYXZ()

template<typename T >
Vector< T > RotMatrix2ExtEulerYXZ ( Matrix< T > mtx,
Vector< T > * vct = NULL )

Definition at line 1065 of file Rotation.h.

1066{
1067 T m12 = mtx.element(1, 2);
1068 T m21 = mtx.element(2, 1);
1069 T m22 = mtx.element(2, 2);
1070 T m23 = mtx.element(2, 3);
1071 T m31 = mtx.element(3, 1);
1072 T m32 = mtx.element(3, 2);
1073 T m33 = mtx.element(3, 3);
1074
1075 Vector<T> eul = RotMatrixElements2ExtEulerYXZ<T>(m12, m21, m22, m23, m31, m32, m33, vct);
1076
1077 return eul;
1078}

References Matrix< T >::element().

Referenced by Quaternion2ExtEulerYXZ().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ RotMatrix2ExtEulerYZX()

template<typename T >
Vector< T > RotMatrix2ExtEulerYZX ( Matrix< T > mtx,
Vector< T > * vct = NULL )

Definition at line 1049 of file Rotation.h.

1050{
1051 T m11 = mtx.element(1, 1);
1052 T m12 = mtx.element(1, 2);
1053 T m13 = mtx.element(1, 3);
1054 T m21 = mtx.element(2, 1);
1055 T m22 = mtx.element(2, 2);
1056 T m31 = mtx.element(3, 1);
1057 T m32 = mtx.element(3, 2);
1058
1059 Vector<T> eul = RotMatrixElements2ExtEulerYZX<T>(m11, m12, m13, m21, m22, m31, m32, vct);
1060
1061 return eul;
1062}

References Matrix< T >::element().

Referenced by Quaternion2ExtEulerYZX().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ RotMatrix2ExtEulerZXY()

template<typename T >
Vector< T > RotMatrix2ExtEulerZXY ( Matrix< T > mtx,
Vector< T > * vct = NULL )

Definition at line 1081 of file Rotation.h.

1082{
1083 T m12 = mtx.element(1, 2);
1084 T m13 = mtx.element(1, 3);
1085 T m21 = mtx.element(2, 1);
1086 T m22 = mtx.element(2, 2);
1087 T m23 = mtx.element(2, 3);
1088 T m32 = mtx.element(3, 2);
1089 T m33 = mtx.element(3, 3);
1090
1091 Vector<T> eul = RotMatrixElements2ExtEulerZXY<T>(m12, m13, m21, m22, m23, m32, m33, vct);
1092
1093 return eul;
1094}

References Matrix< T >::element().

Referenced by Quaternion2ExtEulerZXY().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ RotMatrix2ExtEulerZYX()

template<typename T >
Vector< T > RotMatrix2ExtEulerZYX ( Matrix< T > mtx,
Vector< T > * vct )

Definition at line 1017 of file Rotation.h.

1018{
1019 T m11 = mtx.element(1, 1);
1020 T m12 = mtx.element(1, 2);
1021 T m13 = mtx.element(1, 3);
1022 T m21 = mtx.element(2, 1);
1023 T m23 = mtx.element(2, 3);
1024 T m31 = mtx.element(3, 1);
1025 T m33 = mtx.element(3, 3);
1026
1027 Vector<T> eul = RotMatrixElements2ExtEulerZYX<T>(m11, m12, m13, m21, m23, m31, m33, vct);
1028
1029 return eul;
1030}

References Matrix< T >::element().

Referenced by Quaternion2ExtEulerZYX().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ RotMatrix2Quaternion()

template<typename T >
Quaternion< T > RotMatrix2Quaternion ( Matrix< T > mtx)

Definition at line 1167 of file Rotation.h.

1168{
1169 Quaternion<T> qut;
1170 Vector<T> xyz = RotMatrix2ExtEulerXYZ(mtx);
1171 qut.setExtEulerXYZ(xyz);
1172
1173 return qut;
1174}
jbxl::RotMatrix2ExtEulerXYZ
Vector< T > RotMatrix2ExtEulerXYZ(Matrix< T > mtx, Vector< T > *vct=NULL)
Definition Rotation.h:1000

References RotMatrix2ExtEulerXYZ(), and Quaternion< T >::setExtEulerXYZ().

Here is the call graph for this function:

◆ RotMatrixElements2ExtEulerXYZ()

template<typename T >
Vector< T > RotMatrixElements2ExtEulerXYZ ( T m11,
T m12,
T m13,
T m21,
T m31,
T m32,
T m33,
Vector< T > * vct = NULL )

Definition at line 656 of file Rotation.h.

657{
658 Vector<T> eul((T)0.0, (T)0.0, (T)0.0, (T)0.0, -(T)1.0);
659 Vector<T> ev[2];
660 T arctang;
661
662 if (m31<-(T)1.0 || m31>(T)1.0) return eul;
663
664 if ((T)1.0-m31<(T)Zero_Eps || (T)1.0+m31<(T)Zero_Eps) {
665 if ((T)1.0-m31<Zero_Eps) { // m31==1.0
666 ev[0].y = ev[1].y = -(T)PI_DIV2;
667 ev[0].z = (T)0.0;
668 ev[1].z = (T)PI_DIV2;
669 arctang = (T)atan2(-m12, -m13);
670 ev[0].x = arctang - ev[0].z;
671 ev[1].x = arctang - ev[1].z;
672 }
673 else { // m31==-1.0
674 ev[0].y = ev[1].y = (T)PI_DIV2;
675 ev[0].z = (T)0.0;
676 ev[1].z = (T)PI_DIV2;
677 arctang = (T)atan2(m12, m13);
678 ev[0].x = arctang + ev[0].z;
679 ev[1].x = arctang + ev[1].z;
680 }
681 }
682
683 else {
684 ev[0].y = -(T)asin(m31);
685 if (ev[0].y>=(T)0.0) ev[1].y = (T)PI - ev[0].y; // 別解
686 else ev[1].y = - (T)PI - ev[0].y;
687
688 T cy1 = (T)cos(ev[0].y);
689 T cy2 = (T)cos(ev[1].y);
690 if (Xabs(cy1)<(T)Zero_Eps || Xabs(cy2)<(T)Zero_Eps) return eul;
691
692 ev[0].x = (T)atan2(m32/cy1, m33/cy1);
693 ev[0].z = (T)atan2(m21/cy1, m11/cy1);
694
695 if (ev[0].x>=(T)0.0) ev[1].x = ev[0].x - (T)PI;
696 else ev[1].x = ev[0].x + (T)PI;
697 if (ev[0].z>=(T)0.0) ev[1].z = ev[0].z - (T)PI;
698 else ev[1].z = ev[0].z + (T)PI;
699 }
700
701 //
702 // XYZ
703 if (vct!=NULL) {
704 vct[0].set(ev[0].x, ev[0].y, ev[0].z);
705 vct[1].set(ev[1].x, ev[1].y, ev[1].z);
706 }
707 eul.set(ev[0].x, ev[0].y, ev[0].z);
708
709 return eul;
710}
PI_DIV2
#define PI_DIV2
Definition common.h:185

References PI, PI_DIV2, Vector< T >::set(), Vector< T >::x, Xabs, Vector< T >::y, Vector< T >::z, and Zero_Eps.

Here is the call graph for this function:

◆ RotMatrixElements2ExtEulerXZY()

template<typename T >
Vector< T > RotMatrixElements2ExtEulerXZY ( T m11,
T m12,
T m13,
T m21,
T m22,
T m23,
T m31,
Vector< T > * vct = NULL )

Definition at line 770 of file Rotation.h.

771{
772 Vector<T> eul((T)0.0, (T)0.0, (T)0.0, (T)0.0, -(T)1.0);
773 Vector<T> ev[2];
774 T arctang;
775
776 if (m21<-(T)1.0 || m21>(T)1.0) return eul;
777
778 if ((T)1.0-m21<(T)Zero_Eps || (T)1.0+m21<(T)Zero_Eps) {
779 if ((T)1.0-m21<(T)Zero_Eps) { // m21==1.0
780 ev[0].z = ev[1].z = (T)PI_DIV2;
781 ev[0].y = (T)0.0;
782 ev[1].y = (T)PI_DIV2;
783 arctang = (T)atan2(m13, -m12);
784 ev[0].x = arctang - ev[0].y;
785 ev[1].x = arctang - ev[1].y;
786 }
787 else { // m21==-1.0
788 ev[0].z = ev[1].y = -(T)PI_DIV2;
789 ev[0].y = (T)0.0;
790 ev[1].y = (T)PI_DIV2;
791 arctang = (T)atan2(-m13, m12);
792 ev[0].x = arctang + ev[0].y;
793 ev[1].x = arctang + ev[1].y;
794 }
795 }
796
797 else {
798 ev[0].z = (T)asin(m21);
799 if (ev[0].z>=(T)0.0) ev[1].z = (T)PI - ev[0].z;
800 else ev[1].z = -(T)PI - ev[0].z;
801
802 T cz1 = (T)cos(ev[0].z);
803 T cz2 = (T)cos(ev[1].z);
804 if (Xabs(cz1)<(T)Zero_Eps || Xabs(cz2)<(T)Zero_Eps) return eul;
805
806 ev[0].x = (T)atan2(-m23/cz1, m22/cz1);
807 ev[0].y = (T)atan2(-m31/cz1, m11/cz1);
808
809 if (ev[0].x>=(T)0.0) ev[1].x = ev[0].x - (T)PI;
810 else ev[1].x = ev[0].x + (T)PI;
811 if (ev[0].y>=(T)0.0) ev[1].y = ev[0].y - (T)PI;
812 else ev[1].y = ev[0].y + (T)PI;
813 }
814
815 //
816 // XZY
817 if (vct!=NULL) {
818 vct[0].set(ev[0].x, ev[0].z, ev[0].y);
819 vct[1].set(ev[1].x, ev[1].z, ev[1].y);
820 }
821 eul.set(ev[0].x, ev[0].z, ev[0].y);
822
823 return eul;
824}

References PI, PI_DIV2, Vector< T >::set(), Vector< T >::x, Xabs, Vector< T >::y, Vector< T >::z, and Zero_Eps.

Here is the call graph for this function:

◆ RotMatrixElements2ExtEulerYXZ()

template<typename T >
Vector< T > RotMatrixElements2ExtEulerYXZ ( T m12,
T m21,
T m22,
T m23,
T m31,
T m32,
T m33,
Vector< T > * vct = NULL )

Definition at line 884 of file Rotation.h.

885{
886 Vector<T> eul((T)0.0, (T)0.0, (T)0.0, (T)0.0, -(T)1.0);
887 Vector<T> ev[2];
888 T arctang;
889
890 if (m32<-(T)1.0 || m32>(T)1.0) return eul;
891
892 if ((T)1.0-m32<(T)Zero_Eps || (T)1.0+m32<(T)Zero_Eps) {
893 if ((T)1.0-m32<(T)Zero_Eps) { // m32==1.0
894 ev[0].x = ev[1].x = (T)PI_DIV2;
895 ev[0].z = (T)0.0;
896 ev[1].z = (T)PI_DIV2;
897 arctang = (T)atan2(m21, -m23);
898 ev[0].y = arctang - ev[0].z;
899 ev[1].y = arctang - ev[1].z;
900 }
901 else { // m32==-1.0
902 ev[0].x = ev[1].x = -(T)PI_DIV2;
903 ev[0].z = (T)0.0;
904 ev[1].z = (T)PI_DIV2;
905 arctang = (T)atan2(-m21, m23);
906 ev[0].y = arctang + ev[0].z;
907 ev[1].y = arctang + ev[1].z;
908 }
909 }
910
911 else {
912 ev[0].x = (T)asin(m32);
913 if (ev[0].x>=0.0) ev[1].x = (T)PI - ev[0].x;
914 else ev[1].x = -(T)PI - ev[0].x;
915
916 T cx1 = (T)cos(ev[0].x);
917 T cx2 = (T)cos(ev[1].x);
918 if (Xabs(cx1)<(T)Zero_Eps || Xabs(cx2)<(T)Zero_Eps) return eul;
919
920 ev[0].y = (T)atan2(-m31/cx1, m33/cx1);
921 ev[0].z = (T)atan2(-m12/cx1, m22/cx1);
922
923 if (ev[0].y>=(T)0.0) ev[1].y = ev[0].y - (T)PI;
924 else ev[1].y = ev[0].y + (T)PI;
925 if (ev[0].z>=(T)0.0) ev[1].z = ev[0].z - (T)PI;
926 else ev[1].z = ev[0].z + (T)PI;
927 }
928
929 //
930 // YXZ
931 if (vct!=NULL) {
932 vct[0].set(ev[0].y, ev[0].x, ev[0].z);
933 vct[1].set(ev[1].y, ev[1].x, ev[1].z);
934 }
935 eul.set(ev[0].y, ev[0].x, ev[0].z);
936
937 return eul;
938}

References PI, PI_DIV2, Vector< T >::set(), Vector< T >::x, Xabs, Vector< T >::y, Vector< T >::z, and Zero_Eps.

Here is the call graph for this function:

◆ RotMatrixElements2ExtEulerYZX()

template<typename T >
Vector< T > RotMatrixElements2ExtEulerYZX ( T m11,
T m12,
T m13,
T m21,
T m22,
T m31,
T m32,
Vector< T > * vct = NULL )

Definition at line 827 of file Rotation.h.

828{
829 Vector<T> eul((T)0.0, (T)0.0, (T)0.0, (T)0.0, -(T)1.0);
830 Vector<T> ev[2];
831 T arctang;
832
833 if (m12<-(T)1.0 || m12>(T)1.0) return eul;
834
835 if ((T)1.0-m12<(T)Zero_Eps || (T)1.0+m12<(T)Zero_Eps) {
836 if (1.0-m12<Zero_Eps) { // m12==1.0
837 ev[0].z = ev[1].z = -(T)PI_DIV2;
838 ev[0].y = (T)0.0;
839 ev[1].y = (T)PI_DIV2;
840 arctang = (T)atan2(-m31, -m21);
841 ev[0].x = arctang - ev[0].y;
842 ev[1].x = arctang - ev[1].y;
843 }
844 else { // m12==-1.0
845 ev[0].z = ev[1].y = (T)PI_DIV2;
846 ev[0].y = (T)0.0;
847 ev[1].y = (T)PI_DIV2;
848 arctang = (T)atan2(m31, m21);
849 ev[0].x = arctang + ev[0].y;
850 ev[1].x = arctang + ev[1].y;
851 }
852 }
853
854 else {
855 ev[0].z = -(T)asin(m12);
856 if (ev[0].z>=0.0) ev[1].z = (T)PI - ev[0].z;
857 else ev[1].z = -(T)PI - ev[0].z;
858
859 T cz1 = (T)cos(ev[0].z);
860 T cz2 = (T)cos(ev[1].z);
861 if (Xabs(cz1)<(T)Zero_Eps || Xabs(cz2)<(T)Zero_Eps) return eul;
862
863 ev[0].x = (T)atan2(m32/cz1, m22/cz1);
864 ev[0].y = (T)atan2(m13/cz1, m11/cz1);
865
866 if (ev[0].x>=(T)0.0) ev[1].x = ev[0].x - (T)PI;
867 else ev[1].x = ev[0].x + (T)PI;
868 if (ev[0].y>=(T)0.0) ev[1].y = ev[0].y - (T)PI;
869 else ev[1].y = ev[0].y + (T)PI;
870 }
871
872 //
873 // YZX
874 if (vct!=NULL) {
875 vct[0].set(ev[0].y, ev[0].z, ev[0].x);
876 vct[1].set(ev[1].y, ev[1].z, ev[1].x);
877 }
878 eul.set(ev[0].y, ev[0].z, ev[0].x);
879
880 return eul;
881}

References PI, PI_DIV2, Vector< T >::set(), Vector< T >::x, Xabs, Vector< T >::y, Vector< T >::z, and Zero_Eps.

Here is the call graph for this function:

◆ RotMatrixElements2ExtEulerZXY()

template<typename T >
Vector< T > RotMatrixElements2ExtEulerZXY ( T m12,
T m13,
T m21,
T m22,
T m23,
T m32,
T m33,
Vector< T > * vct = NULL )

Definition at line 941 of file Rotation.h.

942{
943 Vector<T> eul((T)0.0, (T)0.0, (T)0.0, (T)0.0, -(T)1.0);
944 Vector<T> ev[2];
945 T arctang;
946
947 if (m23<-(T)1.0 || m23>(T)1.0) return eul;
948
949 if ((T)1.0-m23<(T)Zero_Eps || (T)1.0+m23<(T)Zero_Eps) {
950 if ((T)1.0-m23<(T)Zero_Eps) { // m23==1.0
951 ev[0].x = ev[1].x = -(T)PI_DIV2;
952 ev[0].z = (T)0.0;
953 ev[1].z = (T)PI_DIV2;
954 arctang = (T)atan2(-m12, -m32);
955 ev[0].y = arctang - ev[0].z;
956 ev[1].y = arctang - ev[1].z;
957 }
958 else { // m23==-1.0
959 ev[0].x = ev[1].x = (T)PI_DIV2;
960 ev[0].z = (T)0.0;
961 ev[1].z = (T)PI_DIV2;
962 arctang = (T)atan2(m12, m32);
963 ev[0].y = arctang + ev[0].z;
964 ev[1].y = arctang + ev[1].z;
965 }
966 }
967
968 else {
969 ev[0].x = -(T)asin(m23);
970 if (ev[0].x>=(T)0.0) ev[1].x = (T)PI - ev[0].x;
971 else ev[1].x = -(T)PI - ev[0].x;
972
973 T cx1 = (T)cos(ev[0].x);
974 T cx2 = (T)cos(ev[1].x);
975 if (Xabs(cx1)<(T)Zero_Eps || Xabs(cx2)<(T)Zero_Eps) return eul;
976
977 ev[0].y = (T)atan2(m13/cx1, m33/cx1);
978 ev[0].z = (T)atan2(m21/cx1, m22/cx1);
979
980 if (ev[0].y>=(T)0.0) ev[1].y = ev[0].y - (T)PI;
981 else ev[1].y = ev[0].y + (T)PI;
982 if (ev[0].z>=(T)0.0) ev[1].z = ev[0].z - (T)PI;
983 else ev[1].z = ev[0].z + (T)PI;
984 }
985
986 //
987 // ZXY
988 if (vct!=NULL) {
989 vct[0].set(ev[0].z, ev[0].x, ev[0].y);
990 vct[1].set(ev[1].z, ev[1].x, ev[1].y);
991 }
992 eul.set(ev[0].z, ev[0].x, ev[0].y);
993
994 return eul;
995}

References PI, PI_DIV2, Vector< T >::set(), Vector< T >::x, Xabs, Vector< T >::y, Vector< T >::z, and Zero_Eps.

Here is the call graph for this function:

◆ RotMatrixElements2ExtEulerZYX()

template<typename T >
Vector< T > RotMatrixElements2ExtEulerZYX ( T m11,
T m12,
T m13,
T m21,
T m23,
T m31,
T m33,
Vector< T > * vct = NULL )

Definition at line 713 of file Rotation.h.

714{
715 Vector<T> eul((T)0.0, (T)0.0, (T)0.0, (T)0.0, -(T)1.0);
716 Vector<T> ev[2];
717 T arctang;
718
719 if (m13<-(T)1.0 || m13>(T)1.0) return eul;
720
721 if ((T)1.0-m13<(T)Zero_Eps || (T)1.0+m13<(T)Zero_Eps) {
722 if ((T)1.0-m13<(T)Zero_Eps) { // m13==1.0
723 ev[0].y = ev[1].y = (T)PI_DIV2;
724 ev[0].z = (T)0.0;
725 ev[1].z = (T)PI_DIV2;
726 arctang = (T)atan2(m21, -m31);
727 ev[0].x = (T)arctang - ev[0].z;
728 ev[1].x = (T)arctang - ev[1].z;
729 }
730 else { // m13==-1.0
731 ev[0].y = ev[1].y = -(T)PI_DIV2;
732 ev[0].z = (T)0.0;
733 ev[1].z = (T)PI_DIV2;
734 arctang = (T)atan2(-m21, m31);
735 ev[0].x = (T)arctang + ev[0].z;
736 ev[1].x = (T)arctang + ev[1].z;
737 }
738 }
739
740 else {
741 ev[0].y = (T)asin(m13);
742 if (ev[0].y>=0.0) ev[1].y = (T)PI - ev[0].y;
743 else ev[1].y = -(T)PI - ev[0].y;
744
745 T cy1 = (T)cos(ev[0].y);
746 T cy2 = (T)cos(ev[1].y);
747 if (Xabs(cy1)<Zero_Eps || Xabs(cy2)<Zero_Eps) return eul;
748
749 ev[0].x = atan2(-m23/cy1, m33/cy1);
750 ev[0].z = atan2(-m12/cy1, m11/cy1);
751
752 if (ev[0].x>=(T)0.0) ev[1].x = ev[0].x - (T)PI;
753 else ev[1].x = ev[0].x + (T)PI;
754 if (ev[0].z>=(T)0.0) ev[1].z = ev[0].z - (T)PI;
755 else ev[1].z = ev[0].z + (T)PI;
756 }
757
758 //
759 // ZYX
760 if (vct!=NULL) {
761 vct[0].set(ev[0].z, ev[0].y, ev[0].x);
762 vct[1].set(ev[1].z, ev[1].y, ev[1].x);
763 }
764 eul.set(ev[0].z, ev[0].y, ev[0].x);
765
766 return eul;
767}

References PI, PI_DIV2, Vector< T >::set(), Vector< T >::x, Xabs, Vector< T >::y, Vector< T >::z, and Zero_Eps.

Here is the call graph for this function:

◆ same_vector() [1/2]

template<typename T >
bool same_vector ( Vector4< T > v1,
Vector4< T > v2 )
inline

v1, v2 が同じ点かチェックする．信頼度は考慮しない．

Definition at line 888 of file Vector.h.

889{
890 T dx = v1.x - v2.x;
891 T dy = v1.y - v2.y;
892 T dz = v1.z - v2.z;
893 T dt = v1.t - v2.t;
894 T d2 = dx*dx + dy*dy + dz*dz + dt*dt;
895 double t2 = Vector_Tolerance*Vector_Tolerance;
896
897 if ((double)d2>t2) return false;
898 return true;
899}
jbxl::Vector_Tolerance
double Vector_Tolerance
Definition Tolerance.cpp:14

References Vector4< T >::t, Vector_Tolerance, Vector4< T >::x, Vector4< T >::y, and Vector4< T >::z.

◆ same_vector() [2/2]

template<typename T >
bool same_vector ( Vector< T > v1,
Vector< T > v2 )
inline

v1, v2 が同じ点かチェックする．信頼度は考慮しない．

Definition at line 241 of file Vector.h.

242{
243 T dx = v1.x - v2.x;
244 T dy = v1.y - v2.y;
245 T dz = v1.z - v2.z;
246 T d2 = dx*dx + dy*dy + dz*dz;
247 double t2 = Vector_Tolerance*Vector_Tolerance;
248
249 if ((double)d2>t2) return false;
250 return true;
251}

References Vector_Tolerance, Vector< T >::x, Vector< T >::y, and Vector< T >::z.

◆ SamePlaneContour()

DllExport bool SamePlaneContour ( BREP_CONTOUR * contour1,
BREP_CONTOUR * contour2,
int & lineno )

Definition at line 1167 of file TriBrep.cpp.

1168{
1169 double um, umt, tm, tmt;
1170 BREP_WING* wing = contour1->wing;
1171 TVector<double> directB, directQ;
1172
1173 lineno = 0;
1174 for (int i=0; i<3; i++) {
1175 directB = Vertex2TVector(wing->next->vertex) - Vertex2TVector(wing->vertex);
1176 directQ = Vertex2TVector(contour2->wing->vertex) - Vertex2TVector(wing->vertex);
1177 um = contour2->directRS*directB;
1178 tm = contour2->directRS*directQ;
1179 umt = TVectorMultiTolerance(contour2->directRS, directB);
1180 tmt = TVectorMultiTolerance(contour2->directRS, directQ);
1181 if (Xabs(um)<Max(umt, Zero_Eps) && Xabs(tm)<Max(tmt, Zero_Eps)) {
1182 lineno++;
1183 }
1184 }
1185
1186 if (lineno>=2) return true;
1187 return false;
1188}

References BREP_CONTOUR::directRS, Max, BREP_WING::next, TVectorMultiTolerance(), BREP_WING::vertex, Vertex2TVector(), BREP_CONTOUR::wing, Xabs, and Zero_Eps.

Referenced by IsCollisionContours().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ scalingMSGraph2D()

template<typename T >
MSGraph< T > scalingMSGraph2D ( MSGraph< T > vp,
double scale )

Definition at line 943 of file Gdata.h.

944{
945 MSGraph<T> xp;
946
947 if (scale==0.0) return xp;
948
949 int xs = (int)(vp.xs*scale);
950 int ys = (int)(vp.ys*scale);
951 int zs = vp.zs;
952 int ps = xs*ys;
953 if (vp.xs*scale-xs>0.0) xs++;
954 if (vp.ys*scale-ys>0.0) ys++;
955
956 xp.set(xs, ys, zs);
957 xp.getm();
958 xp.color = vp.color;
959
960 for (int kk=0; kk<zs; kk++) {
961 int posk = kk*ps;
962 //
963 for (int jj=0; jj<ys; jj++) {
964 int posj = jj*xs + posk;
965 double y = jj/scale;
966 int j = (int)y;
967 int n = j + 1;
968 if (j>vp.ys-1) j = vp.ys-1;
969 if (n>vp.ys-1) n = vp.ys-1;
970 double bt = y - j;
971 //
972 for (int ii=0; ii<xs; ii++) {
973 double x = ii/scale;
974 int i = (int)x;
975 int m = i + 1;
976 if (j>vp.xs-1) j = vp.xs-1;
977 if (n>vp.xs-1) n = vp.xs-1;
978 double al = x - i;
979
980 T a = vp.point(i, j, kk);
981 T b = vp.point(m, j, kk);
982 T c = vp.point(i, n, kk);
983 T d = vp.point(m, n, kk);
984 T p = (T)(a*(1.0-al)*(1.0-bt) + b*al*(1.0-bt) + c*(1.0-al)*bt + d*al*bt);
985
986 xp.gp[ii+posj] = p;
987 }
988 }
989 }
990
991 return xp;
992}

References MSGraph< T >::color, MSGraph< T >::getm(), MSGraph< T >::gp, MSGraph< T >::point(), MSGraph< T >::set(), MSGraph< T >::xs, MSGraph< T >::ys, and MSGraph< T >::zs.

Here is the call graph for this function:

◆ set_around_MSGraph()

template<typename T >
void set_around_MSGraph ( MSGraph< T > vp,
int cc = 0,
int size = 1 )

template <typename T> void set_around_MSGraph(MSGraph<T> vp, int cc=0, int size=1)

2Dグラフィックデータの縁の部分の輝度値を ccにする．

Parameters
vp操作対象となるグラフィックデータ構造体．
ccデータの縁に設定する輝度値．
size縁のサイズ

Definition at line 2030 of file Graph.h.

2031{
2032 int i, j, px1, px2;
2033/*
2034 for (i=0; i<vp.xs; i++){
2035 px1 = i;
2036 px2 = (vp.ys-1)*vp.xs + i;
2037 vp.gp[px1] = (T)cc;
2038 vp.gp[px2] = (T)cc;
2039 }
2040
2041 for (j=1; j<vp.ys-1; j++){
2042 px1 = j*vp.xs;
2043 px2 = (j+1)*vp.xs - 1;
2044 vp.gp[px1] = (T)cc;
2045 vp.gp[px2] = (T)cc;
2046 }
2047*/
2048 for(j=0; j<vp.ys; j++) {
2049 px1 = j*vp.xs;
2050 px2 = (j+1)*vp.xs-size;
2051 for(i=0; i<size; i++) {
2052 vp.gp[i+px1] = (T)cc;
2053 vp.gp[i+px2] = (T)cc;
2054 }
2055 }
2056
2057 for(j=0; j<size; j++) {
2058 px1 = j*vp.xs;
2059 px2 = (j+vp.ys-size)*vp.xs;
2060 for(i=0; i<vp.xs; i++) vp.gp[i+px1] = (T)cc;
2061 for(i=0; i<vp.xs; i++) vp.gp[i+px2] = (T)cc;
2062 }
2063
2064}

References MSGraph< T >::gp, MSGraph< T >::xs, and MSGraph< T >::ys.

Referenced by Density_Mask().

Here is the caller graph for this function:

◆ SetAbsVectorTolerance()

void SetAbsVectorTolerance ( double tol)
inline

Definition at line 49 of file Tolerance.h.

49{ Abs_Vector_Tolerance = tol; }
jbxl::Abs_Vector_Tolerance
double Abs_Vector_Tolerance
Definition Tolerance.cpp:20

References Abs_Vector_Tolerance.

◆ SetAbsVertexTolerance()

void SetAbsVertexTolerance ( double tol)
inline

Definition at line 50 of file Tolerance.h.

50{ Abs_Vertex_Tolerance = tol; }
jbxl::Abs_Vertex_Tolerance
double Abs_Vertex_Tolerance
Definition Tolerance.cpp:21

References Abs_Vertex_Tolerance.

◆ SetCollisionTolerance()

void SetCollisionTolerance ( double tol)
inline

Definition at line 47 of file Tolerance.h.

47{ Collision_Tolerance = tol; }

References Collision_Tolerance.

◆ SetDeletableContoursByEdge()

DllExport void SetDeletableContoursByEdge ( BREP_EDGE * edge)

void jbxl::SetDeletableContoursByEdge(BREP_EDGE* edge)

Edgeに関連付けられた Contourに削除可能のマークをつける．削除は行わない．

Definition at line 816 of file TriBrep.cpp.

817{
818 if (edge->edge_list!=NULL) {
819 BREP_EDGE_LIST::iterator iedge;
820 for (iedge=edge->edge_list->begin(); iedge!=edge->edge_list->end(); iedge++){
821 if ((*iedge)->wing1->contour!=NULL) {
822 (*iedge)->wing1->contour->facet->deletable = true;
823 }
824 if ((*iedge)->wing2->contour!=NULL) {
825 (*iedge)->wing2->contour->facet->deletable = true;
826 }
827 }
828 }
829 else {
830 if (edge->wing1->contour!=NULL) {
831 edge->wing1->contour->facet->deletable = true;
832 }
833 if (edge->wing2->contour!=NULL) {
834 edge->wing2->contour->facet->deletable = true;
835 }
836 }
837}

References BREP_WING::contour, BREP_FACET::deletable, BREP_EDGE::edge_list, BREP_CONTOUR::facet, BREP_EDGE::wing1, and BREP_EDGE::wing2.

Referenced by IsForbiddenEdge().

Here is the caller graph for this function:

◆ SetEdgeTolerance()

void SetEdgeTolerance ( double tol)
inline

Definition at line 45 of file Tolerance.h.

45{ Edge_Tolerance = tol; }
jbxl::Edge_Tolerance
double Edge_Tolerance
Definition Tolerance.cpp:16

References Edge_Tolerance.

◆ SetFacetTolerance()

void SetFacetTolerance ( double tol)
inline

Definition at line 46 of file Tolerance.h.

46{ Facet_Tolerance = tol; }
jbxl::Facet_Tolerance
double Facet_Tolerance
Definition Tolerance.cpp:17

References Facet_Tolerance.

◆ SetGlobalCounter()

void SetGlobalCounter ( CVCounter * counter)
inline

Definition at line 192 of file ClassBox.h.

192{ GLCounter = counter;}

References GLCounter.

Referenced by zzSobel().

Here is the caller graph for this function:

◆ SetGlobalDisplay()

void SetGlobalDisplay ( CVDisplay * disp)
inline

Definition at line 74 of file ClassBox.h.

74{ GLDisplay = disp;}

References GLDisplay.

◆ SetGlobalFrame()

void SetGlobalFrame ( CVFrame * frm)
inline

Definition at line 45 of file ClassBox.h.

45{ GLFrame = frm;}

References GLFrame.

◆ SetGlobalTextDocument()

void SetGlobalTextDocument ( CVTextDocument * doc)
inline

Definition at line 119 of file ClassBox.h.

119{ GLTextDocument = doc;}

References GLTextDocument.

◆ SetMinVertex()

DllExport void SetMinVertex ( BREP_VERTEX_LIST * list,
BREP_VERTEX * vrtx )

void jbxl::SetMinVertex(BREP_VERTEX_LIST* list, BREP_VERTEX* vrtx)

FillShortageWings_Near()用

Definition at line 445 of file TriBrep.cpp.

446{
447 BREP_VERTEX_LIST::iterator ivert;
448 for (ivert=list->begin(); ivert!=list->end(); ivert++){
449 if (vrtx==(*ivert)) return; // 既に登録済み
450 if (vrtx->distance2 < (*ivert)->distance2) {
451 list->insert(ivert, vrtx);
452 return;
453 }
454 }
455 if (ivert==list->end()) list->push_back(vrtx);
456 return;
457}

References BREP_VERTEX::distance2.

Referenced by FillShortageWings_Near().

Here is the caller graph for this function:

◆ SetSINTolerance()

void SetSINTolerance ( double tol)
inline

Definition at line 48 of file Tolerance.h.

48{ Sin_Tolerance = tol; }
jbxl::Sin_Tolerance
double Sin_Tolerance
sinθ==0
Definition Tolerance.cpp:23

References Sin_Tolerance.

◆ setupTGAData()

int setupTGAData ( TGAImage * tga,
bool rle )

int jbxl::setupTGAData(TGAImage* tga, bool rle)

TGAのヘッダを設定し直して，必要なら RLEを行う．

Parameters
tgaTGAデータへのポインタ
rleRLE（連長圧縮）を行うかどうか
Return values
0正常終了
<0エラーコード

Definition at line 390 of file TgaTool.cpp.

391{
392 if (tga->col<=0 || tga->col>4) return JBXL_GRAPH_IVDCOLOR_ERROR;
393
394 memset(tga->hd, 0, TGA_HEADER_SIZE);
395 if (tga->col==3 || tga->col==4) tga->hd[2] = 2; // Full Color
396 else if (tga->col==1 || tga->col==2) tga->hd[2] = 3; // Gray Scale
397 else return JBXL_GRAPH_IVDFMT_ERROR;
398
399 if (is_little_endian()) {
400 tga->hd[12] = (uByte)(tga->xs%256);
401 tga->hd[13] = (uByte)(tga->xs/256);
402 tga->hd[14] = (uByte)(tga->ys%256);
403 tga->hd[15] = (uByte)(tga->ys/256);
404 }
405 else {
406 tga->hd[12] = (uByte)(tga->xs/256);
407 tga->hd[13] = (uByte)(tga->xs%256);
408 tga->hd[14] = (uByte)(tga->ys/256);
409 tga->hd[15] = (uByte)(tga->ys%256);
410 }
411
412 tga->hd[16] = tga->col*8; // depth
413 tga->hd[17] = 0x20; // 0x20: Y方向:Top->Down
414 tga->hd[10] = tga->hd[14]; // Y posion for 0x20
415 tga->hd[11] = tga->hd[15]; //
416 if (tga->col==2 || tga->col==4) {
417 tga->hd[17] |= 0x08; // 0x08: αチャンネル深度
418 }
419 tga->length = tga->xs*tga->ys*tga->col; // データ（gp）長
420
421 if (rle && tga->gp!=NULL) {
422 int len = tga->xs*tga->ys;
423 uByte* index = (uByte*)malloc(len);
424 if (index==NULL) return JBXL_GRAPH_MEMORY_ERROR;
425 memset(index, 0, len);
426
427 int idx = 0;
428 int p = 0;
429 while (p<len-1) {
430 if (!memcmp(tga->gp + p*tga->col, tga->gp + (p+1)*tga->col, tga->col)) {
431 index[idx]++;
432 if (index[idx]==127) {
433 idx = p + 2;
434 p++;
435 }
436 }
437 else {
438 idx = p + 1;
439 }
440 p++;
441 }
442
443 // 変換後のサイズを計算
444 int n = 0;
445 p = 0;
446 while (p < len-1) {
447 n += tga->col + 1;
448 if (index[p]!=0x00) p += index[p];
449 p++;
450 }
451
452 if ((float)n < len*tga->col*0.8f) {
453 DEBUG_MODE PRINT_MESG("JBXL::writeTGAData: exec RLE (%d -> %d)\n", len*tga->col, n);
454 uByte* buf = (uByte*)malloc(len*tga->col);
455 if (buf==NULL) {
456 ::free(index);
457 return JBXL_GRAPH_MEMORY_ERROR;
458 }
459 memset(buf, 0, len*tga->col);
460 //
461 int i = 0;
462 int j = 0;
463 while (i < len-1) {
464 if (index[i]!=0x00) {
465 buf[j++] = 0x80 + index[i];
466 memcpy(buf+j, tga->gp + i*tga->col, tga->col);
467 j += tga->col;
468 i += index[i];
469 }
470 else {
471 buf[j++] = 0x00;
472 memcpy(buf+j, tga->gp + i*tga->col, tga->col);
473 j += tga->col;
474 }
475 i++;
476 }
477 //
478 if (j==n) {
479 tga->hd[2] |= 0x08;
480 tga->length = n;
481 ::free(tga->gp);
482 tga->gp = buf;
483 }
484 else {
485 DEBUG_MODE PRINT_MESG("JBXL::writeTGAData: Warning: missmatch RLE size (%d != %d)\n", j, n);
486 DEBUG_MODE PRINT_MESG("JBXL::writeTGAData: Warning: stop RLE!\n");
487 ::free(buf);
488 }
489 ::free(index);
490 }
491 }
492 return 0;
493}
JBXL_GRAPH_IVDCOLOR_ERROR
#define JBXL_GRAPH_IVDCOLOR_ERROR
無効なカラー指定
Definition jbxl_state.h:183

References TGAImage::col, DEBUG_MODE, TGAImage::gp, TGAImage::hd, is_little_endian(), JBXL_GRAPH_IVDCOLOR_ERROR, JBXL_GRAPH_IVDFMT_ERROR, JBXL_GRAPH_MEMORY_ERROR, TGAImage::length, PRINT_MESG, TGA_HEADER_SIZE, TGAImage::xs, and TGAImage::ys.

Referenced by MSGraph2TGAImage().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ SetVectorTolerance()

void SetVectorTolerance ( double tol)
inline

Definition at line 43 of file Tolerance.h.

43{ Vector_Tolerance = tol; }

References Vector_Tolerance.

◆ SetVertexTolerance()

void SetVertexTolerance ( double tol)
inline

Definition at line 44 of file Tolerance.h.

44{ Vertex_Tolerance = tol; }
jbxl::Vertex_Tolerance
double Vertex_Tolerance
Definition Tolerance.cpp:15

References Vertex_Tolerance.

◆ SetZeroEPS()

void SetZeroEPS ( double eps)
inline

Definition at line 42 of file Tolerance.h.

42{ Zero_Eps = eps; }

References Zero_Eps.

◆ SlerpQuaternion()

template<typename T >
Quaternion< T > SlerpQuaternion ( Quaternion< T > qa,
Quaternion< T > qb,
T t )

Quaternion<T> SlerpQuaternion(Quaternion<T> qa, Quaternion<T> qb, T t)

クオータニオンの球面線形補間 (Sphercal Linear Interpolation)
回転軸が変化しない，または180度反転した状態での 180度以上の回転に対応．

Parameters
qa始点のクオータニオン
qb終点のクオータニオン
tパラメータ 0〜1
Returns
補間結果のクオータニオン
SLERP
q(t) = qa*sin((1-t)*th)/sin(th) + qb*sin(t*th)/sin(th)

Definition at line 1369 of file Rotation.h.

1370{
1371 if (qa.n!=(T)1.0) qa.normalize();
1372 if (qb.n!=(T)1.0) qb.normalize();
1373
1374 //
1375 T dot;
1376 Quaternion<T> qc;
1377
1379 //
1380 Vector<T> va = qa.getVector();
1381 Vector<T> vb = qb.getVector();
1382 va.normalize();
1383 vb.normalize();
1384
1385 //
1386 dot = va*vb;
1387 if (dot>(T)1.0) dot = 1.0;
1388 else if (dot<-(T)1.0) dot = -1.0;
1389
1390 // 回転軸が変わらない場合
1391 if (dot>(T)1.0-Sin_Tolerance) {
1392 T anga = qa.getMathAngle();
1393 T angb = qb.getMathAngle();
1394 T angd = angb - anga;
1395 if (angd<-(T)PI) angd += (T)PI2;
1396 else if (angd>(T)PI) angd -= (T)PI2;
1397
1398 T angc = anga + t*angd;
1399 qc.setRotation(angc, va);
1400 qc.normalize();
1401 return qc;
1402 }
1403
1404 // 回転軸が反転する場合
1405// else if (dot<-(T)1.0+(T)Sin_Tolerance) {
1406 else if (dot<-(T)0.99) {
1407 T anga = qa.getMathAngle();
1408 T angb = - qb.getMathAngle();
1409 T angd = angb - anga;
1410 if (angd<-(T)PI) angd += (T)PI2;
1411 else if (angd>(T)PI) angd -= (T)PI2;
1412
1413 T angc = anga + t*angd;
1414 qc.setRotation(angc, va);
1415 qc.normalize();
1416 return qc;
1417 }
1418
1419 // SLERP
1420 dot = qa.x*qb.x + qa.y*qb.y + qa.z*qb.z + qa.s*qb.s;
1421 if (dot>(T)1.0) dot = (T)1.0;
1422 else if (dot<(T)0.0) {
1423 if (t<=(T)0.5) return qa;
1424 else return qb;
1425 }
1426 //if (dot<0.0) DEBUG_WARN("WARNING: SlerpQuaternion: dot = %f", dot);
1427
1428 //
1429 T th = (T)acos(dot);
1430 T sn = (T)sin(th);
1431 if (Xabs(sn)<(T)Sin_Tolerance) return qa;
1432
1433 //
1434 qc = qa*((T)sin(((T)1.0-t)*th)/sn) + qb*((T)sin(t*th)/sn);
1435 qc.normalize();
1436
1437 return qc;
1438}
jbxl::Quaternion::getMathAngle
T getMathAngle()
-π〜π
Definition Rotation.h:69
jbxl::Quaternion::setRotation
void setRotation(T e, Vector< T > v)
Definition Rotation.h:311
jbxl::Quaternion::normalize
void normalize(void)
Definition Rotation.h:288
jbxl::Quaternion::getVector
Vector< T > getVector()
Definition Rotation.h:66
jbxl::Vector::normalize
Vector< T > normalize(void)
Definition Vector.h:87
PI2
#define PI2
Definition common.h:184

References Quaternion< T >::getMathAngle(), Quaternion< T >::getVector(), Quaternion< T >::n, Quaternion< T >::normalize(), Vector< T >::normalize(), PI, PI2, Quaternion< T >::s, Quaternion< T >::setRotation(), Sin_Tolerance, Quaternion< T >::x, Xabs, Quaternion< T >::y, and Quaternion< T >::z.

Here is the call graph for this function:

◆ TGAImage2MSGraph()

template<typename T >
MSGraph< T > TGAImage2MSGraph ( TGAImage tga)

template <typename T> MSGraph<T> TGAImage2MSGraph(TGAImage tga)

TGAイメージデータを MSGraph型イメージデータに変換する

Parameters
tgaTGAイメージデータ
Returns
MSGraphイメージデータ
Return values
JBXL_GRAPH_NODATA_ERRORstate データ無し
JBXL_GRAPH_MEMORY_ERRORstate メモリ確保エラー

Definition at line 82 of file TgaTool.h.

83{
84 MSGraph<T> vp;
85
86 if (tga.isNull()) {
87 vp.state = JBXL_GRAPH_NODATA_ERROR;
88 return vp;
89 }
90
91 vp.set(tga.xs, tga.ys, tga.col);
92 if (vp.isNull()) return vp;
93 //
94 if (tga.col==4) vp.color = GRAPH_COLOR_BGRA;
95 else if (tga.col==3) vp.color = GRAPH_COLOR_BGR;
96 else if (tga.col==2) vp.color = GRAPH_COLOR_MA;
97 else if (tga.col==1) vp.color = GRAPH_COLOR_GRAY;
98 else {
99 vp.state = JBXL_GRAPH_IVDARG_ERROR;
100 vp.free();
101 return vp;
102 }
103
104 uByte dirx = tga.hd[17] & 0x10; // X方向 0: Left -> Right
105 uByte diry = tga.hd[17] & 0x20; // Y方向 0: Down -> Top
106
107 if (dirx==0x00 && diry==0x00) { // Left->Right, Down->Top
108 for (int k=0; k<tga.col; k++) {
109 int zp = k*tga.xs*tga.ys;
110 for (int j=0; j<tga.ys; j++) {
111 int yp = zp + j*tga.xs;
112 for (int i=0; i<tga.xs; i++) {
113 vp.gp[yp + i] = (T)tga.point(i, tga.ys-1-j, k);
114 }
115 }
116 }
117 }
118 else if (dirx==0x00 && diry==0x20) { // Left->Right, Top->Down
119 for (int k=0; k<tga.col; k++) {
120 int zp = k*tga.xs*tga.ys;
121 for (int j=0; j<tga.ys; j++) {
122 int yp = zp + j*tga.xs;
123 for (int i=0; i<tga.xs; i++) {
124 vp.gp[yp + i] = (T)tga.point(i, j, k);
125 }
126 }
127 }
128 }
129 else if (dirx==0x10 && diry==0x00) { // Right->Left, Down->Top
130 for (int k=0; k<tga.col; k++) {
131 int zp = k*tga.xs*tga.ys;
132 for (int j=0; j<tga.ys; j++) {
133 int yp = zp + j*tga.xs;
134 for (int i=0; i<tga.xs; i++) {
135 vp.gp[yp + i] = (T)tga.point(tga.xs-1-i, tga.ys-1-j, k);
136 }
137 }
138 }
139 }
140 else {
141 for (int k=0; k<tga.col; k++) { // Right->Left, Top->Down
142 int zp = k*tga.xs*tga.ys;
143 for (int j=0; j<tga.ys; j++) {
144 int yp = zp + j*tga.xs;
145 for (int i=0; i<tga.xs; i++) {
146 vp.gp[yp + i] = (T)tga.point(tga.xs-1-i, j, k);
147 }
148 }
149 }
150 }
151 return vp;
152}

References TGAImage::col, MSGraph< T >::color, MSGraph< T >::free(), MSGraph< T >::gp, GRAPH_COLOR_BGR, GRAPH_COLOR_BGRA, GRAPH_COLOR_GRAY, GRAPH_COLOR_MA, TGAImage::hd, MSGraph< T >::isNull(), TGAImage::isNull(), JBXL_GRAPH_IVDARG_ERROR, JBXL_GRAPH_NODATA_ERROR, TGAImage::point(), MSGraph< T >::set(), MSGraph< T >::state, TGAImage::xs, and TGAImage::ys.

Here is the call graph for this function:

◆ ToPola()

template<typename T >
void ToPola ( Vector< T > nv,
double & cst,
double & snt,
double & csf,
double & snf,
double pcsf = 0.0,
double psnf = 1.0 )

template <typename T> void ToPola(Vector<T> nv, double& cst, double& snt, double& csf, double& snf, double pcsf=0.0, double psnf=1.0)

ベクトル nvの単位ベクトルを極座標 (1,θ,φ) へ変換する．

ただし，θφは sin, cosの値として返される．．ベクトル nvのノルムは計算されている必要がある．

Parameters
[in]nv方向ベクトル．
[out]cst指定しない．cosθの値が入る．
[out]snt指定しない．sinθの値が入る．
[out]csf通常は cosφの値が入る．sinθ≒0 の場合は pcsfの値が代入される．
[out]snf通常は sinφの値が入る．sinθ≒0 の場合は psnfの値が代入される．
[in]pcsfsinθ≒0 の場合に csfに代入される．連続計算の場合に直前の cosφの値を指定する．
[in]psnfsinθ≒0 の場合に snfに代入される．連続計算の場合に直前の sinφの値を指定する．

Definition at line 674 of file Graph.h.

675{
676 if (nv.n!=1.0) nv.normalize();
677 if (nv.z<-1.0) nv.z = -1.0;
678 if (nv.z> 1.0) nv.z = 1.0;
679 cst = nv.z;
680 snt = sqrt(1.0-nv.z*nv.z);
681
682 if (snt<Sin_Tolerance) {
683 cst = Sign(cst);
684 snt = 0.0;
685 csf = pcsf;
686 snf = psnf;
687 }
688 else {
689 csf = nv.x/snt;
690 snf = nv.y/snt;
691 }
692/*
693 if (*snt<Sin_Tolerance) {
694 *cst = Sign(*cst);
695 *snt = 0.0;
696 }
697
698 double rr = sqrt(nv.x*nv.x + nv.y*nv.y);
699 if (rr<=Zero_Eps) {
700 *csf = 0.0;
701 *snf = 1.0;
702 }
703 else {
704 *csf = nv.x/rr;
705 *snf = nv.y/rr;
706 }
707*/
708 return;
709}

References Vector< T >::n, Vector< T >::normalize(), Sign, Sin_Tolerance, Vector< T >::x, Vector< T >::y, and Vector< T >::z.

Referenced by Local2World().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ TVectorMultiTolerance()

template<typename T >
T TVectorMultiTolerance ( TVector< T > a,
TVector< T > b )
inline

Definition at line 183 of file TVector.h.

184{ return (T)(a.n*b.t + a.t*b.n); }

References Vector< T >::n, and TVector< T >::t.

Referenced by CollisionTriContour2D(), CollisionTriContour3D(), and SamePlaneContour().

Here is the caller graph for this function:

◆ V2VQuaternion()

template<typename T >
Quaternion< T > V2VQuaternion ( Vector< T > a,
Vector< T > b )

Definition at line 1275 of file Rotation.h.

1276{
1277 Quaternion<T> qut((T)1.0, (T)0.0, (T)0.0, (T)0.0, (T)1.0);
1278
1279 a.normalize();
1280 b.normalize();
1281 if (a.n<(T)Zero_Eps || b.n<(T)Zero_Eps) return qut;
1282
1283 Vector<T> nr = a^b;
1284 nr.normalize();
1285
1286 T cs2 = (a*b)/(T)2.0; // θ/2 = 0〜π/2
1287
1288 T sn;
1289 if (cs2>(T)0.5) sn = (T)0.0;
1290 else sn = (T)sqrt(0.5 - cs2);
1291
1292 if (Xabs(sn-(T)1.0)<(T)Zero_Eps) {
1293 Vector<T> c = a + b;
1294 if (c.norm()<(T)1.0) {
1295 qut.setRotation(PI, nr);
1296 if (nr.n<Zero_Eps) {
1297 qut.s = (T)0.0;
1298 qut.n = (T)0.0;
1299 qut.c = -(T)1.0;
1300 }
1301 }
1302 else {
1303 qut.setRotation((T)0.0, nr);
1304 }
1305 return qut;
1306 }
1307
1308 T cs;
1309 if (cs2<-(T)0.5) cs = (T)0.0;
1310 else cs = (T)sqrt(0.5 + cs2);
1311
1312 //
1313 if (cs>(T)1.0) qut.set((T)1.0, (T)0.0, (T)0.0, (T)0.0, (T)1.0, -(T)1.0);
1314 else qut.set(cs, nr.x*sn, nr.y*sn, nr.z*sn, (T)1.0, (T)Min(a.c, b.c));
1315
1316 return qut;
1317}

References Quaternion< T >::c, Vector< T >::c, Min, Quaternion< T >::n, Vector< T >::n, Vector< T >::norm(), Vector< T >::normalize(), PI, Quaternion< T >::s, Quaternion< T >::set(), Quaternion< T >::setRotation(), Vector< T >::x, Xabs, Vector< T >::y, Vector< T >::z, and Zero_Eps.

Here is the call graph for this function:

◆ Vector4Angle() [1/2]

template<typename T >
double Vector4Angle ( Vector4< T > a,
Vector4< T > b )
inline

Definition at line 914 of file Vector.h.

915{
916 a.normalize();
917 b.normalize();
918 if (a.n<Zero_Eps || b.n<Zero_Eps) return 0.0;
919
920 double cs = a*b;
921 if (cs>=1.0) return 0.0;
922 else if (cs<=-1.0) return PI;
923
924 return acos(a*b);
925}
jbxl::Vector4::normalize
Vector4< T > normalize(void)
Definition Vector.h:740

References Vector4< T >::n, Vector4< T >::normalize(), PI, and Zero_Eps.

Referenced by Vector4Angle().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ Vector4Angle() [2/2]

template<typename T >
double Vector4Angle ( Vector4< T > a,
Vector4< T > b,
Vector4< T > c )
inline

Definition at line 928 of file Vector.h.

929{
930 return Vector4Angle(b-a, c-b);
931}
jbxl::Vector4Angle
double Vector4Angle(Vector4< T > a, Vector4< T > b)
Definition Vector.h:914

References Vector4Angle().

Here is the call graph for this function:

◆ Vector4Dist()

template<typename T >
double Vector4Dist ( const Vector4< T > a,
const Vector4< T > b )
inline

Definition at line 865 of file Vector.h.

866{
867 //return (b-a).n;
868 return (b-a).norm();
869}

References Vector4< T >::norm().

Here is the call graph for this function:

◆ VectorAngle() [1/2]

template<typename T >
double VectorAngle ( Vector< T > a,
Vector< T > b )
inline

Definition at line 266 of file Vector.h.

267{
268 a.normalize();
269 b.normalize();
270 if (a.n<Zero_Eps || b.n<Zero_Eps) return 0.0;
271
272 double cs = a*b;
273 if (cs>=1.0) return 0.0;
274 else if (cs<=-1.0) return PI;
275
276 return acos(a*b);
277}

References Vector< T >::n, Vector< T >::normalize(), PI, and Zero_Eps.

Referenced by VectorAngle().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ VectorAngle() [2/2]

template<typename T >
double VectorAngle ( Vector< T > a,
Vector< T > b,
Vector< T > c )
inline

Definition at line 280 of file Vector.h.

281{
282 return VectorAngle(b-a, c-b);
283}
jbxl::VectorAngle
double VectorAngle(Vector< T > a, Vector< T > b)
Definition Vector.h:266

References VectorAngle().

Here is the call graph for this function:

◆ VectorDist()

template<typename T >
double VectorDist ( const Vector< T > a,
const Vector< T > b )
inline

Definition at line 219 of file Vector.h.

220{
221 return (b-a).norm();
222}

References Vector< T >::norm().

Here is the call graph for this function:

◆ VectorInvRotation() [1/2]

template<typename T >
T * VectorInvRotation ( T * v,
Quaternion< T > q )

Definition at line 1251 of file Rotation.h.

1252{
1253 T x, y, z;
1254
1255 x = (q.s*q.s + q.x*q.x - q.y*q.y -q.z*q.z)*v[0] +
1256 ((T)2.0*q.x*q.y + (T)2.0*q.s*q.z)*v[1] +
1257 ((T)2.0*q.x*q.z - (T)2.0*q.s*q.y)*v[2];
1258
1259 y = ((T)2.0*q.x*q.y - (T)2.0*q.s*q.z)*v[0] +
1260 (q.s*q.s - q.x*q.x + q.y*q.y - q.z*q.z)*v[1] +
1261 ((T)2.0*q.y*q.z + (T)2.0*q.s*q.x)*v[2];
1262
1263 z = ((T)2.0*q.x*q.z + (T)2.0*q.s*q.y)*v[0] +
1264 ((T)2.0*q.y*q.z - (T)2.0*q.s*q.x)*v[1] +
1265 (q.s*q.s - q.x*q.x - q.y*q.y + q.z*q.z)*v[2];
1266
1267 v[0] = x;
1268 v[1] = y;
1269 v[2] = z;
1270
1271 return v;
1272}

References Quaternion< T >::s, Quaternion< T >::x, Quaternion< T >::y, and Quaternion< T >::z.

◆ VectorInvRotation() [2/2]

template<typename T >
Vector< T > VectorInvRotation ( Vector< T > v,
Quaternion< T > q )

Definition at line 1207 of file Rotation.h.

1208{
1209 Vector<T> vect;
1210
1211 vect.x = (q.s*q.s + q.x*q.x - q.y*q.y -q.z*q.z)*v.x +
1212 ((T)2.0*q.x*q.y + (T)2.0*q.s*q.z)*v.y +
1213 ((T)2.0*q.x*q.z - (T)2.0*q.s*q.y)*v.z;
1214
1215 vect.y = ((T)2.0*q.x*q.y - (T)2.0*q.s*q.z)*v.x +
1216 (q.s*q.s - q.x*q.x + q.y*q.y - q.z*q.z)*v.y +
1217 ((T)2.0*q.y*q.z + (T)2.0*q.s*q.x)*v.z;
1218
1219 vect.z = ((T)2.0*q.x*q.z + (T)2.0*q.s*q.y)*v.x +
1220 ((T)2.0*q.y*q.z - (T)2.0*q.s*q.x)*v.y +
1221 (q.s*q.s - q.x*q.x - q.y*q.y + q.z*q.z)*v.z;
1222
1223 return vect;
1224}

References Quaternion< T >::s, Quaternion< T >::x, Vector< T >::x, Quaternion< T >::y, Vector< T >::y, Quaternion< T >::z, and Vector< T >::z.

Referenced by AffineTrans< T >::execInvRotation().

Here is the caller graph for this function:

◆ VectorRotation() [1/2]

template<typename T >
T * VectorRotation ( T * v,
Quaternion< T > q )

Definition at line 1227 of file Rotation.h.

1228{
1229 T x, y, z;
1230
1231 x = (q.s*q.s + q.x*q.x - q.y*q.y -q.z*q.z)*v[0] +
1232 ((T)2.0*q.x*q.y - (T)2.0*q.s*q.z)*v[1] +
1233 ((T)2.0*q.x*q.z + (T)2.0*q.s*q.y)*v[2];
1234
1235 y = ((T)2.0*q.x*q.y + (T)2.0*q.s*q.z)*v[0] +
1236 (q.s*q.s - q.x*q.x + q.y*q.y - q.z*q.z)*v[1] +
1237 ((T)2.0*q.y*q.z - (T)2.0*q.s*q.x)*v[2];
1238
1239 z = ((T)2.0*q.x*q.z - (T)2.0*q.s*q.y)*v[0] +
1240 ((T)2.0*q.y*q.z + (T)2.0*q.s*q.x)*v[1] +
1241 (q.s*q.s - q.x*q.x - q.y*q.y + q.z*q.z)*v[2];
1242
1243 v[0] = x;
1244 v[1] = y;
1245 v[2] = z;
1246
1247 return v;
1248}

References Quaternion< T >::s, Quaternion< T >::x, Quaternion< T >::y, and Quaternion< T >::z.

◆ VectorRotation() [2/2]

template<typename T >
Vector< T > VectorRotation ( Vector< T > v,
Quaternion< T > q )

ベクトル回転の高速計算

See also
http://www.euclideanspace.com/maths/algebra/realNormedAlgebra/quaternions/transforms/

Definition at line 1187 of file Rotation.h.

1188{
1189 Vector<T> vect;
1190
1191 vect.x = (q.s*q.s + q.x*q.x - q.y*q.y -q.z*q.z)*v.x +
1192 ((T)2.0*q.x*q.y - (T)2.0*q.s*q.z)*v.y +
1193 ((T)2.0*q.x*q.z + (T)2.0*q.s*q.y)*v.z;
1194
1195 vect.y = ((T)2.0*q.x*q.y + (T)2.0*q.s*q.z)*v.x +
1196 (q.s*q.s - q.x*q.x + q.y*q.y - q.z*q.z)*v.y +
1197 ((T)2.0*q.y*q.z - (T)2.0*q.s*q.x)*v.z;
1198
1199 vect.z = ((T)2.0*q.x*q.z - (T)2.0*q.s*q.y)*v.x +
1200 ((T)2.0*q.y*q.z + (T)2.0*q.s*q.x)*v.y +
1201 (q.s*q.s - q.x*q.x - q.y*q.y + q.z*q.z)*v.z;
1202
1203 return vect;
1204}

References Quaternion< T >::s, Quaternion< T >::x, Vector< T >::x, Quaternion< T >::y, Vector< T >::y, Quaternion< T >::z, and Vector< T >::z.

Referenced by TriPolygonData::execRotate(), ContourBaseData::execRotate(), and AffineTrans< T >::execRotation().

Here is the caller graph for this function:

◆ Vertex2TVector()

DllExport TVector< double > Vertex2TVector ( BREP_VERTEX * v)

Definition at line 1036 of file Brep.cpp.

1037{
1038 TVector<double> tv;
1039
1040 tv.x = v->point.x;
1041 tv.y = v->point.y;
1042 tv.z = v->point.z;
1043 tv.n = sqrt(tv.x*tv.x + tv.y*tv.y + tv.z*tv.z);
1044 tv.t = v->tolerance;
1045
1046 return tv;
1047}

References Vector< T >::n, BREP_VERTEX::point, TVector< T >::t, BREP_VERTEX::tolerance, Vector< T >::x, Vector< T >::y, and Vector< T >::z.

Referenced by CollisionTriContour2D(), CollisionTriContour3D(), BREP_CONTOUR::ComputeDirectRS(), IsAtLine(), IsInTriangle(), and SamePlaneContour().

Here is the caller graph for this function:

◆ vNabla()

template<typename R , typename T >
MSGraph< Vector< R > > vNabla ( MSGraph< T > vp)

template <typename R, typename T> MSGraph<Vector<R> > vNabla(MSGraph<T> vp)

グラフィックデータの ナブラを計算する(Sobel)．

Parameters
vp計算対象となるグラフィックデータ構造体．
Returns
ナブラ．ベクトル型グラフィックデータ．

Definition at line 641 of file Gmt.h.

642{
643 int i;
644 MSGraph<R> px, py, pz;
645 MSGraph<Vector<R> > nv;
646
647 //MSGraph<Vector<R> > nv(vp.xs, vp.ys, vp.zs);
648 nv.xs = vp.xs;
649 nv.ys = vp.ys;
650 nv.zs = vp.zs;
651 nv.zero.set(vp.zero, vp.zero, vp.zero);
652 nv.base.set(vp.base, vp.base, vp.base);
653 nv.RZxy = vp.RZxy;
654 nv.rbound = vp.rbound;
655
656 nv.gp = (Vector<R>*)malloc(sizeof(Vector<R>)*nv.xs*nv.ys*nv.zs);
657 if (nv.isNull()) {
658 DEBUG_MODE PRINT_MESG("vNabla: No More Memory!!\n");
659 nv.state = JBXL_GRAPH_MEMORY_ERROR;
660 return nv;
661 }
662 for (i=0; i<vp.xs*vp.ys*vp.zs; i++) {
663 nv.gp[i] = nv.base;
664 }
665
666 px = xSobel<R>(vp);
667 if (px.gp==NULL) {
668 nv.state = px.state;
669 return nv;
670 }
671
672 py = ySobel<R>(vp);
673 if (py.gp==NULL) {
674 px.free();
675 nv.state = py.state;
676 return nv;
677 }
678
679 pz = zSobel<R>(vp); // 2Dなら 0が入る
680 if (pz.gp==NULL) {
681 px.free();
682 py.free();
683 nv.state = pz.state;
684 return nv;
685 }
686
687 for (i=0; i<vp.xs*vp.ys*vp.zs; i++) {
688 (nv.gp[i])->set_Vector(px.gp[i], py.gp[i], pz.gp[i]);
689 }
690
691 px.free();
692 py.free();
693 pz.free();
694
695 return nv;
696}

References MSGraph< T >::base, DEBUG_MODE, MSGraph< T >::free(), MSGraph< T >::gp, MSGraph< T >::isNull(), JBXL_GRAPH_MEMORY_ERROR, PRINT_MESG, MSGraph< T >::rbound, MSGraph< T >::RZxy, MSGraph< T >::state, MSGraph< T >::xs, MSGraph< T >::ys, MSGraph< T >::zero, and MSGraph< T >::zs.

Here is the call graph for this function:

◆ VPPQuaternion()

template<typename T >
Quaternion< T > VPPQuaternion ( Vector< T > a,
Vector< T > b,
Vector< T > c )

Definition at line 1331 of file Rotation.h.

1332{
1333 Quaternion<T> qut((T)1.0, (T)0.0, (T)0.0, (T)0.0, (T)1.0);
1334
1335 if (a.c<(T)0.0 || b.c<(T)0.0 || c.c<(T)0.0) return qut;
1336
1337 qut = V2VQuaternion<T>(a, c-b);
1338 return qut;
1339}

References Vector< T >::c.

◆ wCircle3D()

template<typename T >
void wCircle3D ( MSGraph< T > vp,
Vector< double > ox,
Vector< double > ex,
double rr,
int cc,
int mode )

Definition at line 167 of file Window.h.

168{
169 double rate = Max(vp.wRateX, vp.wRateY);
170 rate = Max(rate, vp.wRateZ);
171 int r = (int)(rr*rate);
172
173 ox.x = (vp.wZeroX - ox.x)*vp.wRateX;
174 ox.y = (ox.y - vp.wZeroY)*vp.wRateY;
175 ox.z = (vp.wZeroZ - ox.z)*vp.wRateZ;
176
177 ex.x = -ex.x*vp.wRateX;
178 ex.y = ex.y*vp.wRateY;
179 ex.z = -ex.z*vp.wRateZ;
180
181 MSGraph_Circle3D(vp, ox, ex, r, cc, mode);
182}
jbxl::MSGraph::wZeroX
double wZeroX
スクリーン座標系の原点に対するワールド座標系の x成分．
Definition Gdata.h:99
jbxl::MSGraph::wZeroY
double wZeroY
スクリーン座標系の原点に対するワールド座標系の y成分．
Definition Gdata.h:100
jbxl::MSGraph::wRateY
double wRateY
ワールド座標系の y成分1ドットに対するスクリーン座標系のドット数．
Definition Gdata.h:97
jbxl::MSGraph::wZeroZ
double wZeroZ
スクリーン座標系の原点に対するワールド座標系の z成分．
Definition Gdata.h:101
jbxl::MSGraph::wRateZ
double wRateZ
ワールド座標系の z成分1ドットに対するスクリーン座標系のドット数．
Definition Gdata.h:98
jbxl::MSGraph::wRateX
double wRateX
ワールド座標系の x成分1ドットに対するスクリーン座標系のドット数．
Definition Gdata.h:96

References Max, MSGraph_Circle3D(), MSGraph< T >::wRateX, MSGraph< T >::wRateY, MSGraph< T >::wRateZ, MSGraph< T >::wZeroX, MSGraph< T >::wZeroY, MSGraph< T >::wZeroZ, Vector< T >::x, Vector< T >::y, and Vector< T >::z.

Here is the call graph for this function:

◆ wDraw()

template<typename T >
void wDraw ( MSGraph< T > * vp,
double x,
double y,
int cc )

template <typename T> void wDraw(MSGraph<T>* vp, double x, double y, int cc)

ワールド座標系で現地点から指定した地点へ線を引く．指定した地点が現地点となる．

Parameters
vp操作対象のグラフィックデータ．
x線の終点の x座標(ワールド座標系)．
y線の終点の y座標(ワールド座標系)．
cc線の輝度値．

Definition at line 195 of file Window.h.

196{
197 wLine<T>(*vp, vp->wNowX, vp->wNowY, x, y, cc);
198 vp->wMove(x, y);
199}
jbxl::MSGraph::wNowX
double wNowX
ペンの現地点の x成分(ワールド座標系)
Definition Gdata.h:102
jbxl::MSGraph::wNowY
double wNowY
ペンの現地点の y成分(ワールド座標系)
Definition Gdata.h:103
jbxl::MSGraph::wMove
void wMove(double x, double y, double z=0.0)
Definition Gdata.h:154

References MSGraph< T >::wMove(), MSGraph< T >::wNowX, and MSGraph< T >::wNowY.

Here is the call graph for this function:

◆ wDraw3D()

template<typename T >
void wDraw3D ( MSGraph< T > * vp,
double x,
double y,
double z,
int cc )

template <typename T> void wDraw3D(MSGraph<T>* vp, double x, double y, double z, int cc)

3次元のワールド座標系で現地点から指定した地点へ線を引く．指定した地点が現地点となる．

Parameters
vp操作対象のグラフィックデータ．
x線の終点の x座標(ワールド座標系)．
y線の終点の y座標(ワールド座標系)．
z線の終点の z座標(ワールド座標系)．
cc線の輝度値．

Definition at line 213 of file Window.h.

214{
215 wLine3D<T>(*vp, vp->wNowX, vp->wNowY, vp->wNowZ, x, y, z, cc);
216 vp->wMove(x, y, z);
217}
jbxl::MSGraph::wNowZ
double wNowZ
ペンの現地点の z成分(ワールド座標系)
Definition Gdata.h:104

References MSGraph< T >::wMove(), MSGraph< T >::wNowX, MSGraph< T >::wNowY, and MSGraph< T >::wNowZ.

Here is the call graph for this function:

◆ wDraw_rel()

template<typename T >
void wDraw_rel ( MSGraph< T > * vp,
double x,
double y,
int cc )

template <typename T> void wDraw_rel(MSGraph<T>* vp, double x, double y, int cc)

ワールド座標系で現地点を起点として相対的に線を引く．線の終点が現地点となる．

Parameters
vp操作対象のグラフィックデータ．
x現地点から x方向への移動距離(ワールド座標系)．
y現地点から y方向への移動距離(ワールド座標系)．
cc線の輝度値．

Definition at line 230 of file Window.h.

231{
232 double x2 = vp->wNowX + x;
233 double y2 = vp->wNowY + y;
234
235 wLine<T>(*vp, vp->wNowX, vp->wNowY, x2, y2, cc);
236 vp->wMove(x2, y2);
237}

References MSGraph< T >::wMove(), MSGraph< T >::wNowX, and MSGraph< T >::wNowY.

Here is the call graph for this function:

◆ wDraw_rel3D()

template<typename T >
void wDraw_rel3D ( MSGraph< T > * vp,
double x,
double y,
double z,
int cc )

template <typename T> void wDraw_rel3D(MSGraph<T>* vp, double x, double y, double z, int cc)

3次元のワールド座標系で現地点を起点として相対的に線を引く．線の終点が現地点となる．

Parameters
vp操作対象のグラフィックデータ．
x現地点から x方向への移動距離(ワールド座標系)．
y現地点から y方向への移動距離(ワールド座標系)．
z現地点から z方向への移動距離(ワールド座標系)．
cc線の輝度値．

Definition at line 251 of file Window.h.

252{
253 double x2 = vp->wNowX + x;
254 double y2 = vp->wNowY + y;
255 double z2 = vp->wNowZ + z;
256
257 wLine3D<T>(*vp, vp->wNowX, vp->wNowY, vp->wNowZ, x2, y2, z2, cc);
258 vp->wMove(x2, y2, z2);
259}

References MSGraph< T >::wMove(), MSGraph< T >::wNowX, MSGraph< T >::wNowY, and MSGraph< T >::wNowZ.

Here is the call graph for this function:

◆ wGetPixel()

template<typename T >
T wGetPixel ( MSGraph< T > vp,
double x,
double y )

template <typename T> T wGetPixel(MSGraph<T> vp, double x, double y)

ワールド座標系の点のデータを得る．

Parameters
vp操作対象のグラフィックデータ．
x点の x座標(ワールド座標系)．
y点の y座標(ワールド座標系)．

Definition at line 82 of file Window.h.

83{
84 int i = (int)((x - vp.wZeroX)*vp.wRateX);
85 int j = (int)((vp.wZeroY - y)*vp.wRateY);
86
87 if (i>=0 && i<vp.xs && j>=0 && j<vp.ys) return vp.point(i, j);
88 else return vp.zero;
89}

References MSGraph< T >::point(), MSGraph< T >::wRateX, MSGraph< T >::wRateY, MSGraph< T >::wZeroX, MSGraph< T >::wZeroY, MSGraph< T >::ys, and MSGraph< T >::zero.

Here is the call graph for this function:

◆ wGetPixel3D()

template<typename T >
T wGetPixel3D ( MSGraph< T > vp,
double x,
double y,
double z )

template <typename T> T wGetPixel3D(MSGraph<T> vp, double x, double y, double z)

3次元のワールド座標系の点のデータを得る．

Parameters
vp操作対象のグラフィックデータ．
x点の x座標(ワールド座標系)．
y点の y座標(ワールド座標系)．
z点の z座標(ワールド座標系)．

Definition at line 102 of file Window.h.

103{
104 int i = (int)((vp.wZeroX - x)*vp.wRateX);
105 int j = (int)((y - vp.wZeroY)*vp.wRateY);
106 int k = (int)((vp.wZeroZ - z)*vp.wRateZ);
107
108 if (i>=0 && i<vp.xs && j>=0 && j<vp.ys && k>=0 && k<vp.zs) return vp.point(i, j, k);
109 else return vp.zero;
110}

References MSGraph< T >::point(), MSGraph< T >::wRateX, MSGraph< T >::wRateY, MSGraph< T >::wRateZ, MSGraph< T >::wZeroX, MSGraph< T >::wZeroY, MSGraph< T >::wZeroZ, MSGraph< T >::zero, and MSGraph< T >::zs.

Here is the call graph for this function:

◆ wLine()

template<typename T >
void wLine ( MSGraph< T > vp,
double x1,
double y1,
double x2,
double y2,
int cc )

template <typename T> void wLine(MSGraph<T> vp, double x1, double y1, double x2, double y2, int cc)

ワールド座標系に線を引く．

Parameters
vp操作対象のグラフィックデータ．
x1線の始点の x座標(ワールド座標系)．
y1線の始点の y座標(ワールド座標系)．
x2線の終点の x座標(ワールド座標系)．
y2線の終点の y座標(ワールド座標系)．
cc線の輝度値．

Definition at line 125 of file Window.h.

126{
127 int i1, j1, i2, j2;
128
129 i1 = (int)((x1 - vp.wZeroX)*vp.wRateX);
130 i2 = (int)((x2 - vp.wZeroX)*vp.wRateX);
131 j1 = (int)((vp.wZeroY - y1)*vp.wRateY);
132 j2 = (int)((vp.wZeroY - y2)*vp.wRateY);
133
134 MSGraph_Line<T>(vp, i1, j1, i2, j2, cc);
135}

References MSGraph< T >::wRateX, MSGraph< T >::wRateY, MSGraph< T >::wZeroX, and MSGraph< T >::wZeroY.

◆ wLine3D()

template<typename T >
void wLine3D ( MSGraph< T > vp,
double x1,
double y1,
double z1,
double x2,
double y2,
double z2,
int cc )

template <typename T> void wLine3D(MSGraph<T> vp, double x1, double y1, double z1, double x2, double y2, double z2, int cc)

3次元のワールド座標系に線を引く．

Parameters
vp操作対象のグラフィックデータ．
x1線の始点の x座標(ワールド座標系)．
y1線の始点の y座標(ワールド座標系)．
z1線の始点の z座標(ワールド座標系)．
x2線の終点の x座標(ワールド座標系)．
y2線の終点の y座標(ワールド座標系)．
z2線の終点の z座標(ワールド座標系)．
cc線の輝度値．

Definition at line 152 of file Window.h.

153{
154 int i1, j1, k1, i2, j2, k2;
155
156 i1 = (int)((vp.wZeroX - x1)*vp.wRateX);
157 i2 = (int)((vp.wZeroX - x2)*vp.wRateX);
158 j1 = (int)((y1 - vp.wZeroY)*vp.wRateY);
159 j2 = (int)((y2 - vp.wZeroY)*vp.wRateY);
160 k1 = (int)((vp.wZeroZ - z1)*vp.wRateZ);
161 k2 = (int)((vp.wZeroZ - z2)*vp.wRateZ);
162
163 MSGraph_Line3D<T>(vp, i1, j1, k1, i2, j2, k2, cc);
164}

References MSGraph< T >::wRateX, MSGraph< T >::wRateY, MSGraph< T >::wRateZ, MSGraph< T >::wZeroX, MSGraph< T >::wZeroY, and MSGraph< T >::wZeroZ.

◆ writeCmnHeadData()

int writeCmnHeadData ( FILE * fp,
CmnHead * hd,
bool cnt = false )

int jbxl::writeCmnHeadData(File* fp, CmnHead* hd, bool cnt)

共通画像データをファイルとして保存する．

元の共通画像データのヘッダ種別が MOON_DATA または USERSET_DATAの場合は CT(MOON)形式で保存する．
RAS_DATA, JPEG_RGB_DATA, JPEG_MONO_DATA, TIFF_DATAの場合はそれぞれの形式で保存する．(TIFF_DATAは未サポート)
CT_DATA, CT_3DM, CT_3D_VOL 場合はそのまま共通形式(ヘッダ種別はそのまま)で保存する．
カウンタサポートあり．

サポートしているヘッダ種別は
CT_DATA, USERSET_DATA, CT_3DM, CT_3D_VOL, RAS_DATA, MOON_DATA, JPEG_RGB_DATA, JPEG_MONO_DATA

ヘッダに必要な情報は
hd->kind, xsize, ysize, zsize, depth, grptr, (buf)　　　　( )は省略可.

Parameters
fp保存するファイルの識別子．
hd保存するデータを既述した共通ヘッダ．
cnt仮想カウンタを使用するか？
Return values
>0書き込んだサイズ．
JBXL_GRAPH_HEADER_ERRORヘッダエラー
JBXL_GRAPH_MEMORY_ERRORメモリエラー
JBXL_GRAPH_CANCELキャンセル

Definition at line 1666 of file Gio.cpp.

1667{
1668 CTHead chd;
1669 CmnHead cmd;
1670 CVCounter* counter = NULL;
1671 sByte* ptr;
1672 int i, j, k, l;
1673 int csize, psize;
1674 int kind = hd->kind & 0x00ff;
1675
1676 if (kind==UN_KNOWN_DATA) return JBXL_GRAPH_HEADER_ERROR;
1677
1678 // SUN RASTER
1679 if (kind==RAS_DATA) {
1680 //csize = writeRasData(fp, hd, hd->depth);
1681 csize = writeRasData(fp, hd, 8);
1682 return csize;
1683 }
1684
1685#ifdef ENABLE_JPEGLIB
1686 // JPEG
1687 if (kind==JPEG_RGB_DATA || kind==JPEG_MONO_DATA || kind==JPEG_ARGB_DATA || kind==JPEG_RGBA_DATA ||
1688 kind==JPEG16_RGB_DATA || kind==JPEG16_ARGB_DATA || kind==JPEG16_RGBA_DATA) {
1689 JPEGImage jpg = CmnHead2JPEGImage(*hd);
1690 csize = writeJPEGData(fp, &jpg, 100);
1691 jpg.free();
1692 return csize;
1693 }
1694#endif
1695
1696// Not Implement yet
1697#ifdef ENABLE_PGN
1698 // PNG
1699#endif
1700
1701 // TIFF
1702 /*if (kind==TIFF_DATA) {
1703 csize =
1704 return csize;
1705 }*/
1706
1707 // TGA
1708
1709
1711 // CT : ヘッダの準備
1712 if (hd->zsize<=0) hd->zsize = 1;
1713 if (hd->depth<=0) hd->depth = 16;
1714
1715 psize = hd->xsize*hd->ysize*((hd->depth+7)/8);
1716 hd->lsize = psize*hd->zsize;
1717 ptr = (sByte*)malloc(hd->lsize);
1718 if (ptr==NULL) return JBXL_GRAPH_MEMORY_ERROR;
1719 memset(ptr, 0, hd->lsize);
1720
1721 // CTHead chd を作る．
1722 if (kind==CT_DATA || kind==CT_3DM || kind==CT_3D_VOL) {
1723 DEBUG_MODE {
1724 PRINT_MESG("JBXL::writeCmnHeadData: CTデータ\n");
1725 PRINT_MESG("JBXL::writeCmnHeadData: ヘッダバッファ bsize = %d\n", hd->bsize);
1726 PRINT_MESG("JBXL::writeCmnHeadData: データサイズ lsize = %d\n", hd->lsize);
1727 PRINT_MESG("JBXL::writeCmnHeadData: サイズ %dx%dx%d %d\n", hd->xsize, hd->ysize, hd->zsize, hd->depth);
1728 }
1729 memcpy(&chd, hd->buf, hd->bsize);
1730 chd.anydata[2] += TempBase;
1731 hton_st(&chd, 2);
1732
1733 memcpy(ptr, hd->grptr, hd->lsize);
1734 }
1735 else if (kind==MOON_DATA || kind==USERSET_DATA) {
1736 chd.xsize = htons((sWord)hd->xsize);
1737 chd.ysize = htons((sWord)hd->ysize);
1738 chd.ctmin = 0;
1739 chd.ctmax = 0;
1740 chd.cutup = 0;
1741 chd.cutdown = 0;
1742 chd.cutleft = 0;
1743 chd.cutright= 0;
1744
1745 k = l = 0;
1746 if (hd->depth<16){
1747 for (i=0; i<hd->xsize*hd->ysize; i++) {
1748 for (j=0; j<hd->depth/8; j++) ptr[k++] = 0x00;
1749 for (j=hd->depth/8; j<2; j++) ptr[k++] = hd->grptr[l++];
1750 }
1751 }
1752 else if (hd->depth==16) {
1753 for (i=0; i<hd->xsize*hd->ysize; i++) {
1754 for (j=0; j<2; j++) ptr[k++] = hd->grptr[l++];
1755 }
1756 }
1757 else {
1758 for (i=0; i<hd->xsize*hd->ysize; i++) {
1759 for (j=0; j<2; j++) ptr[k++] = hd->grptr[l++];
1760 l += (hd->depth)/8 - 2;
1761 }
1762 }
1763 }
1764 else {
1765 PRINT_MESG("JBXL::writeCmnHeadData: サポートしていないヘッダタイプ %d\n", hd->kind);
1766 free(ptr);
1767 return 0;
1768 }
1769
1771 // データ書き込み
1772 csize = 0;
1773 // 共通ヘッダ書き込み
1774 if (kind==CT_DATA || kind==CT_3DM || kind==CT_3D_VOL) {
1775 // カウンタ
1776 if (hd->zsize>=10 && cnt) {
1777 counter = GetUsableGlobalCounter();
1778 if (counter!=NULL) {
1779 //counter->SetTitle("Commonファイル書き込み中");
1780 counter->SetMax((hd->zsize+1)/10);
1781 counter->SetPos(1);
1782 }
1783 }
1784
1785 cmd = *hd;
1786 cmd.grptr = NULL;
1787 hton_st(&cmd, 4);
1788 csize = sizeof(CmnHead_Entry);
1789 fwrite(&cmd.entry, csize, 1, fp);
1790 }
1791
1792 // CTヘッダ書き込み
1793 fwrite(&chd, sizeof(CTHead), 1, fp);
1794 csize += sizeof(CTHead);
1795
1796 // 本体データ書き込み
1797 hton_ar((sWord*)ptr, hd->lsize);
1798
1799 if (counter==NULL) {
1800 fwrite(ptr, hd->lsize, 1, fp);
1801 csize += hd->lsize;
1802 }
1803 else {
1804 for (i=0; i<hd->zsize; i++) {
1805 fseek(fp, csize, 0);
1806 fwrite(ptr+i*psize, psize, 1, fp);
1807 csize += psize;
1808 if (i%10==0) {
1809 counter->StepIt();
1810 if (counter->isCanceled()) { // キャンセル
1811 free(ptr);
1812 return JBXL_GRAPH_CANCEL;
1813 }
1814 }
1815 }
1816 }
1817
1818 free(ptr);
1819 if (counter!=NULL) counter->PutFill();
1820
1821 return csize;
1822}
sByte
char sByte
1Byte
Definition common.h:333
JPEG16_RGB_DATA
#define JPEG16_RGB_DATA
0x0022 // 書き込み用(16bit->32bit変換)
Definition gheader.h:186
JPEG_ARGB_DATA
#define JPEG_ARGB_DATA
0x0025 // 書き込み用(アルファチャンネルは削除される)
Definition gheader.h:189
JPEG_RGBA_DATA
#define JPEG_RGBA_DATA
0x0026 // 書き込み用(アルファチャンネルは削除される)
Definition gheader.h:190
JPEG16_ARGB_DATA
#define JPEG16_ARGB_DATA
0x0023 // 書き込み用(16bit->32bit変換)
Definition gheader.h:187
JPEG16_RGBA_DATA
#define JPEG16_RGBA_DATA
0x0024 // 書き込み用(16bit->32bit変換)
Definition gheader.h:188
jbxl::TempBase
int TempBase
Definition Gdata.cpp:14
jbxl::writeRasData
int writeRasData(FILE *fp, CmnHead *ch, int obit=8)
write_ras_data() for C
Definition Gio.cpp:121
CTHead::ctmax
sWord ctmax
Definition gheader.h:68
CTHead::anydata
sWord anydata[23]
Definition gheader.h:73
CTHead::ctmin
sWord ctmin
Definition gheader.h:67
hton_ar
#define hton_ar(p, s)
host形式から network形式へ．長さsバイトの配列pに対して変換．
Definition tools.h:428
hton_st
#define hton_st(p, s)
host形式から network形式へ．構造体pに対して sバイトづつ変換．
Definition tools.h:426

References CTHead::anydata, CmnHead::bsize, CmnHead::buf, CT_3D_VOL, CT_3DM, CT_DATA, CTHead::ctmax, CTHead::ctmin, CTHead::cutdown, CTHead::cutleft, CTHead::cutright, CTHead::cutup, DEBUG_MODE, CmnHead::depth, CmnHead::entry, GetUsableGlobalCounter(), CmnHead::grptr, hton_ar, hton_st, CVCounter::isCanceled(), JBXL_GRAPH_CANCEL, JBXL_GRAPH_HEADER_ERROR, JBXL_GRAPH_MEMORY_ERROR, JPEG16_ARGB_DATA, JPEG16_RGB_DATA, JPEG16_RGBA_DATA, JPEG_ARGB_DATA, JPEG_MONO_DATA, JPEG_RGB_DATA, JPEG_RGBA_DATA, CmnHead::kind, CmnHead::lsize, MOON_DATA, PRINT_MESG, CVCounter::PutFill(), RAS_DATA, CVCounter::SetMax(), CVCounter::SetPos(), CVCounter::StepIt(), TempBase, UN_KNOWN_DATA, USERSET_DATA, writeRasData(), CTHead::xsize, CmnHead::xsize, CTHead::ysize, CmnHead::ysize, and CmnHead::zsize.

Referenced by writeCmnHeadFile().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ writeCmnHeadFile()

int writeCmnHeadFile ( const char * fn,
CmnHead * hd,
bool cnt = false )

int jbxl::writeCmnHeadFile(const char* fn, CmnHead* hd, bool cnt)

共通画像データをCTファイルとして保存する．

元の共通画像データのヘッダ種別が MOON_DATA または USERSET_DATAの場合は CT(MOON)形式で保存する．
RAS_DATA, JPEG_RGB_DATA, JPEG_MONO_DATA, TIFF_DATAの場合はそれぞれの形式で保存する．(TIFF_DATAは未サポート)
CT_DATA, CT_3DM, CT_3D_VOL 場合はそのまま共通形式 (ヘッダはそのまま)で保存する．

サポートしているヘッダ種別は
CT_DATA, USERSET_DATA, CT_3DM, CT_3D_VOL, RAS_DATA, MOON_DATA, JPEG_RGB_DATA, JPEG_MONO_DATA, JPEG16_XXX_DATA

ヘッダに必要な情報は hd->kind, xsize, ysize, zsize, depth, grptr, (buf)　　　　( )は省略可.

Parameters
fn保存するファイル名．
hd保存するデータを既述した共通ヘッダ．
cnt仮想カウンタを使用するか？
Return values
>0書き込んだサイズ．
JBXL_GRAPH_IVDARG_ERROR引数不正．
JBXL_GRAPH_MEMORY_ERRORメモリエラー．
JBXL_GRAPH_OPFILE_ERRORファイルオープンエラー．
JBXL_GRAPH_WRFILE_ERROR書き込みファイルサイズ不一致
JBXL_GRAPH_RDFILE_ERROR書き込みファイルの再読み取り不可
JBXL_GRAPH_HEADER_ERROR書き込みファイルのヘッダ異常

Definition at line 1576 of file Gio.cpp.

1577{
1578 CmnHead cmd;
1579 FILE* fp;
1580 int csize, psize;
1581 int kind = hd->kind & 0x0ff;
1582
1583 if (kind==UN_KNOWN_DATA) return JBXL_GRAPH_HEADER_ERROR;
1584 if (hd==NULL || hd->lsize==0) return JBXL_GRAPH_IVDARG_ERROR;
1585
1586 if ((fp=fopen(fn,"wb"))==NULL) {
1587 PRINT_MESG("JBXL::writeCmnHeadFile: ERROR：ファイルオープン失敗\n");
1588 return JBXL_GRAPH_OPFILE_ERROR;
1589 }
1590 DEBUG_MODE PRINT_MESG("JBXL::writeCmnHeadFile: ファイル種別 = %d で書き込み中．%dx%dx%d\n", hd->kind, hd->xsize, hd->ysize, hd->zsize);
1591
1592 // Write File
1593 csize = writeCmnHeadData(fp, hd, cnt);
1594 fclose(fp);
1595 if (csize<0) return (int)csize;
1596
1597 // SUN RASTER
1598 if (kind==RAS_DATA) return csize;
1599
1600 // JPEG
1601 if (kind==JPEG_RGB_DATA || kind==JPEG_MONO_DATA) return csize;
1602 if (kind==JPEG_ARGB_DATA || kind==JPEG_RGBA_DATA) return csize;
1603 if (kind==JPEG16_RGB_DATA || kind==JPEG16_ARGB_DATA || kind==JPEG16_RGBA_DATA) return csize;
1604
1605 // TIFF
1606 //if (kind==TIFF_DATA) return csize;
1607
1608 // 書き込みチェック
1609 int fsz = (int)file_size(fn);
1610 if (kind==MOON_DATA) psize = hd->bsize + hd->lsize;
1611 else psize = sizeof(CmnHead_Entry) + hd->bsize + hd->lsize;
1612
1613 if (fsz!=psize) {
1614 PRINT_MESG("JBXL::writeCmnHeadFile: ERROR：書き込みファイルのサイズが合わない %d != %d\n", psize, fsz);
1615 return JBXL_GRAPH_WRFILE_ERROR;
1616 }
1617 if (kind==MOON_DATA) return psize;
1618
1619 if ((fp=fopen(fn,"rb"))==NULL) {
1620 PRINT_MESG("JBXL::writeCmnHeadFile: ERROR：ファイル検査：再オープン失敗\n");
1621 return JBXL_GRAPH_RDFILE_ERROR;
1622 }
1623
1624 size_t ret = fread((sByte*)&cmd.entry, sizeof(CmnHead_Entry), 1, fp);
1625 fclose(fp);
1626 ntoh_st(&cmd.entry, 4);
1627 if (ret==0) {
1628 PRINT_MESG("JBXL::writeCmnHeadFile: ERROR：ファイルヘッダ検査：ヘッダ異常\n");
1629 return JBXL_FILE_READ_ERROR;
1630 }
1631 if (cmd.xsize!=hd->xsize || cmd.ysize!=hd->ysize || cmd.zsize!=hd->zsize ||
1632 cmd.bsize!=hd->bsize || cmd.lsize!=hd->lsize || cmd.depth!=hd->depth || cmd.kind!=hd->kind) {
1633 PRINT_MESG("JBXL::writeCmnHeadFile: ERROR：ファイルヘッダ検査：ヘッダ異常\n");
1634 return JBXL_GRAPH_HEADER_ERROR;
1635 }
1636
1637 return csize;
1638}
JBXL_GRAPH_RDFILE_ERROR
#define JBXL_GRAPH_RDFILE_ERROR
ファイルの読み込みエラー
Definition jbxl_state.h:174
JBXL_GRAPH_WRFILE_ERROR
#define JBXL_GRAPH_WRFILE_ERROR
ファイルの書き込みエラー
Definition jbxl_state.h:175
jbxl::writeCmnHeadData
int writeCmnHeadData(FILE *fp, CmnHead *hd, bool cnt=false)
Definition Gio.cpp:1666

References CmnHead::bsize, DEBUG_MODE, CmnHead::depth, CmnHead::entry, file_size(), JBXL_FILE_READ_ERROR, JBXL_GRAPH_HEADER_ERROR, JBXL_GRAPH_IVDARG_ERROR, JBXL_GRAPH_OPFILE_ERROR, JBXL_GRAPH_RDFILE_ERROR, JBXL_GRAPH_WRFILE_ERROR, JPEG16_ARGB_DATA, JPEG16_RGB_DATA, JPEG16_RGBA_DATA, JPEG_ARGB_DATA, JPEG_MONO_DATA, JPEG_RGB_DATA, JPEG_RGBA_DATA, CmnHead::kind, CmnHead::lsize, MOON_DATA, ntoh_st, PRINT_MESG, RAS_DATA, UN_KNOWN_DATA, writeCmnHeadData(), CmnHead::xsize, CmnHead::ysize, and CmnHead::zsize.

Referenced by writeGraphicFile().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ writeGraphicFile()

template<typename T >
int writeGraphicFile ( const char * fname,
MSGraph< T > vp,
int kind = 0,
int mlt = FALSE,
int fnum = 0,
int tnum = 0,
bool cnt = false )

template <typename T> int writeGraphicFile(const char *fname, MSGraph<T> vp, int kind=0, int mlt=FALSE, int fnum=0, int tnum=0, bool cnt=false)

グラフィックデータvpをファイルとして書き出す．

kind でファイルの種別を指定可能．ただし kind==0 の場合は

  • vp.zs<=1 なら CT_DATAとして保存される．
  • vp.zs >1 なら CT_3DM として保存される．

サポートするデータ形式
CT_DATA, CT_3DM, MOON_DATA, RAS_DATA, JPEG_RGB_DATA, JPEG_MONO_DATA

RZxy!=1.0 ならヘッダにその情報が埋め込まれる．
fnum, tnum を指定するとグラフィックデータの一部を保存できる．

Parameters
fname保存する際のファイル名．
vp保存するグラフィックデータ．
kindデータ形式 + 属性ビット
mlt3Dデータとして保存しない
fnum保存するデータの始まりの Z座標．デフォルトは 0
tnum保存するデータの終わりの Z座標．デフォルトは vp.zs-1
cntカウンタ（プログレスバー）を表示するか？
Return values
1以上正常終了．
JBXL_GRAPH_OPFILE_ERRORファイルオープンエラー．
JBXL_GRAPH_MEMORY_ERRORメモリエラー．
JBXL_GRAPH_WRFILE_ERROR書き込みファイルサイズ不一致
JBXL_GRAPH_RDFILE_ERROR書き込みファイルの再読み取り不可
JBXL_GRAPH_HEADER_ERROR書き込みファイルのヘッダ異常
JBXL_GRAPH_CANCELキャンセル

Definition at line 455 of file Gio.h.

456{
457 int ret;
458 CmnHead hd;
459 CTHead* chd;
460
461 if (fnum<0) fnum = 0;
462 else if (fnum>vp.zs-1) fnum = vp.zs - 1;
463 if (tnum<fnum) tnum = fnum;
464 else if (tnum>vp.zs-1) tnum = vp.zs - 1;
465
466 // for JPEG
467 if ((kind&0x00ff)==JPEG_RGB_DATA) {
468 if (vp.color==GRAPH_COLOR_ARGB) kind = (kind&0xff00) + JPEG_ARGB_DATA;
469 else if (vp.color==GRAPH_COLOR_RGBA) kind = (kind&0xff00) + JPEG_RGBA_DATA;
470
471 if (vp.color==GRAPH_COLOR_RGB16) kind = (kind&0xff00) + JPEG16_RGB_DATA;
472 else if (vp.color==GRAPH_COLOR_ARGB16) kind = (kind&0xff00) + JPEG16_ARGB_DATA;
473 else if (vp.color==GRAPH_COLOR_RGBA16) kind = (kind&0xff00) + JPEG16_RGBA_DATA;
474 }
475
476 //
477 hd.xsize = vp.xs;
478 hd.ysize = vp.ys;
479 hd.zsize = tnum - fnum + 1; //vp.zs;
480 hd.depth = sizeof(T)*8;
481 hd.grptr = (uByte*)(vp.gp + vp.xs*vp.ys*fnum);
482 if (kind==0) {
483 hd.kind = CT_3DM;
484 if (hd.zsize==1) hd.kind = CT_DATA;
485 }
486 else hd.kind = kind;
487
488 hd.lsize = hd.zsize*hd.ysize*hd.zsize*2;
489 hd.bsize = sizeof(CTHead);
490 hd.buf = (uByte*)malloc(hd.bsize);
491 if (hd.buf==NULL) return JBXL_GRAPH_OPFILE_ERROR;
492 memset(hd.buf, 0, hd.bsize);
493
494 chd = (CTHead*)hd.buf;
495 chd->xsize = (sWord)vp.xs;
496 chd->ysize = (sWord)vp.ys;
497 chd->ctmin = (sWord)vp.rbound.zmin;
498 chd->ctmax = (sWord)vp.rbound.zmax;
499 chd->cutup = (sWord)vp.rbound.ymin;
500 chd->cutdown = (sWord)vp.rbound.ymax;
501 chd->cutleft = (sWord)vp.rbound.xmin;
502 chd->cutright = (sWord)vp.rbound.xmax;
503 hd.kind |= HAS_RBOUND;
504
505 if (vp.RZxy!=1.0) {
506 chd->anydata[0] = (sWord)(vp.RZxy*RZXY_RATE);
507 chd->anydata[1] = (sWord)RZXY_RATE;
508 hd.kind |= HAS_RZXY;
509 }
510
511 if (vp.base!=0) {
512 chd->anydata[2] = (sWord)vp.base + TempBase;
513 hd.kind |= HAS_BASE;
514 }
515
516 // 通常の保存
517 if (!mlt) {
518 ret = writeCmnHeadFile(fname, &hd, cnt);
519 }
520
521 // マルチスライス
522 else {
523 // カウンタ
524 CVCounter* counter = NULL;
525 if (hd.zsize>=10 && cnt) {
526 counter = GetUsableGlobalCounter();
527 if (counter!=NULL) {
528 counter->SetMax((hd.zsize+1)/10);
529 counter->SetPos(1);
530 }
531 }
532
533 char filename[LNAME];
534 int num = hd.zsize;
535 int cnt = fnum;
536 hd.zsize = 1;
537
538 for (int i=0; i<num; i++) {
539 snprintf(filename, LNAME-2, fname, cnt);
540 hd.grptr = (uByte*)(vp.gp + vp.xs*vp.ys*cnt);
541 ret = writeCmnHeadFile(filename, &hd, false);
542
543 if (counter!=NULL && i%10==0) {
544 counter->StepIt();
545 if (counter->isCanceled()) { // キャンセル
546 if (hd.buf!=NULL) free(hd.buf);
547 return JBXL_GRAPH_CANCEL;
548 }
549 }
550 if (ret<0) break;
551 cnt++;
552 }
553 if (counter!=NULL) counter->PutFill();
554 }
555
556 if (hd.buf!=NULL) free(hd.buf);
557
558 return ret;
559}
snprintf
#define snprintf
Definition common.h:56
GRAPH_COLOR_ARGB16
#define GRAPH_COLOR_ARGB16
Definition gheader.h:257
GRAPH_COLOR_RGBA16
#define GRAPH_COLOR_RGBA16
Definition gheader.h:254
jbxl::writeCmnHeadFile
int writeCmnHeadFile(const char *fn, CmnHead *hd, bool cnt=false)
Definition Gio.cpp:1576

References CTHead::anydata, MSGraph< T >::base, CmnHead::bsize, CmnHead::buf, MSGraph< T >::color, CT_3DM, CT_DATA, CTHead::ctmax, CTHead::ctmin, CTHead::cutdown, CTHead::cutleft, CTHead::cutright, CTHead::cutup, CmnHead::depth, GetUsableGlobalCounter(), MSGraph< T >::gp, GRAPH_COLOR_ARGB, GRAPH_COLOR_ARGB16, GRAPH_COLOR_RGB16, GRAPH_COLOR_RGBA, GRAPH_COLOR_RGBA16, CmnHead::grptr, HAS_BASE, HAS_RBOUND, HAS_RZXY, CVCounter::isCanceled(), JBXL_GRAPH_CANCEL, JBXL_GRAPH_OPFILE_ERROR, JPEG16_ARGB_DATA, JPEG16_RGB_DATA, JPEG16_RGBA_DATA, JPEG_ARGB_DATA, JPEG_RGB_DATA, JPEG_RGBA_DATA, CmnHead::kind, LNAME, CmnHead::lsize, CVCounter::PutFill(), MSGraph< T >::rbound, MSGraph< T >::RZxy, RZXY_RATE, CVCounter::SetMax(), CVCounter::SetPos(), snprintf, CVCounter::StepIt(), TempBase, writeCmnHeadFile(), RBound< T >::xmax, RBound< T >::xmin, MSGraph< T >::xs, CTHead::xsize, CmnHead::xsize, RBound< T >::ymax, RBound< T >::ymin, MSGraph< T >::ys, CTHead::ysize, CmnHead::ysize, RBound< T >::zmax, RBound< T >::zmin, MSGraph< T >::zs, and CmnHead::zsize.

Here is the call graph for this function:

◆ writeRasData()

int writeRasData ( FILE * fp,
CmnHead * hd,
int obit = 8 )

int jbxl::writeRasData(FILE* fp, CmnHead* hd, int obit)

色々な画像データをSUN RASTER型式でファイルに保存する．

Parameters
fp保存するファイルポインタ．
hd保存するデータを既述した共通ヘッダ．
obitSUN RASTERの 1ピクセルのビット数(8, 24をサポート)．
Return values
>0書き込んだバイト数．
JBXL_GRAPH_MEMORY_ERRORメモリエラー．

Definition at line 121 of file Gio.cpp.

122{
123 RasHead shd;
124 int i, j, k, l, linebyte, databyte, depth, lsize;
125 uByte null=0x00, *ptr, *buf;
126
127 obit = Xabs(obit);
128 if (hd->kind == RAS_DATA) {
129 unsigned int u;
130 memcpy((sByte*)&shd, hd->buf, hd->bsize);
131 ptr = (uByte*)malloc(hd->lsize);
132 if (ptr==NULL) return JBXL_GRAPH_MEMORY_ERROR;
133 for (u=0; u<hd->lsize; u++) ptr[u] = hd->grptr[u];
134 lsize = hd->lsize;
135 }
136 else { // CT -> RAS
137 if (hd->depth==16) {
138
139 if (obit==8) depth = 8;
140 else depth = 24;
141
142 lsize = hd->xsize*hd->ysize*depth/8;
143 buf = (uByte*)malloc(lsize);
144 if (buf==NULL) return JBXL_GRAPH_MEMORY_ERROR;
145 memset(buf, 0, lsize);
146
147 if (obit==8) {
148 int max = 255; // 8bit mode での最大値
149 uWord* wp = (uWord*)hd->grptr;
150 for (i=0; i<hd->xsize*hd->ysize; i++) {
151 max = Max(max, wp[i]);
152 }
153 for (i=0; i<hd->ysize*hd->xsize; i++) {
154 buf[i] = 255*wp[i]/max;
155 }
156 }
157 else {
158 k = l = 0;
159 for (i=0; i<hd->ysize*hd->xsize; i++) {
160 buf[k++] = hd->grptr[l++];
161 buf[k++] = hd->grptr[l++];
162 buf[k++] = null;
163 }
164 }
165 }
166 else {
167 depth = hd->depth;
168 lsize = hd->lsize;
169 buf = (uByte*)hd->grptr;
170 }
171
172 databyte = hd->xsize*depth/8;
173 linebyte = lsize/hd->ysize;
174 if (linebyte%2==1) {
175 linebyte++;
176 lsize = linebyte*hd->ysize;
177 }
178
179 shd.ras_magic = RAS_MAGIC;
180 shd.ras_width = hd->xsize;
181 shd.ras_height = hd->ysize;
182 shd.ras_depth = depth;
183 shd.ras_length = lsize;
184 shd.ras_type = RT_STANDARD;
185 shd.ras_maptype = RMT_NONE;
186 shd.ras_maplength= 0;
187
188 ptr = (uByte*)malloc(lsize);
189 if (ptr==NULL) {
190 if (hd->depth==16) free(buf);
191 return -2;
192 }
193 memset(ptr, 0, lsize);
194
195 k = l = 0;
196 for (i=0 ; i<hd->ysize; i++) {
197 for (j=0; j<databyte; j++) ptr[k++] = buf[l++];
198 for (j=0; j<linebyte-databyte; j++) ptr[k++] = null;
199 }
200
201 if (hd->depth==16) free(buf);
202 }
203
204 hton_st(&shd, 4);
205 fwrite(&shd, sizeof(RasHead), 1, fp);
206 fwrite(ptr, lsize, 1, fp);
207
208 free(ptr);
209 return sizeof(RasHead)+lsize;
210}
RT_STANDARD
#define RT_STANDARD
Definition gheader.h:97
RMT_NONE
#define RMT_NONE
Definition gheader.h:100
RasHead::ras_maptype
int ras_maptype
Definition gheader.h:89
RasHead::ras_magic
int ras_magic
Definition gheader.h:83
RasHead::ras_type
int ras_type
Definition gheader.h:88

References CmnHead::bsize, CmnHead::buf, CmnHead::depth, CmnHead::grptr, hton_st, JBXL_GRAPH_MEMORY_ERROR, CmnHead::kind, CmnHead::lsize, Max, RAS_DATA, RasHead::ras_depth, RasHead::ras_height, RasHead::ras_length, RasHead::ras_magic, RAS_MAGIC, RasHead::ras_maplength, RasHead::ras_maptype, RasHead::ras_type, RasHead::ras_width, RMT_NONE, RT_STANDARD, Xabs, CmnHead::xsize, and CmnHead::ysize.

Referenced by writeCmnHeadData(), and writeRasFile().

Here is the caller graph for this function:

◆ writeRasFile()

template<typename T >
int writeRasFile ( const char * fname,
MSGraph< T > vp )

template <typename T> int writeRasFile(const char *fname, MSGraph<T> vp)

Definition at line 565 of file Gio.h.

566{
567 if (fname==NULL) return JBXL_GRAPH_IVDARG_ERROR;
568
569 FILE* fp = fopen(fname, "wb");
570 if (fp==NULL) return JBXL_GRAPH_OPFILE_ERROR;
571
572 CmnHead hd = copyMSGraph2CmnHead(vp);
573 writeRasData(fp, &hd);
574
575 fclose(fp);
576 return JBXL_NORMAL;
577}
JBXL_NORMAL
#define JBXL_NORMAL
正常
Definition jbxl_state.h:32

References copyMSGraph2CmnHead(), JBXL_GRAPH_IVDARG_ERROR, JBXL_GRAPH_OPFILE_ERROR, JBXL_NORMAL, and writeRasData().

Here is the call graph for this function:

◆ writeSTLFile() [1/2]

DllExport int writeSTLFile ( char * fname,
BREP_SOLID * solid,
bool ascii = false )

int jbxl::writeSTLFile (char* fname, BREP_SOLID* solid, bool ascii)

STLファイルを書き込むラッパー関数．

アスキー，バイナリを指定する．デフォルトはバイナリ(ascii==false)． 書き込んだファセットの数を返す．

Definition at line 74 of file STL.cpp.

75{
76 int nn;
77
78 if (ascii) nn = writeSTLFileA(fname, solid);
79 else nn = writeSTLFileB(fname, solid);
80
81 if (nn<0) DEBUG_MODE PRINT_MESG("writeSTLFile: ファイルオープンエラー．\n");
82 return nn;
83}
jbxl::writeSTLFileA
DllExport int writeSTLFileA(char *fname, BREP_SOLID *solid)
Definition STL.cpp:233
jbxl::writeSTLFileB
DllExport int writeSTLFileB(char *fname, BREP_SOLID *solid)
Definition STL.cpp:273

References DEBUG_MODE, PRINT_MESG, writeSTLFileA(), and writeSTLFileB().

Here is the call graph for this function:

◆ writeSTLFile() [2/2]

DllExport int writeSTLFile ( char * fname,
BREP_SOLID_LIST solid_list,
bool ascii = false )

DllExport int jbxl::writeSTLFile (char* fname, BREP_SOLID_LIST solid_list, bool ascii)

STLファイルを書き込むラッパー関数．

アスキー，バイナリを指定する．デフォルトはバイナリ(ascii==false)． 書き込んだファセットの数を返す．

Definition at line 94 of file STL.cpp.

95{
96 int nn;
97
98 if (ascii) nn = writeSTLFileA(fname, solid_list);
99 else nn = writeSTLFileB(fname, solid_list);
100
101 if (nn<0) DEBUG_MODE PRINT_MESG("writeSTLFile: ファイルオープンエラー．\n");
102 return nn;
103}

References DEBUG_MODE, PRINT_MESG, writeSTLFileA(), and writeSTLFileB().

Here is the call graph for this function:

◆ writeSTLFileA() [1/2]

DllExport int writeSTLFileA ( char * fname,
BREP_SOLID * solid )

int jbxl::writeSTLFileA(char* fname, BREP_SOLID* solid)

BREP_SOLID のデータをアスキー形式の STLファイルとして書き込む

Definition at line 233 of file STL.cpp.

234{
235 FILE* fp;
236 int nn = 0;
237
238 fp = fopen(fname, "w");
239 if (fp==NULL) {
240 PRINT_MESG("JBXL::writeSTLFileA: ERROR: Solid file open Error! (%s)\n", fname);
241 return -1;
242 }
243
244 fprintf(fp, "solid %s\n", fname);
245
246 BREP_CONTOUR_LIST::iterator icon;
247 for (icon=solid->contours.begin(); icon!=solid->contours.end(); icon++){
248 fprintf(fp, "facet normal %g %g %g\n", (*icon)->normal.x, (*icon)->normal.y, (*icon)->normal.z);
249 fprintf(fp, " outer loop\n");
250
251 BREP_WING* wing = (*icon)->wing;
252 for (int i=0; i<3; i++) {
253 Vector<double> vect = wing->vertex->point;
254 fprintf(fp, " vertex %g %g %g\n", vect.x, vect.y, vect.z);
255 wing = wing->next;
256 }
257 fprintf(fp," endloop\n");
258 fprintf(fp,"endfacet\n");
259 nn++;
260 }
261 fprintf(fp, "endsolid %s\n", fname);
262 fclose(fp);
263
264 return nn;
265}

References BREP_SOLID::contours, BREP_WING::next, BREP_VERTEX::point, PRINT_MESG, BREP_WING::vertex, Vector< T >::x, Vector< T >::y, and Vector< T >::z.

Referenced by BrepSolidList::outputFile(), writeSTLFile(), and writeSTLFile().

Here is the caller graph for this function:

◆ writeSTLFileA() [2/2]

DllExport int writeSTLFileA ( char * fname,
BREP_SOLID_LIST solid_list )

DllExport int jbxl::writeSTLFileA(char* fname, BREP_SOLID_LIST solid_list)

BREP_SOLID のデータをアスキー形式の STLファイルとして書き込む

Definition at line 317 of file STL.cpp.

318{
319 FILE* fp;
320 int nn = 0;
321
322 fp = fopen(fname, "wa");
323 if (fp==NULL) {
324 PRINT_MESG("JBXL::writeSTLFileA: ERROR: Solid list file open Error! (%s)\n", fname);
325 return -1;
326 }
327
328 fprintf(fp, "solid %s\n", fname);
329
330 BREP_SOLID_LIST::iterator isolid;
331 for (isolid=solid_list.begin(); isolid!=solid_list.end(); isolid++){
332 //
333 BREP_CONTOUR_LIST::iterator icon;
334 for (icon=(*isolid)->contours.begin(); icon!=(*isolid)->contours.end(); icon++){
335 fprintf(fp, "facet normal %g %g %g\n", (*icon)->normal.x, (*icon)->normal.y, (*icon)->normal.z);
336 fprintf(fp, " outer loop\n");
337
338 BREP_WING* wing = (*icon)->wing;
339 for (int i=0; i<3; i++) {
340 Vector<double> vect = wing->vertex->point;
341 fprintf(fp, " vertex %g %g %g\n", vect.x, vect.y, vect.z);
342 wing = wing->next;
343 }
344 fprintf(fp," endloop\n");
345 fprintf(fp,"endfacet\n");
346 nn++;
347 }
348 }
349 fprintf(fp, "endsolid %s\n", fname);
350 fclose(fp);
351
352 return nn;
353}

References BREP_WING::next, BREP_VERTEX::point, PRINT_MESG, BREP_WING::vertex, Vector< T >::x, Vector< T >::y, and Vector< T >::z.

◆ writeSTLFileB() [1/2]

DllExport int writeSTLFileB ( char * fname,
BREP_SOLID * solid )

int jbxl::writeSTLFileB(char* fname, BREP_SOLID* solid)

BREP_SOLID のデータをバイナリ形式の STLファイルとして書き込む

Definition at line 273 of file STL.cpp.

274{
275 FILE* fp;
276 int fno;
277 char message[80]="STL Binary Data Program by Fumi.Iseki";
278 STLData stldata;
279
280 fp = fopen(fname, "wb");
281 if (fp==NULL) {
282 PRINT_MESG("JBXL::writeSTLFileB: ERROR: Solid file open Error! (%s)\n", fname);
283 return -1;
284 }
285
286 fno = (int)solid->contours.size();
287 fwrite(message, 80, 1, fp);
288 fwrite(&fno, 4, 1, fp);
289
290 BREP_CONTOUR_LIST::iterator icon;
291 for (icon=solid->contours.begin(); icon!=solid->contours.end(); icon++){
292 stldata.vect[0] = (float)(*icon)->normal.x;
293 stldata.vect[1] = (float)(*icon)->normal.y;
294 stldata.vect[2] = (float)(*icon)->normal.z;
295
296 BREP_WING* wing = (*icon)->wing;
297 for (int i=0; i<3; i++) {
298 Vector<double> vect = wing->vertex->point;
299 stldata.vect[3*i+3] = (float)vect.x;
300 stldata.vect[3*i+4] = (float)vect.y;
301 stldata.vect[3*i+5] = (float)vect.z;
302 wing = wing->next;
303 }
304 fwrite(&stldata, 50, 1, fp);
305 }
306 fclose(fp);
307
308 return fno;
309}

References BREP_SOLID::contours, BREP_WING::next, BREP_VERTEX::point, PRINT_MESG, STLData::vect, BREP_WING::vertex, Vector< T >::x, Vector< T >::y, and Vector< T >::z.

Referenced by BrepSolidList::outputFile(), writeSTLFile(), and writeSTLFile().

Here is the caller graph for this function:

◆ writeSTLFileB() [2/2]

DllExport int writeSTLFileB ( char * fname,
BREP_SOLID_LIST solid_list )

DllExport int jbxl::writeSTLFileB(char* fname, BREP_SOLID_LIST solidi_list)

BREP_SOLID のデータをバイナリ形式の STLファイルとして書き込む

Definition at line 361 of file STL.cpp.

362{
363 FILE* fp;
364 int fno = 0;
365 char message[80]="STL Binary Data Program by Fumi.Iseki";
366 STLData stldata;
367
368 fp = fopen(fname, "wb");
369 if (fp==NULL) {
370 PRINT_MESG("JBXL::writeSTLFileB: ERROR: Solid list file open Error! (%s)\n", fname);
371 return -1;
372 }
373
374 BREP_SOLID_LIST::iterator isolid;
375 for (isolid=solid_list.begin(); isolid!=solid_list.end(); isolid++){
376 fno += (int)((*isolid)->contours.size());
377 }
378 fwrite(message, 80, 1, fp);
379 fwrite(&fno, 4, 1, fp);
380
381 //
382 for (isolid=solid_list.begin(); isolid!=solid_list.end(); isolid++){
383 //
384 BREP_CONTOUR_LIST::iterator icon;
385 for (icon=(*isolid)->contours.begin(); icon!=(*isolid)->contours.end(); icon++){
386 stldata.vect[0] = (float)(*icon)->normal.x;
387 stldata.vect[1] = (float)(*icon)->normal.y;
388 stldata.vect[2] = (float)(*icon)->normal.z;
389
390 BREP_WING* wing = (*icon)->wing;
391 for (int i=0; i<3; i++) {
392 Vector<double> vect = wing->vertex->point;
393 stldata.vect[3*i+3] = (float)vect.x;
394 stldata.vect[3*i+4] = (float)vect.y;
395 stldata.vect[3*i+5] = (float)vect.z;
396 wing = wing->next;
397 }
398 fwrite(&stldata, 50, 1, fp);
399 }
400 }
401 fclose(fp);
402
403 return fno;
404}

References BREP_WING::next, BREP_VERTEX::point, PRINT_MESG, STLData::vect, BREP_WING::vertex, Vector< T >::x, Vector< T >::y, and Vector< T >::z.

◆ writeTGAData()

int writeTGAData ( FILE * fp,
TGAImage * tga )

int jbxl::writeTGAData(FILE* fp, TGAImage* tga)

tga の画像データを fpに書き出す．

Parameters
fpファイル記述子
tga保存する TGAデータ
Return values
0正常終了
JBXL_GRAPH_OPFILE_ERRORファイルオープンエラー
JBXL_GRAPH_HEADER_ERROR不正ファイル（TGAファイルでない？）
JBXL_GRAPH_MEMORY_ERRORメモリエラー
JBXL_GRAPH_NODATA_ERRORtga にデータが無い
JBXL_GRAPH_IVDCOLOR_ERRORサポート外のチャンネル数
JBXL_GRAPH_IVDFMT_ERRORサポート外のデータ形式

Definition at line 365 of file TgaTool.cpp.

366{
367 if (fp==NULL) return JBXL_GRAPH_OPFILE_ERROR;
368 if (tga->col<=0 || tga->col>4) return JBXL_GRAPH_IVDCOLOR_ERROR;
369 if (tga->gp==NULL) return JBXL_GRAPH_NODATA_ERROR;
370
371 fwrite(tga->hd, TGA_HEADER_SIZE, 1, fp);
372 fwrite(tga->gp, tga->length, 1, fp);
373 fwrite(tga->ft, TGA_FOOTER_SIZE, 1, fp);
374
375 return 0;
376}

References TGAImage::col, TGAImage::ft, TGAImage::gp, TGAImage::hd, JBXL_GRAPH_IVDCOLOR_ERROR, JBXL_GRAPH_NODATA_ERROR, JBXL_GRAPH_OPFILE_ERROR, TGAImage::length, TGA_FOOTER_SIZE, and TGA_HEADER_SIZE.

Referenced by writeTGAFile().

Here is the caller graph for this function:

◆ writeTGAFile()

int writeTGAFile ( const char * fname,
TGAImage * tga )

int jbxl::writeTGAFile(const char* fname, TGAImage* tga)

tga の画像データを fnameに書き出す．

Parameters
fnameファイル名
tga保存する TGAデータ
Return values
0正常終了
JBXL_GRAPH_OPFILE_ERRORファイルオープンエラー
JBXL_GRAPH_HEADER_ERROR不正ファイル（TGAファイルでない？）
JBXL_GRAPH_MEMORY_ERRORメモリエラー
JBXL_GRAPH_NODATA_ERRORtga にデータが無い
JBXL_GRAPH_IVDARG_ERRORファイル名が NULL
JBXL_GRAPH_IVDCOLOR_ERRORサポート外のチャンネル数

Definition at line 328 of file TgaTool.cpp.

329{
330 FILE* fp;
331 int ret;
332
333 if (fname==NULL) return JBXL_GRAPH_IVDARG_ERROR;
334 if (tga->col<=0 || tga->col>4) return JBXL_GRAPH_IVDCOLOR_ERROR;
335 if (tga->gp==NULL) return JBXL_GRAPH_NODATA_ERROR;
336
337 fp = fopen(fname, "wb");
338 if (fp==NULL) {
339 return JBXL_GRAPH_OPFILE_ERROR;
340 }
341
342 ret = writeTGAData(fp, tga);
343 fclose(fp);
344
345 return ret;
346}
jbxl::writeTGAData
int writeTGAData(FILE *fp, TGAImage *tga)
Definition TgaTool.cpp:365

References TGAImage::col, TGAImage::gp, JBXL_GRAPH_IVDARG_ERROR, JBXL_GRAPH_IVDCOLOR_ERROR, JBXL_GRAPH_NODATA_ERROR, JBXL_GRAPH_OPFILE_ERROR, and writeTGAData().

Here is the call graph for this function:

◆ wSetPixel()

template<typename T >
void wSetPixel ( MSGraph< T > vp,
double x,
double y,
int cc )

template <typename T> void wSetPixel(MSGraph<T> vp, double x, double y, int cc)

ワールド座標系に点を打つ．

Parameters
vp操作対象のグラフィックデータ．
x点の x座標(ワールド座標系)．
y点の y座標(ワールド座標系)．
cc点の輝度値．

Definition at line 43 of file Window.h.

44{
45 int i = (int)((x - vp.wZeroX)*vp.wRateX);
46 int j = (int)((vp.wZeroY - y)*vp.wRateY);
47
48 if (i>=0 && i<vp.xs && j>=0 && j<vp.ys) vp.point(i, j) = (T)cc;
49}

References MSGraph< T >::point(), MSGraph< T >::wRateX, MSGraph< T >::wRateY, MSGraph< T >::wZeroX, MSGraph< T >::wZeroY, and MSGraph< T >::ys.

Here is the call graph for this function:

◆ wSetPixel3D()

template<typename T >
void wSetPixel3D ( MSGraph< T > vp,
double x,
double y,
double z,
int cc )

template <typename T> void wSetPixel3D(MSGraph<T> vp, double x, double y, double z, int cc)

3次元のワールド座標系に点を打つ．

Parameters
vp操作対象のグラフィックデータ．
x点の x座標(ワールド座標系)．
y点の y座標(ワールド座標系)．
z点の z座標(ワールド座標系)．
cc点の輝度値．

Definition at line 63 of file Window.h.

64{
65 int i = (int)((vp.wZeroX - x)*vp.wRateX);
66 int j = (int)((y - vp.wZeroY)*vp.wRateY);
67 int k = (int)((vp.wZeroZ - z)*vp.wRateZ);
68
69 if (i>=0 && i<vp.xs && j>=0 && j<vp.ys && k>=0 && k<vp.zs) vp.point(i, j, k) = (T)cc;
70}

References MSGraph< T >::point(), MSGraph< T >::wRateX, MSGraph< T >::wRateY, MSGraph< T >::wRateZ, MSGraph< T >::wZeroX, MSGraph< T >::wZeroY, MSGraph< T >::wZeroZ, and MSGraph< T >::zs.

Here is the call graph for this function:

◆ x_reverse_MSGraph()

template<typename T >
MSGraph< T > x_reverse_MSGraph ( MSGraph< T > vp,
bool ecnt = false )

template <typename T> MSGraph<T> x_reverse_MSGraph(MSGraph<T> vp, bool ecnt=false)

グラフィックデータの x軸を反転させる．

Parameters
vp操作対象となるグラフィックデータ構造体．
ecnt仮想カウンタを使用するか?
Returns
反転したグラフィックデータ．

Definition at line 1978 of file Graph.h.

1979{
1980 int i, j, k, cy, cz;
1981 MSGraph<T> wp;
1982 CVCounter* counter = NULL;
1983
1984 wp.init();
1985
1986 if (ecnt) counter = GetUsableGlobalCounter();
1987 if (counter!=NULL) {
1988 if (counter->isCanceled()) {
1989 wp.state = JBXL_GRAPH_CANCEL;
1990 return wp;
1991 }
1992 counter->SetMax(vp.zs);
1993 }
1994
1995 wp.set(vp.xs, vp.ys, vp.zs, vp.zero, vp.base, vp.RZxy);
1996 if (wp.isNull()) return wp;
1997 wp.color = vp.color;
1998
1999 for (k=0; k<vp.zs; k++) {
2000 cz = k*vp.xs*vp.ys;
2001 for (j=0; j<vp.ys; j++) {
2002 cy = cz + j*vp.xs;
2003 for (i=0; i<vp.xs; i++) {
2004 wp.gp[cy + i] = vp.gp[cy + vp.xs - 1 - i];
2005 }
2006 }
2007
2008 // Counter
2009 if (counter!=NULL) {
2010 counter->StepIt();
2011 if (counter->isCanceled()) {
2012 wp.state = JBXL_GRAPH_CANCEL;
2013 return wp;
2014 }
2015 }
2016 }
2017 return wp;
2018}

References MSGraph< T >::base, MSGraph< T >::color, GetUsableGlobalCounter(), MSGraph< T >::gp, MSGraph< T >::init(), CVCounter::isCanceled(), MSGraph< T >::isNull(), JBXL_GRAPH_CANCEL, MSGraph< T >::RZxy, MSGraph< T >::set(), CVCounter::SetMax(), MSGraph< T >::state, CVCounter::StepIt(), MSGraph< T >::xs, MSGraph< T >::ys, MSGraph< T >::zero, and MSGraph< T >::zs.

Here is the call graph for this function:

◆ xSobel()

template<typename R , typename T >
MSGraph< R > xSobel ( MSGraph< T > vp)

template <typename R, typename T> MSGraph<R> xSobel(MSGraph<T> vp)

グラフィックデータの X方向微分(Sobel)を計算する．

Parameters
vp計算対象となるグラフィックデータ構造体．
Returns
処理されたグラフィックデータ．

Definition at line 154 of file Gmt.h.

155{
156 int i, j, k;
157 int pl, nx, ny, nz;
158 R da, db, dc, dd, de, nr;
159 MSGraph<R> xp;
160
161 xp.mimicry(vp);
162 xp.base = xp.zero = 0;
163
164 if (xp.isNull()) {
165 DEBUG_MODE PRINT_MESG("XSOBEL: No More Memory!!!\n");
166 xp.state = JBXL_GRAPH_MEMORY_ERROR;
167 return xp;
168 }
169
170 // カウンタ
171 CVCounter* vcounter = NULL;
172 if (vp.zs>2) vcounter = GetUsableGlobalCounter();
173 if (vcounter!=NULL) vcounter->SetMax(vp.zs);
174
175 pl = vp.xs*vp.ys;
176 for (k=0; k<vp.zs; k++) {
177 nz = k*pl;
178 for (j=1; j<vp.ys-1; j++) {
179 ny = nz + j*vp.xs;
180 for (i=1; i<vp.xs-1; i++) {
181 nx = ny + i;
182 da = vp.gp[nx+1-vp.xs] - vp.gp[nx-1-vp.xs]; // 1/4 * (da+dc)
183 db = vp.gp[nx+1] - vp.gp[nx-1]; // 1/2 * db
184 dc = vp.gp[nx+1+vp.xs] - vp.gp[nx-1+vp.xs];
185 //da = vp.point(i+1, j-1, k) - vp.point(i-1, j-1, k); // 1/4 * (da+dc)
186 //db = vp.point(i+1, j, k) - vp.point(i-1, j, k); // 1/2 * db
187 //dc = vp.point(i+1, j+1, k) - vp.point(i-1, j+1, k);
188
189 if (k==0 || k==vp.zs-1) {
190 dd = de = 0;
191 nr = 8;
192 }
193 else {
194 dd = vp.gp[nx+1-pl] - vp.gp[nx-1-pl]; // 1/4 * (dd+de)
195 de = vp.gp[nx+1+pl] - vp.gp[nx-1+pl];
196 //dd = vp.point(i+1, j, k-1) - vp.point(i-1, j, k-1); // 1/4 * (dd+de)
197 //de = vp.point(i+1, j, k+1) - vp.point(i-1, j, k+1);
198 nr = 12;
199 }
200
201 xp.gp[nx] = (R)((da + 2.*db + dc + dd + de)/nr);
202 }
203 }
204 if (vcounter!=NULL) vcounter->StepIt();
205 }
206
207 return xp;
208}

References MSGraph< T >::base, DEBUG_MODE, GetUsableGlobalCounter(), MSGraph< T >::gp, MSGraph< T >::isNull(), JBXL_GRAPH_MEMORY_ERROR, MSGraph< T >::mimicry(), PRINT_MESG, CVCounter::SetMax(), MSGraph< T >::state, CVCounter::StepIt(), MSGraph< T >::xs, MSGraph< T >::ys, MSGraph< T >::zero, and MSGraph< T >::zs.

Here is the call graph for this function:

◆ xxSobel()

template<typename R , typename T >
MSGraph< R > xxSobel ( MSGraph< T > vp)

template<typename R, typename T> MSGraph<R> xxSobel(MSGraph<T> vp)

グラフィックデータの X方向の 2階微分(Sobel)を計算する．

Parameters
vp計算対象となるグラフィックデータ構造体．
Returns
処理されたグラフィックデータ．

Definition at line 377 of file Gmt.h.

378{
379 int i, j, k;
380 int pl, nx, ny, nz, pl2, xs, xs2;
381 R da, db, dc, dd, de;
382 R df, dg, dh, di, dj, dk, dl, dm, nr;
383 MSGraph<R> xp;
384
385 xp.mimicry(vp);
386 xp.base = xp.zero = 0;
387
388 if (xp.isNull()) {
389 DEBUG_MODE PRINT_MESG("XXSOBEL: No More Memory!!\n");
390 xp.state = JBXL_GRAPH_MEMORY_ERROR;
391 return xp;
392 }
393
394 // カウンタ
395 CVCounter* vcounter = NULL;
396 if (vp.zs>2) vcounter = GetUsableGlobalCounter();
397 if (vcounter!=NULL) vcounter->SetMax(vp.zs);
398
399 pl = vp.xs*vp.ys;
400 pl2 = 2*pl;
401 xs = vp.xs;
402 xs2 = 2*vp.xs;
403
404 for (k=0; k<vp.zs; k++) {
405 nz = k*pl;
406 for (j=2; j<vp.ys-2; j++) {
407 ny = nz + j*vp.xs;
408 for (i=2; i<vp.xs-2; i++) {
409 nx = ny + i;
410 da = vp.gp[nx+2-xs2] - 2*vp.gp[nx-xs2] + vp.gp[nx-2-xs2];
411 db = vp.gp[nx+2-xs ] - 2*vp.gp[nx-xs] + vp.gp[nx-2-xs];
412 dc = vp.gp[nx+2] - 2*vp.gp[nx] + vp.gp[nx-2];
413 dd = vp.gp[nx+2+xs] - 2*vp.gp[nx+xs] + vp.gp[nx-2+xs];
414 de = vp.gp[nx+2+xs2] - 2*vp.gp[nx+xs2] + vp.gp[nx-2+xs2];
415 //da = vp.point(i+2, j-2, k) - 2*vp.point(i, j-2, k) + vp.point(i-2, j-2, k);
416 //db = vp.point(i+2, j-1, k) - 2*vp.point(i, j-1, k) + vp.point(i-2, j-1, k);
417 //dc = vp.point(i+2, j, k) - 2*vp.point(i, j, k) + vp.point(i-2, j, k);
418 //dd = vp.point(i+2, j+1, k) - 2*vp.point(i, j+1, k) + vp.point(i-2, j+1, k);
419 //de = vp.point(i+2, j+2, k) - 2*vp.point(i, j+2, k) + vp.point(i-2, j+2, k);
420
421 if (k==0 || k==vp.zs-1) {
422 dc = (R)(6.*dc);
423 df = dg = dh = di = dj = dk = dl = dm = 0;
424 nr = 64;
425 }
426 else {
427 dc = (R)(8.*dc);
428 df = vp.gp[nx+2-xs-pl] - 2*vp.gp[nx-xs-pl] + vp.gp[nx-2-xs-pl];
429 dg = vp.gp[nx+2 -pl] - 2*vp.gp[nx -pl] + vp.gp[nx-2 -pl];
430 dh = vp.gp[nx+2+xs-pl] - 2*vp.gp[nx+xs-pl] + vp.gp[nx-2+xs-pl];
431 di = vp.gp[nx+2-xs+pl] - 2*vp.gp[nx-xs+pl] + vp.gp[nx-2-xs+pl];
432 dj = vp.gp[nx+2 +pl] - 2*vp.gp[nx +pl] + vp.gp[nx-2 +pl];
433 dk = vp.gp[nx+2+xs+pl] - 2*vp.gp[nx+xs+pl] + vp.gp[nx-2+xs+pl];
434 //df = vp.point(i+2, j-1, k-1) - 2*vp.point(i, j-1, k-1) + vp.point(i-2, j-1, k-1);
435 //dg = vp.point(i+2, j, k-1) - 2*vp.point(i, j , k-1) + vp.point(i-2, j, k-1);
436 //dh = vp.point(i+2, j+1, k-1) - 2*vp.point(i, j+1, k-1) + vp.point(i-2, j+1, k-1);
437 //di = vp.point(i+2, j-1, k+1) - 2*vp.point(i, j-1, k+1) + vp.point(i-2, j-1, k+1);
438 //dj = vp.point(i+2, j, k+1) - 2*vp.point(i, j, k+1) + vp.point(i-2, j, k+1);
439 //dk = vp.point(i+2, j+1, k+1) - 2*vp.point(i, j+1, k+1) + vp.point(i-2, j+1, k+1);
440
441 if (k==1 || k==vp.zs-2) {
442 dl = dm = 0;
443 nr = 136;
444 }
445 else {
446 dl = vp.gp[nx+2-pl2] - 2*vp.gp[nx-pl2] + vp.gp[nx-2-pl2];
447 dm = vp.gp[nx+2+pl2] - 2*vp.gp[nx+pl2] + vp.gp[nx-2+pl2];\
448 //dl = vp.point(i+2, j, k-2) - 2*vp.point(i, j, k-2) + vp.point(i-2, j, k-2);
449 //dm = vp.point(i+2, j, k+2) - 2*vp.point(i, j, k+2) + vp.point(i-2, j, k+2);
450 nr = 144;
451 }
452 }
453 xp.gp[nx] = (R)((dc + 4.*(db+dd+dg+dj) + 2.*(df+dh+di+dk) + da+de+dl+dm)/nr);
454 }
455 }
456 if (vcounter!=NULL) vcounter->StepIt();
457 }
458 return xp;
459}

References MSGraph< T >::base, DEBUG_MODE, GetUsableGlobalCounter(), MSGraph< T >::gp, MSGraph< T >::isNull(), JBXL_GRAPH_MEMORY_ERROR, MSGraph< T >::mimicry(), PRINT_MESG, CVCounter::SetMax(), MSGraph< T >::state, CVCounter::StepIt(), MSGraph< T >::xs, MSGraph< T >::ys, MSGraph< T >::zero, and MSGraph< T >::zs.

Here is the call graph for this function:

◆ ySobel()

template<typename R , typename T >
MSGraph< R > ySobel ( MSGraph< T > vp)

template<typename R, typename T> MSGraph<R> ySobel(MSGraph<T> vp)

グラフィックデータの Y方向微分(Sobel)を計算する．

Parameters
vp計算対象となるグラフィックデータ構造体．
Returns
処理されたグラフィックデータ．

Definition at line 219 of file Gmt.h.

220{
221 int i, j, k;
222 int pl, nx, ny, nz;
223 R da, db, dc, dd, de, nr;
224 MSGraph<R> xp;
225
226 xp.mimicry(vp);
227 xp.base = xp.zero = 0;
228
229 if (xp.isNull()) {
230 DEBUG_MODE PRINT_MESG("YSOBEL: No More Memory!!\n");
231 xp.state = JBXL_GRAPH_MEMORY_ERROR;
232 return xp;
233 }
234
235 // カウンタ
236 CVCounter* vcounter = NULL;
237 if (vp.zs>2) vcounter = GetUsableGlobalCounter();
238 if (vcounter!=NULL) vcounter->SetMax(vp.zs);
239
240 pl = vp.xs*vp.ys;
241 for (k=0; k<vp.zs; k++) {
242 nz = k*pl;
243 for (j=1; j<vp.ys-1; j++) {
244 ny = nz + j*vp.xs;
245 for (i=1; i<vp.xs-1; i++) {
246 nx = ny + i;
247 da = vp.gp[nx-1+vp.xs] - vp.gp[nx-1-vp.xs];
248 db = vp.gp[nx +vp.xs] - vp.gp[nx -vp.xs];
249 dc = vp.gp[nx+1+vp.xs] - vp.gp[nx+1-vp.xs];
250 //da = vp.point(i-1, j+1, k) - vp.point(i-1, j-1, k);
251 //db = vp.point(i , j+1, k) - vp.point(i, j-1, k);
252 //dc = vp.point(i+1, j+1, k) - vp.point(i+1, j-1, k);
253
254 if (k==0 || k==vp.zs-1) {
255 dd = de = 0;
256 nr = 8;
257 }
258 else {
259 dd = vp.gp[nx+vp.xs-pl] - vp.gp[nx-vp.xs-pl];
260 de = vp.gp[nx+vp.xs+pl] - vp.gp[nx-vp.xs+pl];
261 //dd = vp.point(i, j+1, k-1) - vp.point(i, j-1, k-1);
262 //de = vp.point(i, j+1, k+1) - vp.point(i, j-1, k+1);
263 nr = 12;
264 }
265
266 xp.gp[nx] = (R)((da + 2.*db + dc + dd + de)/nr);
267 }
268 }
269 if (vcounter!=NULL) vcounter->StepIt();
270 }
271
272 return xp;
273}

References MSGraph< T >::base, DEBUG_MODE, GetUsableGlobalCounter(), MSGraph< T >::gp, MSGraph< T >::isNull(), JBXL_GRAPH_MEMORY_ERROR, MSGraph< T >::mimicry(), PRINT_MESG, CVCounter::SetMax(), MSGraph< T >::state, CVCounter::StepIt(), MSGraph< T >::xs, MSGraph< T >::ys, MSGraph< T >::zero, and MSGraph< T >::zs.

Here is the call graph for this function:

◆ yySobel()

template<typename R , typename T >
MSGraph< R > yySobel ( MSGraph< T > vp)

template<typename R, typename T> MSGraph<R> yySobel(MSGraph<T> vp)

グラフィックデータの Y方向の 2階微分(Sobel)を計算する．

Parameters
vp計算対象となるグラフィックデータ構造体．
Returns
処理されたグラフィックデータ．

Definition at line 470 of file Gmt.h.

471{
472 int i, j, k;
473 int pl, nx, ny, nz, pl2, xs, xs2;
474 R da, db, dc, dd, de;
475 R df, dg, dh, di, dj, dk, dl, dm, nr;
476 MSGraph<R> xp;
477
478 xp.mimicry(vp);
479 xp.base = xp.zero = 0;
480
481 if (xp.isNull()) {
482 DEBUG_MODE PRINT_MESG("YYSOBEL: No More Memory!!\n");
483 xp.state = JBXL_GRAPH_MEMORY_ERROR;
484 return xp;
485 }
486
487 // カウンタ
488 CVCounter* vcounter = NULL;
489 if (vp.zs>2) vcounter = GetUsableGlobalCounter();
490 if (vcounter!=NULL) vcounter->SetMax(vp.zs);
491
492 pl = vp.xs*vp.ys;
493 pl2 = 2*pl;
494 xs = vp.xs;
495 xs2 = 2*vp.xs;
496
497 for (k=0; k<vp.zs; k++) {
498 nz = k*pl;
499 for (j=2; j<vp.ys-2; j++) {
500 ny = nz + j*vp.xs;
501 for (i=2; i<vp.xs-2; i++) {
502 nx = ny + i;
503 da = vp.gp[nx-2+xs2] - 2*vp.gp[nx-2] + vp.gp[nx-2-xs2];
504 db = vp.gp[nx-1+xs2] - 2*vp.gp[nx-1] + vp.gp[nx-1-xs2];
505 dc = vp.gp[nx +xs2] - 2*vp.gp[nx] + vp.gp[nx -xs2];
506 dd = vp.gp[nx+1+xs2] - 2*vp.gp[nx+1] + vp.gp[nx+1-xs2];
507 de = vp.gp[nx+2+xs2] - 2*vp.gp[nx+2] + vp.gp[nx+2-xs2];
508 //da = vp.point(i-2, j+2, k) - 2*vp.point(i-2, j, k) + vp.point(i-2, j-2, k);
509 //db = vp.point(i-1, j+2, k) - 2*vp.point(i-1, j, k) + vp.point(i-1, j-2, k);
510 //dc = vp.point(i, j+2, k) - 2*vp.point(i, j, k) + vp.point(i, j-2, k);
511 //dd = vp.point(i+1, j+2, k) - 2*vp.point(i+1, j, k) + vp.point(i+1, j-2, k);
512 //de = vp.point(i+2, j+2, k) - 2*vp.point(i+2, j, k) + vp.point(i+2, j-2, k);
513
514 if (k==0 || k==vp.zs-1) {
515 dc = (R)(6.*dc);
516 df = dg = dh = di = dj = dk = dl = dm = 0;
517 nr = 64;
518 }
519 else {
520 dc = (R)(8.*dc);
521 df = vp.gp[nx-1+xs2-pl] - 2*vp.gp[nx-1-pl] + vp.gp[nx-1-xs2-pl];
522 dg = vp.gp[nx +xs2-pl] - 2*vp.gp[nx -pl] + vp.gp[nx -xs2-pl];
523 dh = vp.gp[nx+1+xs2-pl] - 2*vp.gp[nx+1-pl] + vp.gp[nx+1-xs2-pl];
524 di = vp.gp[nx-1+xs2+pl] - 2*vp.gp[nx-1+pl] + vp.gp[nx-1-xs2+pl];
525 dj = vp.gp[nx +xs2+pl] - 2*vp.gp[nx +pl] + vp.gp[nx -xs2+pl];
526 dk = vp.gp[nx+1+xs2+pl] - 2*vp.gp[nx+1+pl] + vp.gp[nx+1-xs2+pl];
527 //df = vp.point(i-1, j+2, k-1) - 2*vp.point(i-1, j, k-1) + vp.point(i-1, j-2, k-1);
528 //dg = vp.point(i, j+2, k-1) - 2*vp.point(i, j, k-1) + vp.point(i, j-2, k-1);
529 //dh = vp.point(i+1, j+2, k-1) - 2*vp.point(i+1, j, k-1) + vp.point(i+1, j-2, k-1);
530 //di = vp.point(i-1, j+2, k+1) - 2*vp.point(i-1, j, k+1) + vp.point(i-1, j-2, k+1);
531 //dj = vp.point(i, j+2, k+1) - 2*vp.point(i, j, k+1) + vp.point(i, j-2, k+1);
532 //dk = vp.point(i+1, j+2, k+1) - 2*vp.point(i+1, j, k+1) + vp.point(i+1, j-2, k+1);
533
534 if (k==1 || k==vp.zs-2) {
535 dl = dm = 0;
536 nr = 136;
537 }
538 else {
539 dl = vp.gp[nx+xs2-pl2] - 2*vp.gp[nx-pl2] + vp.gp[nx-xs2-pl2];
540 dm = vp.gp[nx+xs2+pl2] - 2*vp.gp[nx+pl2] + vp.gp[nx-xs2+pl2];
541 //dl = vp.point(i, j+2, k-2) - 2*vp.point(i, j, k-2) + vp.point(i, j-2, k-2);
542 //dm = vp.point(i, j+2, k+2) - 2*vp.point(i, j, k+2) + vp.point(i, j-2, k+2);
543 nr = 144;
544 }
545 }
546 xp.gp[nx] = (R)((dc + 4.*(db+dd+dg+dj) + 2.*(df+dh+di+dk) + da+de+dl+dm)/nr);
547 }
548 }
549 if (vcounter!=NULL) vcounter->StepIt();
550 }
551
552 return xp;
553}

References MSGraph< T >::base, DEBUG_MODE, GetUsableGlobalCounter(), MSGraph< T >::gp, MSGraph< T >::isNull(), JBXL_GRAPH_MEMORY_ERROR, MSGraph< T >::mimicry(), PRINT_MESG, CVCounter::SetMax(), MSGraph< T >::state, CVCounter::StepIt(), MSGraph< T >::xs, MSGraph< T >::ys, MSGraph< T >::zero, and MSGraph< T >::zs.

Here is the call graph for this function:

◆ zoom_MSGraph()

template<typename T >
MSGraph< T > zoom_MSGraph ( MSGraph< T > vp,
double zm,
int mode = ON )

template <typename T> MSGraph<T> zoom_MSGraph(MSGraph<T> vp, double zm, int mode=ON)

2Dグラフィックデータ拡大する．

Parameters
vp– 変換する Vector型単純グラフィックデータ．
zm– 倍率．
mode– モード．ON: 線形補間．その他: 単純拡大
Returns
拡大したグラフィックデータ．

Definition at line 1733 of file Graph.h.

1734{
1735 int xss, yss, ps, pz, py;
1736 MSGraph<T> vx;
1737
1738 vx.init();
1739
1740 if (vp.gp==NULL) {
1741 vx.state = JBXL_GRAPH_NODATA_ERROR;
1742 return vx;
1743 }
1744 if (zm==0.0) {
1745 vx.state = JBXL_GRAPH_IVDARG_ERROR;
1746 return vx;
1747 }
1748 else if (zm<0.0) zm = -zm;
1749
1750 xss = (int)(vp.xs*zm) + 1;
1751 yss = (int)(vp.ys*zm) + 1;
1752
1753 vx.set(xss, yss, vp.zs);
1754 if (vx.isNull()) return vx;
1755 vx.color = vp.color;
1756
1757 ps = xss*yss;
1758
1759 if (mode==ON) {
1760 int ii, jj, kk, ll;
1761 double xx, yy, al, bt;
1762
1763 for(int k=0; k<vx.zs; k++) {
1764 pz = k*ps;
1765 for(int j=0; j<yss; j++) {
1766 py = pz + j*xss;
1767 for(int i=0; i<xss; i++) {
1768 xx = i/zm;
1769 yy = j/zm;
1770 ii = (int)xx;
1771 jj = (int)yy;
1772 if (ii>=vp.xs) ii = vp.xs - 1;
1773 if (jj>=vp.ys) jj = vp.ys - 1;
1774
1775 kk = ii + 1;
1776 ll = jj + 1;
1777 if (kk>=vp.xs) kk = vp.xs - 1;
1778 if (ll>=vp.ys) ll = vp.ys - 1;
1779
1780 if (xx>=0.) al = xx - ii;
1781 else al = 0.;
1782 if (yy>=0.) bt = yy - jj;
1783 else bt = 0.;
1784
1785 vx.gp[py+i] = (T)((1.-al)*(1.-bt)*vp.point(ii, jj, k) + al*(1.-bt)*vp.point(kk, jj, k)
1786 + (1.-al)*bt*vp.point(ii, ll, k) + al*bt*vp.point(kk, ll, k) + 0.5);
1787 }
1788 }
1789 }
1790 }
1791
1792 else {
1793 int ii, jj;
1794
1795 for(int k=0; k<vx.zs; k++) {
1796 pz = k*ps;
1797 for(int j=0; j<yss; j++) {
1798 py = pz + j*xss;
1799 for(int i=0; i<xss; i++) {
1800 ii = (int)(i/zm);
1801 jj = (int)(j/zm);
1802 vx.gp[py+i] = vp.point(ii, jj, k);
1803 }
1804 }
1805 }
1806 }
1807
1808 return vx;
1809}

References MSGraph< T >::color, MSGraph< T >::gp, MSGraph< T >::init(), MSGraph< T >::isNull(), JBXL_GRAPH_IVDARG_ERROR, JBXL_GRAPH_NODATA_ERROR, ON, MSGraph< T >::point(), MSGraph< T >::set(), MSGraph< T >::state, MSGraph< T >::xs, MSGraph< T >::ys, and MSGraph< T >::zs.

Referenced by count_around_MSGraph().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ zSobel()

template<typename R , typename T >
MSGraph< R > zSobel ( MSGraph< T > vp)

template<typename R, typename T> MSGraph<R> zSobel(MSGraph<T> vp)

グラフィックデータの Z方向微分(Sobel)を計算する．

Parameters
vp計算対象となるグラフィックデータ構造体．
Returns
処理されたグラフィックデータ．

Definition at line 284 of file Gmt.h.

285{
286 int i, j, k;
287 int pl, nx, ny, nz;
288 R da, db, dc, dd, de;
289 MSGraph<R> xp;
290
291 xp.mimicry(vp);
292 xp.base = xp.zero = 0;
293
294 if (xp.isNull()) {
295 DEBUG_MODE PRINT_MESG("ZSOBEL: No More Memory!!\n");
296 xp.state = JBXL_GRAPH_MEMORY_ERROR;
297 return xp;
298 }
299 if (vp.zs<2) {
300 xp.state = JBXL_GRAPH_NODATA_ERROR;
301 return xp; // 0 のグラフィックデータを返す
302 }
303
304 // カウンタ
305 CVCounter* vcounter = NULL;
306 if (vp.zs>2) vcounter = GetUsableGlobalCounter();
307 if (vcounter!=NULL) vcounter->SetMax(vp.zs-1);
308
309 pl = vp.xs*vp.ys;
310 for (k=1; k<vp.zs-1; k++) {
311 nz = k*pl;
312 for (j=1; j<vp.ys-1; j++) {
313 ny = nz + j*vp.xs;
314 for (i=1; i<vp.xs-1; i++) {
315 nx = ny +i;
316 da = vp.gp[nx-1+pl] - vp.gp[nx-1-pl];
317 db = vp.gp[nx+1+pl] - vp.gp[nx+1-pl];
318 dc = vp.gp[nx +pl] - vp.gp[nx -pl];
319 dd = vp.gp[nx-vp.xs+pl] - vp.gp[nx-vp.xs-pl];
320 de = vp.gp[nx+vp.xs+pl] - vp.gp[nx+vp.xs-pl];
321 //da = vp.point(i-1, j, k+1) - vp.point(i-1, j, k-1);
322 //db = vp.point(i+1, j, k+1) - vp.point(i+1, j, k-1);
323 //dc = vp.point(i, j, k+1) - vp.point(i, j, k-1);
324 //dd = vp.point(i, j-1, k+1) - vp.point(i, j-1, k-1);
325 //de = vp.point(i, j+1, k+1) - vp.point(i, j+1, k-1);
326 xp.gp[nx] = (R)((da + db + 2.*dc + dd + de)/12.);
327 }
328 }
329 if (vcounter!=NULL) vcounter->StepIt();
330 }
331
332 // k==0 and k==vp.zs-1
333 nz = (vp.zs-1)*pl;
334 for (j=1; j<vp.ys-1; j++) {
335 ny = j*vp.xs;
336 for (i=1; i<vp.xs-1; i++) {
337 nx = ny + i;
338 da = vp.gp[nx];
339 db = vp.gp[nx+pl];
340 dc = vp.gp[nx+1 +pl] + vp.gp[nx-1 +pl];
341 dd = vp.gp[nx+vp.xs+pl] + vp.gp[nx-vp.xs+pl];
342 //da = vp.point(i, j, 0);
343 //db = vp.point(i, j, 1);
344 //dc = vp.point(i+1, j, 1) + vp.point(i-1, j, 1);
345 //dd = vp.point(i, j+1, 1) + vp.point(i, j-1, 1);
346 xp.gp[nx] = (R)((2.*db + dc + dd)/6. - da);
347 }
348
349 ny = ny + nz;
350 for (i=1; i<vp.xs-1; i++) {
351 nx = ny + i;
352 da = vp.gp[nx];
353 db = vp.gp[nx-pl];
354 dc = vp.gp[nx+1 -pl] + vp.gp[nx-1 -pl];
355 dd = vp.gp[nx+vp.xs-pl] + vp.gp[nx-vp.xs-pl];
356 //da = vp.point(i, j, vp.zs-1);
357 //db = vp.point(i, j, vp.zs-2);
358 //dc = vp.point(i+1, j, vp.zs-2) + vp.point(i-1, j, vp.zs-2);
359 //dd = vp.point(i, j+1, vp.zs-2) + vp.point(i, j-1, vp.zs-2);
360 xp.gp[nx] = (R)(da - (2.*db + dc + dd)/6.);
361 }
362 }
363 if (vcounter!=NULL) vcounter->PutFill();
364
365 return xp;
366}

References MSGraph< T >::base, DEBUG_MODE, GetUsableGlobalCounter(), MSGraph< T >::gp, MSGraph< T >::isNull(), JBXL_GRAPH_MEMORY_ERROR, JBXL_GRAPH_NODATA_ERROR, MSGraph< T >::mimicry(), PRINT_MESG, CVCounter::PutFill(), CVCounter::SetMax(), MSGraph< T >::state, CVCounter::StepIt(), MSGraph< T >::xs, MSGraph< T >::ys, MSGraph< T >::zero, and MSGraph< T >::zs.

Here is the call graph for this function:

◆ zzSobel()

template<typename R , typename T >
MSGraph< R > zzSobel ( MSGraph< T > vp)

template<typename R, typename T> MSGraph<R> zzSobel(MSGraph<T> vp)

グラフィックデータの Z方向の 2階微分(Sobel)を計算する．

Parameters
vp計算対象となるグラフィックデータ構造体．
Returns
処理されたグラフィックデータ．

Definition at line 564 of file Gmt.h.

565{
566 int i, j, k;
567 R da, db, dc, dd, de;
568 R df, dg, dh, di, dj, dk, dl, dm;
569 MSGraph<R> pp, xp;
570
571 if (vp.zs<2) { // 0 のグラフィックデータを返す
572 pp.mimicry(vp);
573 pp.state = JBXL_GRAPH_NODATA_ERROR;
574 return pp;
575 }
576
577 // カウンタ
578 CVCounter* vcounter = NULL;
579 CVCounter* ccounter = NULL;
580 if (vp.zs>2) vcounter = GetUsableGlobalCounter();
581 if (vcounter!=NULL) {
582 vcounter->SetMax(200);
583 ccounter = vcounter->MakeChildCounter(100);
584 SetGlobalCounter(ccounter);
585 }
586
587 pp = zSobel<R>(vp);
588
589 if (vcounter!=NULL) {
590 vcounter->DeleteChildCounter();
591 ccounter = vcounter->MakeChildCounter(100);
592 SetGlobalCounter(ccounter);
593 }
594
595 if (!pp.isNull()) {
596 xp = zSobel<R>(pp);
597 pp.free();
598 }
599 else xp = pp;
600
601 if (vcounter!=NULL) {
602 vcounter->DeleteChildCounter();
603 SetGlobalCounter(vcounter);
604 vcounter->PutFill();
605 }
606
607/* if (vp.zs<5) return xp;
608 for (k=2; k<vp.zs-2; k++) {
609 for (j=2; j<vp.ys-2; j++) {
610 for (i=2; i<vp.xs-2; i++) {
611 da = vp.point(i, j, k+2) - 2*vp.point(i, j, k) + vp.point(i, j, k-2);
612 db = vp.point(i+1, j, k+2) - 2*vp.point(i+1, j, k) + vp.point(i+1, j, k-2);
613 dc = vp.point(i-1, j, k+2) - 2*vp.point(i-1, j, k) + vp.point(i-1, j, k-2);
614 dd = vp.point(i, j+1, k+2) - 2*vp.point(i, j+1, k) + vp.point(i, j+1, k-2);
615 de = vp.point(i, j-1, k+2) - 2*vp.point(i, j-1, k) + vp.point(i, j-1, k-2);
616 df = vp.point(i+1, j+1, k+2) - 2*vp.point(i+1, j+1, k) + vp.point(i+1, j+1, k-2);
617 dg = vp.point(i+1, j-1, k+2) - 2*vp.point(i+1, j-1, k) + vp.point(i+1, j-1, k-2);
618 dh = vp.point(i-1, j+1, k+2) - 2*vp.point(i-1, j+1, k) + vp.point(i-1, j+1, k-2);
619 di = vp.point(i-1, j-1, k+2) - 2*vp.point(i-1, j-1, k) + vp.point(i-1, j-1, k-2);
620 dj = vp.point(i+2, j, k+2) - 2*vp.point(i+2, j, k) + vp.point(i+2, j, k-2);
621 dk = vp.point(i-2, j, k+2) - 2*vp.point(i-2, j, k) + vp.point(i-2, j, k-2);
622 dl = vp.point(i, j+2, k+2) - 2*vp.point(i, j+2, k) + vp.point(i, j+2, k-2);
623 dm = vp.point(i, j-2, k+2) - 2*vp.point(i, j-2, k) + vp.point(i, j-2, k-2);
624 xp.point(i, j, k) = (R)((8.*da + 4.*(db+dc+dd+de) + 2.*(df+dg+dh+di) +dj+dk+dl+dm)/144.);
625 }
626 }
627 }
628*/
629 return xp;
630}
jbxl::SetGlobalCounter
void SetGlobalCounter(CVCounter *counter)
グローバルカウンタのセット
Definition ClassBox.h:192

References CVCounter::DeleteChildCounter(), MSGraph< T >::free(), GetUsableGlobalCounter(), MSGraph< T >::isNull(), JBXL_GRAPH_NODATA_ERROR, CVCounter::MakeChildCounter(), MSGraph< T >::mimicry(), CVCounter::PutFill(), SetGlobalCounter(), CVCounter::SetMax(), MSGraph< T >::state, and MSGraph< T >::zs.

Here is the call graph for this function:

Variable Documentation

◆ Abs_Vector_Tolerance

double Abs_Vector_Tolerance = 1.0e-6
extern

Definition at line 20 of file Tolerance.cpp.

Referenced by SetAbsVectorTolerance().

◆ Abs_Vertex_Tolerance

double Abs_Vertex_Tolerance = 1.0e-6
extern

Definition at line 21 of file Tolerance.cpp.

Referenced by BREP_VERTEX::BREP_VERTEX(), BREP_VERTEX::ComputeTolerance(), and SetAbsVertexTolerance().

◆ BREP_CONTOUR

class DllExport BREP_CONTOUR

Definition at line 35 of file Brep.h.

Referenced by CreateContour(), and CreateContourByVertex().

◆ BREP_EDGE

class DllExport BREP_EDGE

Definition at line 36 of file Brep.h.

Referenced by CreateEdge().

◆ BREP_FACET

class DllExport BREP_FACET

Definition at line 34 of file Brep.h.

Referenced by BrepSolidList::addSolid(), AddVector2TriSolid(), CreateTriSolidFromSTL(), CreateTriSolidFromVector(), BrepSolidList::getMerge(), PatchupContour(), and ReverseContours().

◆ BREP_SHELL

class DllExport BREP_SHELL

Definition at line 33 of file Brep.h.

Referenced by BrepSolidList::addSolid(), CreateTriSolidFromSTL(), CreateTriSolidFromVector(), and BrepSolidList::getMerge().

◆ BREP_SOLID

class DllExport BREP_SOLID

Definition at line 32 of file Brep.h.

Referenced by BrepSolidList::addSolid(), MeshFacetNode::computeVertexByBREP(), MeshFacetNode::computeVertexByBREP(), and BrepSolidList::getMerge().

◆ BREP_VERTEX

class DllExport BREP_VERTEX

Definition at line 38 of file Brep.h.

Referenced by CreateContourByVector().

◆ BREP_WING

class DllExport BREP_WING

Definition at line 37 of file Brep.h.

Referenced by BREP_EDGE::BREP_EDGE().

◆ Collision_Tolerance

double Collision_Tolerance = 1.0e-3
extern

Definition at line 22 of file Tolerance.cpp.

Referenced by CollisionTriContour2D(), CollisionTriContour3D(), IsInTriangle(), and SetCollisionTolerance().

◆ Edge_Tolerance

double Edge_Tolerance = 1.0e-12
extern

Definition at line 16 of file Tolerance.cpp.

Referenced by BREP_EDGE::BREP_EDGE(), and SetEdgeTolerance().

◆ Facet_Tolerance

double Facet_Tolerance = 1.0e-12
extern

Definition at line 17 of file Tolerance.cpp.

Referenced by BREP_FACET::BREP_FACET(), BREP_FACET::ComputePlaneEquation(), and SetFacetTolerance().

◆ GLCounter

CVCounter * GLCounter = NULL
extern

Definition at line 22 of file ClassBox.cpp.

Referenced by ClearGlobalCounter(), GetUsableGlobalCounter(), and SetGlobalCounter().

◆ GLDisplay

CVDisplay * GLDisplay = NULL
extern

Definition at line 16 of file ClassBox.cpp.

Referenced by ClearGlobalDisplay(), and SetGlobalDisplay().

◆ GLFrame

CVFrame * GLFrame = NULL
extern

Definition at line 15 of file ClassBox.cpp.

Referenced by ClearGlobalFrame(), and SetGlobalFrame().

◆ GLTextDocument

CVTextDocument * GLTextDocument = NULL
extern

Definition at line 17 of file ClassBox.cpp.

Referenced by ClearGlobalTextDocument(), and SetGlobalTextDocument().

◆ OctreeNode

class DllExport OctreeNode

Definition at line 39 of file Brep.h.

Referenced by OctreeNode::AddWithDuplicates(), OctreeNode::AddWithUnique(), and BREP_SOLID::BREP_SOLID().

◆ Quaternion

template<typename T >
class DllExport Quaternion

Definition at line 22 of file Rotation.h.

◆ Sin_Tolerance

double Sin_Tolerance = 1.0e-6
extern

Definition at line 23 of file Tolerance.cpp.

Referenced by SetSINTolerance(), SlerpQuaternion(), and ToPola().

◆ TempBase

int TempBase = 0
extern

Definition at line 14 of file Gdata.cpp.

Referenced by writeCmnHeadData(), and writeGraphicFile().

◆ Vector_Tolerance

double Vector_Tolerance = 1.0e-8
extern

Definition at line 14 of file Tolerance.cpp.

Referenced by same_vector(), same_vector(), and SetVectorTolerance().

◆ Vertex_Tolerance

double Vertex_Tolerance = 1.0e-8
extern

Definition at line 15 of file Tolerance.cpp.

Referenced by BREP_VERTEX::ComputeTolerance(), and SetVertexTolerance().

◆ Zero_Eps

double Zero_Eps = 1.0e-8
extern

Definition at line 26 of file Tolerance.cpp.

Referenced by CollisionTriContour2D(), CollisionTriContour3D(), IsAtLine(), Quaternion< T >::normalize(), Vector< T >::normalize(), Vector4< T >::normalize(), ProportionVector(), RotMatrixElements2ExtEulerXYZ(), RotMatrixElements2ExtEulerXZY(), RotMatrixElements2ExtEulerYXZ(), RotMatrixElements2ExtEulerYZX(), RotMatrixElements2ExtEulerZXY(), RotMatrixElements2ExtEulerZYX(), SamePlaneContour(), SetZeroEPS(), V2VQuaternion(), Vector4Angle(), and VectorAngle().

◆ Zero_Eps2

double Zero_Eps2 = Zero_Eps*Zero_Eps
extern

Definition at line 27 of file Tolerance.cpp.

◆ ZeroBase

int ZeroBase = 0
extern

Definition at line 13 of file Gdata.cpp.

Referenced by readGraphicFile(), and readGraphicSlices().