jbxl Namespace Reference

Classes
class	BREP_SOLID
class	BREP_SHELL
class	BREP_FACET
class	BREP_CONTOUR
class	BREP_WING
class	BREP_EDGE
class	BREP_VERTEX
class	OctreeNode
class	BrepSolidList
struct	tmpSTLData
	データ読み込み用一時データ More...
struct	STLData
class	CVFrame
class	CVDisplay
class	CVTextDocument
class	CVCounter
class	CRingBuffer
class	Base64
class	CBVHTool
class	CLogRingBuffer
class	ExMSGraph
class	ExCmnHead
class	MSGraph
class	MSGraphDisp
class	TGAImage
class	Matrix
class	Quaternion
class	AffineTrans
class	TVector
class	Vector
class	PCoordinate
class	RBound
class	UVMap
class	ColladaXML
class	FacetTriIndex
class	FacetTriData
class	FacetBaseData
class	TriPolyData
class	TextureParam
class	MaterialParam
class	MeshObjectNode
	MeshObject の Polygonデータを格納するクラス．リスト構造を取る．. More...
class	MeshObjectData
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 > >	FACET_VECTOR_ARRAY
typedef std::vector< Vector < float > >	FACET_VECTOR_ARRAY32
typedef std::vector < FacetTriIndex >	FACET_TRIINDX_ARRAY
typedef std::vector< FacetTriData >	FACET_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 > *vect, Vector< double > *nrml=NULL, UVMap< double > *uv=NULL, bool dupli=false)
DllExport BREP_CONTOUR *	CreateContourByVertex (BREP_FACET *facet, BREP_VERTEX **vect)
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, 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, 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 >
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)
template<typename T >
MSGraph< T >	TGAImage2MSGraph (TGAImage tga)
template<typename T >
TGAImage	MSGraph2TGAImage (MSGraph< T > vp)
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	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 >
void	freeAffineTrans (AffineTrans< T > *&affine)
template<typename T >
AffineTrans< T > *	newAffineTrans (AffineTrans< T > p)
template<typename T >
AffineTrans< T >	operator* (const AffineTrans< T > a, const AffineTrans< T > b)
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 >
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^ (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 >
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)
void	freeColladaXML (ColladaXML *&xml)
void	freeFacetBaseData (FacetBaseData *&facet)
TriPolyData *	dupTriPolyData (TriPolyData *data, int num)
TriPolyData *	joinTriPolyData (TriPolyData *&first, int num_f, TriPolyData *&next, int num_n)
void	freeTriPolyData (TriPolyData *&tridata)
void	freeTriPolyData (TriPolyData *&tridata, int n)
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	freeMeshObjectNode (MeshObjectNode *&node)
void	freeMeshObjectList (MeshObjectNode *&node)
MeshObjectNode *	DelMeshObjectNode (MeshObjectNode *node)
MeshObjectNode *	AddMeshObjectNode (MeshObjectNode *list, MeshObjectNode *node)
void	freeMeshObjectData (MeshObjectData *&data)
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
class DllExport	Quaternion
double	Vector_Tolerance = 1.0e-6
double	Vertex_Tolerance = 1.0e-6
double	Edge_Tolerance = 1.0e-12
double	Facet_Tolerance = 1.0e-12
double	Abs_Vector_Tolerance = 1.0e-4
double	Abs_Vertex_Tolerance = 1.0e-4
double	Collision_Tolerance = 1.0e-2
	衝突判定用トレランス
double	Sin_Tolerance = 1.0e-6
	sinθ==0
double	Zero_Eps = 1.0e-6
	1に対して 0とするトレランス
double	Zero_Eps2 = Zero_Eps*Zero_Eps

---

Detailed Description

3D Facet用基本データ

---

Typedef Documentation

typedef std::list<BREP_CONTOUR*> BREP_CONTOUR_LIST

Definition at line 46 of file Brep.h.

typedef std::list<BREP_EDGE*> BREP_EDGE_LIST

Definition at line 47 of file Brep.h.

typedef std::list<BREP_FACET*> BREP_FACET_LIST

Definition at line 45 of file Brep.h.

typedef std::list<BREP_SHELL*> BREP_SHELL_LIST

Definition at line 44 of file Brep.h.

typedef std::list<BREP_SOLID*> BREP_SOLID_LIST

Definition at line 43 of file Brep.h.

typedef std::list<BREP_VERTEX*> BREP_VERTEX_LIST

Definition at line 49 of file Brep.h.

typedef std::list<BREP_WING*> BREP_WING_LIST

Definition at line 48 of file Brep.h.

typedef std::vector<FacetTriData> FACET_TRIDATA_ARRAY

Definition at line 32 of file FacetBaseData.h.

typedef std::vector<FacetTriIndex> FACET_TRIINDX_ARRAY

Definition at line 31 of file FacetBaseData.h.

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

Definition at line 26 of file FacetBaseData.h.

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

Definition at line 30 of file FacetBaseData.h.

---

Function Documentation

MSGraph<T>* jbxl::_getMSGraph_CvMat_C1

(

cv::Mat

mat

)

[inline]

Definition at line 247 of file OpenCVTool.h.

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

{
    MSGraph<T>* vp = NULL;

    if (mat.channels()!=1) return NULL;

    if (mat.dims==2) {
        vp = new MSGraph<T>(mat.cols, mat.rows);
        if (vp==NULL || vp->gp==NULL) return vp;

        // 通常は連続しているはず
        if (mat.isContinuous()) {
            R* ptr = (R*)mat.data;
            T* dst = vp->gp;
            for (int i=0; i<vp->xs*vp->ys; i++) {
                dst[i] = (T)ptr[i];
            }
        }
        else {
            for (int j=0; j<vp->ys; j++) {
                R* ptr = mat.ptr<R>(j);
                T* dst = &(vp->gp[j*vp->xs]);
                for (int i=0; i<vp->xs; i++) {
                    dst[i] = (T)ptr[i];
                }
            }
        }
        //
        vp->color = GRAPH_COLOR_MONO;
    }

    // 3次元
    else if (mat.dims==3) {
        vp = new MSGraph<T>((int)mat.size[2], (int)mat.size[1], (int)mat.size[0]);
        if (vp==NULL || vp->gp==NULL) return vp;
        
        // 通常は連続しているはず
        if (mat.isContinuous()) {
            R* ptr = (R*)mat.data;
            T* dst = vp->gp;
            for (int i=0; i<vp->xs*vp->ys*vp->zs; i++) {
                dst[i] = (T)ptr[i]; 
            }
        }
        else {
            for (int k=0; k<vp->zs; k++) {
                int kk = k*vp->ys*vp->xs;
                for (int j=0; j<vp->ys; j++) {
                    R* ptr = mat.ptr<R>(k, j);
                    T* dst = &(vp->gp[j*vp->xs + kk]);
                    for (int i=0; i<vp->xs; i++) {
                        dst[i] = (T)ptr[i];
                    }
                }
            }
        }
        //
        vp->color = GRAPH_COLOR_MONO;
    }

    return vp;
}

MSGraph<T>* jbxl::_getMSGraph_CvMat_C3

(

cv::Mat

mat

)

[inline]

Definition at line 315 of file OpenCVTool.h.

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

{
    MSGraph<T>* vp = NULL;

    if (mat.channels()!=3) return NULL;
    int tsz = sizeof(T);
    
    if (mat.dims==2) {
        vp = new MSGraph<T>(mat.cols, mat.rows);
        if (vp==NULL || vp->gp==NULL) return vp;

        // 通常は連続しているはず
        if (mat.isContinuous()) {
            R* src = (R*)mat.data;
            T* dst = vp->gp;
            vp->color = _linecopy_MAT2MSG_C3(src, dst, vp->xs*vp->ys, tsz);
        }

        else {
            for (int j=0; j<vp->ys; j++) {
                R* src = mat.ptr<R>(j);
                T* dst = &(vp->gp[j*vp->xs]);
                _linecopy_MAT2MSG_C3(src, dst, vp->xs, tsz);
            }
            vp->color = _linecopy_MAT2MSG_C3((R*)NULL, (T*)NULL, 0, tsz);       // return color only
        }
    }

    // 3次元
    else if (mat.dims==3) {
        vp = new MSGraph<T>((int)mat.size[2], (int)mat.size[1], (int)mat.size[0]);
        if (vp==NULL || vp->gp==NULL) return vp;
        
        // 通常は連続しているはず
        if (mat.isContinuous()) {
            R* src = (R*)mat.data;
            T* dst = vp->gp;
            vp->color = _linecopy_MAT2MSG_C3(src, dst, vp->xs*vp->ys*vp->zs, tsz);
        }
        else {
            for (int k=0; k<vp->zs; k++) {
                int kk = k*vp->ys*vp->xs;
                for (int j=0; j<vp->ys; j++) {
                    R* src = mat.ptr<R>(k, j);
                    T* dst = &(vp->gp[j*vp->xs + kk]);
                    for (int i=0; i<vp->xs; i++) {
                        _linecopy_MAT2MSG_C3(src, dst, vp->xs, tsz);
                    }
                }
            }
            vp->color = _linecopy_MAT2MSG_C3((R*)NULL, (T*)NULL, 0, tsz);       // return color only
        }
    }

    return vp;
}

Here is the call graph for this function:

int jbxl::_linecopy_MAT2MSG_C3	(	R *	src,
		T *	dst,
		int	len,
		int	sz
	)			[inline]

Definition at line 376 of file OpenCVTool.h.

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

Referenced by _getMSGraph_CvMat_C3().

{
    int i3 = 0;
    int color = GRAPH_COLOR_MONO;

    if (sz==1) {
        for (int i=0; i<len; i++) {
            dst[i] = (T)(((unsigned int)src[i3] + (unsigned int)src[i3+1] + (unsigned int)src[i3+2])/3);
            i3 += 3;
        }
    }

    else if (sz==2) {
        for (int i=0; i<len; i++) {
            dst[i] = (T)RGB2Word((unsigned int)src[i3+2], (unsigned int)src[i3+1], (unsigned int)src[i3]);
            i3 += 3;
        }
        color = GRAPH_COLOR_RGB16;
    }

    else {
        for (int i=0; i<len; i++) {
            dst[i] = (T)ABGR2Int(0, (unsigned int)src[i3], (unsigned int)src[i3+1], (unsigned int)src[i3+2]);
            i3 += 3;
        }
        color = GRAPH_COLOR_ABGR;
    }

    return color;
}

Here is the call graph for this function:

Here is the caller graph for this function:

tList* jbxl::add_tList_object	(	tList *	lt,
		T	obj
	)			[inline]

非推奨 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 76 of file tools++.h.

References add_tList_node_bystr().

{
    T* pp = new T();
    *pp = obj;
    lt  = add_tList_node_bystr(lt, 0, 0, NULL, NULL, (void*)pp, sizeof(T));

    return lt;
}

Here is the call graph for this function:

MeshObjectNode * AddMeshObjectNode	(	MeshObjectNode *	list,
		MeshObjectNode *	node
	)

Definition at line 409 of file MeshObjectData.cpp.

References MeshObjectNode::next, and MeshObjectNode::prev.

Referenced by MeshObjectData::addNode().

{
    if (list==NULL) return node;
    if (node==NULL) return list;

    node->prev = list;
    node->next = list->next;

    if (list->next!=NULL) list->next->prev = node;
    list->next = node;

    return node;
}

Here is the caller graph for this function:

int jbxl::addPaint_MSGraph	(	MSGraph< T >	xp,
		int	x,
		int	y,
		int	mn,
		int	mx,
		int	add,
		int	mode = 8
	)			[inline]

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 2254 of file Graph.h.

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

Referenced by delete_noise_MSGraph().

{
    int  i, k, cc, cx, st, ed, num=0;

    if (x<0 || x>=xp.xs || y<0 || y>=xp.ys) return 0;

    // 左端へ
    cc = (int)xp.point(x, y);
    while(x>0) {
        cx = (int)xp.point(x-1, y);
        if (cx>mx || cx<mn) break;
        cc = cx;
        x--; 
    }
    st = k = x;

    // 右方向へ塗りつぶし
    while(k<xp.xs) {
        cx = (int)xp.point(k, y);
        if (cx>mx || cx<mn) break;
        xp.point(k, y) += add;
        cc = cx;
        num++;
        k++;
    }
    ed = k - 1;

    // 上下ライン
    for (i=st; i<=ed; i++){ 
        cc = (int)xp.point(i, y) - add;
        
        // 1ライン上へ
        if (y-1>=0 && y-1<xp.ys){ 
            cx = (int)xp.point(i, y-1);
            if (cx<=mx && cx>=mn) {
                num += addPaint_MSGraph(xp, i, y-1, mn, mx, add, mode);
            }
            if (mode>=8) {   
                if (i-1>=0) {
                    cx = (int)xp.point(i-1, y-1);
                    if (cx<=mx && cx>=mn) {
                        num += addPaint_MSGraph(xp, i-1, y-1, mn, mx, add, mode);
                    }
                }
                if (i+1<xp.xs) {
                    cx = (int)xp.point(i+1, y-1);
                    if (cx<=mx && cx>=mn) {
                        num += addPaint_MSGraph(xp, i+1, y-1, mn, mx, add, mode);
                    }
                }
            }
        }

        // 1ライン下へ
        if (y+1>=0 && y+1<xp.ys){
            cx = (int)xp.point(i, y+1);
            if (cx<=mx && cx>=mn) {
                num += addPaint_MSGraph(xp, i, y+1, mn, mx, add, mode);
            }
            if (mode>=8) {  
                if (i-1>=0) {
                    cx = (int)xp.point(i-1, y+1);
                    if (cx<=mx && cx>=mn) {
                        num += addPaint_MSGraph(xp, i-1, y+1, mn, mx, add, mode);
                    }
                }
                if (i+1<xp.xs) {
                    cx = (int)xp.point(i+1, y+1);
                    if (cx<=mx && cx>=mn) {
                        num += addPaint_MSGraph(xp, i+1, y+1, mn, mx, add, mode);
                    }
                }
            }
        }
    }

    return num;
}

Here is the call graph for this function:

Here is the caller graph for this function:

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

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

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

カウンタは無し．外部で利用すること．

Parameters:

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

Definition at line 1436 of file TriBrep.cpp.

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

{
    BREP_FACET*   facet;
    BREP_CONTOUR* contour;

    if (solid==NULL || shell==NULL || vect==NULL) return;
    if (solid->octree==NULL) return; 

    facet = new BREP_FACET(shell); 
    contour = CreateContourByVector(facet, vect, nrml, uvmp, dupli);
    if (contour!=NULL) {
/*
        if (check) {    
            // 衝突判定
            BREP_CONTOUR* collision;
            facet->CloseData();
            if (!IsCollisionContours(solid, contour, &collision)) {
                solid->contours.push_back(contour);             // IsCollisionContours()用
            }
            else {
                collision->facet->deletable = true;             // 衝突相手も消す．
                FastDeleteFacet(facet);
            }
        }
        else  solid->contours.push_back(contour);
*/
        solid->contours.push_back(contour);
    }
    else {
        deleteNull(facet);
    }

    return;
}

Here is the call graph for this function:

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	頂点データを格納するオクトツリー
	dupli	true: 頂点の重複登録を許可する．false: 重複登録を許可しない．

Returns:

オクトツリー中の頂点データ

使用例

    vert = AddVertex2Octree(vert, octree, false);

Definition at line 1019 of file Brep.cpp.

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

Referenced by CreateContourByVector().

{
    OctreeNode* node;

    if (dupli) node = octree->AddWithDuplicates(vert); 
    else       node = octree->AddWithUnique(vert);
    if (node==NULL) return NULL;

    if (node->vertex==vert) {
        octree->solid->vertexno++;      // Vertexを新規登録したのでカウントする．
    }
    return node->vertex;
}

Here is the call graph for this function:

Here is the caller graph for this function:

unsigned int jbxl::ARGB2Int	(	unsigned int	a,
		unsigned int	r,
		unsigned int	g,
		unsigned int	b
	)			[inline]

Definition at line 1016 of file Gdata.h.

References isBigEndian.

{
    if (isBigEndian) {      // A-R-G-B
        a = (unsigned int)((a&0x000000ff)<<24);
        r = (unsigned int)((r&0x000000ff)<<16);
        g = (unsigned int)((g&0x000000ff)<<8);
        b = (unsigned int) (b&0x000000ff);
    }
    else {                  // B-G-R-A
        b = (unsigned int)((b&0x000000ff)<<24);
        g = (unsigned int)((g&0x000000ff)<<16);
        r = (unsigned int)((r&0x000000ff)<<8);
        a = (unsigned int) (a&0x000000ff);
    }

    unsigned int c = (unsigned int)(a + r + g + b);
    return  c;
}

uWord jbxl::ARGB2Word	(	uWord	a,
		uWord	r,
		uWord	g,
		uWord	b
	)			[inline]

Definition at line 1041 of file Gdata.h.

References isBigEndian.

{
    if (isBigEndian) {  // A-R-G-B
        a = (int)(((a&0x00ff)>>4)<<12);
        r = (int)(((r&0x00ff)>>4)<<8);
        g = (int)(((g&0x00ff)>>4)<<4);
        b = (int) ((b&0x00ff)>>4);
    }
    else {              // G-B A-R
        g = (int)(((g&0x00ff)>>4)<<12);
        b = (int)(((b&0x00ff)>>4)<<8);
        a = (int)(((a&0x00ff)>>4)<<4);
        r = (int) ((r&0x00ff)>>4);
    }

    uWord c = (uWord)(a + r + g + b);
    return  c;
}

Vector<T> jbxl::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 324 of file Vector.h.

{
    Vector<T> q0 = 2*p0 - p1;
//  Vector<T> q1 = p0;
//  Vector<T> q2 = p1;
    Vector<T> q3 = 2*p1 - p0;

    double t2 = t*t;
    double t3 = t2*t;
    
    double c0 = (t2 - t)*0.5 + (1.0 - t3)*0.1666666666666667;   // 1/6*(1-t)^3
    double c1 = t3*0.5 - t2 + 0.6666666666666667;               // 1/2*t3 - t2 + 2/3
    double c2 = (t + t2 - t3)*0.5 + 0.1666666666666667;         // -1/2*t3 + 1/2*t2 + 1/2*t + 1/6
    double c3 = t3*0.1666666666666667;                          // 1/6*t3

    Vector<T> vect = c0*q0 + c1*p0 + c2*p1 + c3*q3;

    return vect;
}

void jbxl::cat_MSGraph	(	MSGraph< R > *	src,
		MSGraph< T > *	dst
	)			[inline]

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

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

Parameters:

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

Definition at line 489 of file Graph.h.

References MSGraph< T >::base, MSGraph< T >::free(), MSGraph< T >::gp, MSGraph< T >::max, Max, MSGraph< T >::min, 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.

{
    if (src==NULL || dst==NULL) return;
    if ((void*)src->gp==(void*)dst->gp) return;

    int  i, x, y, z;
    MSGraph<T>   vp;
    RBound<int>  rb;

    rb.xmin = Min(src->rbound.xmin, dst->rbound.xmin);
    rb.ymin = Min(src->rbound.ymin, dst->rbound.ymin);
    rb.zmin = Min(src->rbound.zmin, dst->rbound.zmin);
    rb.xmax = Max(src->rbound.xmax, dst->rbound.xmax);
    rb.ymax = Max(src->rbound.ymax, dst->rbound.ymax);
    rb.zmax = Max(src->rbound.zmax, dst->rbound.zmax);

    vp.set(rb.xmax-rb.xmin+1, rb.ymax-rb.ymin+1, rb.zmax-rb.zmin+1, dst->zero, dst->base, dst->RZxy);
    if (vp.gp==NULL) return;
    vp.rbound = rb;
    vp.max = Max((T)src->max, dst->max); 
    vp.min = Min((T)src->min, dst->min); 

    for (i=0; i<dst->xs*dst->ys*dst->zs; i++) {
        if (dst->gp[i]!=dst->zero) {
            x = i%dst->xs           + dst->rbound.xmin - rb.xmin;
            y = (i/dst->xs)%dst->ys + dst->rbound.ymin - rb.ymin;
            z = i/(dst->xs*dst->ys) + dst->rbound.zmin - rb.zmin;
            vp.gp[z*vp.xs*vp.ys + y*vp.xs + x] = dst->gp[i];
        }
    }

    for (i=0; i<src->xs*src->ys*src->zs; i++) {
        if (src->gp[i]!=src->zero) {
            x = i%src->xs           + src->rbound.xmin - rb.xmin;
            y = (i/src->xs)%src->ys + src->rbound.ymin - rb.ymin;
            z = i/(src->xs*src->ys) + src->rbound.zmin - rb.zmin;
            vp.gp[z*vp.xs*vp.ys + y*vp.xs + x] = (T)src->gp[i];
        }
    }

    dst->free();
    *dst = vp;
    return;
}

Here is the call graph for this function:

void jbxl::cat_MSGraph	(	MSGraph< R >	src,
		MSGraph< T > &	dst
	)			[inline]

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

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

Parameters:

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

Definition at line 434 of file Graph.h.

References MSGraph< T >::base, MSGraph< T >::free(), MSGraph< T >::gp, MSGraph< T >::max, Max, MSGraph< T >::min, 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.

{
    if ((void*)src.gp==(void*)dst.gp) return;

    int  i, x, y, z;
    MSGraph<T>   vp;
    RBound<int>  rb;

    rb.xmin = Min(src.rbound.xmin, dst.rbound.xmin);
    rb.ymin = Min(src.rbound.ymin, dst.rbound.ymin);
    rb.zmin = Min(src.rbound.zmin, dst.rbound.zmin);
    rb.xmax = Max(src.rbound.xmax, dst.rbound.xmax);
    rb.ymax = Max(src.rbound.ymax, dst.rbound.ymax);
    rb.zmax = Max(src.rbound.zmax, dst.rbound.zmax);

    vp.set(rb.xmax-rb.xmin+1, rb.ymax-rb.ymin+1, rb.zmax-rb.zmin+1, dst.zero, dst.base, dst.RZxy);
    if (vp.gp==NULL) return;
    vp.rbound = rb;
    vp.max = Max((T)src.max, dst.max); 
    vp.min = Min((T)src.min, dst.min); 

    for (i=0; i<dst.xs*dst.ys*dst.zs; i++) {
        if (dst.gp[i]!=dst.zero) {
            x = i%dst.xs          + dst.rbound.xmin - rb.xmin;
            y = (i/dst.xs)%dst.ys + dst.rbound.ymin - rb.ymin;
            z = i/(dst.xs*dst.ys) + dst.rbound.zmin - rb.zmin;
            vp.gp[z*vp.xs*vp.ys + y*vp.xs + x] = dst.gp[i];
        }
    }

    for (i=0; i<src.xs*src.ys*src.zs; i++) {
        if (src.gp[i]!=src.zero) {
            x = i%src.xs          + src.rbound.xmin - rb.xmin;
            y = (i/src.xs)%src.ys + src.rbound.ymin - rb.ymin;
            z = i/(src.xs*src.ys) + src.rbound.zmin - rb.zmin;
            vp.gp[z*vp.xs*vp.ys + y*vp.xs + x] = (T)src.gp[i];
        }
    }

    dst.free();
    dst = vp;
    return;
}

Here is the call graph for this function:

MSGraph<T> jbxl::centerLine	(	MSGraph< T >	gx,
		int	mode
	)			[inline]

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

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

Parameters:

	gx	3D画像．
	mode	26: 26近傍，その他: 6近傍

Returns:

細線化された画像データ．

See also:

信学論D-II, Vol.J79-D-II, pp.1675-1685, 1996.

Definition at line 45 of file Thinning.h.

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.

{
    int   i, j, k, l, m, n, w, b, nn, mm; 
    int   rr, dd, xs, ps;
    
    bool  dt;

    MSGraph<int>   gd;
    MSGraph<T>   vp;
    tList *pp, *px;
    tList_data ld;

    if (mode!=26)  mode = 6;
    xs = gx.xs;
    ps = gx.xs*gx.ys;
    ld = init_tList_data();

    // STEP 1 
    //DEBUG_Warning("center_line: start step1");
    gd = euclidDistance(gx, gd.zero+1, rr);

    dd = SINTMAX;
    rr = 0;
    for (i=0; i<gd.xs*gd.ys*gd.zs; i++) {
        if (gd.gp[i]!=0) {
            gd.gp[i] += 20;
            dd = Min(dd, gd.gp[i]);
            rr = Max(rr, gd.gp[i]);
        }
    }

    // STEP 2
    //DEBUG_Warning("center_line: start step2");
    pp = px = new_tList_node();

    for (k=1; k<gd.zs-1; k++) {
        l = k*ps;
        for (j=1; j<gd.ys-1; j++) {
            m = l + j*xs;
            for (i=1; i<gd.xs-1; i++) {
                n = m + i;
                if (gd.gp[n]>20) {
                    w = gd.gp[n+1]*gd.gp[n-1]*gd.gp[n+xs]*gd.gp[n-xs]   
                                    *gd.gp[n+ps]*gd.gp[n-ps];
                    if(w==0) {
                        ld.id = n;
                        ld.lv = (int)gd.gp[n];
                        px = add_tList_node_bydata(px, ld);
                        gd.gp[n] = 1;
                    }
                }
            }
        }
    }

    //DEBUG_Warning("center_line: start step3, step4 and step5");
    do {
        // STEP 3
        //DEBUG_Warning("center_line: start step3");
        px = pp->next;
        while(px!=NULL) {
            if (px->ldat.lv<=dd) {
                dt = deletable(gd, px->ldat.id, mode, 3);
                if (dt) {
                    m = nonZeroBoxel(gd, px->ldat.id);
                    if (m==1) {
                        tList* pv = px->prev;
                        del_tList_node(&px);
                        px = pv;
                    }
                    else px->ldat.lv = m/3 + 7;
                }
                else {
                    px->ldat.lv = 16;
                }
            }
            px = px->next;
        } 

        // STEP 4
        //DEBUG_Warning("center_line: start step4");
        for (b=7; b<=15; b++) {
            px = pp->next;
            while(px!=NULL) {
                if (px->ldat.lv==b) {
                    dt = deletable(gd, px->ldat.id, mode, 3);
                    if (dt) {
                        m = nonZeroBoxel(gd, px->ldat.id);
                        if (m==1) {
                            tList* pv = px->prev;
                            del_tList_node(&px);
                            px = pv;
                        }
                        else  {
                            i = px->ldat.id;
                            gd.gp[i] = 0;

                            tList* pv = px->prev;
                            del_tList_node(&px);
                            px = pv;

                            if (gd.gp[i+1]>20) {
                                ld.id = i+1;
                                ld.lv = (int)gd.gp[ld.id];
                                px = add_tList_node_bydata(px, ld);
                                gd.gp[ld.id] = 1;
                            }
                            if (gd.gp[i-1]>20) {
                                ld.id = i-1;
                                ld.lv = (int)gd.gp[ld.id];
                                px = add_tList_node_bydata(px, ld);
                                gd.gp[ld.id] = 1;
                            }
                            if (gd.gp[i+xs]>20) {
                                ld.id = i+xs;
                                ld.lv = (int)gd.gp[ld.id];
                                px = add_tList_node_bydata(px, ld);
                                gd.gp[ld.id] = 1;
                            }
                            if (gd.gp[i-xs]>20) {
                                ld.id = i-xs;
                                ld.lv = (int)gd.gp[ld.id];
                                px = add_tList_node_bydata(px, ld);
                                gd.gp[ld.id] = 1;
                            }
                            if (gd.gp[i+ps]>20) {
                                ld.id = i+ps;
                                ld.lv = (int)gd.gp[ld.id];
                                px = add_tList_node_bydata(px, ld);
                                gd.gp[ld.id] = 1;
                            }
                            if (gd.gp[i-ps]>20) {
                                ld.id = i-ps;
                                ld.lv = (int)gd.gp[ld.id];
                                px = add_tList_node_bydata(px, ld);
                                gd.gp[ld.id] = 1;
                            }
                        }
                    }
                    else {
                        px->ldat.lv = 16;
                    }
                }
                px = px->next;
            }
        } 

        // STEP 5
        //DEBUG_Warning("center_line: start step5");
        dd = rr;
        px = pp->next;
        while(px!=NULL) {
            if (px->ldat.lv>20) {
                dd = Min(dd, px->ldat.lv);
            }
            px = px->next;
        }
        mm = nn = 0;
        px = pp->next;
        while(px!=NULL) {
            nn++;
            if (px->ldat.lv==16) mm++;
            px = px->next;
        }

    } while (dd<rr || mm!=nn);

    vp.setup(gd.xs, gd.ys, gd.zs);
    for (i=0; i<gd.xs*gd.ys*gd.zs; i++) vp.gp[i] = (T)gd.gp[i];
    gd.free();

    return  vp;
}

Here is the call graph for this function:

MSGraph<T> jbxl::CenterLine	(	MSGraph< T >	gx,
		int	mode
	)			[inline]

void jbxl::ClearGlobalCounter

(

)

[inline]

Definition at line 195 of file ClassBox.h.

References GLCounter.

{ GLCounter = NULL;}

void jbxl::ClearGlobalDisplay

(

)

[inline]

Definition at line 77 of file ClassBox.h.

References GLDisplay.

{ GLDisplay = NULL;}

void jbxl::ClearGlobalFrame

(

)

[inline]

Definition at line 48 of file ClassBox.h.

References GLFrame.

{ GLFrame = NULL;}

void jbxl::ClearGlobalTextDocument

(

)

[inline]

Definition at line 122 of file ClassBox.h.

References GLTextDocument.

{ GLTextDocument = NULL;}

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 1484 of file TriBrep.cpp.

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().

{
    if (solid==NULL) return -1;

    // deletableになっているContourがあるかもしれないので，CreateContoursList()で作り直し．     
    CreateContoursList(solid);
    CreateWingsList(solid);

    if (check) {
        // 多重Edgeの削除
        CreateSurplusContoursList(solid);   
        if (counter!=NULL) counter->MakeChildCounter(10);
        DeleteSurplusContours(solid);
        if (counter!=NULL) counter->DeleteChildCounter();
        // 直線に並んだ Edgeの削除
        CreateShortageWingsList(solid);
        if (counter!=NULL) counter->MakeChildCounter(10);
        DeleteStraightEdges(solid);         
        if (counter!=NULL) counter->DeleteChildCounter();
    }

    CreateSurplusContoursList(solid);   // 作り直し 
    CreateShortageWingsList(solid); 
    solid->vcount = 3;                  // for Triangle Facet
    solid->CloseData();                 // Close Octree
    //
    return  (int)solid->contours.size();
}

Here is the call graph for this function:

Here is the caller graph for this function:

uByte& jbxl::CmnHeadBytePoint	(	CmnHead	hd,
		int	i = 0,
		int	j = 0,
		int	k = 0
	)			[inline]

Definition at line 39 of file Gdata.h.

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

{
    return hd.grptr[(int)i + (int)j*hd.xsize + (int)k*hd.xsize*hd.ysize]; 
}

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

Definition at line 1075 of file TriBrep.cpp.

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

Referenced by IsCollisionContours().

{
    double  uc, vc, tm, um, ut, vt, tmt, umt;
    BREP_WING* wing = contour1->wing;
    TVector<double> directR  = contour2->directR;
    TVector<double> directS  = contour2->directS;
    TVector<double> directRS = contour2->directRS;
    
    wing = contour1->wing;
    for (int i=0; i<3; i++) {
        TVector<double> point    = Vertex2TVector(wing->vertex);
        TVector<double> directB  = Vertex2TVector(wing->next->vertex) - point;
        TVector<double> directQ  = Vertex2TVector(contour2->wing->vertex) - point;
        TVector<double> directQB = directQ^directB;
        directB.norm();

        tm  = directQB*directS;
        um  = directRS*directB;
        tmt = TVectorMultiTolerance(directQB, directS);
        umt = TVectorMultiTolerance(directRS, directB);

        if (Xabs(tm)<=Max(tmt, Zero_Eps) || Xabs(um)<=Max(umt, Zero_Eps)) {
            TVector<double> directBR = directB^directR;
            TVector<double> directQR = directQ^directR;
            TVector<double> directQB = directQ^directB;
            uc = ProportionVector(directQB, directBR, ut);
            vc = ProportionVector(directQR, directBR, vt);
            ut = Max(ut, Collision_Tolerance);
            vt = Max(vt, Collision_Tolerance);
            if (uc>ut && 1.-uc>ut && vc>vt && 1.-vc>vt && 
                uc*directR.n>directR.t && (1.-uc)*directR.n>directR.t &&
                vc*directB.n>directB.t && (1.-vc)*directB.n>directB.t) { 
    //              DEBUG_MODE PRINT_MESG("同一平面上1  %e  %e    %e  %e\n", uc, vc, ut, vt);
    //              PrintFacetAsciiSTL(contour1);
    //              PrintFacetAsciiSTL(contour2);
                    return true;
            }

            directBR = directB^directS;
            directQR = (directQ+directR)^directS;
            directQB = (directQ+directR)^directB;
            uc = ProportionVector(directQB, directBR, ut);
            vc = ProportionVector(directQR, directBR, vt);
            ut = Max(ut, Collision_Tolerance);
            vt = Max(vt, Collision_Tolerance);
            if (uc>ut && 1.-uc>ut && vc>vt && 1.-vc>vt &&  
                uc*directS.n>directS.t && (1.-uc)*directS.n>directS.t &&
                vc*directB.n>directB.t && (1.-vc)*directB.n>directB.t) { 
//              DEBUG_MODE PRINT_MESG("同一平面上2  %e  %e    %e  %e\n", uc, vc, ut, vt);
//              PrintFacetAsciiSTL(contour1);
//              PrintFacetAsciiSTL(contour2);
                return true;
            }

            TVector<double> directT = directR + directS;
            directBR = directB^directT;
            directQR = directQ^directT;
            directQB = directQ^directB;
            uc = ProportionVector(directQB, directBR, ut);
            vc = ProportionVector(directQR, directBR, vt);
            ut = Max(ut, Collision_Tolerance);
            vt = Max(vt, Collision_Tolerance);
            if (uc>ut && 1.-uc>ut && vc>vt && 1.-vc>vt &&
                uc*directT.n>directT.t && (1.-uc)*directT.n>directT.t &&
                vc*directB.n>directB.t && (1.-vc)*directB.n>directB.t) { 
//              DEBUG_MODE PRINT_MESG("同一平面上3  %e  %e    %e  %e\n", uc, vc, ut, vt);
//              PrintFacetAsciiSTL(contour1);
//              PrintFacetAsciiSTL(contour2);
                return true;
            }
        }

        wing = wing->next;
    }

    return false;
}

Here is the call graph for this function:

Here is the caller graph for this function:

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 1012 of file TriBrep.cpp.

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().

{
    double  tc, uc, vc, tm, um, ut, vt, tt, tmt, umt;
    BREP_WING* wing  = contour1->wing;
    TVector<double> directR  = contour2->directR;
    TVector<double> directS  = contour2->directS;
    TVector<double> directRS = contour2->directRS;
    TVector<double> directT;
    TVector<double> directB;
    TVector<double> directQB;
    TVector<double> directN;

    // 各辺による衝突検出
    for (int i=0; i<3; i++) {
        TVector<double> point   = Vertex2TVector(wing->vertex);
        TVector<double> directQ = Vertex2TVector(contour2->wing->vertex) - point;

        for (int j=0; j<2; j++) {       
            directN = Vertex2TVector(wing->next->vertex);
            if (j==0) directB = directN - point;
            else      directB = directB + (Vertex2TVector(wing->next->next->vertex) - directN)*0.5;
            directQB = directQ^directB;

            um  = directRS*directB;
            tm  = directQB*directS;
            umt = TVectorMultiTolerance(directRS, directB);
            tmt = TVectorMultiTolerance(directQB, directS);

            if (Xabs(um)>Max(umt, Zero_Eps) && Xabs(tm)>Max(tmt, Zero_Eps)) {
                uc =  tm;
                tc = -directQB*directR;
                vc =  directRS*directQ;
                ut = tmt;
                tt = TVectorMultiTolerance(directQB, directR);
                vt = TVectorMultiTolerance(directRS, directQ);

                ut = Max(Collision_Tolerance, (um*ut+umt*uc)/(um*um));
                tt = Max(Collision_Tolerance, (tm*tt+tmt*tc)/(tm*tm));
                vt = Max(Collision_Tolerance, (um*vt+umt*vc)/(um*um));
                uc  = uc/um;
                tc  = tc/tm;
                vc  = vc/um;
                directT = directR + tc*directS;

                if (uc>ut && 1.-uc>ut && tc>tt && 1.-tc>tt && vc>vt && 1.-vc>vt &&
                    uc*directT.n>directT.t && (1.-uc)*directT.n>directT.t &&
                    tc*directS.n>directS.t && (1.-tc)*directS.n>directS.t && 
                    vc*directB.n>directB.t && (1.-vc)*directB.n>directB.t) { 
                //  DEBUG_MODE PRINT_MESG("3D衝突 %d !!!!  %e  %e  %e\n", j+1, uc, tc, vc);
                //  PrintFacetAsciiSTL(contour1);
                //  PrintFacetAsciiSTL(contour2);
                    return true;
                }
            }
        }
        wing = wing->next;
    }

    return false;
}

Here is the call graph for this function:

Here is the caller graph for this function:

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

Definition at line 1216 of file TriBrep.cpp.

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

Referenced by IsCollisionContours().

{
    BREP_VERTEX_LIST  vertex_list;

    int cnt = 0;
    BREP_WING* wing1 = contour1->wing;
    for (int i=0; i<3; i++) {
        bool common = false;
        BREP_WING* wing2 = contour2->wing;
        for (int j=0; j<3; j++) {
            if (wing1->vertex==wing2->vertex) {
                cnt++;
                common = true;
                break;
            }
            wing2 = wing2->next;
        }
        if (!common) vertex_list.push_back(wing1->vertex);
        wing1 = wing1->next;
    }
    return cnt;
}

Here is the caller graph for this function:

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

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

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

Return values:

	0〜7	Vertex の位置
	8	同じVertex

Definition at line 1057 of file Brep.cpp.

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

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

{
    double  tolerance = v1->tolerance + v2->tolerance;
    double  dist2 = (v1->point.x - v2->point.x)*(v1->point.x - v2->point.x) +
                    (v1->point.y - v2->point.y)*(v1->point.y - v2->point.y) +
                    (v1->point.z - v2->point.z)*(v1->point.z - v2->point.z);
    if (dist2<=tolerance*tolerance && v1->uvmap==v2->uvmap) return 8;   // 同じ位置．同じテクスチャマップ．

    int code = 0;
    if (v1->point.x > v2->point.x) code += 1;
    if (v1->point.y > v2->point.y) code += 2;
    if (v1->point.z > v2->point.z) code += 4;
    return code;   // x1 > x2 || y1 > y2 || z1 > z2
}

Here is the caller graph for this function:

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

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

連結数の計算

Parameters:

	w	w[] 近傍の連結数
	c	近傍数
	d	次元数

Returns:

連結数

Definition at line 28 of file Thinning.cpp.

Referenced by deletable().

{
    int  i;
    int  cn, n0, n1, n2;
    int  v[27];

    if (d<3) {
        for(i=0; i<9; i++) v[i] = w[i];
        if (c==8) {
            v[4] = 1 - v[4];
            for (i=0; i<9; i++) v[i] = 1 - v[i];
        }
        if (c==4 || c==8) {
            cn =  v[1] - v[1]*v[0]*v[3]; 
            cn += v[3] - v[3]*v[6]*v[7]; 
            cn += v[5] - v[5]*v[2]*v[1]; 
            cn += v[7] - v[7]*v[8]*v[5]; 
        }
        else {
            cn = -1;
        }
    }
    else {
        for (i=0; i<27; i++) v[i] = w[i];
        if (c==26) {
            v[13] = 1 - v[13];
            for(i=0; i<27; i++) v[i] = 1 - v[i];
        }
        if (c==6 || c==26) {
        n0 = v[13]*v[14] + v[13]*v[12] +
             v[13]*v[16] + v[13]*v[10] +
             v[13]*v[22] + v[13]*v[ 4];

        n1 = v[13]*v[14]*v[10]*v[11] + v[13]*v[14]*v[16]*v[17] +
             v[13]*v[14]*v[ 4]*v[ 5] + v[13]*v[14]*v[22]*v[23] +
             v[13]*v[12]*v[10]*v[ 9] + v[13]*v[12]*v[16]*v[15] +
             v[13]*v[12]*v[ 4]*v[ 3] + v[13]*v[12]*v[22]*v[21] +
             v[13]*v[10]*v[ 4]*v[ 1] + v[13]*v[10]*v[22]*v[19] +
             v[13]*v[16]*v[ 4]*v[ 7] + v[13]*v[16]*v[22]*v[25];

        n2 = v[13]*v[14]*v[10]*v[11]*v[ 4]*v[ 5]*v[ 1]*v[ 2] +
             v[13]*v[14]*v[10]*v[11]*v[22]*v[23]*v[19]*v[20] +
             v[13]*v[14]*v[16]*v[17]*v[ 4]*v[ 5]*v[ 7]*v[ 8] +
             v[13]*v[14]*v[16]*v[17]*v[22]*v[23]*v[25]*v[26] +
             v[13]*v[12]*v[10]*v[ 9]*v[ 4]*v[ 3]*v[ 1]*v[ 0] +
             v[13]*v[12]*v[10]*v[ 9]*v[22]*v[21]*v[19]*v[18] +
             v[13]*v[12]*v[16]*v[15]*v[ 4]*v[ 3]*v[ 7]*v[ 6] +
             v[13]*v[12]*v[16]*v[15]*v[22]*v[21]*v[25]*v[24];

            cn = n0 - n1 + n2;
            if (c==26) cn = 2 - cn; 
        }
        else {
            cn = -1;
        }
    }

    return  cn;
}

Here is the caller graph for this function:

DllExport void ConnectWingToVertex

(

BREP_WING *

wing

)

void jbxl::ConnectWingToVertex(BREP_WING* wing)

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

Definition at line 845 of file Brep.cpp.

References BREP_WING::vertex.

{
    if (wing!=NULL) {
        (wing->vertex)->wing_list.push_back(wing);
    }
}

void jbxl::copy_morph_element	(	MSGraph< T >	vp,
		int	x,
		int	y,
		int	z,
		MSGraph< T >	xp
	)			[inline]

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

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

Definition at line 146 of file Morph.h.

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

Referenced by fat_object_morph(), and opening_morph().

{
    int  i, j, k, cx, cy, cz;
    int  xx, yy, zz, ax, ay, az;

    for (k=0; k<xp.zs; k++) {
        zz = z + k - xp.zs/2;
        az = vp.xs*vp.ys*zz;
        cz = xp.xs*xp.ys*k; 
        for (j=0; j<xp.ys; j++) {
            yy = y + j - xp.ys/2;
            ay = az + vp.xs*yy; 
            cy = cz + xp.xs*j;  
            for (i=0; i<xp.xs; i++) {
                xx = x + i - xp.xs/2;
                ax = ay + xx;   
                cx = cy + i;    
                if (xx>=0&&xx<vp.xs&&yy>=0&&yy<vp.ys&&zz>=0&&zz<vp.zs){
                    if (xp.gp[cx]>0) vp.gp[ax] = xp.gp[cx];
                }
            }
        }
    }
}

Here is the caller graph for this function:

void jbxl::copy_MSGraph	(	MSGraph< R > *	src,
		MSGraph< T > *	dst
	)			[inline]

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 581 of file Graph.h.

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.

{
    if (src==NULL || dst==NULL) return;
    if ((void*)src->gp==(void*)dst->gp) return;

    MSGraph<T> vp;
    
    vp.getm(src->xs, src->ys, src->zs, (T)src->zero);
    if (vp.gp==NULL) {
        dst->free();
        dst->gp = NULL;
        dst->state = JBXL_GRAPH_MEMORY_ERROR;
        return;
    }

    vp.max   = (T)src->max;
    vp.min   = (T)src->min;
    vp.base  = (T)src->base;
    vp.color = src->color;
    vp.state = src->state;
    for (int i=0; i<vp.xs*vp.ys*vp.zs; i++) vp.gp[i] = (T)src->gp[i];
    
    dst->free();
    *dst = vp;
    return;
}

Here is the call graph for this function:

void jbxl::copy_MSGraph	(	MSGraph< R >	src,
		MSGraph< T > &	dst
	)			[inline]

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 545 of file Graph.h.

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.

{
    if ((void*)src.gp==(void*)dst.gp) return;

    MSGraph<T> vp;
    
    vp.getm(src.xs, src.ys, src.zs, (T)src.zero);
    if (vp.gp==NULL) {
        dst.free();
        dst.gp = NULL;
        dst.state = JBXL_GRAPH_MEMORY_ERROR;
        return;
    }

    vp.max   = (T)src.max;
    vp.min   = (T)src.min;
    vp.base  = (T)src.base;
    vp.color = src.color;
    vp.state = src.state;
    for (int i=0; i<vp.xs*vp.ys*vp.zs; i++) vp.gp[i] = (T)src.gp[i];
    
    dst.free();
    dst = vp;
    return;
}

Here is the call graph for this function:

MSGraph<T> jbxl::copyCmnHead2MSGraph	(	CmnHead	hd,
		unsigned int	mode = CH2MG_NORMAL,
		bool	cnt = false
	)			[inline]

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

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

Parameters:

	hd	共通ヘッダ
	mode	CH2MG_NORMAL (0) ノーマルコピー（デフォルト） CH2MG_NORZXY (1) Z軸の歪を処理しない．
	cnt	カウンタを使用するか（デフォルト：使用しない false）

Returns:

画像データ．エラーの場合は，stateメンバに値が設定される．

Return values:

	JBXL_GRAPH_HEADER_ERROR	state ヘッダエラー
	JBXL_GRAPH_MEMORY_ERROR	state メモリ確保エラー
	JBXL_GRAPH_CANCEL	state ユーザによる中断

Definition at line 667 of file Gdata.h.

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.

{
    MSGraph<T> vp;
    int kind = hd.kind & 0x00ff;

    vp.init();  // vp.color = GRAPH_COLOR_UNKNOWN;

    if (kind==UN_KNOWN_DATA || hd.kind==HEADER_NONE) {
        vp.state = JBXL_GRAPH_HEADER_ERROR;
        return vp;
    }

    vp.set(hd.xsize, hd.ysize, hd.zsize);
    if (vp.gp==NULL) { vp.state = JBXL_GRAPH_MEMORY_ERROR; return vp;}

    // カラータイプ
    if (kind==JPEG_RGB_DATA || kind==JPEG_MONO_DATA) {
        //if (hd.zsize==3) vp.color = GRAPH_COLOR_PRGB;
        if (hd.zsize==3) vp.color = GRAPH_COLOR_RGB;
    }
    else if (hd.depth==16) {
        vp.color = GRAPH_COLOR_MONO16;
    }

    // カウンタ．ここでは，delete禁止
    CVCounter* counter = NULL;
    if (vp.zs>=10 && cnt) {
        counter = GetUsableGlobalCounter();
        if (counter!=NULL) counter->SetMax(vp.zs/10);
    }

    int ks, js, ln;
    ln = vp.xs*vp.ys;

    if (hd.depth==16){
        sWord* bp = (sWord*)hd.grptr;
        vp.max = vp.min = bp[0];
        for (int k=0; k<vp.zs; k++) {
            ks = k*ln;
            for (int j=0; j<vp.xs*vp.ys; j++) {
                js = j+ ks;
                vp.gp[js] = bp[js];
                vp.max = Max(vp.max, vp.gp[js]);
                vp.min = Min(vp.min, vp.gp[js]);
            }
            
            if (counter!=NULL && k%10==0) {
                counter->StepIt();
                if (counter->isCanceled()) {        //  キャンセル
                    vp.free();
                    vp.state = JBXL_GRAPH_CANCEL;
                    return vp;
                }
            }

        }
    }

    else if (hd.depth<16){ // ==8
        //int uint = (unsigned char)hd.grptr[0];
        vp.max = vp.min = (T)((unsigned char)hd.grptr[0]);
        for (int k=0; k<vp.zs; k++) {
            ks = k*ln;
            for (int j=0; j<vp.xs*vp.ys; j++) {
                js = j + ks;
                vp.gp[js] = (T)((unsigned char)hd.grptr[js]); 
                vp.max = Max(vp.max, vp.gp[js]);
                vp.min = Min(vp.min, vp.gp[js]);
            }

            if (counter!=NULL && k%10==0) {
                counter->StepIt();
                if (counter->isCanceled()) {        //  キャンセル
                    vp.free();
                    vp.state = JBXL_GRAPH_CANCEL;
                    return vp;
                }
            }
        }
    }

    else {
        vp.max = vp.min = (T)((uByte)hd.grptr[0]>>(hd.depth-15));
        for (int k=0; k<vp.zs; k++) {
            ks = k*ln;
            for (int j=0; j<vp.xs*vp.ys; j++) {
                js = j + ks;
                vp.gp[js] = (T)((uByte)hd.grptr[js]>>(hd.depth-15));
                vp.max = Max(vp.max, vp.gp[js]);
                vp.min = Min(vp.min, vp.gp[js]);
            }

            if (counter!=NULL && k%10==0) {
                counter->StepIt();
                if (counter->isCanceled()) {        //  キャンセル
                    vp.free();
                    vp.state = JBXL_GRAPH_CANCEL;
                    return vp;
                }
            }
        }
    }

    // もし存在するなら，ヘッダ部分から Z方向の歪率, rboundを取り出す．
    if (!checkBit(mode, CH2MG_NOPARM)) {
        if (hd.bsize>0 && (kind==CT_DATA || kind==CT_3DM || kind==CT_3D_VOL)) {
            sWord* rz = (sWord*)hd.buf;
            if (rz[9]==RZXY_RATE || checkBit(hd.kind, HAS_RZXY)) {
                double rzm = rz[8]/(double)rz[9];
                if (rzm<5.0 && rzm>0.) vp.RZxy = rzm;
            }

            if (rz[10]!=0 && checkBit(hd.kind, HAS_BASE)) {
                vp.base = (T)rz[10];
            }

            if (checkBit(hd.kind, HAS_RBOUND)) {
                vp.rbound.xmin = rz[6];
                vp.rbound.xmax = rz[7];
                vp.rbound.ymin = rz[4];
                vp.rbound.ymax = rz[5];
                vp.rbound.zmin = rz[2];
                vp.rbound.zmax = rz[3];
            }
        }
    }

    if (counter!=NULL) counter->PutFill();

    return  vp;
}

Here is the call graph for this function:

CmnHead jbxl::copyMSGraph2CmnHead	(	MSGraph< T > &	vp,
		unsigned int	mode = MG2CH_NORMAL,
		bool	cnt = false
	)			[inline]

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	コピー元のグラフィックデータ
	mode	MG2CH_NORMAL (0) ノーマルコピー（デフォルト） MG2CH_NORZXY (1) Z軸の歪を処理しない． MG2CH_CONTRAST (2) コントラスト調整 MG2CH_OCTET (4) 8bitへ変換
	cnt	カウンタを使用するか（デフォルト：使用しない false）

Returns:

共通ヘッダ．エラーの場合は kind が HEADER_NONE になり，xsizeに値が設定される．

Return values:

	HEADER_NONE	kind エラー
	JBXL_GRAPH_HEADER_ERROR	xsize ヘッダエラー
	JBXL_GRAPH_MEMORY_ERROR	xsize メモリ確保エラー
	JBXL_GRAPH_CANCEL	xsize ユーザによる中断

Definition at line 822 of file Gdata.h.

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, MSGraph< T >::max, Max, MG2CH_CONTRAST, MG2CH_NOPARM, MG2CH_NORMAL, MG2CH_OCTET, MSGraph< T >::min, 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().

{
    CmnHead  hd;
    CTHead   ct;

    memset(&ct, 0, sizeof(CTHead));
    memset(&hd, 0, sizeof(CmnHead));

    if (vp.gp==NULL) {
        hd.xsize = JBXL_GRAPH_HEADER_ERROR;
        hd.kind  = HEADER_NONE;
        return hd;
    }

    //
    hd.kind  = 0;   // MSGraphからのコピー時には，ヘッダ情報は既に消失している．
    hd.xsize = ct.xsize = ct.cutright= vp.xs;
    hd.ysize = ct.ysize = ct.cutdown = vp.ys;
    hd.zsize = vp.zs;

    if (checkBit(mode, MG2CH_OCTET)) hd.depth = 8;
    else                             hd.depth = sizeof(T)*8;
    hd.lsize = hd.xsize*hd.ysize*hd.zsize*(hd.depth/8);
    hd.bsize = sizeof(CTHead);

    hd.grptr = (uByte*)malloc(hd.lsize*sizeof(uByte));
    if (hd.grptr==NULL) {
        hd.xsize = JBXL_GRAPH_MEMORY_ERROR;
        hd.kind  = HEADER_NONE;
        return hd;
    }
    hd.buf = (uByte*)malloc(hd.bsize*sizeof(uByte));
    if (hd.buf==NULL) {
        free_CmnHead(&hd);
        hd.xsize = JBXL_GRAPH_MEMORY_ERROR;
        return hd;
    }

    // カウンタ．ここでは，delete禁止
    CVCounter* counter = NULL;

    if (hd.zsize>=5 && cnt) {
        counter = GetUsableGlobalCounter();
        if (counter!=NULL) counter->SetMax(hd.zsize*2/10);
    }

    // 最大値，最小値を求める
    int j, k, ks, js, ln;
    T   max, min;
    max = min = vp.gp[0];

    ln = vp.xs*vp.ys;
    for (k=0; k<vp.zs; k++) {
        ks = k*ln;
        for (j=0; j<vp.ys*vp.xs; j++) {
            js = j + ks;
            min = Min(vp.gp[js], min);
            max = Max(vp.gp[js], max);
        }

        // カウンタ
        if (counter!=NULL && k%10==0) {
            counter->StepIt();
            if (counter->isCanceled()) {        //  キャンセル
                free_CmnHead(&hd);
                hd.xsize = JBXL_GRAPH_CANCEL;
                return hd;
            }
        }
    }
    vp.max = max;
    vp.min = min;

    // ノーマルコピー
    if (mode==MG2CH_NORMAL) {
        memcpy(hd.grptr, vp.gp, hd.lsize);
    }

    // 8bitへ変換
    else if (checkBit(mode, MG2CH_OCTET)) {
        // 255以下はコントラスト調整しない
        if (!checkBit(mode, MG2CH_CONTRAST) && vp.max<=255 && vp.min>=0) {
            max = 255;
            min = 0;
        }

        for (k=0; k<hd.zsize; k++) {
            ks = k*ln;
            for (j=0; j<hd.xsize*hd.ysize; j++) {
                js = j + ks;
                hd.grptr[js] = (uByte)(((vp.gp[js]-min)/(double)(max-min))*255.);
            }
            
            // カウンタ
            if (counter!=NULL && k%10==0) {
                counter->StepIt();
                if (counter->isCanceled()) {        // キャンセル
                    free_CmnHead(&hd);
                    hd.xsize = JBXL_GRAPH_CANCEL;
                    return hd;
                }
            }
        }
    }
    if (counter!=NULL) counter->PutFill();

    memcpy(hd.buf, &ct, hd.bsize);

    // Z方向の歪率, rboundの設定．
    if (!checkBit(mode, MG2CH_NOPARM)) {
        sWord* rz  = (sWord*)hd.buf;
        if (vp.RZxy!=1.0) {     
            hd.kind = hd.kind | HAS_RZXY;
            rz[9] = (sWord)RZXY_RATE;
            rz[8] = (sWord)(vp.RZxy*RZXY_RATE);
        }
        if (vp.base!=0) {
            rz[10] = (sWord)vp.base;
            hd.kind |= HAS_BASE;
        }
        rz[2] = (sWord)vp.rbound.zmin;
        rz[3] = (sWord)vp.rbound.zmax;
        rz[4] = (sWord)vp.rbound.ymin;
        rz[5] = (sWord)vp.rbound.ymax;
        rz[6] = (sWord)vp.rbound.xmin;
        rz[7] = (sWord)vp.rbound.xmax;
        hd.kind |= HAS_RBOUND;
    }

    return hd;
}

Here is the call graph for this function:

Here is the caller graph for this function:

cv::Mat jbxl::copyMSGraph2CvMat

(

MSGraph< T > *

vp

)

[inline]

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 124 of file OpenCVTool.h.

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

{
    cv::Mat mat;

    if (vp->zs<=1) {
        vp->zs = 1;
        mat = cv::Mat_<R>(vp->ys, vp->xs);

        // 通常は連続しているはず
        if (mat.isContinuous()) {
            R* dst = mat.ptr<R>(0);
            for (int i=0; i<vp->xs*vp->ys; i++) {
                dst[i] = (R)vp->gp[i];
            }
        }
        else {
            for (int j=0; j<vp->ys; j++) {
                R* dst = mat.ptr<R>(j);
                T* src = &(vp->gp[j*vp->xs]);
                for (int i=0; i<vp->xs; i++) {
                    dst[i] = (R)src[i];
                }
            }
        }
    }

    //
    else {
        int size[3];
        size[0] = vp->zs;
        size[1] = vp->ys;
        size[2] = vp->xs;
        mat = cv::Mat_<R>(3, size);

        // 通常は連続しているはず
        if (mat.isContinuous()) {
            R* dst = (R*)mat.data;
            for (int i=0; i<vp->xs*vp->ys*vp->zs; i++) {
                dst[i] = (R)vp->gp[i]; 
            }
        }
        else {
            for (int k=0; k<vp->zs; k++) {
                int kk = k*vp->ys*vp->xs;
                for (int j=0; j<vp->ys; j++) {
                    R* dst = mat.ptr<R>(k, j);
                    T* src = &(vp->gp[j*vp->xs + kk]);
                    for (int i=0; i<vp->xs; i++) {
                        dst[i] = (R)src[i];
                    }
                }
            }
        }
    }

    return mat;
}

int jbxl::count_area_MSGraph

(

MSGraph< T >

xp

)

[inline]

template <typename t>=""> int count_area_MSGraph(MSGraph<T> xp)

面積を測る．

Definition at line 230 of file Graph.h.

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

Referenced by dgree_circle_MSGraph().

{
    int ss = 0;

    for (int i=0; i<xp.xs*xp.ys*xp.zs; i++) {
        if (xp.gp[i]!=xp.zero) ss++;
    }
    return ss;
}

Here is the caller graph for this function:

double jbxl::count_around_MSGraph

(

MSGraph< T >

vp

)

[inline]

Definition at line 186 of file Graph.h.

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().

{
    int  i, j, m, n, cc;
    bool    sflg;
    double  cnt;
    const double qs = 0.70710678118654752440084436210;  // sqrt(2.)/2.
    MSGraph<T> xp;

    xp = zoom_MSGraph(vp, 2, OFF);
    if (xp.isNull()) return -1.0;

    cnt = 0.0;
    for (j=1; j<xp.ys-1; j+=2) {
        for (i=1; i<xp.xs-1; i+=2) {
            cc = 0;
            sflg = false;
            for (n=0; n<2; n++) { 
                for (m=0; m<2; m++) {
                    if (xp.point(i+m, j+n)!=vp.zero) {
                        cc++;
                        if (n>0) if (xp.point(i+(1-m), j)!=vp.zero) sflg = true;    // 対角チェック
                    }
                }
            }

            if (cc==1 || cc==3)  cnt += qs;
            else if (cc==2) { 
                if (sflg==false) cnt += 1;
                else             cnt += 2;
            }
        }
    }
    xp.free();

    return cnt;
}

Here is the call graph for this function:

Here is the caller graph for this function:

int jbxl::count_object_MSGraph	(	MSGraph< T >	xp,
		int	mn,
		int	mx
	)			[inline]

Definition at line 242 of file Graph.h.

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.

{
    int  cnt = 0;
    int  nx, ny;
    MSGraph<T> pp;

    pp.mimicry(xp);
    for (int i=0; i<pp.xs*pp.ys*pp.zs; i++) pp.gp[i] = xp.gp[i];

    MSGraph_Paint(pp, 0, 0, pp.zero, pp.zero, mx+1, 4);

    for (int j=0; j<pp.ys; j++) {
        ny = pp.xs*j;
        for (int i=0; i<pp.xs; i++) {
            nx = ny + i;
            if (pp.gp[nx]==pp.zero) {
                MSGraph_Paint(pp, i, j, pp.zero, pp.zero, mx, 8);
            }
        }
    }

    MSGraph_Paint(pp, 0, 0, mx+1, mx+1, pp.zero, 4);

    for (int j=0; j<pp.ys; j++) {
        ny = pp.xs*j;
        for (int i=0; i<pp.xs; i++) {
            nx = ny + i;
            if (pp.gp[nx]>=mn && pp.gp[nx]<=mx) {
                 MSGraph_Paint(pp, i, j, mn, mx, pp.zero, 8);
                 cnt++;
            }
        }
    }
    pp.free();

    return cnt;
}

Here is the call graph for this function:

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

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

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

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

Parameters:

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

Definition at line 701 of file TriBrep.cpp.

References AddVertex2Octree(), BREP_VERTEX, BREP_VERTEX::calc_normal, BREP_VERTEX::CloseData(), CreateContourByVertex(), IsForbiddenEdge(), BREP_VERTEX::normal, BREP_SOLID::octree, BREP_VERTEX::point, BREP_FACET::shell, BREP_SHELL::solid, and BREP_VERTEX::uvmap.

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

{
    BREP_SOLID*   solid;
    BREP_CONTOUR* contour;
    BREP_VERTEX*  vertex[3];

    solid = facet->shell->solid;

    // Vertex の生成
    for (int i=0; i<3; i++) {
        vertex[i] = new BREP_VERTEX();
        vertex[i]->point = vect[i];
        if (nrml!=NULL) {
            vertex[i]->calc_normal = false;
            vertex[i]->normal = nrml[i];
        }
        if (uvmp!=NULL) {
            vertex[i]->uvmap  = uvmp[i];
        }
        vertex[i]->CloseData();
    }

    // 同じ点がある．または３点が直線上にある．
    if (vertex[0]==vertex[1] || vertex[1]==vertex[2] || vertex[0]==vertex[2]) return NULL;
    if (IsForbiddenEdge(vertex)) return NULL;

    // Vertexをソリッドの Octreeに登録
    BREP_VERTEX* vert;
    for (int i=0; i<3; i++) {
        vert = AddVertex2Octree(vertex[i], solid->octree, dupli);
        if (vert!=vertex[i]) {
            delete vertex[i];
            vertex[i] = vert;
        }
    }

    contour = CreateContourByVertex(facet, vertex); 

    return  contour;
}

Here is the call graph for this function:

Here is the caller graph for this function:

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 750 of file TriBrep.cpp.

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

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

{
    // 同じ点がある．または３点が直線上にある．
    if (vertex[0]==vertex[1] || vertex[1]==vertex[2] || vertex[0]==vertex[2]) return NULL;
    if (IsForbiddenEdge(vertex)) return NULL;

    BREP_CONTOUR* contour = new BREP_CONTOUR(facet);

    // Wingを作る．
    BREP_WING*      wing = contour->CreateWing(vertex[0], vertex[1]);
    if (wing!=NULL) wing = contour->CreateWing(vertex[1], vertex[2]);
    if (wing!=NULL) wing = contour->CreateWing(vertex[2], vertex[0]);
    if (wing!=NULL) {
        contour->CloseData();  // 面の法線ベクトルを計算．
    }
    else {
        delete(contour);
        contour = NULL;
    }

    return  contour;
}

Here is the call graph for this function:

Here is the caller graph for this function:

DllExport void CreateContoursList

(

BREP_SOLID *

solid

)

void jbxl:: CreateContoursList(BREP_SOLID* solid)

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

Definition at line 24 of file TriBrep.cpp.

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().

{
    solid->contours.clear();

    BREP_SHELL_LIST shells = solid->shells;
    BREP_SHELL_LIST::iterator ishell;
    for (ishell=shells.begin(); ishell!=shells.end(); ishell++){
        BREP_FACET* pbfc;
        BREP_FACET_LIST::iterator ifacet;
        for (ifacet =(*ishell)->facets.begin(); ifacet!=(*ishell)->facets.end(); ifacet++){
            if ((*ifacet)->deletable && !(*ifacet)->notdelete) {
                pbfc = *ifacet;
                ifacet = (*ishell)->facets.erase(ifacet);
                ifacet--;
                pbfc->shell = NULL;
                delete(pbfc);
            }
            else {
                BREP_CONTOUR_LIST::iterator icon;
                for (icon=(*ifacet)->outer_contours.begin(); icon!=(*ifacet)->outer_contours.end(); icon++) {
                    (*ifacet)->deletable = false;
                    solid->contours.push_back(*icon);
                }
            }
        }
    }
    solid->facetno = (int)solid->contours.size();
}

Here is the caller graph for this function:

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

Definition at line 1037 of file Brep.cpp.

References BREP_EDGE, and BREP_EDGE::CloseData().

Referenced by CreateWingWithoutContour().

{
    if (v1==v2) return NULL;

    BREP_EDGE* edge = new BREP_EDGE(v1, v2);
    edge->CloseData();

    return edge;
}

Here is the call graph for this function:

Here is the caller graph for this function:

DllExport void CreateShortageWingsList

(

BREP_SOLID *

solid

)

void jbxl::CreateShortageWingsList(BREP_SOLID* solid)

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

Definition at line 110 of file TriBrep.cpp.

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

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

{
    solid->shortage_wings.clear();

    BREP_WING_LIST::iterator iwing;
    for (iwing=solid->wings.begin(); iwing!=solid->wings.end(); iwing++){
        if ((*iwing)->contour==NULL) solid->shortage_wings.push_back(*iwing);
    }
}

Here is the caller graph for this function:

DllExport void CreateSurplusContoursList

(

BREP_SOLID *

solid

)

void jbxl::CreateSurplusContoursList(BREP_SOLID* solid)

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

Definition at line 88 of file TriBrep.cpp.

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

Referenced by CloseTriSolid(), and DeleteSurplusContours().

{
//  DEBUG_MODE PRINT_MESG("Start CreateSurplusContoursList\n");
    solid->surplus_contours.clear();

    BREP_CONTOUR_LIST::iterator icon;
    for (icon=solid->contours.begin(); icon!=solid->contours.end(); icon++){
        if (DupEdgeNumber(*icon)>0) {
            solid->surplus_contours.push_back(*icon);
        }
    }
//  DEBUG_MODE PRINT_MESG("END CreateSurplusContoursList\n");
}

Here is the call graph for this function:

Here is the caller graph for this function:

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	ソリッドデータへのポインタ
	stldata	STLデータへのポインタ
	fno	Facet(STLデータ)の数
	check	データの不正検査を行うか？

Return values:

	-1	ソリッドがNULL，stldataがNULL またはソリッドの Octreeが NULL
	-3	操作がキャンセルされた．

Definition at line 1256 of file TriBrep.cpp.

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.

{
    BREP_SHELL*   shell;
    BREP_FACET*   facet;
    BREP_CONTOUR* contour;
    CVCounter* counter = NULL;
    Vector<double> v[4];

    if (solid==NULL || stldata==NULL) return -1;
    if (solid->octree==NULL) return -1; 

    solid->contours.clear();

    // カウンタ
    int intvl = 1;
    if (solid->counter!=NULL) {
        counter = solid->counter->GetUsableCounter();
        if (counter!=NULL) {
            counter->SetMax(100);
            counter->ResetRate(80, 100);
            intvl = Max(1, fno/100);
        }
    }

    shell = new BREP_SHELL(solid);
    for (int i=0; i<fno; i++) {
        // 読み込んだ STLデータを作業用Vector変数に格納
        v[0].x = stldata[i].vect[3]; v[0].y = stldata[i].vect[4];  v[0].z = stldata[i].vect[5];
        v[1].x = stldata[i].vect[6]; v[1].y = stldata[i].vect[7];  v[1].z = stldata[i].vect[8]; 
        v[2].x = stldata[i].vect[9]; v[2].y = stldata[i].vect[10]; v[2].z = stldata[i].vect[11];
        // ここでは法線ベクトルは 再計算させる．

        facet = new BREP_FACET(shell); 
        contour = CreateContourByVector(facet, v, NULL, NULL, false);
        if (contour!=NULL) {
/*
            if (check) {    
                // 衝突判定
                BREP_CONTOUR* collision;
                facet->CloseData();
                if (!IsCollisionContours(solid, contour, &collision)) {
                    solid->contours.push_back(contour);             // IsCollisionContours()用
                }
                else {
                    collision->facet->deletable = true;             // 衝突相手も消す．
                    FastDeleteFacet(facet);
                }
            }
            else  solid->contours.push_back(contour);
*/
            solid->contours.push_back(contour);
        }
        else  {
            deleteNull(facet);          // 中身は空
        }

        if (counter!=NULL && i%intvl==0) {
            counter->StepIt();
            if (counter->isCanceled()) {
                deleteNull(facet);
                return -3;
            }
        }
    }
    if (counter!=NULL) counter->PutFill();

    // 
    fno = CloseTriSolid(solid, check, counter);

    return fno;
}

Here is the call graph for this function:

DllExport int CreateTriSolidFromVector	(	BREP_SOLID *	solid,
		int	vno,
		Vector< double > *	vect,
		Vector< double > *	nrml = NULL,
		UVMap< double > *	uvmp = 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, bool dupli, bool check)

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

Parameters:

	solid	ソリッドデータへのポインタ
	vno	頂点データの数
	vect	頂点の座標データへのポインタ．
	nrml	頂点の法線ベクトルデータへのポインタ．
	uvmp	頂点の曲面座標データへのポインタ．
	dupli	true: 頂点の重複登録を許可する．false: 重複登録を許可しない．
	check	データの不正検査を行うか？

Return values:

	-1	ソリッドがNULL，stldataがNULL またはソリッドの Octreeが NULL
	-3	操作がキャンセルされた．

Definition at line 1347 of file TriBrep.cpp.

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 MeshObjectNode::computeVertexByBREP().

{
    BREP_SHELL*   shell;
    BREP_FACET*   facet;
    BREP_CONTOUR* contour;
    CVCounter* counter = NULL;
    int fno = vno/3;

    if (solid==NULL || vect==NULL) return -1;
    if (solid->octree==NULL) return -1; 

    solid->contours.clear();

    // カウンタ
    int intvl = 1;
    if (solid->counter!=NULL) {
        counter = solid->counter->GetUsableCounter();
        if (counter!=NULL) {
            counter->SetMax(100);
            counter->ResetRate(80, 100);
            intvl = Max(1, fno/100);
        }
    }

    Vector<double>* normal = NULL;
    UVMap<double>*  uvmap  = NULL;
    shell = new BREP_SHELL(solid);
    //
    for (int i=0; i<fno; i++) {
        facet = new BREP_FACET(shell); 
        if (nrml!=NULL) normal = nrml + i*3;
        if (uvmp!=NULL) uvmap  = uvmp + i*3;
        contour = CreateContourByVector(facet, vect+i*3, normal, uvmap, dupli);

        if (contour!=NULL) {
/*
            if (check) {    
                // 衝突判定．
                BREP_CONTOUR* collision;
                facet->CloseData();
                if (!IsCollisionContours(solid, contour, &collision)) {
                    solid->contours.push_back(contour);             // IsCollisionContours()用
                }
                else {
                    collision->facet->deletable = true;             // 衝突相手も消す．
                    FastDeleteFacet(facet);
                }
            }
            else  solid->contours.push_back(contour);
*/
            solid->contours.push_back(contour);
        }
        else  {
            deleteNull(facet);          // 中身は空
        }

        if (counter!=NULL && i%intvl==0) {
            counter->StepIt();
            if (counter->isCanceled()) {
                deleteNull(facet);
                return -3;
            }
        }
    }
    if (counter!=NULL) counter->PutFill();

    //
    fno = CloseTriSolid(solid, check, counter);
    
    return fno;
}

Here is the call graph for this function:

Here is the caller graph for this function:

DllExport void CreateWingsList

(

BREP_SOLID *

solid

)

void jbxl::CreateWingsList(BREP_SOLID* solid)

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

Definition at line 61 of file TriBrep.cpp.

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().

{
    solid->wings.clear();

    BREP_CONTOUR_LIST::iterator icon;
    for (icon=solid->contours.begin(); icon!=solid->contours.end(); icon++) {
        BREP_WING* first = (*icon)->wing;
        if (first!=NULL) {
            BREP_WING* next = first;
            do {
                BREP_WING* wing = next;
                next = wing->next;
                solid->wings.push_back(wing);
                if (!wing->edge->complete) solid->wings.push_back(GetWingOtherSide(wing));
            } while(next!=first);
        }
    }
}

Here is the call graph for this function:

Here is the caller graph for this function:

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 861 of file Brep.cpp.

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().

{
    BREP_WING* wing = NULL;

    // vertex1 - vertex2 間にエッジが既に登録されているかどうかチェックする．
    BREP_EDGE* edge = FindEdge(vertex1, vertex2);
    if (edge==NULL) { // Edgeは存在しない．
        edge = CreateEdge(vertex1, vertex2);
        if (edge==NULL) return NULL;    // vertex1==vertex2 なら NULL
        wing = edge->wing1;
    }
    else{ // Edgeは既に存在する．
        if      (edge->wing1->vertex==vertex1) wing = edge->wing1;
        else if (edge->wing2->vertex==vertex1) wing = edge->wing2;
        
        // Wingが既に Contourで使われている場合，他の Wingを探す．
        if (edge->edge_list!=NULL && wing!=NULL && wing->contour!=NULL) {
            BREP_EDGE_LIST::iterator iedge=edge->edge_list->begin();
            while (iedge!=edge->edge_list->end() && wing->contour!=NULL) {
                if      ((*iedge)->wing1->vertex==vertex1) wing = (*iedge)->wing1;
                else if ((*iedge)->wing2->vertex==vertex1) wing = (*iedge)->wing2;
                iedge++;
            }
        }

        // このWingは既に Contourで使われているか？
        if (wing!=NULL && wing->contour!=NULL){
            // 新しくEdgeを作り直す
            BREP_EDGE* new_edge = CreateEdge(vertex1, vertex2);
            if (new_edge==NULL) return NULL;

            if (edge->edge_list==NULL) {
                edge->edge_list = new BREP_EDGE_LIST();
                edge->edge_list->push_back(edge);
            }
            edge->edge_list->push_back(new_edge);
            new_edge->edge_list = edge->edge_list;
            wing = new_edge->wing1;
        }
    }

    return wing;
}

Here is the call graph for this function:

Here is the caller graph for this function:

MSGraph<T> jbxl::cut_object_MSGraph	(	MSGraph< T >	vp,
		RBound< int >	rb,
		bool	ecnt = false
	)			[inline]

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 1687 of file Graph.h.

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.

{
    int  i, j, k;
    int  cx, cy, cz, cp;
    int  ax, ay, az, ap;
    MSGraph<T> xp;  // = new MSGraph<T>();

    xp.init();
    RBound<int> rx(0, vp.xs-1, 0, vp.ys-1, 0, vp.zs-1);
    CVCounter* counter = NULL;

    if (ecnt) counter = GetUsableGlobalCounter();
    if (counter!=NULL) {
        if (counter->isCanceled()) {
            xp.state = JBXL_GRAPH_CANCEL;
            return xp;
        }
        counter->SetMax(vp.zs*2);
    }

    rb.commonarea(rx);
    xp.set(rb.xmax-rb.xmin+1, rb.ymax-rb.ymin+1, rb.zmax-rb.zmin+1, vp.zero, vp.base, vp.RZxy);
    if (xp.isNull()) {
        xp.state = JBXL_GRAPH_MEMORY_ERROR;
        return xp;
    }
    xp.rbound = rb;
    xp.color  = vp.color;

    ap = vp.xs*vp.ys;
    cp = xp.xs*xp.ys;

    for (k=0; k<xp.zs; k++) {
        cz = cp*k;
        az = ap*(k+rb.zmin);
        for (j=0; j<xp.ys; j++) {
            cy = cz + xp.xs*j;
            ay = az + vp.xs*(j+rb.ymin);
            for (i=0; i<xp.xs; i++) {
                cx = cy + i;
                ax = ay + i + rb.xmin;
                xp.gp[cx] = vp.gp[ax];
                
                if (cx==0) xp.max = xp.min = xp.gp[cx];
                else {
                    xp.max = Max(xp.max, xp.gp[cx]);
                    xp.min = Min(xp.min, xp.gp[cx]);
                }
            }
        }

        // Counter
        if (counter!=NULL) {
            counter->StepIt();
            if (counter->isCanceled()) {
                xp.state = JBXL_GRAPH_CANCEL;
                return xp;
            }
        }
    }
    xp.rbound.cutdown(vp.rbound);

    return xp;
}

Here is the call graph for this function:

MSGraph<T> jbxl::cut_object_MSGraph	(	MSGraph< T >	vp,
		int	mn,
		int	mx,
		RBound< int >	rbound,
		int	blank = BOUNDARY_BLANK,
		bool	ecnt = false
	)			[inline]

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 1577 of file Graph.h.

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.

{
    int  i, j, k, n;
    int  cx, cy, cz, cp;
    int  ax, ay, az, ap;
    MSGraph<T> xp;  // = new MSGraph<T>();

    xp.init();
    RBound<int> rb(vp.xs-1, 0, vp.ys-1, 0, vp.zs-1, 0);
    RBound<int> rx(0, vp.xs-1, 0, vp.ys-1, 0, vp.zs-1);
    CVCounter* counter = NULL;

    if (ecnt) counter = GetUsableGlobalCounter();
    if (counter!=NULL) {
        if (counter->isCanceled()) {
            xp.state = JBXL_GRAPH_CANCEL;
            return xp;
        }
        counter->SetMax(vp.zs*2);
    }

    rbound.commonarea(rx);
    ap = vp.xs*vp.ys;
    n  = 0;
    for (k=rbound.zmin; k<=rbound.zmax; k++) {
        az = ap*k;
        for (j=rbound.ymin; j<=rbound.ymax; j++) {
            ay = az + vp.xs*j;
            for (i=rbound.xmin; i<=rbound.xmax; i++) {
                ax = ay + i;
                if (vp.gp[ax]>=(T)mn && vp.gp[ax]<=(T)mx) {
                    n++;
                    rb.fusion(i, j, k);
                }
            }
        }

        // Counter
        if (counter!=NULL) {    
            counter->StepIt();
            if (counter->isCanceled()) {
                xp.state = JBXL_GRAPH_CANCEL;
                return xp;
            }
        }
    }

    if (n==0) {
        xp.state = JBXL_GRAPH_NODATA_ERROR;
        return xp;
    }

    if (blank>0) rb.enlarge(blank);
    rb.commonarea(rbound);

    xp.set(rb.xmax-rb.xmin+1, rb.ymax-rb.ymin+1, rb.zmax-rb.zmin+1, vp.zero, vp.base, vp.RZxy);
    if (xp.isNull()) {
        xp.state = JBXL_GRAPH_MEMORY_ERROR;
        return xp;
    }
    xp.rbound = rb;
    xp.min    = (T)mx;
    xp.max    = (T)mn;
    xp.color  = vp.color;

    cp = xp.xs*xp.ys;
    for (k=0; k<xp.zs; k++) {
        cz = cp*k;
        az = ap*(k+rb.zmin);
        for (j=0; j<xp.ys; j++) {
            cy = cz + xp.xs*j;
            ay = az + vp.xs*(j+rb.ymin);
            for (i=0; i<xp.xs; i++) {
                cx = cy + i;
                ax = ay + i + rb.xmin;
                if (vp.gp[ax]>=(T)mn && vp.gp[ax]<=(T)mx) {
                    xp.gp[cx] = vp.gp[ax];
                    xp.max = Max(xp.max, xp.gp[cx]);
                    xp.min = Min(xp.min, xp.gp[cx]);
                }
            }
        }

        // Counter
        if (counter!=NULL) {
            counter->StepIt();
            if (counter->isCanceled()) {
                xp.state = JBXL_GRAPH_CANCEL;
                return xp;
            }
        }
    }
    xp.rbound.cutdown(vp.rbound);

    return xp;
}

Here is the call graph for this function:

MSGraph<T> jbxl::cut_object_MSGraph	(	MSGraph< T >	vp,
		int	mn,
		int	mx,
		int	blank = BOUNDARY_BLANK,
		bool	ecnt = false
	)			[inline]

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 1464 of file Graph.h.

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.

{
    int  i, j, k, n;
    int  cx, cy, cz, cp;
    int  ax, ay, az, ap;
    MSGraph<T> xp;  // = new MSGraph<T>();

    xp.init();
    RBound<int> rb(vp.xs-1, 0, vp.ys-1, 0, vp.zs-1, 0);
    RBound<int> rx(0, vp.xs-1, 0, vp.ys-1, 0, vp.zs-1);
    CVCounter* counter = NULL;

    if (ecnt) counter = GetUsableGlobalCounter();
    if (counter!=NULL) {
        if (counter->isCanceled()) {
            xp.state = JBXL_GRAPH_CANCEL;
            return xp;
        }
        counter->SetMax(vp.zs*2);
    }

    ap = vp.xs*vp.ys;
    n  = 0;
    for (k=0; k<vp.zs; k++) {
        az = ap*k;
        for (j=0; j<vp.ys; j++) {
            ay = az + vp.xs*j;
            for (i=0; i<vp.xs; i++) {
                ax = ay + i;
                if (vp.gp[ax]>=(T)mn && vp.gp[ax]<=(T)mx) {
                    n++;
                    rb.fusion(i, j, k);
                }
            }
        }
    
        // Counter
        if (counter!=NULL) {    
            counter->StepIt();
            if (counter->isCanceled()) {
                xp.state = JBXL_GRAPH_CANCEL;
                return xp;
            }
        }
    }

    if (n==0) {
        xp.state = JBXL_GRAPH_NODATA_ERROR;
        return xp;
    }

    if (blank>0) rb.enlarge(blank);
    rb.commonarea(rx);

    xp.set(rb.xmax-rb.xmin+1, rb.ymax-rb.ymin+1, rb.zmax-rb.zmin+1, vp.zero, vp.base, vp.RZxy);
    if (xp.isNull()) {
        xp.state = JBXL_GRAPH_MEMORY_ERROR;
        return xp;
    }
    xp.rbound = rb;
    xp.min    = (T)mx;
    xp.max    = (T)mn;
    xp.color  = vp.color;

    cp = xp.xs*xp.ys;
    for (k=0; k<xp.zs; k++) {
        cz = cp*k;
        az = ap*(k+rb.zmin);
        for (j=0; j<xp.ys; j++) {
            cy = cz + xp.xs*j;
            ay = az + vp.xs*(j+rb.ymin);
            for (i=0; i<xp.xs; i++) {
                cx = cy + i;
                ax = ay + (i+rb.xmin);
                if (vp.gp[ax]>=(T)mn && vp.gp[ax]<=(T)mx) {
                    xp.gp[cx] = vp.gp[ax];
                    xp.max = Max(xp.max, xp.gp[cx]);
                    xp.min = Min(xp.min, xp.gp[cx]);
                }
            }
        }

        // Counter
        if (counter!=NULL) {
            counter->StepIt();
            if (counter->isCanceled()) {
                xp.state = JBXL_GRAPH_CANCEL;
                return xp;
            }
        }
    }

    xp.rbound.cutdown(vp.rbound);

    return xp;
}

Here is the call graph for this function:

rectangle* jbxl::cvDetectObjects	(	cv::CascadeClassifier	cascade,
		MSGraph< T > *	vp,
		int &	num,
		int	sz = 0,
		double	scale = 1.0
	)			[inline]

Parameters:

	cascade	識別エンジン
	vp	1plane(channel) MSGraphデータ（つまりモノクロ）へのポインタ
[out]	num	要素の数
	sz	検出する最小のサイズ
	scale	縮小スケール

Definition at line 67 of file OpenCVTool.h.

{
    num = 0;

    cv::Mat imag = copyMSGraph2CvMat<uByte>(vp);
    cv::equalizeHist(imag, imag);

    cv::Mat simg = imag;
    if (scale>1.0) {
        simg = cv::Mat_<uByte>((int)(imag.rows/scale), (int)(imag.cols/scale));
        cv::resize(imag, simg, simg.size(), 0, 0, cv::INTER_LINEAR);
    }
    else scale = 1.0;
    
    std::vector<cv::Rect> faces;
    if (sz>1) cascade.detectMultiScale(simg, faces, 1.1, 3, 0, cv::Size(sz, sz));
    else      cascade.detectMultiScale(simg, faces);

    num = (int)faces.size();
    if (num==0) return NULL;

    int len = sizeof(rectangle)*num;
    rectangle* data = (rectangle*)malloc(len);
    if (data==NULL) return NULL;
    memset(data, 0, len);

    int n = 0;
    std::vector<cv::Rect>::const_iterator r;    
    for (r=faces.begin(); r!=faces.end(); r++) {
        data[n].x     = (int)(r->x*scale);
        data[n].y     = (int)(r->y*scale);
        data[n].xsize = (int)(r->width *scale); 
        data[n].ysize = (int)(r->height*scale); 
        n++;
    }

    return data;
}

void jbxl::del_tList_object

(

tList **

lp

)

[inline]

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

References del_tList().

{
    tList* lt = *lp;

    while(lt!=NULL) {
        T* pp = (T*)lt->ldat.ptr;
        pp->free();
        delete(pp);
        lt->ldat.ptr = NULL;
        lt->ldat.sz  = 0;
        lt = lt->next;
    }
    del_tList(lp);
}

Here is the call graph for this function:

bool deletable	(	MSGraph< T >	vp,
		int	n,
		int	c,
		int	d
	)			[inline]

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 272 of file Thinning.h.

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().

{
    int  i, j, k, l, m, lz, ly, mz, my;
    int  cn, mm, nh;
    int  v[27];
    bool ret;

    if (d<3) {                          // 2D-   YET NO IMPLIMENT 
        mm = 9;
        for (j=-1; j<=1; j++) {
            ly = (j+1)*3;
            my = n + j*vp.xs;
            for (i=-1; i<=1; i++) {
                l = ly + (i+1);
                m = my + i;
                if (vp.gp[m]!=0) v[l] = 1;
                else             v[l] = 0;
            }
        }
        DEBUG_MODE PRINT_MESG("DELETABLE: 2D mode is not supported.\n");
        return false;
    }
    else {                              // for 3D 
        mm = 27;
        for (k=-1; k<=1; k++) {
            lz = (k+1)*9;
            mz = n + k*vp.xs*vp.ys;
            for (j=-1; j<=1; j++) {
                ly = lz + (j+1)*3;
                my = mz + j*vp.xs;
                for (i=-1; i<=1; i++) {
                    l = ly + (i+1);
                    m = my + i;
                    if (vp.gp[m]>0) v[l] = 1;
                    else            v[l] = 0;
                }
            }
        }
    }

    cn = connectNumber(v, c, d);
    if (cn==-1 || cn!=1) return false;

    if (c==26 || c==8) {
        v[c/2] = 1 - v[c/2];
        for(i=0; i<mm; i++) v[i] = 1 - v[i];
    }

    nh = v[10] + v[12] + v[14] + v[16] + v[4] + v[22];
    if    (nh<=3) ret = true;
    else if (nh==4) ret = deletable_s(v);
    else if (nh==5) ret = deletable_4(v);
    else if (nh==6) ret = deletable_5(v);

    return  ret;
}

Here is the call graph for this function:

Here is the caller graph for this function:

bool deletable_4

(

int *

v

)

Definition at line 107 of file Thinning.cpp.

References deletable_s().

Referenced by deletable().

{
    int  i, w[6], u[6];

    bool ret = deletable_s(v);
    if (!ret) return false;

    u[0] = v[ 4];
    u[1] = v[10];
    u[2] = v[12];
    u[3] = v[14];
    u[4] = v[16];
    u[5] = v[22];

    for(i=0; i<6; i++)   w[i] = 0;

    if (v[ 1]==1) w[0] = w[1] = 1;
    if (v[ 3]==1) w[0] = w[2] = 1;
    if (v[ 5]==1) w[0] = w[3] = 1;
    if (v[ 7]==1) w[0] = w[4] = 1;
    if (v[ 9]==1) w[1] = w[2] = 1;
    if (v[11]==1) w[1] = w[3] = 1;
    if (v[15]==1) w[2] = w[4] = 1;
    if (v[17]==1) w[3] = w[4] = 1;
    if (v[19]==1) w[1] = w[5] = 1;
    if (v[21]==1) w[2] = w[5] = 1;
    if (v[23]==1) w[3] = w[5] = 1;
    if (v[25]==1) w[4] = w[5] = 1;

    ret = true;
    for(i=0; i<6; i++) if (w[i]==0 && u[i]==1) ret = false;
    
    return  ret;
}

Here is the call graph for this function:

Here is the caller graph for this function:

bool deletable_5

(

int *

v

)

Definition at line 143 of file Thinning.cpp.

Referenced by deletable().

{
    int  i, j, k, m, s;
    int  mz[6][6], mx[6][6], mm[6][6];

    mm[0][1] = mm[1][0] = v[ 3];
    mm[0][2] = mm[2][0] = v[ 7];
    mm[0][3] = mm[3][0] = v[ 1];
    mm[0][4] = mm[4][0] = v[ 5];
    mm[1][2] = mm[2][1] = v[15];
    mm[1][3] = mm[3][1] = v[ 9];
    mm[1][5] = mm[5][1] = v[21];
    mm[2][4] = mm[4][2] = v[17];
    mm[2][5] = mm[5][2] = v[25];
    mm[3][4] = mm[4][3] = v[11];
    mm[3][5] = mm[5][3] = v[19];
    mm[4][5] = mm[5][4] = v[23];

    for(i=0; i<6; i++) {            // I+M 
        for(j=0; j<6; j++) {
            mx[i][j] = mm[i][j];
            if (i==j) mx[i][i]++;
        }
    }

    for(i=0; i<6; i++) {            // M(I+M) 
        for(j=0; j<6; j++) {
            m = 0;
            for(k=0; k<6; k++) {
                m = m + mm[i][k]*mx[k][j];
            }
            mz[i][j] = m; 
        }
    }
        
    for(i=0; i<6; i++) {            // I+M(I+M) 
        mz[i][i] = 1 + mz[i][i];
    }

    for(i=0; i<6; i++) {            // M(I+M(I+M)) 
        for(j=0; j<6; j++) {
            m = 0;
            for(k=0; k<6; k++) {
                m = m + mm[i][k]*mz[k][j];
            }
            mx[i][j] = m; 
        }
    }

    for(i=0; i<6; i++) {            // I+M(I+M(I+M)) 
        mx[i][i] = 1 + mx[i][i];
    }

    for(i=0; i<6; i++) {            // M(I+M(I+M(I+M))) 
        for(j=0; j<6; j++) {
            m = 0;
            for(k=0; k<6; k++) {
                m = m + mm[i][k]*mx[k][j];
            }
            mz[i][j] = m; 
        }
    }

    for(i=0; i<6; i++) {            // I+M(I+M(I+M(I+M))) 
        mz[i][i] = 1 + mz[i][i];
    }

    s = 1;
    for(i=0; i<6; i++) {            // M(I+M(I+M(I+M(I+M)))) 
        for(j=0; j<6; j++) {
            m = 0;
            for(k=0; k<6; k++) {
                m = m + mm[i][k]*mz[k][j];
            }
            s = s*m; 
        }
    }

    if (s==0)  return  false;
    else       return  true;
}

Here is the caller graph for this function:

bool deletable_s

(

int *

v

)

Definition at line 89 of file Thinning.cpp.

Referenced by deletable(), and deletable_4().

{
    int  s;

    s = (1-v[ 6])*v[ 3]*v[ 7]*v[ 4]*v[12]*v[15]*v[16] +
        (1-v[ 8])*v[ 7]*v[ 5]*v[ 4]*v[16]*v[17]*v[14] +
        (1-v[ 2])*v[ 5]*v[ 1]*v[ 4]*v[14]*v[11]*v[10] +
        (1-v[ 0])*v[ 1]*v[ 3]*v[ 4]*v[10]*v[ 9]*v[12] +
        (1-v[24])*v[21]*v[25]*v[22]*v[12]*v[15]*v[16] +
        (1-v[26])*v[25]*v[23]*v[22]*v[16]*v[17]*v[14] +
        (1-v[20])*v[23]*v[19]*v[22]*v[14]*v[11]*v[10] +
        (1-v[18])*v[19]*v[21]*v[22]*v[10]*v[ 9]*v[12];

    if (s==1) return false;
    else      return true;
}

Here is the caller graph for this function:

void jbxl::delete_noise_MSGraph	(	MSGraph< T >	vp,
		int	size,
		int	mode = 8,
		int	work_color = 0
	)			[inline]

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 2484 of file Graph.h.

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

{
    int  i, j, k;
    int  num, ps ,pp;

    ps = vp.xs*vp.ys;
    if (work_color==0) {
        if (vp.max==0 || vp.max==vp.zero) vp.get_minmax();
        work_color = vp.max + 1;
    }

    for(j=0; j<vp.ys; j++) {
        pp = j*vp.xs;         
        for(i=0; i<vp.xs; i++) {                  
            if (vp.gp[i+pp]>vp.zero && vp.gp[i+pp]<work_color) {
                num = addPaint_MSGraph(vp, i, j, 1, work_color-1, work_color, mode);
                if (num<=size) {                    
                    int n = 0;
                    for (k=i+pp; k<ps; k++) {
                        if (vp.gp[k]>=work_color) {
                            vp.gp[k] = vp.zero;
                            n++;
                            if (n>=num) break;
                        }
                    }
                }
                else {
                    int n = 0;
                    for (k=i+pp; k<ps; k++) {
                        if (vp.gp[k]>=work_color) {
                            vp.gp[k] = -vp.gp[k];
                            n++;
                            if (n>=num) break;
                        }
                    }
                }
            }
        }
    }
   
    for (i=0; i<ps; i++) {
        if (vp.gp[i]<vp.zero) vp.gp[i] = - vp.gp[i] - work_color;
    }
}

Here is the call graph for this function:

void jbxl::deleteNull

(

T &

p

)

[inline]

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

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

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

Here is the caller graph for this function:

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 258 of file TriBrep.cpp.

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().

{
    if (solid->shortage_wings.empty()) return;
//  DEBUG_MODE PRINT_MESG("Start DeleteShortageWings\n");

    CVCounter* counter = NULL;
    if (solid->counter!=NULL) counter = solid->counter->GetUsableCounter();
    if (counter!=NULL) counter->SetMax((int)solid->shortage_wings.size());

    BREP_WING_LIST::iterator iwing;
    for (iwing=solid->shortage_wings.begin(); iwing!=solid->shortage_wings.end(); iwing++){
        if ((*iwing)->contour!=NULL) (*iwing)->contour->facet->deletable = true;
        BREP_WING* othwing = GetWingOtherSide(*iwing);
        if (othwing->contour!=NULL)  othwing->contour->facet->deletable = true;
        if (counter!=NULL) counter->StepIt();
    }

    CreateContoursList(solid);
    CreateWingsList(solid);
//  DEBUG_MODE PRINT_MESG("End   DeleteShortageWings\n");
    return;
}

Here is the call graph for this function:

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 217 of file TriBrep.cpp.

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().

{
    if (solid->shortage_wings.empty()) return;
//  DEBUG_MODE PRINT_MESG("Start DeleteStraightEdges\n");

    CVCounter* counter = NULL;
    if (solid->counter!=NULL) counter = solid->counter->GetUsableCounter();
    if (counter!=NULL) counter->SetMax((int)solid->shortage_wings.size());

    BREP_WING_LIST::iterator wing1;
    for (wing1=solid->shortage_wings.begin(); wing1!=solid->shortage_wings.end(); wing1++){
        BREP_VERTEX* vert[3];
        vert[0] = (*wing1)->vertex;
        BREP_WING_LIST::iterator wing2;
        for (wing2=solid->shortage_wings.begin(); wing2!=solid->shortage_wings.end(); wing2++){
            if (IsConnectEdges(*wing1, *wing2)) {
                vert[1] = (*wing2)->vertex;
                vert[2] = GetWingOtherSide(*wing2)->vertex;
                IsForbiddenEdge(vert);  // 直線に並んだ Vertexを禁止する．
            }
        }
        if (counter!=NULL) counter->StepIt();
    }
    CreateContoursList(solid);          // 該当Contour(Facet)を削除し，全てのContour(Facet)の Listを作り直す．
    CreateWingsList(solid);             // WingsListを作り直す．
    
//  DEBUG_MODE PRINT_MESG("End   DeleteStraightEdges\n");
    return;
}

Here is the call graph for this function:

Here is the caller graph for this function:

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 146 of file TriBrep.cpp.

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

Referenced by CloseTriSolid().

{
    if (solid->surplus_contours.empty()) return;
//  DEBUG_MODE PRINT_MESG("Start DeleteSurplusContours\n");
    
    CVCounter* counter = NULL;
    if (solid->counter!=NULL) counter = solid->counter->GetUsableCounter();
    if (counter!=NULL) counter->SetMax((int)solid->surplus_contours.size()*3);
    
    BREP_CONTOUR_LIST::iterator icon;
    // ３つの多重Edgeを持つ Facetの処理
    for (icon=solid->surplus_contours.begin(); icon!=solid->surplus_contours.end(); icon++){
        if ((*icon)->dup_edge==3) (*icon)->facet->deletable = true;
        if (counter!=NULL) counter->StepIt();
    }
    ReverseContours(solid);         // ３辺が多重Edgeの Facetを裏返す
    CreateShortageWingsList(solid);
    JoinShortageWings(solid);       // 一つにまとまるEdgeは一つにまとめる．

    CreateSurplusContoursList(solid);
    if (solid->surplus_contours.empty()) {
//      DEBUG_MODE PRINT_MESG("End   DeleteSurplusContours\n");
        return;
    }

    // ２つの多重Edgeを持つ Facetの処理
    for (icon=solid->surplus_contours.begin(); icon!=solid->surplus_contours.end(); icon++){
        if ((*icon)->dup_edge==2) (*icon)->facet->deletable = true;
        if (counter!=NULL) counter->StepIt();
    }
    ReverseContours(solid);         // ２辺が多重Edgeの Facetを裏返す
    CreateShortageWingsList(solid);
    JoinShortageWings(solid);   

    CreateSurplusContoursList(solid);
    if (solid->surplus_contours.empty()) {
//      DEBUG_MODE PRINT_MESG("End   DeleteSurplusContours\n");
        return;
    }

    // １つの多重Edgeを持つ Facetの処理
    for (icon=solid->surplus_contours.begin(); icon!=solid->surplus_contours.end(); icon++){
        if ((*icon)->dup_edge==1) (*icon)->facet->deletable = true;
        if (counter!=NULL) counter->StepIt();
    }
    ReverseContours(solid);         // １辺が多重Edgeの Facetを裏返す
    CreateShortageWingsList(solid);
    JoinShortageWings(solid);   
        
    CreateSurplusContoursList(solid);
    if (!solid->surplus_contours.empty()) {
//      DEBUG_MODE PRINT_MESG("EraseSurplusContour: 多重Edgeを持つ Facetデータが残っている？\n");
    }
//  DEBUG_MODE PRINT_MESG("End   DeleteSurplusContours\n");
    return;
}

Here is the call graph for this function:

Here is the caller graph for this function:

MeshObjectNode * DelMeshObjectNode

(

MeshObjectNode *

node

)

Definition at line 394 of file MeshObjectData.cpp.

References freeMeshObjectNode(), MeshObjectNode::next, and MeshObjectNode::prev.

{
    if (node==NULL) return NULL;

    if (node->prev!=NULL) node->prev->next = node->next;
    if (node->next!=NULL) node->next->prev = node->prev;
            
    MeshObjectNode* next = node->next;
    freeMeshObjectNode(node);

    return next;
}

Here is the call graph for this function:

MSGraph<T> jbxl::Density_Filter	(	MSGraph< T >	vp,
		int	size,
		double	rate,
		int	mode = 8,
		int	work_color = 0
	)			[inline]

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 2426 of file Graph.h.

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.

{
    MSGraph<T> pp, xp, wp;
    int hsize = size/2;

    if (work_color==0) {
        if (vp.max==0 || vp.max==vp.zero) vp.get_minmax();
        work_color = vp.max + 1;
    }

    if (hsize==0) hsize = 1;
    size = hsize*2 + 1;
    pp.set(size, size, 1, vp.zero, vp.base);
    wp.mimicry(vp);

    for (int j=hsize; j<vp.ys-hsize; j++) {
        for (int i=hsize; i<vp.xs-hsize; i++) {

            for (int m=-hsize; m<=hsize; m++) {
                int vx = (m+j)*vp.xs + i;
                int px = (m+hsize)*pp.xs + hsize;

                for (int n=-hsize; n<=hsize; n++) {
                    pp.gp[px+n] = vp.gp[vx+n];
                }
            }

            xp = Density_Mask<T>(pp, rate, mode, work_color);

            if (xp.state!=0) {
                for (int m=-hsize; m<=hsize; m++) {
                    int wx = (m+j)*wp.xs + i;
                    int xx = (m+hsize)*xp.xs + hsize;

                    for (int n=-hsize; n<=hsize; n++) {
                        if (xp.gp[xx+n]!=vp.zero) {
                            wp.gp[wx+n] = xp.gp[xx+n];
                        }
                    }
                }
            }
            xp.free();
        }
    }

    pp.free();
    return wp;
}

Here is the call graph for this function:

MSGraph<T> jbxl::Density_Mask	(	MSGraph< T >	vp,
		double	rate,
		int	mode = 8,
		int	work_color = 0
	)			[inline]

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 2351 of file Graph.h.

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.

{
    MSGraph<T> pp;
    int  ps = vp.xs*vp.ys;

    if (work_color==0) {
        if (vp.max==0 || vp.max==vp.zero) vp.get_minmax();
        work_color = vp.max + 1;
    }
    pp.mimicry(vp);

    if ((int)(ps*rate+0.5)==ps) {
        int  eflg = OFF;
        for (int i=0; i<ps; i++) {
            if (vp.gp[i]==vp.zero) {
                pp.state = 0;
                eflg = ON;
                break;
            }
        }
        if (eflg==OFF) {
            for (int i=0; i<ps; i++) pp.gp[i] = vp.gp[i];
            pp.state = ps;
        }
        return pp;
    }

    MSGraph<T> xp;
    xp.set(vp.xs+2, vp.ys+2, 1, vp.zero, vp.base, vp.RZxy);
    xp.color = vp.color;

    for (int j=0; j<vp.ys; j++) {
        for (int i=0; i<vp.xs; i++) {
            xp.gp[(j+1)*xp.xs+i+1] = vp.gp[j*vp.xs+i];
        }
    }
    set_around_MSGraph(xp, xp.zero+1);
    MSGraph_Paint(xp, 0, 0, xp.zero+1, work_color-1, work_color, mode);

    int nn = 0;
    for (int j=0; j<vp.ys; j++) {
        for (int i=0; i<vp.xs; i++) {
            if (xp.gp[(j+1)*xp.xs+i+1]==work_color) {
                pp.gp[j*pp.xs+i] = vp.gp[j*vp.xs+i];
                nn++;
            }
        }
    }
    pp.state = nn;

    if ((int)(ps*rate+0.5)>nn) {
        pp.state = 0;
        pp.clear();
    }

    xp.free();
    return pp;
}

Here is the call graph for this function:

DllExport void DestroyWing

(

BREP_WING *

wing

)

void jbxl::DestroyWing(BREP_WING* wing)

Definition at line 910 of file Brep.cpp.

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().

{
    wing->vertex->DisconnectWing(wing);
    wing->contour->DisconnectWing(wing);

    if (!wing->edge->wing1->contour && !wing->edge->wing2->contour) {
        delete wing->edge;
    }
    else {
        wing->edge->complete = false;
    }
}

Here is the call graph for this function:

Here is the caller graph for this function:

Vector<double> jbxl::dgree_circle_MSGraph

(

MSGraph< T >

vp

)

[inline]

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 90 of file Graph.h.

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

{
    Vector<double> vt;
    double fac = 1.113757;
//  double fac = 1.182;

/*
    MSGraph<T> pp;
    pp.set(vp.xs+2, vp.ys+2, 1);
    for (int j=0; j<vp.ys; j++) {
        for (int i=0; i<vp.xs; i++) {
            pp.gp[(j+1)*pp.xs+i+1] = vp.gp[j*vp.xs+i];
        }
    }
*/
    vt.z  = -1.0;
    vt.x  = count_around_MSGraph(vp);
    vt.y  = count_area_MSGraph(vp);
    if (vt.y!=0) vt.z = (vt.x*vt.x)/(4.*PI*vt.y)/fac;

    //pp.free();

    return vt;
}

Here is the call graph for this function:

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:

	fp	DICOM型式ファイルへのファイル識別子
	fsize	ファイルのサイズ．
[out]	dsize	グラフィックデータの大きさが格納される．
[out]	xsize	グラフィックデータの Xサイズが格納される．
[out]	ysize	グラフィックデータの Yサイズが格納される．
[out]	depth	グラフィックデータのデプス(Bit)が格納される．
[out]	rzxy	Z軸の歪．0.0 なら不明．

Return values:

	>0	読みこんだヘッダの大きさ (Byte単位)．
	0	ヘッダの区切りを識別できなかった．
	JBXL_GRAPH_INVARG_ERROR	不正な引数 (fp, fsize, dsize)
	JBXL_GRAPH_MEMORY_ERROR	メモリ不足

Definition at line 431 of file Gio.cpp.

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_GRAPH_IVDARG_ERROR, JBXL_GRAPH_MEMORY_ERROR, LNAME, OFF, and ON.

Referenced by readDicomData(), and readXHead().

{
    int   i, j, sz, rp, ef;
    int   ln, hsize;
    int   xs = 0, ys = 0, dp = 0;
    double rz = 0.0;

#ifdef WIN32
    uWord  cn[2];
#else
    uWord  cn[2] __attribute__((may_alias));
#endif
    uWord  dt;
    uWord* wp;

    if (fp==NULL || fsize<=0 || dsize==NULL) return JBXL_GRAPH_IVDARG_ERROR;

    *dsize = 0;
    if (rzxy!=NULL) *rzxy = 0.0;
    ef = OFF;
    fseek(fp, 0, 0);

    // ヘッダの区切りを検出
    rp = (int)fread(&dt, sizeof(uWord), 1, fp);
    while(!feof(fp) && ef!=ON) {
        //if ((uWord)ntohs(dt)==0xe07f) {
        if (dt==DICOM_PIXEL_GROUP) {
            rp += (int)fread(&dt, sizeof(uWord), 1, fp);
            //if ((uWord)ntohs(dt)==0x1000) {
            if (dt==DICOM_PIXEL_ELEMENT) {
                rp += (int)fread(&cn, sizeof(uWord), 2, fp);
                //if ((uWord)ntohs(cn[0])==0x4f57 && cn[1]==0x0000) {
                if (cn[0]==DICOM_PIXCEL_VR && cn[1]==0x0000) {
                    rp += (int)fread(&cn, sizeof(uWord), 2, fp);
                }
                //*dsize = *((int*)cn);
                int* sizep = (int*)cn;
                *dsize = *sizep;
                hsize = rp*sizeof(uWord);
                if (fsize>=*dsize+hsize) {      // footer
                    ef = ON;
                    break;
                }
            }
        }
        rp += (int)fread(&dt, sizeof(uWord), 1, fp);
    }

    if (!ef) return 0;

    sz = rp*sizeof(uWord);
    wp = (uWord*)malloc(sz);
    if (wp==NULL) return JBXL_GRAPH_MEMORY_ERROR;

    // ヘッダ読み込み
    fseek(fp, 0, 0);
    fread(wp, sz, 1, fp);

    for (i=0; i<sz/2-3; i++) {
        //if ((uWord)ntohs(wp[i])==0x2800 && (uWord)ntohs(wp[i+1])==0x3000) {
        if (wp[i]==DICOM_IMAGE_GROUP) {

            // Z方向の歪
            if (wp[i+1]==DICOM_PXLSPC_ELEMENT) {
                char   rx[LNAME], ry[LNAME];
                uByte* bp;

                memset(rx, 0, LNAME);
                memset(ry, 0, LNAME);

                if (wp[i+2]==DICOM_STR_VR) ln = wp[i+3];
                else                       ln = *(int*)&wp[i+2];

                if (ln<LNAME-1) {
                    bp = (uByte*)&wp[i+4];
                    j  = 0;
                    while (j<ln-1 && bp[j]!='\\') {
                        rx[j] = bp[j];
                        j++;
                    }
                    ln -= j + 1;
                    bp += j + 1;
                    j   = 0;
                    while (j<ln-1 && bp[j]!=' ') {
                        ry[j] = bp[j];
                        j++;
                    }
                    if (!strcmp(rx, ry)) {
                        rz = atof(rx);
                    } 
                }
            }

            // X サイズ
            else if (wp[i+1]==DICOM_XSIZE_ELEMENT) {
                if (wp[i+2]==DICOM_INT_VR) ln = wp[i+3];
                else                       ln = *(int*)&wp[i+2];
                if (ln==2) {
                    xs = (int)*(sWord*)&wp[i+4];
                }
                else if (ln==4) {
                    xs = *(int*)&wp[i+4];
                }
            }

            // Y サイズ
            else if (wp[i+1]==DICOM_YSIZE_ELEMENT) {
                if (wp[i+2]==DICOM_INT_VR) ln = wp[i+3];
                else                       ln = *(int*)&wp[i+2];
                if (ln==2) {
                    ys = (int)*(sWord*)&wp[i+4];
                }
                else if (ln==4) {
                    ys = *(int*)&wp[i+4];
                }
            }

            // Depth
            else if (wp[i+1]==DICOM_DEPTH_ELEMENT) {
                if (wp[i+2]==DICOM_INT_VR) ln = wp[i+3];
                else                       ln = *(int*)&wp[i+2];
                if (ln==2) {
                    dp = (int)*(sWord*)&wp[i+4];
                }
                else if (ln==4) {
                    dp = *(int*)&wp[i+4];
                }
            }
        }
    }
    free(wp);
    
    if (rzxy!=NULL)  *rzxy  = rz;
    if (xsize!=NULL) *xsize = xs;
    if (ysize!=NULL) *ysize = ys;
    if (depth!=NULL) *depth = dp;
        
    return sz;
}

Here is the caller graph for this function:

bool jbxl::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 576 of file Vector.h.

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

Referenced by IsCollisionContours().

{
    return  (b1.xmin >= b2.xmax) || (b2.xmin >= b1.xmax) || 
            (b1.ymin >= b2.ymax) || (b2.ymin >= b1.ymax) || 
            (b1.zmin >= b2.zmax) || (b2.zmin >= b1.zmax);
}

Here is the caller graph for this function:

void DisPatcher	(	int	signalno = 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 41 of file tools++.cpp.

{
    int   i;
    unsigned int*  ign_signal = NULL;

    va_list args;    
    va_start(args, signalno);

    if (signalno>0) ign_signal = (unsigned int*)malloc(signalno*sizeof(int));
    if (ign_signal==NULL) signalno = 0;
    for (i=0; i<signalno; i++) {
        ign_signal[i] = va_arg(args, unsigned int);
    }

    MSG msg;
    while (PeekMessage(&msg, 0, 0, 0, PM_REMOVE)){
        TranslateMessage(&msg);
        if (msg.message==WM_QUIT) exit(1);            //    強制終了
        for (i=0; i<signalno; i++) { 
            if (msg.message==ign_signal[i]) {
                msg.message = WM_NULL;
                break;
            }
        }
        DispatchMessage(&msg);
    }

    free(ign_signal);
    va_end(args);
    return;
}

Matrix<T> jbxl::dup_Matrix

(

Matrix< T >

a

)

[inline]

template <typename t>=""> Matrix<T> dup_Matrix(Matrix<T> a)

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

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

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< double >::dup().

{
    Matrix<T> mtx;
    
    if (a.sz!=NULL) {
        mtx.getm(a.n, a.sz);
        if (a.mx!=NULL && mtx.r==a.r) {
            for (int i=0; i<a.r; i++) {
                mtx.mx[i] = a.mx[i];
            }
        }
    }
    
    mtx.d   = a.d;
    mtx.err = (T)(1);
    //
    return mtx;
}

Here is the call graph for this function:

Here is the caller graph for this function:

MSGraph<T>* jbxl::dup_MSGraph

(

MSGraph< T > *

src

)

[inline]

template <typename t>=""> MSGraph<T>* dup_MSGraph(MSGraph<T>* src)

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

Parameters:

src

コピー元グラフィックデータ

Returns:

コピーされた MSGraph<T>型のデータ

Definition at line 651 of file Graph.h.

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.

{
    if (src==NULL) return NULL;
    MSGraph<T>* vp = new MSGraph<T>();

    vp->init();
    if (src->isNull()) {
        vp->state = JBXL_GRAPH_NODATA_ERROR;
        return vp;
    }
    
    *vp = *src;
    vp->getm(src->xs, src->ys, src->zs, src->zero);
    if (vp->gp==NULL) {
        vp->init();
        vp->state = JBXL_GRAPH_MEMORY_ERROR;
        return vp;
    }

    for (int i=0; i<vp->xs*vp->ys*vp->zs; i++) vp->gp[i] = src->gp[i];
    
    return vp;
}

Here is the call graph for this function:

MSGraph<T> jbxl::dup_MSGraph

(

MSGraph< T >

src

)

[inline]

template <typename t>=""> MSGraph<T> dup_MSGraph(MSGraph<R> src)

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

Parameters:

src

コピー元グラフィックデータ

Returns:

コピーされた MSGraph<T>型のデータ

Definition at line 618 of file Graph.h.

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.

{
    MSGraph<T> vp;

    vp.init();
    if (src.isNull()) {
        vp.state = JBXL_GRAPH_NODATA_ERROR;
        return vp;
    }
    
    vp = src;
    vp.getm(src.xs, src.ys, src.zs, src.zero);
    if (vp.gp==NULL) {
        vp.init();
        vp.state = JBXL_GRAPH_MEMORY_ERROR;
        return vp;
    }

    for (int i=0; i<vp.xs*vp.ys*vp.zs; i++) vp.gp[i] = src.gp[i];
    
    return vp;
}

Here is the call graph for this function:

DllExport int DupEdgeNumber

(

BREP_CONTOUR *

contour

)

int jbxl::DupEdgeNumber(BREP_CONTOUR* contour)

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

Definition at line 668 of file TriBrep.cpp.

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().

{
    contour->dup_edge = 0;

    BREP_WING* first = contour->wing;
    if (first!=NULL) {
        BREP_WING* next = first;
        do {
            BREP_WING* wing = next;
            next = wing->next;
            if (wing->edge->edge_list!=NULL) contour->dup_edge++;
        } while(next!=first);
    }
    return  contour->dup_edge;
}

Here is the caller graph for this function:

TriPolyData * dupTriPolyData	(	TriPolyData *	data,
		int	num
	)

Definition at line 235 of file FacetBaseData.cpp.

{
    if (data==NULL) return NULL;

    TriPolyData* dup = (TriPolyData*)malloc(num*sizeof(TriPolyData));
    if (dup==NULL) return NULL;

    for (int i=0; i<num; i++) dup[i].dup(data[i]);
    return dup;
}

Vector<T>* jbxl::dupVector	(	Vector< T > *	a,
		int	n
	)			[inline]

Definition at line 243 of file Vector.h.

{
    Vector<T>* v = (Vector<T>*)malloc(sizeof(Vector<T>)*n);
    if (v==NULL) return NULL;

    for (int i=0; i<n; i++) v[i] = a[i];

    return v;
}

MSGraph<R> jbxl::edgeEnhance	(	MSGraph< T >	gd,
		int	mode = 0
	)			[inline]

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 774 of file Gmt.h.

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.

{
    int  i;
    MSGraph<R> la, vp;

    vp.mimicry(gd);
    if (vp.isNull()) {
        DEBUG_MODE PRINT_MESG("edgeEnhance: No More Memory!!\n");
        vp.state = JBXL_GRAPH_MEMORY_ERROR;
        return vp;
    }

    la = Laplacian<R>(gd, mode);  
    for (i=0; i<vp.xs*vp.ys*vp.zs; i++) {
        vp.gp[i] = gd.gp[i] - la.gp[i];
    }
    la.free();
    
    return vp;
}

Here is the call graph for this function:

MSGraph<int> jbxl::euclidDistance	(	MSGraph< T >	vp,
		int	bc,
		int &	rr
	)			[inline]

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 869 of file Gmt.h.

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().

{
    int  i, j, k, l, df, d, w;
    int  rmax, rstart, rend;
    int  nx, ny, nz, pl;

    rr = -1;
    MSGraph<int>  pp(vp.xs, vp.ys, vp.zs, (int)vp.zero, (int)vp.base, vp.RZxy);
    if (pp.isNull()) {
        DEBUG_MODE PRINT_MESG("euclidDistance: No More Memory!! E1\n");
        pp.state = JBXL_GRAPH_MEMORY_ERROR;
        return pp;
    }

    for (i=0; i<vp.xs*vp.ys*vp.zs; i++) {
         if (vp.gp[i]>=bc) pp.gp[i] = 1;
         else              pp.gp[i] = 0;
    }

    pl = vp.xs*vp.ys;

    for (k=0; k<vp.zs; k++) {
        nz = k*pl;
        for (j=0; j<vp.ys; j++) {
            df = vp.xs;
            ny = nz + j*vp.xs;
            for (i=0; i<vp.xs; i++) {
                nx = ny + i;
                if (pp.gp[nx]!=0) df = df + 1;
                else              df = 0;
                pp.gp[nx] = df*df;
            }
        }
    }
        
    for (k=0; k<vp.zs; k++) {
        nz = k*pl;
        for (j=0; j<vp.ys; j++) {
            df = vp.xs;
            ny = nz + j*vp.xs;
            for (i=vp.xs-1; i>=0; i--) {
                nx = ny + i;
                if (pp.gp[nx]!=0) df = df + 1;
                else              df = 0;
                pp.gp[nx] = Min(pp.gp[nx], df*df);
            }
        }
    }

    rmax = Max(vp.ys, vp.zs);
    MSGraph<int>  buf(rmax);
    if (buf.isNull()) {
        pp.free();
        DEBUG_MODE PRINT_MESG("euclidDistance: No More Memory!! E2\n");
        pp.state = JBXL_GRAPH_MEMORY_ERROR;
        return pp;
    }

    for (k=0; k<vp.zs; k++) {
        nz = k*pl;
        for (i=0; i<vp.xs; i++) {
            nx = nz + i;
            for (j=0; j<vp.ys; j++)  buf.gp[j] = pp.gp[nx+j*vp.xs];
            for (j=0; j<vp.ys; j++) {
                ny = nx + j*vp.xs;
                d = buf.gp[j];
                if (d!=0) {
                    rmax   = (int)sqrt((double)d) + 1;
                    rstart = Min(rmax, j);
                    rend   = Min(rmax, vp.ys-j-1);
                    for (l=-rstart; l<=rend; l++) {
                        w = buf.gp[j+l] + l*l;
                        if (w<d) d = w;
                    }
                }
                pp.gp[ny] = d;
            }
        }
    }
    buf.clear();

    rr = 0;
    for (j=0; j<vp.ys; j++) {
        ny = j*vp.xs;
        for (i=0; i<vp.xs; i++) {
            nx = ny + i;
            for (k=0; k<vp.zs; k++)  buf.gp[k] = pp.gp[nx+k*pl];
            for (k=0; k<vp.zs; k++) {
                nz = nx + k*pl;
                d = buf.gp[k];
                if (d!=0) {
                    rmax   = (int)sqrt((double)d) + 1;
                    rstart = Min(rmax, k);
                    rend   = Min(rmax, vp.zs-k-1);
                    for (l=-rstart; l<=rend; l++) {
                        w = buf.gp[k+l] + l*l;
                        if (w<d) d = w;
                    }
                    rr = Max(rr, d);
                }
                pp.gp[nz] = d;
            }
        }
    }
    buf.free();

    return pp;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Quaternion<T> jbxl::ExtEulerXYZ2Quaternion

(

Vector< T >

e

)

[inline]

Definition at line 238 of file Rotation.h.

References Quaternion< T >::setExtEulerXYZ().

{ Quaternion<T> q; q.setExtEulerXYZ(e); return q;}

Here is the call graph for this function:

Matrix<T> jbxl::ExtEulerXYZ2RotMatrix

(

Vector< T >

eul

)

[inline]

Definition at line 659 of file Rotation.h.

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

{
    Matrix<T> mtx(2, 3, 3);

    T sinx = (T)sin(eul.element1());
    T cosx = (T)cos(eul.element1());
    T siny = (T)sin(eul.element2());
    T cosy = (T)cos(eul.element2());
    T sinz = (T)sin(eul.element3());
    T cosz = (T)cos(eul.element3());

    mtx.element(1, 1) =  cosy*cosz;
    mtx.element(1, 2) =  sinx*siny*cosz - cosx*sinz;
    mtx.element(1, 3) =  cosx*siny*cosz + sinx*sinz;
    mtx.element(2, 1) =  cosy*sinz;
    mtx.element(2, 2) =  sinx*siny*sinz + cosx*cosz;
    mtx.element(2, 3) =  cosx*siny*sinz - sinx*cosz;
    mtx.element(3, 1) = -siny;
    mtx.element(3, 2) =  sinx*cosy;
    mtx.element(3, 3) =  cosx*cosy;

    return mtx;
}

Here is the call graph for this function:

Quaternion<T> jbxl::ExtEulerXZY2Quaternion

(

Vector< T >

e

)

[inline]

Definition at line 240 of file Rotation.h.

References Quaternion< T >::setExtEulerXZY().

{ Quaternion<T> q; q.setExtEulerXZY(e); return q;}

Here is the call graph for this function:

Matrix<T> jbxl::ExtEulerXZY2RotMatrix

(

Vector< T >

eul

)

[inline]

Definition at line 711 of file Rotation.h.

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

{
    Matrix<T> mtx(2, 3, 3);

    T sinx = (T)sin(eul.element1());
    T cosx = (T)cos(eul.element1());
    T sinz = (T)sin(eul.element2());
    T cosz = (T)cos(eul.element2());
    T siny = (T)sin(eul.element3());
    T cosy = (T)cos(eul.element3());

    mtx.element(1, 1) =  cosy*cosz;
    mtx.element(1, 2) = -cosx*cosy*sinz + sinx*siny;
    mtx.element(1, 3) =  sinx*cosy*sinz + cosx*siny;
    mtx.element(2, 1) =  sinz;
    mtx.element(2, 2) =  cosx*cosz;
    mtx.element(2, 3) = -sinx*cosz;
    mtx.element(3, 1) = -siny*cosz;
    mtx.element(3, 2) =  cosx*siny*sinz + sinx*cosy;
    mtx.element(3, 3) = -sinx*siny*sinz + cosx*cosy;

    return mtx;
}

Here is the call graph for this function:

Quaternion<T> jbxl::ExtEulerYXZ2Quaternion

(

Vector< T >

e

)

[inline]

Definition at line 242 of file Rotation.h.

References Quaternion< T >::setExtEulerYXZ().

{ Quaternion<T> q; q.setExtEulerYXZ(e); return q;}

Here is the call graph for this function:

Matrix<T> jbxl::ExtEulerYXZ2RotMatrix

(

Vector< T >

eul

)

[inline]

Definition at line 789 of file Rotation.h.

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

{
    Matrix<T> mtx(2, 3, 3);

    T siny = (T)sin(eul.element1());
    T cosy = (T)cos(eul.element1());
    T sinx = (T)sin(eul.element2());
    T cosx = (T)cos(eul.element2());
    T sinz = (T)sin(eul.element3());
    T cosz = (T)cos(eul.element3());

    mtx.element(1, 1) = -sinx*siny*sinz + cosy*cosz;
    mtx.element(1, 2) = -cosx*sinz;
    mtx.element(1, 3) =  sinx*cosy*sinz + siny*cosz;
    mtx.element(2, 1) =  sinx*siny*cosz + cosy*sinz;
    mtx.element(2, 2) =  cosx*cosz;
    mtx.element(2, 3) = -sinx*cosy*cosz + siny*sinz;
    mtx.element(3, 1) = -cosx*siny;
    mtx.element(3, 2) =  sinx;
    mtx.element(3, 3) =  cosx*cosy;

    return mtx;
}

Here is the call graph for this function:

Quaternion<T> jbxl::ExtEulerYZX2Quaternion

(

Vector< T >

e

)

[inline]

Definition at line 241 of file Rotation.h.

References Quaternion< T >::setExtEulerYZX().

{ Quaternion<T> q; q.setExtEulerYZX(e); return q;}

Here is the call graph for this function:

Matrix<T> jbxl::ExtEulerYZX2RotMatrix

(

Vector< T >

eul

)

[inline]

Definition at line 737 of file Rotation.h.

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

{
    Matrix<T> mtx(2, 3, 3);

    T siny = (T)sin(eul.element1());
    T cosy = (T)cos(eul.element1());
    T sinz = (T)sin(eul.element2());
    T cosz = (T)cos(eul.element2());
    T sinx = (T)sin(eul.element3());
    T cosx = (T)cos(eul.element3());

    mtx.element(1, 1) =  cosy*cosz;
    mtx.element(1, 2) = -sinz;
    mtx.element(1, 3) =  siny*cosz;
    mtx.element(2, 1) =  cosx*cosy*sinz + sinx*siny;
    mtx.element(2, 2) =  cosx*cosz;
    mtx.element(2, 3) =  cosx*siny*sinz - sinx*cosy;
    mtx.element(3, 1) =  sinx*cosy*sinz - cosx*siny;
    mtx.element(3, 2) =  sinx*cosz;
    mtx.element(3, 3) =  sinx*siny*sinz + cosx*cosy;

    return mtx;
}

Here is the call graph for this function:

Quaternion<T> jbxl::ExtEulerZXY2Quaternion

(

Vector< T >

e

)

[inline]

Definition at line 243 of file Rotation.h.

References Quaternion< T >::setExtEulerZXY().

{ Quaternion<T> q; q.setExtEulerZXY(e); return q;}

Here is the call graph for this function:

Matrix<T> jbxl::ExtEulerZXY2RotMatrix

(

Vector< T >

eul

)

[inline]

Definition at line 763 of file Rotation.h.

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

{
    Matrix<T> mtx(2, 3, 3);

    T sinz = (T)sin(eul.element1());
    T cosz = (T)cos(eul.element1());
    T sinx = (T)sin(eul.element2());
    T cosx = (T)cos(eul.element2());
    T siny = (T)sin(eul.element3());
    T cosy = (T)cos(eul.element3());

    mtx.element(1, 1) =  sinx*siny*sinz + cosy*cosz;
    mtx.element(1, 2) =  sinx*siny*cosz - cosy*sinz;
    mtx.element(1, 3) =  cosx*siny;
    mtx.element(2, 1) =  cosx*sinz;
    mtx.element(2, 2) =  cosx*cosz;
    mtx.element(2, 3) = -sinx;
    mtx.element(3, 1) =  sinx*cosy*sinz - siny*cosz;
    mtx.element(3, 2) =  sinx*cosy*cosz + siny*sinz;
    mtx.element(3, 3) =  cosx*cosy;
    
    return mtx;
}

Here is the call graph for this function:

Quaternion<T> jbxl::ExtEulerZYX2Quaternion

(

Vector< T >

e

)

[inline]

Definition at line 239 of file Rotation.h.

References Quaternion< T >::setExtEulerZYX().

{ Quaternion<T> q; q.setExtEulerZYX(e); return q;}

Here is the call graph for this function:

Matrix<T> jbxl::ExtEulerZYX2RotMatrix

(

Vector< T >

eul

)

[inline]

Definition at line 685 of file Rotation.h.

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

{
    Matrix<T> mtx(2, 3, 3);

    T sinz = (T)sin(eul.element1());
    T cosz = (T)cos(eul.element1());
    T siny = (T)sin(eul.element2());
    T cosy = (T)cos(eul.element2());
    T sinx = (T)sin(eul.element3());
    T cosx = (T)cos(eul.element3());

    mtx.element(1, 1) =  cosy*cosz;
    mtx.element(1, 2) = -cosy*sinz;
    mtx.element(1, 3) =  siny;
    mtx.element(2, 1) =  sinx*siny*cosz + cosx*sinz;
    mtx.element(2, 2) = -sinx*siny*sinz + cosx*cosz;
    mtx.element(2, 3) = -sinx*cosy;
    mtx.element(3, 1) = -cosx*siny*cosz + sinx*sinz;
    mtx.element(3, 2) =  cosx*siny*sinz + sinx*cosz;
    mtx.element(3, 3) =  cosx*cosy;

    return mtx;
}

Here is the call graph for this function:

DllExport void FastDeleteFacet

(

BREP_FACET *

facet

)

void jbxl::FastDeleteFacet(BREP_FACET* facet)

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

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

Definition at line 804 of file TriBrep.cpp.

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

Referenced by PatchupContour(), and ReverseContours().

{
    if (facet==NULL) return;
    if (facet->shell!=NULL) {
        facet->shell->facets.pop_back();
        facet->shell = NULL;
    }

    // Destroy its contours
    BREP_CONTOUR*  bpcn;
    BREP_CONTOUR_LIST::iterator contour = facet->outer_contours.begin();

    while (contour!=facet->outer_contours.end()) {
        bpcn = *contour;
        contour = facet->outer_contours.erase(contour);
        bpcn->facet = NULL;
        delete (bpcn);  
    }
    free(facet);
    
    return;
}

Here is the caller graph for this function:

MSGraph<T> jbxl::fat_object_morph	(	MSGraph< T >	vp,
		MSGraph< T >	xp,
		int	cc
	)			[inline]

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

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

Definition at line 177 of file Morph.h.

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

{
    int  i, j, k, ps, cz, cy, cx;
    bool err;
    MSGraph<T> wp(vp.xs, vp.ys, vp.zs);
    if (wp.isNull()) return wp;

    ps = vp.xs*vp.ys;
    for (k=0; k<vp.zs; k++) {
        cz = k*ps;
        for (j=0; j<vp.ys; j++) {
            cy = cz + j*vp.xs;
            for (i=0; i<vp.xs; i++) {
                cx = cy + i;
                if (vp.gp[cx]>=cc) {
                    err = point_fat_object_morph(vp, i, j, k, xp, cc);
                    if (err) copy_morph_element(wp, i, j, k, xp);
                }
            }
        }
    }

    return wp;
}

Here is the call graph for this function:

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	ソリッドデータへのポインタ
	method	1: 三番目のVertexを探すアルゴリズムは Next.
	method	2: 三番目のVertexを探すアルゴリズムは Near.
	mode	true : 多重Edgeを認める．
	mode	false: 多重Edgeを認めない．

Definition at line 301 of file TriBrep.cpp.

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

{
    if (solid->shortage_wings.empty()) return;
//  DEBUG_MODE PRINT_MESG("Start FillShortageWings\n");

    int wmax = (int)solid->shortage_wings.size();
    CVCounter* counter = NULL;
    if (solid->counter!=NULL) counter = solid->counter->GetUsableCounter();
    if (counter!=NULL) counter->SetMax(wmax);

    int lpc = 0;
    int pno = 1;
    while (solid->shortage_wings.size()>1 && pno!=0 && lpc<JBXL_BREP_MAX_LOOPCNT) {
        if      (method==1) pno = FillShortageWings_Next(solid, mode);
        else if (method==2) pno = FillShortageWings_Near(solid, mode);
        else {
//          DEBUG_MODE PRINT_MESG("FillShortageWings: 知らない手法が指定された %d\n", method);
//          DEBUG_MODE PRINT_MESG("End   FillShortageWings\n");
            return;
        }
        CreateShortageWingsList(solid);
        //DEBUG_MODE PRINT_MESG("FillShortageWings: 不完全Wingデータは %d/%d 個  %d\n", solid->shortage_wings.size(), wmax, pno);
        lpc++;
    }

//  DEBUG_MODE PRINT_MESG("End   FillShortageWings\n");
    return;
}

Here is the call graph for this function:

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	ソリッドデータへのポインタ
	mode	true : 多重Edgeを認める．
	mode	false: 多重Edgeを認めない．

Definition at line 394 of file TriBrep.cpp.

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().

{
    int patchno = 0;
    BREP_VERTEX_LIST  vertex_list;

    BREP_WING_LIST::iterator wing1;
    for (wing1=solid->shortage_wings.begin(); wing1!=solid->shortage_wings.end(); wing1++){
        if (!IsIncludeCompleteEdge(*wing1)) {
            BREP_VERTEX* vert[3];
            vert[0] = (*wing1)->vertex;
            vert[1] = GetWingOtherSide(*wing1)->vertex;
            vert[2] = NULL;
            vertex_list.clear();

            BREP_WING_LIST::iterator wing2;
            for (wing2=solid->shortage_wings.begin(); wing2!=solid->shortage_wings.end(); wing2++){
                if (wing1!=wing2) {
                    BREP_VERTEX* vrtx = (*wing2)->vertex;
                    if (vrtx!=vert[0] && vrtx!=vert[1]) {
                    /*  int cnt = 0;
                        BREP_VERTEX* v = vert[1];
                        do {
                            v = FindConnectEdgeVertex(v);
                            cnt++;
                        } while (v!=vert[0] && v!=vert[1] && v!=vrtx && v!=NULL && cnt<100);
                    */  
                    //  if (v!=vrtx) {
                            Vector<double> vect = (*wing1)->edge->center - vrtx->point;  
                            vrtx->distance2 = vect.norm2();
                            SetMinVertex(&vertex_list, vrtx);
                    //  }
                    }
                }
            }

            int cnt=0;
            BREP_SHELL* shell = GetWingOtherSide(*wing1)->contour->facet->shell;
            BREP_VERTEX_LIST::iterator ivert;
            for (ivert=vertex_list.begin(); ivert!=vertex_list.end(); ivert++){
                vert[2] = *ivert;
                if (PatchupContour(shell, vert, mode)) {
                    patchno++;
                    break;
                }
                cnt++;
                if (cnt>=JBXL_BREP_MAX_QUEUESIZE) break;
            }

        }
    }
    CreateContoursList(solid);
    CreateWingsList(solid);

    return patchno;
}

Here is the call graph for this function:

Here is the caller graph for this function:

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	ソリッドデータへのポインタ
	mode	true : 多重Edgeを認める．
	mode	false: 多重Edgeを認めない．

Definition at line 347 of file TriBrep.cpp.

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().

{
    int patchno = 0;

    BREP_WING_LIST::iterator wing1;
    for (wing1=solid->shortage_wings.begin(); wing1!=solid->shortage_wings.end(); wing1++){
        if (!IsIncludeCompleteEdge(*wing1)) {
            BREP_VERTEX* vert[3];

            vert[0] = (*wing1)->vertex;
            BREP_WING_LIST::iterator wing2;
            for (wing2=solid->shortage_wings.begin(); wing2!=solid->shortage_wings.end(); wing2++){
                if (!IsIncludeCompleteEdge(*wing2) && IsConnectEdges(*wing1, *wing2)) {
                    vert[1] = (*wing2)->vertex;
                    vert[2] = GetWingOtherSide(*wing2)->vertex; // vert[]: Contourを貼る頂点
                    BREP_SHELL* shell = GetWingOtherSide(*wing1)->contour->facet->shell;
                    if (PatchupContour(shell, vert, mode)) patchno++;
                }
            }
        }
    }
    CreateContoursList(solid);
    CreateWingsList(solid);

    return patchno;
}

Here is the call graph for this function:

Here is the caller graph for this function:

DllExport BREP_VERTEX * FindConnectEdgeVertex

(

BREP_VERTEX *

vert

)

BREP_VERTEX* jbxl::FindConnectEdgeVertex(BREP_VERTEX* vert)

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

Definition at line 478 of file TriBrep.cpp.

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

{
    BREP_WING_LIST::iterator iwing;
    for (iwing=vert->wing_list.begin(); iwing!=vert->wing_list.end(); iwing++){
        if ((*iwing)->contour==NULL) {
            return GetWingOtherSide(*iwing)->vertex;
        }
    }
    return NULL;
}

Here is the call graph for this function:

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 935 of file Brep.cpp.

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

Referenced by CreateWingWithoutContour(), and IsForbiddenEdge().

{
    BREP_WING_LIST list;
    BREP_WING_LIST::iterator iwing;

    list = vertex2->wing_list;
    for (iwing=list.begin(); iwing!=list.end(); iwing++){
        BREP_WING* wing = *iwing;
        if (GetWingOtherSide(wing)->vertex==vertex1) return wing->edge;
    }

    list = vertex1->wing_list;
    for (iwing=list.begin(); iwing!=list.end(); iwing++) {
        BREP_WING* wing = *iwing;
        if (GetWingOtherSide(wing)->vertex==vertex2) return wing->edge;
    }

    return NULL;
}

Here is the call graph for this function:

Here is the caller graph for this function:

void free_CmnHead

(

CmnHead *

hd

)

void jbxl::free_CmnHead(CmnHead* hd)

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

Parameters:

hd

開放する共通ヘッダ

Definition at line 26 of file Gdata.cpp.

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

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

{
    if (hd!=NULL) {
        if (hd->buf!=NULL)   free(hd->buf);
        if (hd->grptr!=NULL) free(hd->grptr);
        init_CmnHead(hd);
    }
}

Here is the call graph for this function:

Here is the caller graph for this function:

void jbxl::freeAffineTrans

(

AffineTrans< T > *&

affine

)

[inline]

Definition at line 374 of file Rotation.h.

References AffineTrans< T >::free().

Referenced by MeshObjectData::delAffineTrans().

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

Here is the call graph for this function:

Here is the caller graph for this function:

void jbxl::freeBrepSolid

(

BREP_SOLID *&

solid

)

[inline]

Definition at line 107 of file Brep.h.

References BREP_SOLID::FreeData().

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

{ if(solid!=NULL){ solid->FreeData(); delete solid; solid=NULL;} }

Here is the call graph for this function:

Here is the caller graph for this function:

void jbxl::freeBrepSolidList

(

BrepSolidList *&

solids

)

[inline]

Definition at line 53 of file BrepLib.h.

References BrepSolidList::free().

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

Here is the call graph for this function:

void jbxl::freeColladaXML

(

ColladaXML *&

xml

)

[inline]

Definition at line 126 of file ColladaTool.h.

References ColladaXML::free().

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

Here is the call graph for this function:

void jbxl::freeFacetBaseData

(

FacetBaseData *&

facet

)

[inline]

Definition at line 131 of file FacetBaseData.h.

References FacetBaseData::free().

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

Here is the call graph for this function:

void jbxl::freeMeshObjectData

(

MeshObjectData *&

data

)

[inline]

Definition at line 160 of file MeshObjectData.h.

References MeshObjectData::free().

Referenced by MeshObjectData::joinData().

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

Here is the call graph for this function:

Here is the caller graph for this function:

void freeMeshObjectList

(

MeshObjectNode *&

node

)

Definition at line 379 of file MeshObjectData.cpp.

References freeMeshObjectNode(), and MeshObjectNode::next.

Referenced by MeshObjectData::free().

{
    if (node==NULL) return;

    MeshObjectNode* next = node->next;
    if (next!=NULL) freeMeshObjectList(next);

    freeMeshObjectNode(node);

    return;
}

Here is the call graph for this function:

Here is the caller graph for this function:

void jbxl::freeMeshObjectNode

(

MeshObjectNode *&

node

)

[inline]

Definition at line 90 of file MeshObjectData.h.

References MeshObjectNode::free().

Referenced by DelMeshObjectNode(), and freeMeshObjectList().

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

Here is the call graph for this function:

Here is the caller graph for this function:

void jbxl::freeNull

(

T &

p

)

[inline]

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

References isNull().

Referenced by ColladaXML::addGeometry(), MeshObjectData::addNode(), FacetBaseData::free(), MeshObjectData::free_value(), MeshObjectNode::free_value(), MeshObjectData::importTriData(), readGraphicSlices(), readMoonData(), readRasData(), and readUserSetData().

{ if (!jbxl::isNull(p)) ::free(p); p = (T)NULL;}

Here is the call graph for this function:

Here is the caller graph for this function:

DllExport void freeSTL

(

STLData *

stldata

)

Definition at line 411 of file STL.cpp.

{
    if (stldata!=NULL) free(stldata);
}

void freeTriPolyData	(	TriPolyData *&	tridata,
		int	n
	)

Definition at line 276 of file FacetBaseData.cpp.

References TriPolyData::free().

{
    if (tridata!=NULL) {
        for (int i=0; i<n; i++) {
            tridata[i].free();
        }
        ::free(tridata);
        tridata = NULL;
    }
}

Here is the call graph for this function:

void jbxl::freeTriPolyData

(

TriPolyData *&

tridata

)

[inline]

Definition at line 168 of file FacetBaseData.h.

References TriPolyData::free().

Referenced by joinTriPolyData().

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

Here is the call graph for this function:

Here is the caller graph for this function:

RBound<int> jbxl::get_boundary_MSGraph	(	MSGraph< T >	vp,
		T	mn,
		T	mx
	)			[inline]

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

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

Definition at line 397 of file Graph.h.

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.

{
    int  nx, ny, nz, ps;
    RBound<int> rb;

    rb.set(vp.xs, 0, vp.ys, 0, vp.zs, 0);

    ps = vp.xs*vp.ys;
    for (int k=0; k<vp.zs; k++) {
        nz = k*ps;
        for (int j=0; j<vp.ys; j++) {
            ny = j*vp.xs + nz;
            for (int i=0; i<vp.xs; i++) {
                nx = i + ny;
                if (vp.gp[nx]>=mn && vp.gp[nx]<=mx) {
                    rb.fusion((T)i, (T)j, (T)k);
                }
            }
        }
    }

    rb.cutdown(vp.rbound);

    return rb;
}

Here is the call graph for this function:

CmnHead getinfo_CmnHead

(

CmnHead

hd

)

CmnHead jbxl::getinfo_CmnHead(CmnHead hd)

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

Definition at line 59 of file Gdata.cpp.

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

Referenced by readGraphicSlices().

{
    CmnHead cmnhd = hd;

    cmnhd.bsize = 0;
    cmnhd.buf   = NULL;
    cmnhd.grptr = NULL;

    return cmnhd;
}

Here is the caller graph for this function:

MSGraph<T>* jbxl::getMSGraphFromCvMat

(

cv::Mat

mat

)

[inline]

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);

Definition at line 215 of file OpenCVTool.h.

{
    MSGraph<T>* vp = NULL;

    if (mat.channels()==1) {
        if      (mat.depth()==CV_8U)  vp = _getMSGraph_CvMat_C1<T, uByte>(mat);
        else if (mat.depth()==CV_8S)  vp = _getMSGraph_CvMat_C1<T, sByte>(mat);
        else if (mat.depth()==CV_16U) vp = _getMSGraph_CvMat_C1<T, uWord>(mat);
        else if (mat.depth()==CV_16S) vp = _getMSGraph_CvMat_C1<T, sWord>(mat);
        else if (mat.depth()==CV_32S) vp = _getMSGraph_CvMat_C1<T, int>(mat);
        //else if (mat.depth()==CV_32F) vp = _getMSGraph_CvMat_C1<T, double>(mat);
        //else if (mat.depth()==CV_64F) vp = _getMSGraph_CvMat_C1<T, double>(mat);
    }

    else if (mat.channels()==3) {
        if      (mat.depth()==CV_8U)  vp = _getMSGraph_CvMat_C3<T, uByte>(mat);
        else if (mat.depth()==CV_8S)  vp = _getMSGraph_CvMat_C3<T, sByte>(mat);
        else if (mat.depth()==CV_16U) vp = _getMSGraph_CvMat_C3<T, uWord>(mat);
        else if (mat.depth()==CV_16S) vp = _getMSGraph_CvMat_C3<T, sWord>(mat);
        else if (mat.depth()==CV_32S) vp = _getMSGraph_CvMat_C3<T, int>(mat);
        //else if (mat.depth()==CV_32F) vp = getMSGraph_CvMatC3<T, double>(mat);
        //else if (mat.depth()==CV_64F) vp = getMSGraph_CvMatC3<T, double>(mat);
    }

    return vp;
}

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

要free

Definition at line 960 of file Brep.cpp.

References OctreeGetter().

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

{
    BREP_VERTEX** vindex = NULL;

    long int num = OctreeGetter(octree, NULL, 0);

    if (num>0) {
        vindex = (BREP_VERTEX**)malloc(num*sizeof(BREP_VERTEX*));
    }
    if (vindex!=NULL) {
        OctreeGetter(octree, vindex, 0);
    }
    if (vertexno!=NULL) *vertexno = num;

    return vindex;
}

Here is the call graph for this function:

Here is the caller graph for this function:

CVCounter* jbxl::GetUsableGlobalCounter

(

)

[inline]

Definition at line 185 of file ClassBox.h.

References CVCounter::GetUsableCounter(), and GLCounter.

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

{ 
    if (GLCounter!=NULL) return GLCounter->GetUsableCounter(); 
    else return NULL;
}

Here is the call graph for this function:

Here is the caller graph for this function:

DllExport BREP_WING * GetWingOtherSide

(

BREP_WING *

wing

)

BREP_WING* jbxl::GetWingOtherSide(BREP_WING* wing)

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

Definition at line 1079 of file Brep.cpp.

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().

{ 
    if (wing==wing->edge->wing1) return wing->edge->wing2;
    //
    return wing->edge->wing1;
}

Here is the caller graph for this function:

MSGraph<T>* jbxl::grab_MSGraph	(	MSGraph< T > *	vp,
		int	x1,
		int	y1,
		int	x2,
		int	y2,
		int	zs = 0,
		int	ze = 0
	)			[inline]

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,ze	z軸の範囲

Returns:

取り出したグラフィックデータ．bound メンバに切り出した範囲が入る．

Definition at line 2184 of file Graph.h.

References MSGraph< T >::base, MSGraph< T >::color, MSGraph< T >::init(), MSGraph< T >::max, Max, MSGraph< T >::min, 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.

{
    int  i, j, k;
    int  xs, xe, ys, ye;
    int  xsize, ysize, zsize;
    MSGraph<T>* xp = new MSGraph<T>();

    xp->init();
    xs = Min(x1, x2);
    xe = Max(x1, x2);
    xs = Max(xs, 0);
    xe = Min(xe, vp->xs-1);
    ys = Min(y1, y2);
    ye = Max(y1, y2);
    ys = Max(ys, 0);
    ye = Min(ye, vp->ys-1);
    zs = Max(zs, 0);
    ze = Min(ze, vp->zs-1);

    xsize = xe - xs + 1;
    ysize = ye - ys + 1;
    zsize = ze - zs + 1;

    xp->set(xsize, ysize, zsize, vp->zero, vp->base);
    xp->color = vp->color;

    xp->max = vp->point(xs, ys, zs);
    xp->min = xp->max;

    for (k=0; k<zsize; k++) {
        for (j=0; j<ysize; j++) {
            for (i=0; i<xsize; i++) {
                T point = vp->point(xs+i, ys+j, zs+k);
                xp->point(i, j, k) = point;
                if      (point>xp->max) xp->max = point;
                else if (point<xp->min) xp->min = point; 
            }
        }
    }
    
    xp->rbound.xmin = vp->rbound.xmin + xs;
    xp->rbound.xmax = vp->rbound.xmin + xe;
    xp->rbound.ymin = vp->rbound.ymin + ys;
    xp->rbound.ymax = vp->rbound.ymin + ye;
    xp->rbound.zmin = vp->rbound.zmin + zs;
    xp->rbound.zmax = vp->rbound.zmin + ze;
    return xp;
}

Here is the call graph for this function:

MSGraph<T> jbxl::grab_MSGraph	(	MSGraph< T >	vp,
		int	x1,
		int	y1,
		int	x2,
		int	y2,
		int	zs = 0,
		int	ze = 0
	)			[inline]

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,ze	z軸の範囲

Returns:

取り出したグラフィックデータ．bound メンバに切り出した範囲が入る．

Definition at line 2119 of file Graph.h.

References MSGraph< T >::base, MSGraph< T >::color, MSGraph< T >::init(), MSGraph< T >::isNull(), MSGraph< T >::max, Max, MSGraph< T >::min, 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.

{
    int  i, j, k;
    int  xs, xe, ys, ye;
    int  xsize, ysize, zsize;
    MSGraph<T> xp;

    xp.init();
    xs = Min(x1, x2);
    xe = Max(x1, x2);
    xs = Max(xs, 0);
    xe = Min(xe, vp.xs-1);
    ys = Min(y1, y2);
    ye = Max(y1, y2);
    ys = Max(ys, 0);
    ye = Min(ye, vp.ys-1);
    zs = Max(zs, 0);
    ze = Min(ze, vp.zs-1);

    xsize = xe - xs + 1;
    ysize = ye - ys + 1;
    zsize = ze - zs + 1;

    xp.set(xsize, ysize, zsize, vp.zero, vp.base);
    if (xp.isNull()) return xp;
    xp.color = vp.color;

    xp.max = vp.point(xs, ys, zs);
    xp.min = xp.max;

    for (k=0; k<zsize; k++) {
        for (j=0; j<ysize; j++) {
            for (i=0; i<xsize; i++) {
                T point = vp.point(xs+i, ys+j, zs+k);
                xp.point(i, j, k) = point;
                if      (point>xp.max) xp.max = point;
                else if (point<xp.min) xp.min = point; 
            }
        }
    }
    
    xp.rbound.xmin = vp.rbound.xmin + xs;
    xp.rbound.xmax = vp.rbound.xmin + xe;
    xp.rbound.ymin = vp.rbound.ymin + ys;
    xp.rbound.ymax = vp.rbound.ymin + ye;
    xp.rbound.zmin = vp.rbound.zmin + zs;
    xp.rbound.zmax = vp.rbound.zmin + ze;
    return xp;
}

Here is the call graph for this function:

void init_CmnHead

(

CmnHead *

hd

)

void jbxl::init_CmnHead(CmnHead* hd)

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

Parameters:

hd

初期化する共通ヘッダ

Definition at line 43 of file Gdata.cpp.

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().

{  
    if (hd!=NULL) {
        hd->buf   = hd->grptr = NULL;
        hd->kind  = HEADER_NONE;
        hd->xsize = hd->ysize = hd->zsize = 0;
        hd->depth = hd->bsize = hd->lsize = 0;
    }
} 

Here is the caller graph for this function:

DllExport int IsAtLine

(

BREP_VERTEX **

v

)

Definition at line 871 of file TriBrep.cpp.

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

Referenced by IsForbiddenEdge().

{
    TVector<double> vect  = Vertex2TVector(v[0]);
    TVector<double> vect1 = Vertex2TVector(v[1]);
    TVector<double> vect2 = Vertex2TVector(v[2]) - vect;
    TVector<double> vect3 = Vertex2TVector(v[2]) - vect1;
    vect1 = vect1 - vect;

    int mode = 0;
    double tt;
    double th = ProportionVector(vect2, vect1, tt);
    tt = Max(tt, Zero_Eps);
    if (th>1.-tt) mode = 1;         // 0->1->2
    else {
        th = ProportionVector(vect1, vect2, tt);
        tt = Max(tt, Zero_Eps);
        if (th>1.-tt) mode = 2;     // 0->2->1
        else {
            th = ProportionVector(vect3, vect2, tt);
            tt = Max(tt, Zero_Eps);
            if (th>1.-tt) mode = 3; // 1->0->2
        }
    }
    return  mode;
}

Here is the call graph for this function:

Here is the caller graph for this function:

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 950 of file TriBrep.cpp.

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().

{
    *collision = NULL;

    BREP_CONTOUR_LIST::iterator icon;
    for (icon=solid->contours.begin(); icon!=solid->contours.end(); icon++){
        if (!disJunctBounds(contour->facet->rbound, (*icon)->facet->rbound)) {
        if (!(*icon)->facet->deletable || (*icon)->facet->notdelete) {
            int svrtx = CommonVertex(*icon, contour);
            if (svrtx==3) {
                *collision = *icon;
                return true;
            }
            
            int lineno;
            if (SamePlaneContour(*icon, contour, lineno)) {
                // ３角形の内部点
                if (!contour->hasCollisionVector) contour->ComputeDirectRS();
                if (IsInTriangle(*icon, contour)) {
                    *collision = *icon;
                    return true;
                }
                if (!(*icon)->hasCollisionVector) (*icon)->ComputeDirectRS();
                if (IsInTriangle(contour, *icon)) {
                    *collision = *icon;
                    return true;
                }
                
                // 2D衝突検査
                if (CollisionTriContour2D(*icon, contour)) {
                    *collision = *icon;
                    return true;
                }
            }
            else {
                if (lineno==1) continue;
                // 3D衝突検査
                if (!contour->hasCollisionVector) contour->ComputeDirectRS();
                if (CollisionTriContour3D(*icon, contour)) {
                    *collision = *icon;
                    return true;
                }
                if (!(*icon)->hasCollisionVector) (*icon)->ComputeDirectRS();
                if (CollisionTriContour3D(contour, *icon)) {
                    *collision = *icon;
                    return true;
                }
            }
        }
        }
    }
    return false;
}

Here is the call graph for this function:

Here is the caller graph for this function:

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

Definition at line 1515 of file TriBrep.cpp.

References GetWingOtherSide(), and BREP_WING::vertex.

Referenced by DeleteStraightEdges(), and FillShortageWings_Next().

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

Here is the call graph for this function:

Here is the caller graph for this function:

DllExport bool IsForbiddenEdge

(

BREP_VERTEX **

vert

)

bool jbxl::IsForbiddenEdge(BREP_VERTEX** vert)

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

Definition at line 905 of file TriBrep.cpp.

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

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

{
    BREP_EDGE* edge = NULL;
    int mode = IsAtLine(vert);
    if (mode==1) {      // 0->1->2
        if (vert[0]->forbidden_list==NULL) vert[0]->forbidden_list = new BREP_VERTEX_LIST();
        if (vert[2]->forbidden_list==NULL) vert[2]->forbidden_list = new BREP_VERTEX_LIST();
        vert[0]->forbidden_list->push_back(vert[2]);
        vert[2]->forbidden_list->push_back(vert[0]);
        edge = FindEdge(vert[0], vert[2]);
    }
    else if (mode==2) { // 0->2->1
        if (vert[0]->forbidden_list==NULL) vert[0]->forbidden_list = new BREP_VERTEX_LIST();
        if (vert[1]->forbidden_list==NULL) vert[1]->forbidden_list = new BREP_VERTEX_LIST();
        vert[0]->forbidden_list->push_back(vert[1]);
        vert[1]->forbidden_list->push_back(vert[0]);
        edge = FindEdge(vert[0], vert[1]);
    }
    else if (mode==3) { // 2->0->1
        if (vert[1]->forbidden_list==NULL) vert[1]->forbidden_list = new BREP_VERTEX_LIST();
        if (vert[2]->forbidden_list==NULL) vert[2]->forbidden_list = new BREP_VERTEX_LIST();
        vert[1]->forbidden_list->push_back(vert[2]);
        vert[2]->forbidden_list->push_back(vert[1]);
        edge = FindEdge(vert[1], vert[2]);
    }
    if (edge!=NULL) SetDeletableContoursByEdge(edge);

    if (mode==0) return false;
    return true;
}

Here is the call graph for this function:

Here is the caller graph for this function:

DllExport bool IsIncludeCompleteEdge

(

BREP_WING *

wing

)

bool jbxl::IsIncludeCompleteEdge(BREP_WING* wing)

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

Definition at line 781 of file TriBrep.cpp.

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

Referenced by FillShortageWings_Near(), and FillShortageWings_Next().

{
    BREP_EDGE* edge = wing->edge;
    if (edge->complete) return true;
    if (edge->edge_list!=NULL) {
        BREP_EDGE_LIST::iterator iedge;
        for (iedge=edge->edge_list->begin(); iedge!=edge->edge_list->end(); iedge++){
            if ((*iedge)->complete) return true;
        }
    }
    return false;
}

Here is the caller graph for this function:

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

Definition at line 1155 of file TriBrep.cpp.

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().

{
    double  tc, uc, tt, ut;
    TVector<double>  directS  = contour2->directS;
    TVector<double>  directRS = contour2->directRS;
    TVector<double>  directQ, directT, directN;
    BREP_WING* wing = contour1->wing;

    for (int i=0; i<3; i++) {
        for (int j=0; j<2; j++) {
            directN = Vertex2TVector(wing->vertex);
            if (j==0) directQ = Vertex2TVector(contour2->wing->vertex) - directN;
            else      directQ = directQ - (Vertex2TVector(wing->next->vertex) - directN)*0.5;

            TVector<double>  directSQ = directS^directQ;
            TVector<double>  directQR = directQ^contour2->directR;
            tc = ProportionVector(directQR, directSQ, tt);
            uc = ProportionVector(directSQ, directRS, ut);
            directT = contour2->directR + tc*directS;
            ut = Max(ut, Collision_Tolerance);
            tt = Max(tt, Collision_Tolerance);
            if (tc>tt && 1.-tc>tt && uc>ut && 1.-uc>ut &&
                tc*directS.n>directS.t && (1.-tc)*directS.n>directS.t &&
                uc*directT.n>directT.t && (1.-uc)*directT.n>directT.t) {
//              DEBUG_MODE PRINT_MESG("三角形の内部 %d : %e  %e    %e  %e\n", j+1, tc, uc, tt, ut);
                //PrintFacetAsciiSTL(contour1);
                //PrintFacetAsciiSTL(contour2);
                return true;
            }
        }
    }
    return false;
}

Here is the call graph for this function:

Here is the caller graph for this function:

bool jbxl::isNull

(

void *

p

)

[inline]

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

Referenced by CRingBuffer::free(), and freeNull().

                              {
    if (p==NULL) return true;

#ifdef WIN32
    if (p==WIN_DD_NULL) return true;
#endif
    
    return false;
}

Here is the caller graph for this function:

bool jbxl::isSameDimension	(	const Matrix< T >	v1,
		const Matrix< T >	v2
	)			[inline]

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

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

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

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

Here is the caller graph for this function:

bool isSameMaterial	(	MaterialParam	a,
		MaterialParam	b
	)

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

Definition at line 404 of file MaterialParam.cpp.

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

Referenced by MeshObjectNode::setMaterialParam().

{
    if (!isSameTexture(a.texture, b.texture)) return false;
    if (!isSameTexture(a.bumpmap, b.bumpmap)) return false;
    if (!isSameTexture(a.specmap, b.specmap)) return false;

    //
    bool ret = true;

    char* a_param = a.getBase64Params();
    char* b_param = b.getBase64Params();
    //
    if (a_param!=NULL && b_param!=NULL) {
        if (strcmp(a_param, b_param)) ret = false;
    }
    else if (a_param!=NULL || b_param!=NULL) {
        ret = false;
    }
    if (a_param!=NULL) ::free(a_param);
    if (b_param!=NULL) ::free(b_param);

    return ret;
}

Here is the call graph for this function:

Here is the caller graph for this function:

bool isSameTexture	(	TextureParam	a,
		TextureParam	b
	)

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

Definition at line 192 of file MaterialParam.cpp.

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

Referenced by isSameMaterial().

{
    char* a_name = a.getName();
    char* b_name = b.getName();
    if (a_name!=NULL && b_name!=NULL) {
        if (strcmp(a_name, b_name)) return false;
    }
    else if (a_name!=NULL || b_name!=NULL) return false;

    //
    for (int i=0; i<4; i++) {
        if (a.getColor(i)!=b.getColor(i)) return false;
    }

    return true;
}

Here is the call graph for this function:

Here is the caller graph for this function:

DllExport void JoinShortageWings

(

BREP_SOLID *

solid

)

void jbxl::JoinShortageWings(BREP_SOLID* solid)

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

要求データ

• ShortageWings List．CreateShortageWingsList()で作成しても良い

Definition at line 608 of file TriBrep.cpp.

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().

{
    if (solid->shortage_wings.empty()) return;
//  DEBUG_MODE PRINT_MESG("Start JoinShortageWings\n");

    BREP_WING_LIST::iterator iwing;
    for (iwing=solid->shortage_wings.begin(); iwing!=solid->shortage_wings.end(); iwing++){
        BREP_WING* wingA = (*iwing);

        if (GetWingOtherSide(wingA)->contour==NULL) {       // 両方NULL
            delete (wingA->edge);
            continue;
        }
        
        if (wingA->edge->edge_list!=NULL) {
            BREP_EDGE_LIST* edge_list = wingA->edge->edge_list;
            BREP_EDGE_LIST::iterator iedge;
            for (iedge=edge_list->begin(); iedge!=edge_list->end(); iedge++){
                if (wingA==(*iedge)->wing1 || wingA==(*iedge)->wing2) continue;
                if ((*iedge)->wing1->contour!=NULL && (*iedge)->wing2->contour!=NULL) continue;

                BREP_WING* wingB;
                if      ((*iedge)->wing1->contour!=NULL) wingB = (*iedge)->wing1;
                else if ((*iedge)->wing2->contour!=NULL) wingB = (*iedge)->wing2;
                else continue;  // 両方NULLをこちらが先に見つけた．→ 上のdeleteコードに任せる．

                if (wingA->vertex==wingB->vertex) {
                    if      (wingA->edge->wing1==wingA) wingA->edge->wing1 = wingB;
                    else if (wingA->edge->wing2==wingA) wingA->edge->wing2 = wingB;
                    if      (wingB->edge->wing1==wingB) wingB->edge->wing1 = wingA;
                    else if (wingB->edge->wing2==wingB) wingB->edge->wing2 = wingA;

                    BREP_EDGE* sedge = wingB->edge;
                    wingB->edge = wingA->edge;
                    wingA->edge = sedge;
                    wingB->edge->complete = true;
                    wingA->edge->complete = false;
                    break;
                }
            }
        }
    }
    CreateContoursList(solid);
    CreateWingsList(solid);

//  DEBUG_MODE PRINT_MESG("End   JoinShortageWings\n");
    return;
}

Here is the call graph for this function:

Here is the caller graph for this function:

TriPolyData * joinTriPolyData	(	TriPolyData *&	first,
		int	num_f,
		TriPolyData *&	next,
		int	num_n
	)

Definition at line 248 of file FacetBaseData.cpp.

References TriPolyData::dup(), TriPolyData::facetNum, and freeTriPolyData().

{
    if (first==NULL) return next;
    if (next ==NULL) return first;

    TriPolyData* join = (TriPolyData*)malloc((num_f+num_n)*sizeof(TriPolyData));
    if (join==NULL) return NULL;
    
    int fnum = 0;
    for (int i=0; i<num_f; i++) {
        join[i].dup(first[i]);
        if (join[i].facetNum>fnum) fnum = join[i].facetNum;
    }
    fnum += 1;

    for (int i=0; i<num_n; i++) {
        join[num_f+i].dup(next[i]);
        join[num_f+i].facetNum += fnum;
    }

    freeTriPolyData(first, num_f);
    freeTriPolyData(next,  num_n);

    return join;
}

Here is the call graph for this function:

MSGraph<R> jbxl::Laplacian	(	MSGraph< T >	vp,
		int	mode = 0
	)			[inline]

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 61 of file Gmt.h.

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.

{
    int i, j;
    int nx, ny, xs, xs2;
    R   da, db, dc, dd, de, df, dg, dh;
    MSGraph<R> lp;
    
    lp.mimicry(vp);
    lp.base = lp.zero = 0;

    if (lp.isNull()) {
        DEBUG_MODE PRINT_MESG("LAPLACIAN: No More Memory!!!\n");
        lp.state = JBXL_GRAPH_MEMORY_ERROR;
        return lp;
    }

    xs  = vp.xs;
    xs2 = 2*xs;

    if (mode==4) {
        for (j=1; j<vp.ys-1; j++) {
            ny = j*vp.xs;
            for (i=1; i<vp.xs-1; i++) {
                nx = ny + i;
                da = vp.gp[nx+1]  + vp.gp[nx-1];
                db = vp.gp[nx];
                dc = vp.gp[nx+xs] + vp.gp[nx-xs];
                lp.gp[nx] = (R)(da - 4.*db + dc);
                //da = vp.point(i+1, j) + vp.point(i-1, j);
                //db = vp.point(i, j);
                //dc = vp.point(i, j+1) + vp.point(i, j-1);
                //lp.point(i, j) = (R)(da - 4.*db + dc);
            }
        }
    }

    else if (mode==8) {
        for (j=1; j<vp.ys-1; j++) {
            ny = j*vp.xs;
            for (i=1; i<vp.xs-1; i++) {
                nx = ny + i;
                da = vp.gp[nx+1]    + vp.gp[nx-1];
                db = vp.gp[nx+xs]   + vp.gp[nx-xs];
                dc = vp.gp[nx];
                dd = vp.gp[nx+1+xs] + vp.gp[nx-1+xs];
                de = vp.gp[nx+1-xs] + vp.gp[nx-1-xs];
                lp.gp[nx] = (R)(da + db - 8.*dc + dd + de);
                //da = vp.point(i+1, j)   + vp.point(i-1, j);
                //db = vp.point(i, j+1)   + vp.point(i, j-1);
                //dc = vp.point(i, j);
                //dd = vp.point(i+1, j+1) + vp.point(i-1, j+1);
                //de = vp.point(i+1, j-1) + vp.point(i-1, j-1);
                //lp.point(i, j) = (R)(da + db - 8.*dc + dd + de);
            }
        }
    }

    else {
        for (j=2; j<vp.ys-2; j++) {
            ny = j*vp.xs;
            for (i=2; i<vp.xs-2; i++) {
                nx = ny + i;
                da = vp.gp[nx];
                db = vp.gp[nx+1]     + vp.gp[nx-1]   + vp.gp[nx+xs]   + vp.gp[nx-xs];
                dc = vp.gp[nx-1-xs2] + vp.gp[nx-xs2] + vp.gp[nx+1-xs2];
                dd = vp.gp[nx-1+xs2] + vp.gp[nx+xs2] + vp.gp[nx+1+xs2];
                de = vp.gp[nx-2-xs ] + vp.gp[nx-2]   + vp.gp[nx-2+xs];
                df = vp.gp[nx+2-xs ] + vp.gp[nx+2]   + vp.gp[nx+2+xs];
                dg = vp.gp[nx-2-xs2] + vp.gp[nx+2-xs2];
                dh = vp.gp[nx-2+xs2] + vp.gp[nx+2+xs2];
                lp.gp[nx] = (R)((-12.*da - 4.*db + 2.*(dc+dd+de+df) + dg + dh)/32.);

                //da = vp.point(i, j);
                //db = vp.point(i+1, j)   + vp.point(i-1, j) + vp.point(i,   j+1)   + vp.point(i, j-1);
                //dc = vp.point(i-1, j-2) + vp.point(i, j-2) + vp.point(i+1, j-2);
                //dd = vp.point(i-1, j+2) + vp.point(i, j+2) + vp.point(i+1, j+2);
                //de = vp.point(i-2, j-1) + vp.point(i-2, j) + vp.point(i-2, j+1);
                //df = vp.point(i+2, j-1) + vp.point(i+2, j) + vp.point(i+2, j+1);
                //dg = vp.point(i-2, j-2) + vp.point(i+2, j-2);
                //dh = vp.point(i-2, j+2) + vp.point(i+2, j+2);
                //lp.point(i, j) = (R)((-12.*da - 4.*db + 2.*(dc+dd+de+df) + dg + dh)/32.);
            }
        }
    }

    return lp;
}

Here is the call graph for this function:

void jbxl::Local2World	(	MSGraph< T >	gd,
		MSGraph< T >	vp,
		Vector< R >	oq,
		Vector< R >	op,
		Vector< R >	ex,
		double *	pcsf = NULL,
		double *	psnf = NULL
	)			[inline]

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軸）の向き．
	pcsf	sinθ≒0 の場合に *csfに代入される．連続計算の場合に直前の cosφの値を指定する．
	psnf	sinθ≒0 の場合に *snfに代入される．連続計算の場合に直前の sinφの値を指定する．

Definition at line 749 of file Graph.h.

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().

{
    int x, y, z, cx, cy, cz;
    double px, py, pz, xx, yy, zz;
    double cst, snt, csf=0.0, snf=1.0;

    if (pcsf!=NULL && psnf!=NULL) {
        csf = *pcsf;
        snf = *psnf;
    }

    ToPola(ex, cst, snt, csf, snf, csf, snf);

    for (z=0; z<vp.zs; z++) {
        cz = z*vp.xs*vp.ys;
        for (y=0; y<vp.ys; y++) {
            cy = cz + y*vp.xs;
            for (x=0; x<vp.xs; x++) {
                cx = cy + x;
                if (vp.gp[cx]!=vp.zero) {
                    px = z - op.z;  // ローカルな極座標系の原点へ
                    py = op.x - x;
                    pz = op.y - y;
                    xx = px*snt*csf - py*snf - pz*cst*csf + oq.x;
                    yy = px*snt*snf + py*csf - pz*cst*snf + oq.y;
                    zz = px*cst           + pz*snt   + oq.z;
                    gd.set_vPoint(xx, yy, zz, vp.gp[cx], ON);
                }
            }
        }
    }

    if (pcsf!=NULL && psnf!=NULL) {
        *pcsf = csf;
        *psnf = snf;
    }
}

Here is the call graph for this function:

Here is the caller graph for this function:

MSGraph<T> jbxl::make_element_morph

(

Parameter32

x

)

[inline]

template <typename t>=""> MSGraph<T> make_element_morph(Parameter x)

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

Definition at line 243 of file Morph.h.

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.

{
    int    *p, n, m, r, c, i, j, k, z;
    int    nn, xs, ir;
    double s, sn, cs, dr, dt, df, th, fi, rx, zz;
    MSGraph<T> vp, xp;
  
    p = (int*)x.pm; 
    m = p[0];               // mode 
    r = p[1];               // hankei 
    c = p[2];               // color
    s = p[3]/p[4];          // RZxy;

    if (m==SPHERE_ELEMENT) {
        xs = 2*r + 1;
        vp.getm(xs, xs, (int)(xs*s+0.5));
        if (vp.isNull()) return vp;

        xp.xs = xs; 
        xp.ys = xs; 
        xp.zs = 1;

        for (z=0; z<vp.zs; z++) {
            xp.gp = &vp.gp[z*vp.xs*vp.ys];
            zz = Min(r, Xabs(((vp.zs-1.)/2.-z)/s));
            ir = (int)(sqrt(Max(r*r-zz*zz, 0.0))+0.5); 
            circle(xp, r, r, ir, c, ON);
        }
    } 
    else {
        DEBUG_MODE PRINT_MESG("MAKE_ELEMENT_MORPH: no support mode = %d\n",m);
        exit(1);
    }

    return vp;
}

Here is the call graph for this function:

MSGraph<T> jbxl::medianFilter	(	MSGraph< T >	xp,
		int	ms = 3
	)			[inline]

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

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

Parameters:

	xp	対象となるグラフィックデータ構造体．
	ms	フィルタの大きさ．

Returns:

メディアンフィルタ処理されたグラフィックデータ．

Definition at line 806 of file Gmt.h.

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.

{
    int   i, j, x, y, z, cx;
    int   xx, yy, zz, cw, ux, mz;
    int   kc, xc, zc, xs, ps;
    T*    me;
    MSGraph<T> vp;

    mz = Min(ms, xp.zs);
    me = (T*)malloc(ms*ms*mz*sizeof(T));

    vp.mimicry(xp);
    if (vp.isNull()) {
        free(me);
        DEBUG_MODE PRINT_MESG("medianFilter: No More Memory!!\n");
        vp.state = JBXL_GRAPH_MEMORY_ERROR;
        return vp;
    }

    kc = ms*ms*mz/2;
    xc = ms/2;
    zc = mz/2;
    xs = xp.xs;
    ps = xp.xs*xp.ys;
    z  = xp.zs/2;
    for(y=xc; y<xp.ys-xc; y++) 
    for(x=xc; x<xp.xs-xc; x++) {
        cx = z*ps + y*xs + x;
        i  = 0;
        for (zz=-zc; zz<=zc; zz++)
        for (yy=-xc; yy<=xc; yy++)
        for (xx=-xc; xx<=xc; xx++) {
            cw = cx + xx + yy*xs + zz*ps;
            me[i++] = xp.gp[cw];
        }
        for (i=0; i<ms*ms*mz-1; i++) 
        for (j=i+1; j<ms*ms*mz; j++) {
            if (me[i]<me[j]) {
                ux    = me[i];
                me[i] = me[j];
                me[j] = ux;
            }
        }
        vp.gp[cx-z*ps] = me[kc];
    }

    free(me);
    return vp;
}

Here is the call graph for this function:

Vector<T> jbxl::MidPoint	(	const Vector< T >	a,
		const Vector< T >	b
	)			[inline]

Definition at line 199 of file Vector.h.

{ return 0.5*(a+b); }

MSGraph<T> jbxl::Morphology	(	MSGraph< T >	vp,
		MSGraph< T >	xp,
		int	cc,
		int	mode
	)			[inline]

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 55 of file Morph.h.

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

{
    MSGraph<T> wp;

    if (mode==OPENING) wp = opening_morph(vp, xp, cc);
    else {
        DEBUG_MODE PRINT_MESG("MORPHOLOGY: サポートしていない演算です = %d\n", mode);
    }
    return wp;
}

Here is the call graph for this function:

TGAImage jbxl::MSGraph2TGAImage

(

MSGraph< T >

vp

)

[inline]

template <typename t>=""> TGAImage MSGraph2TGAImage(MSGraph<T> vp)

MSGraph型イメージデータを Tgaイメージデータに変換する

Parameters:

vp

MSGraph型イメージデータ

Returns:

Tgaイメージデータ

Return values:

	JBXL_GRAPH_NODATA_ERROR	state データ無し
	JBXL_GRAPH_MEMORY_ERROR	state メモリ確保エラー

Definition at line 121 of file TgaTool.h.

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_MA, GRAPH_COLOR_MONO, GRAPH_COLOR_RGB, GRAPH_COLOR_RGBA, GRAPH_COLOR_UNKNOWN, TGAImage::isNull(), MSGraph< T >::isNull(), JBXL_GRAPH_IVDARG_ERROR, JBXL_GRAPH_NODATA_ERROR, TGAImage::point(), TGAImage::set(), TGAImage::state, TGAImage::xs, MSGraph< T >::xs, TGAImage::ys, MSGraph< T >::ys, and MSGraph< T >::zs.

{
    TGAImage tga;

    if (vp.isNull()) {
        tga.state = JBXL_GRAPH_NODATA_ERROR;
        return tga;
    }

    tga.set(vp.xs, vp.ys, vp.zs);
    if (tga.isNull()) return tga;

    if (vp.color==GRAPH_COLOR_UNKNOWN) {
        if      (vp.zs==1) vp.color = GRAPH_COLOR_MONO;
        else if (vp.zs==3) vp.color = GRAPH_COLOR_RGB;
        else if (vp.zs==4) vp.color = GRAPH_COLOR_RGBA;
    }

    //
    if (vp.color==GRAPH_COLOR_BGRA || vp.color==GRAPH_COLOR_BGR || vp.color==GRAPH_COLOR_MONO || vp.color==GRAPH_COLOR_MA) { 
        for (int k=0; k<tga.col; k++) {
            int zp = k*tga.xs*tga.ys;
            for (int j=0; j<tga.ys; j++) {
                int yp = zp + j*tga.xs;
                for (int i=0; i<tga.xs; i++) {
                    tga.point(i, j, k) = (uByte)vp.gp[yp + i];
                }
            }
        }
    }
    //
    else if (vp.color==GRAPH_COLOR_RGB || vp.color==GRAPH_COLOR_RGBA) { 
        for (int k=0; k<3; k++) {
            int zp = (2-k)*tga.xs*tga.ys;
            for (int j=0; j<tga.ys; j++) {
                int yp = zp + j*tga.xs;
                for (int i=0; i<tga.xs; i++) {
                    tga.point(i, j, k) = (uByte)vp.gp[yp + i];
                }
            }
        }
        if (vp.color==GRAPH_COLOR_RGBA) {   // αチャンネル
            int zp = 3*tga.xs*tga.ys;
            for (int j=0; j<tga.ys; j++) {
                int yp = zp + j*tga.xs;
                for (int i=0; i<tga.xs; i++) {
                    tga.point(i, j, 3) = (uByte)vp.gp[yp + i];
                }
            }
        }
    }
    //
    else if (vp.color==GRAPH_COLOR_ABGR) { 
        for (int j=0; j<tga.ys; j++) {      // αチャンネル
            int yp = j*tga.xs;
            for (int i=0; i<tga.xs; i++) {
                tga.point(i, j, 3) = (uByte)vp.gp[yp + i];
            }
        }
        for (int k=1; k<4; k++) {
            int zp = k*tga.xs*tga.ys;
            for (int j=0; j<tga.ys; j++) {
                int yp = zp + j*tga.xs;
                for (int i=0; i<tga.xs; i++) {
                    tga.point(i, j, k-1) = (uByte)vp.gp[yp + i];
                }
            }
        }
    }
    //
    else if (vp.color==GRAPH_COLOR_ARGB) { 
        for (int j=0; j<tga.ys; j++) {      // αチャンネル
            int yp = j*tga.xs;
            for (int i=0; i<tga.xs; i++) {
                tga.point(i, j, 3) = (uByte)vp.gp[yp + i];
            }
        }
        for (int k=1; k<4; k++) {
            int zp = (4-k)*tga.xs*tga.ys;
            for (int j=0; j<tga.ys; j++) {
                int yp = zp + j*tga.xs;
                for (int i=0; i<tga.xs; i++) {
                    tga.point(i, j, k-1) = (uByte)vp.gp[yp + i];
                }
            }
        }
    }
    else {
        tga.state = JBXL_GRAPH_IVDARG_ERROR;
        tga.free();
    }

    return tga;
}

Here is the call graph for this function:

void jbxl::MSGraph_Box	(	MSGraph< T >	vp,
		int	x1,
		int	y1,
		int	x2,
		int	y2,
		int	cc,
		int	mode = OFF
	)			[inline]

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	線の濃度．
	mode	ON なら四角形の内部の vp.zero〜cc-1 をccで塗りつぶす．

使用例

box(vp, 100, 100, 200, 200, 1000, 0);  // 100,100),(200,200)を対角とした四角形を描く 

Definition at line 1061 of file Graph.h.

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

{
    MSGraph_Line(vp, x1, y1, x2, y1, cc);
    MSGraph_Line(vp, x2, y1, x2, y2, cc);
    MSGraph_Line(vp, x2, y2, x1, y2, cc);
    MSGraph_Line(vp, x1, y2, x1, y1, cc);

    if (mode==ON) {
        MSGraph_Paint(vp, (x1+x2)/2, (y1+y2)/2, (int)vp.zero, cc-1, cc, 4); 
    }
    return;
}

Here is the call graph for this function:

void jbxl::MSGraph_changeColor	(	MSGraph< T >	vp,
		int	f,
		int	t
	)			[inline]

Definition at line 789 of file Graph.h.

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

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

void jbxl::MSGraph_Circle	(	MSGraph< T >	vp,
		int	x,
		int	y,
		int	r,
		int	cc,
		int	mode = OFF
	)			[inline]

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	線の濃度．
	mode	ON なら円の内部の vp.zero〜cc-1 をccで塗りつぶす．

Definition at line 1187 of file Graph.h.

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().

{
    double yy, dy, dt;
    int i, nn, cx;
    int ix, iy, ux=1;
    int *px, *py;

    if (r<=0) return;

    px = (int*)malloc(sizeof(int)*(r+1));
    py = (int*)malloc(sizeof(int)*(r+1));
    if (px==NULL || py==NULL) {
        free(px);
        free(py);
        return;
    }

    ix = 0;
    iy = r;
    yy = (double)r;
    nn = 0;
    px[0] = ix;
    py[0] = iy;

    cx = (y+iy)*vp.xs + (x+ix);
    if (x+ix>=0 && x+ix<vp.xs && y+iy>=0 && y+iy<vp.ys) vp.gp[cx] = (T)cc;
    while(iy>=ix) {
        ix = ix + ux;
        dt = -ux/yy;
        dy = ix*dt;
        yy = yy + dy;
        iy = (int)yy;

        if (x+ix>=0 && x+ix<vp.xs && y+iy>=0 && y+iy<vp.ys) vp.point(x+ix, y+iy) = (T)cc;
        nn++;
        px[nn] = ix;
        py[nn] = iy;
    }

    for (i=0; i<=nn; i++) {
        ix = py[nn-i];
        iy = px[nn-i];
        if (x+ix>=0 && x+ix<vp.xs && y+iy>=0 && y+iy<vp.ys) vp.point(x+ix, y+iy) = (T)cc;
    }

    for (i=0; i<=nn; i++) {
        ix =  py[i];
        iy = -px[i];
        if (x+ix>=0 && x+ix<vp.xs && y+iy>=0 && y+iy<vp.ys) vp.point(x+ix, y+iy) = (T)cc;
    }

    for (i=0; i<=nn; i++) {
        ix =  px[nn-i];
        iy = -py[nn-i];
        if (x+ix>=0 && x+ix<vp.xs && y+iy>=0 && y+iy<vp.ys) vp.point(x+ix, y+iy) = (T)cc;
    }

    for (i=0; i<=nn; i++) {
        ix = -px[i];
        iy = -py[i];
        if (x+ix>=0 && x+ix<vp.xs && y+iy>=0 && y+iy<vp.ys) vp.point(x+ix, y+iy) = (T)cc;
    }

    for (i=0; i<=nn; i++) {
        ix = -py[nn-i];
        iy = -px[nn-i];
        if (x+ix>=0 && x+ix<vp.xs && y+iy>=0 && y+iy<vp.ys) vp.point(x+ix, y+iy) = (T)cc;
    }

    for (i=0; i<=nn; i++) {
        ix = -py[i];
        iy =  px[i];
        if (x+ix>=0 && x+ix<vp.xs && y+iy>=0 && y+iy<vp.ys) vp.point(x+ix, y+iy) = (T)cc;
    }

    for (i=0; i<=nn; i++) {
        ix = -px[nn-i];
        iy =  py[nn-i];
        if (x+ix>=0 && x+ix<vp.xs && y+iy>=0 && y+iy<vp.ys) vp.point(x+ix, y+iy) = (T)cc;
    }

    if (mode==ON) MSGraph_Paint(vp, x, y, (int)vp.zero, cc-1, cc, 4);

    free(px);
    free(py);
}

Here is the call graph for this function:

Here is the caller graph for this function:

void jbxl::MSGraph_Circle3D	(	MSGraph< T >	vp,
		Vector<>	ox,
		Vector<>	ex,
		int	rr,
		int	cc,
		int	mode = OFF
	)			[inline]

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	線の濃度．
	mode	ON なら円の内部の vp.zero〜cc-1 をccで塗りつぶす．

Definition at line 1289 of file Graph.h.

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

Referenced by MSGraph_Torus(), and wCircle3D().

{
    MSGraph<T>  xp(2*rr+3, 2*rr+3);
    if (xp.gp==NULL) return;

    Vector<> oz((xp.xs-1)/2., (xp.ys-1)/2., 0.0);

    MSGraph_Circle(xp, rr+1, rr+1, rr, cc, mode);
    Local2World(vp, xp, ox, oz, ex);
    xp.free();
}

Here is the call graph for this function:

Here is the caller graph for this function:

void jbxl::MSGraph_Line	(	MSGraph< T >	vp,
		int	x1,
		int	y1,
		int	x2,
		int	y2,
		int	cc
	)			[inline]

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 962 of file Graph.h.

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

Referenced by MSGraph_Box(), and MSGraph_Triangle().

{
    int  thresh=0, index;
    int  xunit=1;
    int  yunit=1;
    int  xdiff=x2-x1;
    int  ydiff=y2-y1;

    if (xdiff<0) {
        xdiff = -xdiff;
        xunit = -1;
    }
    if (ydiff<0) {
        ydiff = -ydiff;
        yunit = -1;
    }

    if (xdiff>ydiff) {
        for (index=0; index<xdiff+1; index++) {
            if (x1>=0 && x1<vp.xs && y1>=0 && y1<vp.ys) {
                vp.point(x1, y1) = (T)cc;
            }
            x1 = x1 + xunit;
            thresh = thresh + ydiff;
            if (thresh>=xdiff) {
                thresh = thresh - xdiff;
                y1 = y1 + yunit;
            }
        }
    }
    else {
        for (index=0; index<ydiff+1; index++) {
            if (x1>=0 && x1<vp.xs && y1>=0 && y1<vp.ys) {
                vp.point(x1, y1) = (T)cc;
            }
            y1 = y1 + yunit;
            thresh = thresh + xdiff;
            if (thresh>=ydiff) {
                thresh = thresh - ydiff;
                x1 = x1 + xunit;
            }
        }
    }
}   

Here is the call graph for this function:

Here is the caller graph for this function:

void jbxl::MSGraph_Line3D	(	MSGraph< T >	vp,
		int	x1,
		int	y1,
		int	z1,
		int	x2,
		int	y2,
		int	z2,
		int	cc
	)			[inline]

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 1087 of file Graph.h.

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

{
    int   i;
    int   xx, yy, zz, dx, dy, dz;
    int   ux=1, uy=1, uz=1;
    int   sx=0, sy=0, sz=0;

    dx = x2 - x1;
    dy = y2 - y1;
    dz = z2 - z1;

    if (dx<0) {
        dx = -dx;
        ux = -1;
    }
    if (dy<0) {
        dy = -dy;
        uy = -1;
    }
    if (dz<0) {
        dz = -dz;
        uz = -1;
    }

    xx = x1;
    yy = y1;
    zz = z1;

    if (xx>=0 && xx<vp.xs && yy>=0 && yy<vp.ys && zz>=0 && zz<vp.zs) {
        vp.point(xx, yy, zz) = (T)cc;
    }
    if (dx>=dy && dx>=dz) {
        for (i=1; i<=dx; i++) {
            xx = xx + ux;
            sy = sy + dy;
            sz = sz + dz;
            if (sy>dx) {
                sy = sy - dx;
                yy = yy + uy;
            }
            if (sz>dx) {
                sz = sz - dx;
                zz = zz + uz;
            }
            if (xx>=0 && xx<vp.xs && yy>=0 && yy<vp.ys && zz>=0 && zz<vp.zs) {
                vp.point(xx, yy, zz) = (T)cc;
            }
        }
    }
    else if (dy>dx && dy>=dz) {
        for (i=1; i<=dy; i++) {
            yy = yy + uy;
            sx = sx + dx;
            sz = sz + dz;
            if (sx>dy) {
                sx = sx - dy;
                xx = xx + ux;
            }
            if (sz>dy) {
                sz = sz - dy;
                zz = zz + uz;
            }
            if (xx>=0 && xx<vp.xs && yy>=0 && yy<vp.ys && zz>=0 && zz<vp.zs) {
                vp.point(xx, yy, zz) = (T)cc;
            }
        }
    }
    else {
        for (i=1; i<=dz; i++) {
            zz = zz + uz;
            sx = sx + dx;
            sy = sy + dy;
            if (sx>dz) {
                sx = sx - dz;
                xx = xx + ux;
            }
            if (sy>dz) {
                sy = sy - dz;
                yy = yy + uy;
            }
            if (xx>=0 && xx<vp.xs && yy>=0 && yy<vp.ys && zz>=0 && zz<vp.zs) {
                vp.point(xx, yy, zz) = (T)cc;
            }
        }
    }
}

Here is the call graph for this function:

int jbxl::MSGraph_Paint	(	MSGraph< T >	vp,
		int	x,
		int	y,
		int	mn,
		int	mx,
		int	cc,
		int	mode = 8
	)			[inline]

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 814 of file Graph.h.

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

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

{
    int  i, j, k, ss;

    if (cc<=mx && cc>=mn) {
        DEBUG_MODE PRINT_MESG("MSGRAPH_PAINT: WARNING: c = %d. Not be %d< c <%d\n", cc, mn, mx); 
        return 0;
    }

    if (x<0 || x>=vp.xs || y<0 || y>=vp.ys) return 0;
    if (vp.gp[y*vp.xs+x]>(T)mx || vp.gp[y*vp.xs+x]<(T)mn) return 0;

    while(x>0) {
        if (vp.gp[y*vp.xs+x-1]>(T)mx || vp.gp[y*vp.xs+x-1]<(T)mn) break;
        x--; 
    }
    k = x;

    ss = 0;
    while(k<vp.xs) {
        if (vp.gp[y*vp.xs+k]>(T)mx || vp.gp[y*vp.xs+k]<(T)mn) break;
        vp.gp[y*vp.xs+k] = (T)cc; 
        ss++;
        k++;
    }
    k--;

    for (i=x; i<=k; i++){ 
        if (y-1>=0 && y-1<vp.ys){ 
            j = (y-1)*vp.xs+i;
            if (vp.gp[j]<=(T)mx && vp.gp[j]>=(T)mn) {
                ss += MSGraph_Paint(vp, i, y-1, mn, mx, cc, mode);
            }

            if (Xabs(mode)==8) {  // 8-neighborhood 
                if (i-1>=0) {
                    if (vp.gp[j-1]<=(T)mx && vp.gp[j-1]>=(T)mn) {
                        ss += MSGraph_Paint(vp, i-1, y-1, mn, mx, cc, mode);
                    }
                }
                if (i+1<vp.xs) {
                    if (vp.gp[j+1]<=(T)mx && vp.gp[j+1]>=(T)mn) {
                        ss += MSGraph_Paint(vp, i+1, y-1, mn, mx, cc, mode);
                    }
                }
            }
        }

        if (y+1>=0 && y+1<vp.ys){
            j = (y+1)*vp.xs+i;
            if (vp.gp[j]<=(T)mx && vp.gp[j]>=(T)mn) {
                ss += MSGraph_Paint(vp, i, y+1, mn, mx, cc, mode);
            }

            if (Xabs(mode)==8) {    // 8-neighborhood 
                if (i-1>=0) {
                    if (vp.gp[j-1]<=(T)mx && vp.gp[j-1]>=(T)mn) {
                        ss += MSGraph_Paint(vp, i-1, y+1, mn, mx, cc, mode);
                    }
                }
                if (i+1<vp.xs) {
                    if (vp.gp[j+1]<=(T)mx && vp.gp[j+1]>=(T)mn) {
                        ss += MSGraph_Paint(vp, i+1, y+1, mn, mx, cc, mode);
                    }
                }
            }
        }
    }
    return ss;
}

Here is the caller graph for this function:

int jbxl::MSGraph_Paint3D	(	MSGraph< T >	vp,
		int	x,
		int	y,
		int	z,
		int	mn,
		int	mx,
		int	cc,
		int	mode = 8
	)			[inline]

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 905 of file Graph.h.

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

{
    int  i, j, ps, ss;
    MSGraph<T> xp;

    ss = 0;
    ps = vp.xs*vp.ys;
    xp = vp;
    xp.zs = 1;
    xp.gp = &(vp.gp[z*ps]);

    if (xp.gp[y*xp.xs+x]>(T)mx || xp.gp[y*xp.xs+x]<(T)mn) return 0;
    ss += MSGraph_Paint(xp, x, y, mn, mx, cc, mode);
    if (mode<0) {
        DEBUG_MODE PRINT_MESG("MSGRAPH_PAINT3D: zz = %d\n", z);
    }

    for (i=0; i<ps; i++) {
        if (xp.gp[i]==(T)cc) {
            x = i%vp.xs;
            y = i/vp.xs;
            if (z-1>=0) {
                j = (z-1)*ps+y*vp.xs+x;
                if (vp.gp[j]<=(T)mx && vp.gp[j]>=(T)mn) {
                    ss += MSGraph_Paint3D(vp, x, y, z-1, mn, mx, cc, mode);
                }
            }
            if (z+1<vp.zs) {
                j = (z+1)*ps+y*vp.xs+x;
                if (vp.gp[j]<=(T)mx && vp.gp[j]>=(T)mn) {
                    ss += MSGraph_Paint3D(vp, x, y, z+1, mn, mx, cc, mode);
                }
            }
        }
    }

    return ss;
}

Here is the call graph for this function:

void jbxl::MSGraph_Pool	(	MSGraph< T >	vp,
		Vector<>	a,
		Vector<>	b,
		int	rr,
		int	cc
	)			[inline]

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 1314 of file Graph.h.

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

{
    int  i, cz;
    Vector<>   ox, oz;
    MSGraph<T> xp, pp;

    ox = a - b;
    ox.norm();
    xp.set(2*rr+3, 2*rr+3, (int)(ox.n + 0.5));
    if (xp.gp==NULL) return;

    pp = xp;
    for (i=0; i<xp.zs; i++) {
        cz = i*xp.xs*xp.ys;
        pp.gp = &(xp.gp[cz]);
        MSGraph_Circle(pp, rr+1, rr+1, rr, cc, ON);
    }
    
    oz.set((xp.xs-1)/2.0, (xp.ys-1)/2.0, (xp.zs-1)/2.0);
    Local2World(vp, xp, (a+b)/2.0, oz, ox);
    xp.free();
    return;
}

Here is the call graph for this function:

void jbxl::MSGraph_Sphere	(	MSGraph< T >	vp,
		Vector<>	a,
		int	r,
		int	cc,
		int	mode = 1
	)			[inline]

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 1401 of file Graph.h.

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.

{
    int i, j, k, rx, nn, s=1;   // s: 壁を作る場合の境界からの距離
    double th, fi, cs, sn, cf, sf, dt;
    double xx, yy, zz;
    MSGraph<T> xp;
 
    if (mode==1) {
        xp = vp;
        for (k=(int)(a.z-r+0.5); k<=(int)(a.z+r+0.5); k++) {
            if (k>=0 && k<vp.zs) {
                xp.gp = &vp.gp[k*vp.xs*vp.ys];
                rx = (int)(sqrt(r*r-(a.z-k)*(a.z-k))+0.5);
                MSGraph_Circle(xp, (int)(a.x+0.5), (int)(a.y+0.5), rx, cc, ON);
            }
        }   
    }
    else {
        nn = (int)(2*PI*r + 0.5)*2;
        dt = PI/nn;
        for (i=0; i<=nn; i++) {
            th = dt*i;
            sn = sin(th);
            cs = cos(th);
            zz = r*cs + a.z;
            if (mode==-1) {
                if (zz<s)        zz = s;
                if (zz>vp.zs-s-1) zz = vp.zs - s - 1;
            }
            for (j=0; j<=2*nn; j++) {
                fi = dt*j;
                cf = cos(fi);
                sf = sin(fi);
                xx = r*sn*cf + a.x;
                yy = r*sn*sf + a.y;
                if (mode==-1) {
                    if (xx<s)        xx = s;
                    if (yy<s)        yy = s;
                    if (xx>vp.xs-s-1) xx = vp.xs - s - 1;
                    if (yy>vp.ys-s-1) yy = vp.ys - s - 1;
                }
                vp.set_vPoint(xx, yy, zz, (T)cc, ON);
            }
        }
    }
    return;
}

Here is the call graph for this function:

void jbxl::MSGraph_Torus	(	MSGraph< T >	vp,
		Vector<>	ox,
		Vector<>	ex,
		int	rr,
		int	ra,
		int	cc
	)			[inline]

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 1354 of file Graph.h.

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

{
    int  i, nn;
    double  dt, th, xx, yy, zz, sn, cs;
    MSGraph<T> xp;
    Vector<>   ve, vo, vz;

    xp.set(2*(rr+ra)+3, 2*(rr+ra)+3, 2*ra+3);
    if (xp.gp==NULL) return;
    nn = (int)(2.0*PI*(rr+ra)*2 + 0.5);
    dt = 2.0*PI/nn;

    zz = (xp.zs-1)/2.0;
    for (i=0; i<nn; i++) {
        th = dt*i;
        sn = sin(th);
        cs = cos(th);
        xx = (xp.xs-1)/2.0 + rr*cs;
        yy = (xp.ys-1)/2.0 - rr*sn;
        vo.set(xx, yy, zz);
        ve.set(sn, cs, 0.0);
        MSGraph_Circle3D(xp, vo, ve, ra, cc, ON);
    }
    vz.set((xp.xs-1)/2., (xp.ys-1)/2., (xp.zs-1)/2.);

    Local2World(vp, xp, ox, vz, ex);
    xp.free();

    return;
}

Here is the call graph for this function:

void jbxl::MSGraph_Triangle	(	MSGraph< T >	vp,
		int	x1,
		int	y1,
		int	x2,
		int	y2,
		int	x3,
		int	y3,
		int	cc,
		int	mode = OFF
	)			[inline]

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	線の濃度．
	mode	ON なら三角形の内部の vp.zero〜cc-1 をccで塗りつぶす．

使用例

// (100,100),(100,200),(200,100)を頂点とした三角形(直角三角形)を描き，内部を塗りつぶす 
triangle(vp, 100, 100, 100, 200, 200, 100, 1000, 1);

Definition at line 1031 of file Graph.h.

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

{
    MSGraph_Line(vp, x1, y1, x2, y2, cc);
    MSGraph_Line(vp, x2, y2, x3, y3, cc);
    MSGraph_Line(vp, x3, y3, x1, y1, cc);

    if (mode==ON) {
        MSGraph_Paint(vp, (x1+x2+x3)/3, (y1+y2+y3)/3, (int)vp.zero, cc-1, cc, 4); 
    }
    return;
}

Here is the call graph for this function:

MSGraph<R> jbxl::MSMaskFilter	(	MSGraph< R >	vp,
		MSGraph< T >	filter,
		int	mode = FILTER_NON
	)			[inline]

Definition at line 993 of file Gmt.h.

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.

{
    MSGraph<R> xp;

    if (vp.xs<filter.xs || vp.ys<filter.ys || vp.zs<filter.zs) {
        DEBUG_MODE PRINT_MESG("MSMaskFilter: Error: mismach filter dimension!!\n");
        xp.state = JBXL_GRAPH_NODATA_ERROR;
        return xp;
    }
    if (filter.norm==0.0) {
        DEBUG_MODE PRINT_MESG("MSMaskFilter: Error: norm of filter is zero!!\n");
        xp.state = JBXL_GRAPH_NODATA_ERROR;
        return xp;
    }

    xp.mimicry(vp);

    int xs = filter.xs/2;
    int ys = filter.ys/2;
    int zs = filter.zs/2;

    for (int k=zs; k<xp.zs-zs; k++) {
        for (int j=ys; j<xp.ys-ys; j++) {
            for (int i=xs; i<xp.xs-xs; i++) {

                T conv = (T)0;
                for (int n=-zs; n<=zs; n++) {
                    for (int m=-ys; m<=ys; m++) {
                        for (int l=-xs; l<=xs; l++) {
                            conv += filter.point(xs+l, ys+m, zs+n) * vp.point(i+l, j+m, k+n);
                        }
                    }
                }

                R pt = (R)(conv/filter.norm);

                if (mode==FILTER_ABS && pt<(R)0) pt = -pt;
                else if (mode==FILTER_MINMAX) {
                    if (pt<(R)vp.min)      pt = (R)vp.min;
                    else if (pt>(R)vp.max) pt = (R)vp.max;
                }
                xp.point(i, j, k) = pt;
            }
        }
    }

    xp.get_minmax();
    if (mode==FILTER_NORM && xp.max!=xp.min) {
        for (int i=0; i<xp.xs*xp.ys*xp.zs; i++) {
            xp.gp[i] = (R)(((T)(xp.gp[i]-xp.min)*(vp.max-vp.min))/(xp.max-xp.min) + vp.min);
        }
        xp.get_minmax();
    }

    return xp;
}

Here is the call graph for this function:

MSGraph<R> jbxl::Nabla

(

MSGraph< T >

vp

)

[inline]

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

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

Parameters:

vp

計算対象となるグラフィックデータ構造体．

Returns:

ナブラ．スカラ型グラフィックデータ．

Definition at line 713 of file Gmt.h.

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.

{
    int   i;
    R     xx, yy, zz;
    MSGraph<R> px, py, pz, nv;

    nv.mimicry(vp);
    if (nv.isNull()) {
        DEBUG_MODE PRINT_MESG("Nabla: No More Memory!!\n");
        nv.state = JBXL_GRAPH_MEMORY_ERROR;
        return nv;
    }

    px = xSobel<R>(vp);
    if (px.gp==NULL) {
        nv.state = px.state;
        return nv;
    }

    py = ySobel<R>(vp);
    if (py.gp==NULL) {
        px.free();
        nv.state = py.state;
        return nv;
    }

    pz = zSobel<R>(vp);
    if (pz.gp==NULL) {
        px.free();
        py.free();
        nv.state = pz.state;
        return nv;
    }

    for (i=0; i<vp.xs*vp.ys*vp.zs; i++) {
        xx = px.gp[i];
        yy = py.gp[i];
        zz = pz.gp[i];
        nv.gp[i] = (R)sqrt((double)xx*xx + yy*yy + zz*zz);
    }

    px.free();
    py.free();
    pz.free();

    return nv;
}

Here is the call graph for this function:

AffineTrans<T>* jbxl::newAffineTrans

(

AffineTrans< T >

p

)

[inline]

Definition at line 384 of file Rotation.h.

References AffineTrans< T >::dup().

{
    AffineTrans<T>* a = new AffineTrans<T>();
    a->dup(p);
    return a;
}

Here is the call graph for this function:

Vector<T> jbxl::NewellMethod	(	Vector< T >	v1,
		Vector< T >	v2,
		Vector< T >	v3
	)			[inline]

Definition at line 277 of file Vector.h.

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

Referenced by FacetTriData::ComputeTriNormal(), and NewellMethod3().

{
    Vector<T> vect;

    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);
    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);
    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);
    vect.n = 0.0;
    vect.c = Min(v1.c, v2.c);
    vect.c = Min(v3.c, vect.c);

    return vect;
}

Here is the caller graph for this function:

Vector<T> jbxl::NewellMethod3	(	Vector< T >	v1,
		Vector< T >	v2,
		Vector< T >	v3
	)			[inline]

Definition at line 292 of file Vector.h.

References NewellMethod().

{
    return NewellMethod(v1, v2, v3);
}

Here is the call graph for this function:

Vector<T> jbxl::NewellMethod4	(	Vector< T >	v1,
		Vector< T >	v2,
		Vector< T >	v3,
		Vector< T >	v4
	)			[inline]

Definition at line 298 of file Vector.h.

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

{
    Vector<T> vect;

    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);
    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);
    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);
    vect.n = 0.0;
    vect.c = Min(v1.c, v2.c);
    vect.c = Min(v3.c, vect.c);
    vect.c = Min(v4.c, vect.c);
    return vect;
}

MaterialParam* jbxl::newMaterialParam

(

MaterialParam

p

)

[inline]

Definition at line 284 of file MaterialParam.h.

References MaterialParam::dup().

{ MaterialParam* m = new MaterialParam(); m->dup(p); return m;}

Here is the call graph for this function:

int nonZeroBoxel	(	MSGraph< T >	vp,
		int	n
	)			[inline]

Definition at line 220 of file Thinning.h.

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

Referenced by centerLine().

{
    int  m, xs, ps;

    ps = vp.xs*vp.ys;
    xs = vp.xs;

    m = 0;
    if (vp.gp[n+1]      !=0) m++;
    if (vp.gp[n-1]      !=0) m++;
    if (vp.gp[n+xs]     !=0) m++;
    if (vp.gp[n-xs]     !=0) m++;
    if (vp.gp[n+ps]     !=0) m++;
    if (vp.gp[n-ps]     !=0) m++;
    if (vp.gp[n+1+xs]   !=0) m++;
    if (vp.gp[n+1-xs]   !=0) m++;
    if (vp.gp[n-1+xs]   !=0) m++;
    if (vp.gp[n-1-xs]   !=0) m++;
    if (vp.gp[n+1+ps]   !=0) m++;
    if (vp.gp[n+1-ps]   !=0) m++;
    if (vp.gp[n-1+ps]   !=0) m++;
    if (vp.gp[n-1-ps]   !=0) m++;
    if (vp.gp[n+xs+ps]  !=0) m++;
    if (vp.gp[n+xs-ps]  !=0) m++;
    if (vp.gp[n-xs+ps]  !=0) m++;
    if (vp.gp[n-xs-ps]  !=0) m++;
    if (vp.gp[n+1+xs+ps]!=0) m++;
    if (vp.gp[n+1+xs-ps]!=0) m++;
    if (vp.gp[n+1-xs+ps]!=0) m++;
    if (vp.gp[n+1-xs-ps]!=0) m++;
    if (vp.gp[n-1+xs+ps]!=0) m++;
    if (vp.gp[n-1+xs-ps]!=0) m++;
    if (vp.gp[n-1-xs+ps]!=0) m++;
    if (vp.gp[n-1-xs-ps]!=0) m++;

    return m;
}

Here is the caller graph for this function:

Vector<double> jbxl::object_feature_MSGraph	(	MSGraph< T >	vp,
		int	mn,
		int	mx
	)			[inline]

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 131 of file Graph.h.

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.

{
    int  cnt = 0;
    int  nx, ny;
    MSGraph<T> pp;
    Vector<double> vt;

    pp.mimicry(vp);
    for (int i=0; i<pp.xs*pp.ys*pp.zs; i++) pp.gp[i] = vp.gp[i];

    MSGraph_Paint(pp, 0, 0, pp.zero, pp.zero, mx+1, 4);

    for (int j=0; j<pp.ys; j++) {
        ny = pp.xs*j;
        for (int i=0; i<pp.xs; i++) {
            nx = ny + i;
            if (pp.gp[nx]==pp.zero) {
                MSGraph_Paint(pp, i, j, pp.zero, pp.zero, mx, 8);
            }
        }
    }

    MSGraph_Paint(pp, 0, 0, mx+1, mx+1, pp.zero, 4);

    vt = dgree_circle_MSGraph<T>(pp);

    for (int j=0; j<pp.ys; j++) {
        ny = pp.xs*j;
        for (int i=0; i<pp.xs; i++) {
            nx = ny + i;
            if (pp.gp[nx]>=mn && pp.gp[nx]<=mx) {
                 MSGraph_Paint(pp, i, j, mn, mx, pp.zero, 8);
                 cnt++;
            }
        }
    }
    pp.free();
    vt.x = (double)cnt;

    return vt;
}

Here is the call graph for this function:

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

Definition at line 979 of file Brep.cpp.

References OctreeNode::child, BREP_VERTEX::index, and OctreeNode::vertex.

Referenced by GetOctreeVertices().

{
    if (p->vertex!=NULL) {
        if (vtx!=NULL && p->vertex->index>=0) vtx[p->vertex->index] = p->vertex;
        counter++;
    }

    for (int i=0; i<8; i++) {
        if (p->child[i]!=NULL) {
            counter = OctreeGetter(p->child[i], vtx, counter);
        }
    }

    return counter;
}

Here is the caller graph for this function:

MSGraph<T> jbxl::opening_morph	(	MSGraph< T >	vp,
		MSGraph< T >	xp,
		int	cc
	)			[inline]

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 79 of file Morph.h.

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().

{
    int  i, j, k, ks, cz, cy, cx, ps;
    bool err;
    MSGraph<T> wp(vp.xs, vp.ys, vp.zs);
    if (wp.isNull()) return wp;

    ps = vp.xs*vp.ys;
    for (k=0; k<vp.zs; k++) {
        cz = k*ps;
        for (j=0; j<vp.ys; j++) {
            cy = cz + j*vp.xs;
            for (i=0; i<vp.xs; i++) {
                cx = cy + i;
                if (vp.gp[cx]>=cc) {
                    err = point_open_morph(vp, i, j, k, xp, cc);
                    if (err) copy_morph_element(wp, i, j, k, xp);
                }
            }
        }
    }

    return wp;
}

Here is the call graph for this function:

Here is the caller graph for this function:

bool jbxl::operator!=	(	const UVMap< T >	a,
		const UVMap< T >	b
	)			[inline]

Definition at line 671 of file Vector.h.

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

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

bool jbxl::operator!=	(	const Vector< T >	v1,
		const Vector< T >	v2
	)			[inline]

Definition at line 195 of file Vector.h.

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

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

bool jbxl::operator!=	(	const TVector< T >	v1,
		const TVector< T >	v2
	)			[inline]

Definition at line 157 of file TVector.h.

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

{
    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);
    T err = (v1.t+v2.t)*(v1.t+v2.t);
    if (dst>err) return true;
    return false;
}

bool jbxl::operator!=	(	const Quaternion< T >	q1,
		const Quaternion< T >	q2
	)			[inline]

Definition at line 111 of file Rotation.h.

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

UVMap<T> jbxl::operator*	(	const UVMap< T >	a,
		const R	d
	)			[inline]

Definition at line 655 of file Vector.h.

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

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

UVMap<T> jbxl::operator*	(	const R	d,
		const UVMap< T >	a
	)			[inline]

Definition at line 651 of file Vector.h.

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

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

T jbxl::operator*	(	const Vector< T >	a,
		const Vector< T >	b
	)			[inline]

Definition at line 187 of file Vector.h.

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

{ return (a.x*b.x + a.y*b.y + a.z*b.z); }

Vector<T> jbxl::operator*	(	const Vector< T >	a,
		const R	d
	)			[inline]

Definition at line 165 of file Vector.h.

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

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

Vector<T> jbxl::operator*	(	const R	d,
		const Vector< T >	a
	)			[inline]

Definition at line 161 of file Vector.h.

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

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

T jbxl::operator*	(	const TVector< T >	a,
		const TVector< T >	b
	)			[inline]

Definition at line 181 of file TVector.h.

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

{ return  (T)(a.x*b.x + a.y*b.y + a.z*b.z);}

TVector<T> jbxl::operator*	(	const TVector< T >	a,
		const R	d
	)			[inline]

Definition at line 136 of file TVector.h.

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

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

TVector<T> jbxl::operator*	(	const R	d,
		const TVector< T >	a
	)			[inline]

Definition at line 132 of file TVector.h.

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

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

AffineTrans<T> jbxl::operator*	(	const AffineTrans< T >	a,
		const AffineTrans< T >	b
	)			[inline]

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

Definition at line 395 of file Rotation.h.

References AffineTrans< T >::isInverse, Min, AffineTrans< T >::rotate, AffineTrans< T >::scale, AffineTrans< T >::set(), Vector< T >::set(), and AffineTrans< T >::shift.

{ 
    Quaternion<T> rotate = a.rotate * b.rotate;
    Vector<T> shift = a.shift + b.shift;
    //
    Vector<T> scale;
    scale.set(a.scale.x*b.scale.x, a.scale.y*b.scale.y, a.scale.z*b.scale.z, (T)0.0, Min(a.scale.c, b.scale.c));
    
    AffineTrans<T> affine;
    affine.set(scale, rotate, shift, a.isInverse);

    return affine;
}

Here is the call graph for this function:

Quaternion<T> jbxl::operator*	(	const Vector< T >	v,
		const Quaternion< T >	q
	)			[inline]

Definition at line 170 of file Rotation.h.

References Vector< T >::c, Quaternion< 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.

{ 
    Quaternion<T> quat;
    if (q.c<(T)0.0 || v.c<(T)0.0) quat.init(-(T)1.0);
    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, 
                   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));
    return quat;
}

Here is the call graph for this function:

Quaternion<T> jbxl::operator*	(	const Quaternion< T >	q,
		const Vector< T >	v
	)			[inline]

Definition at line 159 of file Rotation.h.

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

{ 
    Quaternion<T> quat;
    if (q.c<(T)0.0 || v.c<(T)0.0) quat.init(-(T)1.0);
    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, 
                   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));
    return quat;
}

Here is the call graph for this function:

Quaternion<T> jbxl::operator*	(	const Quaternion< T >	a,
		const Quaternion< T >	b
	)			[inline]

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

Definition at line 148 of file Rotation.h.

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

{
    Quaternion<T> quat;
    if (a.c<(T)0.0 || b.c<(T)0.0) quat.init(-(T)1.0);
    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, 
                   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)); 
    return quat;
}

Here is the call graph for this function:

Quaternion<T> jbxl::operator*	(	const Quaternion< T >	a,
		const R	d
	)			[inline]

Definition at line 137 of file Rotation.h.

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

{ 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); }

Quaternion<T> jbxl::operator*	(	const R	d,
		const Quaternion< T >	a
	)			[inline]

Definition at line 133 of file Rotation.h.

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

{ 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); }

Matrix<T> jbxl::operator*	(	const Matrix< T >	a,
		const R	d
	)			[inline]

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

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

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

Matrix<T> jbxl::operator*	(	const R	d,
		const Matrix< T >	a
	)			[inline]

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

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

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

Vector<T> jbxl::operator*	(	const Matrix< T >	a,
		const Vector< T >	v
	)			[inline]

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 368 of file Matrix++.h.

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

{
    Vector<T> vct(0.0, 0.0, 0.0, 0.0, -1.0);

    Matrix<T> b(1, 3);
    b.mx[0] = v.x;
    b.mx[1] = v.y;
    b.mx[2] = v.z;

    Matrix<T> c = a*b;
    b.free();

    if (c.mx==NULL) return vct;
    vct.x = c.mx[0];
    vct.y = c.mx[1];
    vct.z = c.mx[2];
    vct.c = v.c;
    c.free();

    return vct;
}

Here is the call graph for this function:

Matrix<T> jbxl::operator*	(	const Matrix< T >	a,
		const Matrix< T >	b
	)			[inline]

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

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

Parameters:

	a	掛けられるマトリックス．
	b	掛けるマトリックス．

Returns:

掛け算結果のマトリックス．掛け算不能，または失敗の場合は空のマトリックス．

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

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

{
    int  i, j, k, n, ii, aa, bb;
    int  *sz, *sa, *sb, *sc, *cx;
    T    st;
    Matrix<T> c;

    if (a.mx==NULL || b.mx==NULL) return c;
    if (a.sz[a.n-1]!=b.sz[0])     return c;

    n  = a.n + b.n - 2;
    sz = (int*)malloc(n*sizeof(int));
    if (sz==NULL) return c;
    sa = (int*)malloc(a.n*sizeof(int));
    if (sa==NULL) {free(sz); return c;}
    sb = (int*)malloc(b.n*sizeof(int));
    if (sb==NULL) {free(sz); free(sa); return c;}
    sc = (int*)malloc(n*sizeof(int));
    if (sc==NULL) {free(sz); free(sa); free(sb); return c;}
    cx = (int*)malloc(n*sizeof(int));
    if (cx==NULL) {free(sz); free(sa); free(sb); free(sc); return c;}

    for (i=0; i<a.n-1; i++) sz[i] = a.sz[i];
    for (i=1; i<b.n; i++)   sz[a.n-2+i] = b.sz[i];

    sa[a.n-1] = sb[b.n-1] = sc[n-1] = 1;
    for (i=a.n-2; i>=0; i--) sa[i] = sa[i+1]*a.sz[i+1];
    for (i=b.n-2; i>=0; i--) sb[i] = sb[i+1]*b.sz[i+1];
    for (i=n-2;   i>=0; i--) sc[i] = sc[i+1]*sz[i+1];

    c.getm(n, sz);

    if (c.sz!=NULL) {
       for (i=0; i<c.r; i++) {
            ii = i;
            for (j=0; j<c.n; j++) {
                cx[j] = ii / sc[j]; 
                ii = ii % sc[j];
            }
            aa = bb = 0;
            for (j=0; j<a.n-1; j++) aa = aa + sa[j]*cx[j]; 
            for (j=1; j<b.n;   j++) bb = bb + sb[j]*cx[j+a.n-2];

            st = (T)0;
            for (k=0; k<b.sz[0]; k++) st = st + a.mx[k+aa]*b.mx[bb+sb[0]*k];
            c.mx[i] = st;
        }
    }
        
    free(sz);
    free(sa);
    free(sb);
    free(sc);
    free(cx);

    return c;
}

Here is the call graph for this function:

UVMap<T> jbxl::operator+	(	const R	c,
		UVMap< T >	a
	)			[inline]

Definition at line 635 of file Vector.h.

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

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

UVMap<T> jbxl::operator+	(	const UVMap< T >	a,
		R	c
	)			[inline]

Definition at line 631 of file Vector.h.

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

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

UVMap<T> jbxl::operator+	(	const UVMap< T >	a,
		const UVMap< T >	b
	)			[inline]

Definition at line 627 of file Vector.h.

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

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

Vector<T> jbxl::operator+	(	const R	c,
		Vector< T >	a
	)			[inline]

Definition at line 145 of file Vector.h.

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

{ return Vector<T>((T)c+a.x, (T)c+a.y, (T)c+a.z, 0.0, a.c, a.d); }

Vector<T> jbxl::operator+	(	const Vector< T >	a,
		R	c
	)			[inline]

Definition at line 141 of file Vector.h.

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

{ return Vector<T>(a.x+(T)c, a.y+(T)c, a.z+(T)c, 0.0, a.c, a.d); }

Vector<T> jbxl::operator+	(	const Vector< T >	a,
		const Vector< T >	b
	)			[inline]

Definition at line 137 of file Vector.h.

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

{ return Vector<T>(a.x+b.x, a.y+b.y, a.z+b.z, 0.0, Min(a.c, b.c), a.d); }

TVector<T> jbxl::operator+	(	const TVector< T >	a,
		const R	d
	)			[inline]

Definition at line 107 of file TVector.h.

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

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

TVector<T> jbxl::operator+	(	const R	d,
		const TVector< T >	a
	)			[inline]

Definition at line 103 of file TVector.h.

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

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

TVector<T> jbxl::operator+	(	const TVector< T >	a,
		const TVector< T >	b
	)			[inline]

Definition at line 90 of file TVector.h.

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

{ 
    T  xx = a.x + b.x;
    T  yy = a.y + b.y;
    T  zz = a.z + b.z;
    T  tt = a.t + b.t;
    if (Xabs(xx)<tt) xx = (T)0.0;
    if (Xabs(yy)<tt) yy = (T)0.0;
    if (Xabs(zz)<tt) zz = (T)0.0;
    return TVector<T>(xx, yy, zz, tt);
}

Quaternion<T> jbxl::operator+	(	const Quaternion< T >	a,
		const Quaternion< T >	b
	)			[inline]

Definition at line 125 of file Rotation.h.

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

{ 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)); }

Matrix<T> jbxl::operator+	(	const Matrix< T >	a,
		const Matrix< T >	b
	)			[inline]

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

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

{ 
    Matrix<T>  c;
    if (!isSameDimension(a, b)) return c;
    
    c.getm(a.n, a.sz);
    if (c.mx!=NULL) for (int i=0; i<a.r; i++) c.mx[i] = a.mx[i] + b.mx[i];
    return c;
}

Here is the call graph for this function:

UVMap<T> jbxl::operator-	(	const R	c,
		UVMap< T >	a
	)			[inline]

Definition at line 647 of file Vector.h.

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

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

UVMap<T> jbxl::operator-	(	const UVMap< T >	a,
		R	c
	)			[inline]

Definition at line 643 of file Vector.h.

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

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

UVMap<T> jbxl::operator-	(	const UVMap< T >	a,
		const UVMap< T >	b
	)			[inline]

Definition at line 639 of file Vector.h.

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

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

UVMap<T> jbxl::operator-

(

const UVMap< T >

a

)

[inline]

Definition at line 623 of file Vector.h.

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

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

Vector<T> jbxl::operator-	(	R	c,
		const Vector< T >	a
	)			[inline]

Definition at line 157 of file Vector.h.

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

{ return Vector<T>((T)c-a.x, (T)c-a.y, (T)c-a.z, 0.0, a.c, a.d); }

Vector<T> jbxl::operator-	(	const Vector< T >	a,
		R	c
	)			[inline]

Definition at line 153 of file Vector.h.

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

{ return Vector<T>(a.x-(T)c, a.y-(T)c, a.z-(T)c, 0.0, a.c, a.d); }

Vector<T> jbxl::operator-	(	const Vector< T >	a,
		const Vector< T >	b
	)			[inline]

Definition at line 149 of file Vector.h.

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

{ return Vector<T>(a.x-b.x, a.y-b.y, a.z-b.z, 0.0, Min(a.c, b.c), a.d); }

Vector<T> jbxl::operator-

(

const Vector< T >

a

)

[inline]

Definition at line 133 of file Vector.h.

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

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

TVector<T> jbxl::operator-	(	const TVector< T >	a,
		const R	d
	)			[inline]

Definition at line 128 of file TVector.h.

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

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

TVector<T> jbxl::operator-	(	const R	d,
		const TVector< T >	a
	)			[inline]

Definition at line 124 of file TVector.h.

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

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

TVector<T> jbxl::operator-	(	const TVector< T >	a,
		const TVector< T >	b
	)			[inline]

Definition at line 111 of file TVector.h.

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

{
    T  xx = a.x - b.x;
    T  yy = a.y - b.y;
    T  zz = a.z - b.z;
    T  tt = a.t + b.t;
    if (Xabs(xx)<tt) xx = (T)0.0;
    if (Xabs(yy)<tt) yy = (T)0.0;
    if (Xabs(zz)<tt) zz = (T)0.0;
    return TVector<T>(xx, yy, zz, tt);
}

TVector<T> jbxl::operator-

(

const TVector< T >

a

)

[inline]

Definition at line 86 of file TVector.h.

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

{ return TVector<T>(-a.x, -a.y, -a.z, a.t, a.n); }

Quaternion<T> jbxl::operator-	(	const Quaternion< T >	a,
		const Quaternion< T >	b
	)			[inline]

Definition at line 129 of file Rotation.h.

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

{ 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)); }

Quaternion<T> jbxl::operator-

(

const Quaternion< T >

a

)

[inline]

Definition at line 121 of file Rotation.h.

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

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

Matrix<T> jbxl::operator-	(	const Matrix< T >	a,
		const Matrix< T >	b
	)			[inline]

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

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

{ 
    Matrix<T>  c;
    if (!isSameDimension(a, b)) return c;

    c.getm(a.n, a.sz);
    if (c.mx!=NULL) for (int i=0; i<a.r; i++) c.mx[i] = a.mx[i] - b.mx[i];
    return c;
}

Here is the call graph for this function:

Matrix<T> jbxl::operator-

(

const Matrix< T >

a

)

[inline]

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

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

{   
    Matrix<T>  c(a.n, a.sz);
    if (c.mx!=NULL) for (int i=0; i<a.r; i++) c.mx[i] = -a.mx[i];
    return c;
}

UVMap<T> jbxl::operator/	(	const R	d,
		const UVMap< T >	a
	)			[inline]

Definition at line 663 of file Vector.h.

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

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

UVMap<T> jbxl::operator/	(	const UVMap< T >	a,
		const R	d
	)			[inline]

Definition at line 659 of file Vector.h.

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

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

Vector<T> jbxl::operator/	(	const R	d,
		const Vector< T >	a
	)			[inline]

Definition at line 173 of file Vector.h.

References Vector< T >::c, Vector< T >::d, Vector< T >::norm(), Vector< T >::x, Vector< T >::y, and Vector< T >::z.

{
    Vector<T> v((T)d/a.x, (T)d/a.y, (T)d/a.z, 0.0, a.c, a.d);
    v.norm();
    return v;
}

Here is the call graph for this function:

Vector<T> jbxl::operator/	(	const Vector< T >	a,
		const R	d
	)			[inline]

Definition at line 169 of file Vector.h.

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

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

TVector<T> jbxl::operator/	(	const R	d,
		const TVector< T >	a
	)			[inline]

Definition at line 144 of file TVector.h.

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

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

Here is the call graph for this function:

TVector<T> jbxl::operator/	(	const TVector< T >	a,
		const R	d
	)			[inline]

Definition at line 140 of file TVector.h.

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

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

Quaternion<T> jbxl::operator/	(	const Quaternion< T >	a,
		const R	d
	)			[inline]

Definition at line 141 of file Rotation.h.

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

{ 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); }

Matrix<T> jbxl::operator/	(	const Matrix< T >	a,
		const R	d
	)			[inline]

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

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

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

bool jbxl::operator<	(	const Vector< T >	v1,
		const Vector< T >	v2
	)			[inline]

Definition at line 213 of file Vector.h.

{
    if (v1.x != v2.x) return v1.x < v2.x;
    if (v1.y != v2.y) return v1.y < v2.y;
    if (v1.z != v2.z) return v1.z < v2.z;
    return false;
}

bool jbxl::operator==	(	const UVMap< T >	a,
		const UVMap< T >	b
	)			[inline]

Definition at line 667 of file Vector.h.

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

{ return (a.u==b.u && a.v==b.v); }

bool jbxl::operator==	(	const Vector< T >	v1,
		const Vector< T >	v2
	)			[inline]

Definition at line 191 of file Vector.h.

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

{ return (v1.x==v2.x && v1.y==v2.y && v1.z==v2.z); }

bool jbxl::operator==	(	const TVector< T >	v1,
		const TVector< T >	v2
	)			[inline]

Definition at line 148 of file TVector.h.

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

{
    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);
    T err = (v1.t+v2.t)*(v1.t+v2.t);
    if (dst<=err) return true;
    return false;
}

bool jbxl::operator==	(	const Quaternion< T >	q1,
		const Quaternion< T >	q2
	)			[inline]

Definition at line 107 of file Rotation.h.

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

{ return (q1.s==q2.s && q1.x==q2.x && q1.y==q2.y && q1.z==q2.z); }

bool jbxl::operator==	(	const Matrix< T >	v1,
		const Matrix< T >	v2
	)			[inline]

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

References isSameDimension(), Matrix< T >::mx, and Matrix< T >::r.

{
    if (!isSameDimension(v1, v2)) return false;
    for (int i=0; i<v1.r; i++) if (v1.mx[i]!=v2.mx[i]) return false;
    return true;
}

Here is the call graph for this function:

Vector<T> jbxl::operator^	(	const Vector< T >	a,
		const Vector< T >	b
	)			[inline]

Definition at line 182 of file Vector.h.

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

{ 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)); }

TVector<T> jbxl::operator^	(	const TVector< T >	a,
		const TVector< T >	b
	)			[inline]

Definition at line 167 of file TVector.h.

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

{
    T  xx = a.y*b.z - a.z*b.y;
    T  yy = a.z*b.x - a.x*b.z;
    T  zz = a.x*b.y - a.y*b.x;
    T  tt = (T)(a.n*b.t + a.t*b.n);
    if (Xabs(xx)<tt) xx = (T)0.0;
    if (Xabs(yy)<tt) yy = (T)0.0;
    if (Xabs(zz)<tt) zz = (T)0.0;
    return TVector<T>(xx, yy, zz, tt);
}

Quaternion<T> jbxl::operator~

(

const Quaternion< T >

a

)

[inline]

Definition at line 116 of file Rotation.h.

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

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

RBound<int> jbxl::out_around_MSGraph	(	MSGraph< T >	vp,
		int	x,
		int	y,
		int	mode = 8
	)			[inline]

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.zmax	8近傍モード時の斜めの距離の回数．
	rb.zmin	オブジェクトの周囲長．ただし，8近傍モードの場合，斜めの距離も1と数える． 周囲長を rb.zmin + rb.zmax*{sqrt(2.)-1} で計算する場合もある．

Attention:

1ドットの長さは 1と数える．

Definition at line 305 of file Graph.h.

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.

{
    int   i, j, sp, cp, w, ll, ss;
    int   xx, yy, vx, vy, ix;
    bool  eflg=false;

    int   r8[8]={-1, 1, -1, -1, 1, -1, 1, 1};
    int   r4[8]={ 0, 1, -1,  0, 0, -1, 1, 0};
    int*  cc;

    i = x;
    // オブジェクトを探す
    for (j=y; j<vp.ys-1; j++) { 
        for (i=x; i<vp.xs-1; i++) {
            if (vp.gp[i+(j)*vp.xs]!=vp.zero) {
                eflg = true;
                break;
            }
        }
        if (eflg) break;
    }
    x = i;
    y = j;
    eflg = false;

    RBound<int>  rb(x, x, y, y);
    i = y*vp.xs + x;

    sp = cp = i;
    ss = ll = 0;
    vx = 1;
    vy = 0;

    if (mode==4) {
        ix = 4;
        cc = r4;
    }
    else {
        ix = 8;
        cc = r8;
    }

    do {
        w  = abs(vx)+abs(vy);
        xx = (vx*cc[0]+vy*cc[1])/w;
        yy = (vx*cc[2]+vy*cc[3])/w;
        for (j=1; j<=ix; j++) {
            if (vp.gp[cp+yy*vp.xs+xx]!=vp.zero) {
                vx = xx;
                vy = yy;
                cp = cp + yy*vp.xs + xx;
                xx = cp%vp.xs;
                yy = (cp-xx)/vp.xs;
                rb.xmax = Max(rb.xmax, xx);
                rb.ymax = Max(rb.ymax, yy);
                rb.xmin = Min(rb.xmin, xx);
                rb.ymin = Min(rb.ymin, yy);
                break;
            }
            else {
                if(sp==cp && xx==-1 && yy==vp.zero) {
                    eflg = true;
                    break;
                }
                w  = abs(xx)+abs(yy);
                vx = (xx*cc[4]+yy*cc[5])/w;
                vy = (xx*cc[6]+yy*cc[7])/w;
                xx = vx;
                yy = vy;
            }
        }
        ll++;
        if (abs(vx)+abs(vy)==2) ss++;
    } while(!eflg);

    if (mode==4) ss = 0;
    (rb.xmax)++;
    (rb.ymax)++;
    (rb.xmin)--;
    (rb.ymin)--;
    rb.zmax = ss;
    rb.zmin = ll;
    return  rb;
}

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	頂点情報．補填された三角形の頂点情報が追加される．
	mode	true: 多重Edgeを認める．
	mode	false: 多重Edgeを認めない．

Definition at line 501 of file TriBrep.cpp.

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().

{
    if (vert[0]->forbidden_list!=NULL) {
        BREP_VERTEX_LIST::iterator vertex; 
        vertex = std::find(vert[0]->forbidden_list->begin(), vert[0]->forbidden_list->end(), vert[2]);
        if (vertex!=vert[0]->forbidden_list->end()) return false;   // 禁止Listの中に見つけた． 
    }

    BREP_SOLID* solid  = shell->solid;
    CVCounter* counter = NULL;
    if (solid->counter!=NULL) counter = solid->counter->GetUsableCounter();

    BREP_FACET* facet  = new BREP_FACET(shell);
    BREP_CONTOUR* contour = CreateContourByVertex(facet, vert);     
    if (contour!=NULL) {
        if (DupEdgeNumber(contour)==0 || mode) {
            BREP_CONTOUR* collision;
            facet->CloseData();
            if (!IsCollisionContours(solid, contour, &collision)) {
                solid->contours.push_back(contour);
//              PrintFacetAsciiSTL(contour);
                if (counter!=NULL) counter->StepIt();
                return true;
            }
            else FastDeleteFacet(facet);
        }
        else FastDeleteFacet(facet);
    }
    else FastDeleteFacet(facet); 

    return  false;
}

Here is the call graph for this function:

Here is the caller graph for this function:

bool jbxl::point_fat_object_morph	(	MSGraph< T >	vp,
		int	x,
		int	y,
		int	z,
		MSGraph< T >	xp,
		int	cc
	)			[inline]

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 206 of file Morph.h.

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

Referenced by fat_object_morph().

{
    int  i, j, k, cx, cy, cz;
    int  xx, yy, zz, ax, ay, az;

    for (k=0; k<xp.zs; k++) {
        zz = z + k - xp.zs/2;
        if (zz<0)       zz = 0;
        if (zz>vp.zs-1) zz = vp.zs-1;
        az = vp.xs*vp.ys*zz;
        cz = xp.xs*xp.ys*k; 
        for (j=0; j<xp.ys; j++) {
            yy = y + j - xp.ys/2;
            ay = az + vp.xs*yy; 
            cy = cz + xp.xs*j;  
            for (i=0; i<xp.xs; i++) {
                xx = x + i - xp.xs/2;
                ax = ay + xx;   
                cx = cy + i;    
                if (xp.gp[cx]>0) {
                    if (xx>=0&&xx<vp.xs&&yy>=0&&yy<vp.ys) {
                        if (vp.gp[ax]>=cc)  return true;
                    }
                }
            }
        }
    }
   
    return false;
}

Here is the caller graph for this function:

bool jbxl::point_open_morph	(	MSGraph< T >	vp,
		int	x,
		int	y,
		int	z,
		MSGraph< T >	xp,
		int	cc
	)			[inline]

template <typename t>=""> bool point_open_morph(MSGraph<T> vp, int x, int y, int z, MSGraph<T> xp, int cc)

オープニング可能かどうかチェックする．

Definition at line 110 of file Morph.h.

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

Referenced by opening_morph().

{
    int  i, j, k, cx, cy, cz;
    int  xx, yy, zz, ax, ay, az;

    for (k=0; k<xp.zs; k++) {
        zz = z + k - xp.zs/2;
        if (zz<0)       zz = 0;
        if (zz>vp.zs-1) zz = vp.zs-1;
        az = vp.xs*vp.ys*zz;
        cz = xp.xs*xp.ys*k; 
        for (j=0; j<xp.ys; j++) {
            yy = y + j - xp.ys/2;
            ay = az + vp.xs*yy; 
            cy = cz + xp.xs*j;  
            for (i=0; i<xp.xs; i++) {
                xx = x + i - xp.xs/2;
                ax = ay + xx;   
                cx = cy + i;    
                if (xp.gp[cx]>0) {
                    if (!(xx>=0&&xx<vp.xs&&yy>=0&&yy<vp.ys)) return false;
                    if (vp.gp[ax]<cc) return false;
                }
            }
        }
    }
   
    return true;
}

Here is the caller graph for this function:

Quaternion<T> jbxl::PPPQuaternion	(	Vector< T >	a,
		Vector< T >	b,
		Vector< T >	c
	)			[inline]

Definition at line 1490 of file Rotation.h.

References Vector< T >::c.

{
    Quaternion<T> qut((T)1.0, (T)0.0, (T)0.0, (T)0.0, (T)1.0);

    if (a.c<(T)0.0 || b.c<(T)0.0 || c.c<(T)0.0) return qut;

    qut = V2VQuaternion<T>(b-a, c-b);
    return qut;
}

Quaternion<T> jbxl::PPVQuaternion	(	Vector< T >	a,
		Vector< T >	b,
		Vector< T >	c
	)			[inline]

Definition at line 1514 of file Rotation.h.

References Vector< T >::c.

{
    Quaternion<T> qut((T)1.0, (T)0.0, (T)0.0, (T)0.0, (T)1.0);

    if (a.c<(T)0.0 || b.c<(T)0.0 || c.c<(T)0.0) return qut;

    qut = V2VQuaternion<T>(b-a, c);
    return qut;
}

void jbxl::print_Matrix	(	FILE *	fp,
		Matrix< T >	a
	)			[inline]

template <typename t>=""> void print_Matrix(FILE* fp, Matrix<T> a)

実数マトリックスの要素を標準出力に書き出す．デバッグ用．

Parameters:

	fp	出力先のファイルディスクリプタ
	a	プリントするマトリックス

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

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

{
    for (int i=0; i<a.r; i++) {
        fprintf(fp, "  %15lf", (double)a.mx[i]);
        if ((i+1)%a.sz[a.n-1]==0) fprintf(fp, "\n");
    }
}

DllExport void println_FacetAsciiSTL

(

BREP_CONTOUR *

contour

)

void jbxl::println_FacetAsciiSTL(BREP_CONTOUR* contour)

contourの情報を STLのアスキー形式で表示する ReadSTLFileA()で読み込み可

Definition at line 395 of file STL.cpp.

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.

{
    BREP_WING* wing = contour->wing;

    PRINT_MESG("facet normal %g %g %g\n", contour->normal.x, contour->normal.y, contour->normal.z);
    PRINT_MESG("outer loop\n");
    for (int i=0; i<3; i++) {
        Vector<double> vect = wing->vertex->point;
        PRINT_MESG("vertex %g %g %g\n", vect.x, vect.y, vect.z);
        wing = wing->next;
    }
    PRINT_MESG("endloop\n");
    PRINT_MESG("endfacet\n");
}

double jbxl::ProportionVector	(	TVector< T >	v1,
		TVector< T >	v2,
		T &	t
	)			[inline]

template <typename t>=""> double ProportionVector(TVector<T> v1, TVector<T> v2, T& t)

ベクトルv1, v2が一直線上にあるかどうかをチェックする．
v1 = c*v2 の cを返す. tには誤差が入る．

Definition at line 65 of file TVector.h.

References Max, Vector< T >::n, TVector< T >::t, and Zero_Eps.

Referenced by CollisionTriContour2D(), IsAtLine(), and IsInTriangle().

{
    double  cc = 0.0;
    T  tt = (T)(Max(v2.t, Zero_Eps));
    if (v2.n>=tt) cc = (v1*v2)/(double)(v2.n*v2.n);

    TVector<T> dif = v1 - cc*v2;
    T tolerance = (T)Max(dif.t, Zero_Eps);
    if (dif.n>=tolerance) {
        t = 0.0;
        return  -HUGE_VALF; 
    }
    t = (T)((v1.n*v2.t + v2.n*v1.t)/(v2.n*v2.n));   // 誤差
    return cc;
}

Here is the caller graph for this function:

Vector< T > Quaternion2ExtEulerXYZ	(	Quaternion< T >	qut,
		Vector< T > *	vct = NULL
	)			[inline]

Definition at line 1263 of file Rotation.h.

References Quaternion< T >::getRotMatrix().

{
    Matrix<T> mtx = qut.getRotMatrix();
    Vector<T> eul = RotMatrix2ExtEulerXYZ<T>(mtx, vct);
    mtx.free();

    return eul;
}

Here is the call graph for this function:

Vector< T > Quaternion2ExtEulerXZY	(	Quaternion< T >	qut,
		Vector< T > *	vct = NULL
	)			[inline]

Definition at line 1285 of file Rotation.h.

References Matrix< T >::free(), Quaternion< T >::getRotMatrix(), and RotMatrix2ExtEulerXZY().

{
    Matrix<T> mtx = qut.getRotMatrix();
    Vector<T> eul = RotMatrix2ExtEulerXZY(mtx, vct);
    mtx.free();

    return eul;
}

Here is the call graph for this function:

Vector< T > Quaternion2ExtEulerYXZ	(	Quaternion< T >	qut,
		Vector< T > *	vct = NULL
	)			[inline]

Definition at line 1307 of file Rotation.h.

References Matrix< T >::free(), Quaternion< T >::getRotMatrix(), and RotMatrix2ExtEulerYXZ().

{
    Matrix<T> mtx = qut.getRotMatrix();
    Vector<T> eul = RotMatrix2ExtEulerYXZ(mtx, vct);
    mtx.free();

    return eul;
}

Here is the call graph for this function:

Vector< T > Quaternion2ExtEulerYZX	(	Quaternion< T >	qut,
		Vector< T > *	vct = NULL
	)			[inline]

Definition at line 1296 of file Rotation.h.

References Matrix< T >::free(), Quaternion< T >::getRotMatrix(), and RotMatrix2ExtEulerYZX().

{
    Matrix<T> mtx = qut.getRotMatrix();
    Vector<T> eul = RotMatrix2ExtEulerYZX(mtx, vct);
    mtx.free();

    return eul;
}

Here is the call graph for this function:

Vector< T > Quaternion2ExtEulerZXY	(	Quaternion< T >	qut,
		Vector< T > *	vct = NULL
	)			[inline]

Definition at line 1318 of file Rotation.h.

References Matrix< T >::free(), Quaternion< T >::getRotMatrix(), and RotMatrix2ExtEulerZXY().

{
    Matrix<T> mtx = qut.getRotMatrix();
    Vector<T> eul = RotMatrix2ExtEulerZXY(mtx, vct);
    mtx.free();

    return eul;
}

Here is the call graph for this function:

Vector< T > Quaternion2ExtEulerZYX	(	Quaternion< T >	qut,
		Vector< T > *	vct = NULL
	)			[inline]

Definition at line 1274 of file Rotation.h.

References Matrix< T >::free(), Quaternion< T >::getRotMatrix(), and RotMatrix2ExtEulerZYX().

{
    Matrix<T> mtx = qut.getRotMatrix();
    Vector<T> eul = RotMatrix2ExtEulerZYX(mtx, vct);
    mtx.free();

    return eul;
}

Here is the call graph for this function:

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_ERROR	xsize ファイルオープンエラー．
	JBXL_GRAPH_MEMORY_ERROR	xsize メモリエラー．
	JBXL_GRAPH_CANCEL	xsize キャンセル by ユーザ

Bug:

Common形式の画素深度が 24,32bitの場合のエンディアン処理が未実装

Definition at line 1202 of file Gio.cpp.

References CmnHead::bsize, CmnHead::buf, checkBit, CmnHead::depth, DICOM_DATA, file_size(), free_CmnHead(), GetUsableGlobalCounter(), MSGraph< T >::gp, CmnHead::grptr, HAS_LENDIAN, HAS_RZXY, HEADER_NONE, is_little_endian(), CVCounter::isCanceled(), 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, CmnHead::xsize, MSGraph< T >::ys, CmnHead::ysize, MSGraph< T >::zs, and CmnHead::zsize.

Referenced by readGraphicSlices().

{
    FILE* fp;
    int  kind, fsz, hsz;
    bool  no_ntoh = false;
    CmnHead hd;
    CVCounter* counter = NULL;

    memset(&hd, 0, sizeof(CmnHead));
    hd.kind  = HEADER_NONE;
    hd.xsize = JBXL_GRAPH_HEADER_ERROR;

    if (chd==NULL) return hd;

    fsz = (int)file_size(fn);
    if (fsz==0) {
        hd.xsize = JBXL_GRAPH_NOFILE_ERROR;
        return hd;
    }

    if ((fp=fopen(fn,"rb"))==NULL) {
        hd.xsize = JBXL_GRAPH_OPFILE_ERROR;
        return hd;
    }

    // ファイルとCPUのエンディアンが同じ
    if (checkBit(chd->kind, HAS_LENDIAN) && is_little_endian()) {
        no_ntoh = true;
    }
    kind = chd->kind & 0x00ff;

    // オペレータ指定のデータ形式．カウンタ未サポート
    if (kind == USERSET_DATA) {
        if (chd->zsize<=0) chd->zsize = 1;
        chd->lsize = chd->xsize*chd->ysize*chd->zsize*((chd->depth+7)/8);
        if (fsz==(int)(chd->bsize+chd->lsize)) {        // ファイルサイズのチェック
            PRINT_MESG("readCmnHeadFile: オペレータ指定のデータ形式\n");
            hd = readUserSetData(fp, chd, true);        // カウンタ有効 

            // 24, 32bit 未対応
            if (hd.depth==16 && !no_ntoh) {
                sWord* wptr = (sWord*)hd.grptr;
                for (int i=0; i<hd.xsize*hd.ysize*hd.zsize; i++) {
                    wptr[i] = ntohs(wptr[i]);
                }
            }
        }
    }

    // DICOMファイル．
    else if (kind==DICOM_DATA) {
        MSGraph<sWord> vp = readDicomData(fp, fsz);
        if (vp.gp!=NULL) {
            PRINT_MESG("readCmnHeadFile: DICOMデータ形式\n");
            hd.kind  = DICOM_DATA;
            hd.xsize = vp.xs;
            hd.ysize = vp.ys;
            hd.zsize = vp.zs;
            hd.depth = 16;
            hd.bsize = sizeof(CTHead);
            hd.lsize = vp.xs*vp.ys*vp.zs*2;
            hd.buf   = (uByte*)malloc(hd.bsize);
            hd.grptr = (uByte*)vp.gp;
                
            CTHead* pcthd = (CTHead*)hd.buf;
            memset(pcthd, 0, hd.bsize);
            pcthd->xsize  = (sWord)hd.xsize;
            pcthd->ysize  = (sWord)hd.ysize;
            //pcthd->ctmin  = 0;
            //pcthd->ctmax  = 0;
            //pcthd->cutup  = 0;
            //pcthd->cutdown  = 0;
            //pcthd->cutleft  = 0;
            //pcthd->cutright = 0;

            if (vp.RZxy>0.0) {
                pcthd->anydata[0] = (sWord)(vp.RZxy*RZXY_RATE);
                pcthd->anydata[1] = RZXY_RATE;
                hd.kind |= HAS_RZXY;
            }

            if (!no_ntoh) {
                sWord* wptr = (sWord*)hd.grptr;
                for (int i=0; i<hd.xsize*hd.ysize*hd.zsize; i++) {
                    wptr[i] = ntohs(wptr[i]);
                }
            }
        }
    }

    // Sun Raster
    else if (kind==RAS_DATA) {
        PRINT_MESG("readCmnHeadFile: Sun Rasterデータ形式\n");
        hd = readRasData(fp); 
    }
    
    // Moon形式 16bit
    else if (kind==MOON_DATA) {
        PRINT_MESG("readCmnHeadFile: Moonデータ形式\n");
        hd = readMoonData(fp, fsz, no_ntoh);
    }

#ifdef  ENABLE_JPEGLIB
    // JPEG
    else if (kind==JPEG_RGB_DATA || kind==JPEG_MONO_DATA) {
        PRINT_MESG("readCmnHeadFile: JPEGデータ形式\n");
        JPEGImage jpg = readJPEGData(fp);
        hd = JPEGImage2CmnHead(jpg);
        jpg.free();
    }
#endif

    // TIFF
    /*else if (kind == TIFF_DATA) {

    }*/

    // Common形式 
    else if (kind!=UN_KNOWN_DATA) {
        // データ読み取りでは hd.lsize==0 のファイルサイズ無効（CT_RGN_SL）はまだサポートされていない
        PRINT_MESG("readCmnHeadFile: Commonデータ形式\n");

        hsz = sizeof(CmnHead);
        fseek(fp, 0, 0);
        fread(&hd, hsz, 1, fp);
        ntoh_st(&hd, 4);
        if (hd.zsize<=0) hd.zsize = 1;

        // カウンタ
        if (hd.zsize>=10 && cnt) {
            counter = GetUsableGlobalCounter();
            if (counter!=NULL) {
                //counter->SetTitle("Commonファイル読み込み中");
                counter->SetMax(hd.zsize/10);
                counter->SetPos(0);
            }
        }

        if (hd.bsize>0) hd.buf = (uByte*)malloc(hd.bsize);
        hd.grptr = (uByte*)malloc(hd.lsize);
        if ((hd.bsize>0&&hd.buf==NULL) || hd.grptr==NULL) {
            free_CmnHead(&hd);
            hd.xsize = JBXL_GRAPH_MEMORY_ERROR;
            hd.kind  = HEADER_NONE;
            fclose(fp);
            return hd;
        }
        fseek(fp, hsz, 0);
        if (hd.bsize>0) {
            fread(hd.buf, hd.bsize, 1, fp);
            ntoh_ar((sWord*)hd.buf, hd.bsize);
        }
        
        // ヘッダのみ
        if (hd.lsize==0) {
            if (counter!=NULL) counter->PutFill();
        }
        else {
            // データ本体
            if (counter==NULL) {
                fread(hd.grptr, hd.lsize, 1, fp);
            }
            else {
                int psize = hd.xsize*hd.ysize*((hd.depth+7)/8);
                for (int i=0; i<hd.zsize; i++) {
                    fread(hd.grptr+i*psize, psize, 1, fp);
                    if (i%10==0) {
                        counter->StepIt();
                        if (counter->isCanceled()) {    // キャンセル
                            //counter->Stop();
                            free_CmnHead(&hd);
                            hd.xsize = JBXL_GRAPH_CANCEL;
                            hd.kind  = HEADER_NONE;
                            fclose(fp);
                            return hd;
                        }
                    }
                }
            }

            // 24, 32bit 未対応
            if (hd.depth==16 && !no_ntoh) {
                sWord* wptr = (sWord*)hd.grptr;
                for (int i=0; i<hd.xsize*hd.ysize*hd.zsize; i++) {
                    wptr[i] = ntohs(wptr[i]);
                }
            }

            if (counter!=NULL) counter->PutFill();
        }
    }

    else {
        PRINT_MESG("readCmnHeadFile: 未知のデータ形式が指定された．(%04x, %04x)\n", chd->kind, (uWord)kind);
    }

    fclose(fp);
    return hd;
}

Here is the call graph for this function:

Here is the caller graph for this function:

MSGraph< sWord > readDicomData	(	FILE *	fp,
		int	fsz
	)

Definition at line 612 of file Gio.cpp.

References dicomHeader(), MSGraph< T >::gp, JBXL_GRAPH_HEADER_ERROR, MSGraph< T >::set(), and MSGraph< T >::xs.

Referenced by readCmnHeadFile(), readDicomFile(), and readXHeadFile().

{
    int   sz, dsize;
    int   xsize, ysize, depth;
    double rzxy;
    MSGraph<sWord> vp;

    memset(&vp, 0, sizeof(MSGraph<sWord>));

    sz = dicomHeader(fp, fsize, &dsize, &xsize, &ysize, &depth, &rzxy);
    if (sz<=0) {
        vp.xs = JBXL_GRAPH_HEADER_ERROR;
        return vp;
    }

    if (dsize!=xsize*ysize*((depth+7)/8)) {
        vp.xs = JBXL_GRAPH_HEADER_ERROR;
        return vp;
    }

    if ((depth+7)/8!=2) {
        vp.xs = JBXL_GRAPH_HEADER_ERROR;
        return vp;
    }

    vp.set(xsize, ysize, 1, 0, 0, rzxy);

    fseek(fp, sz, 0);
    fread(vp.gp, dsize, 1, fp);

    return vp;
}

Here is the call graph for this function:

Here is the caller graph for this function:

MSGraph< sWord > readDicomFile

(

const char *

fn

)

MSGraph<sWord> jbxl::readDicomFile(const char* fn)

DICOM形式のデータを読み込む．

Attention:

現在はまだ限定的な機能しか持たない．

Bug:

depth = 16bit 固定

Definition at line 585 of file Gio.cpp.

References file_size(), JBXL_GRAPH_NOFILE_ERROR, JBXL_GRAPH_OPFILE_ERROR, readDicomData(), and MSGraph< T >::xs.

{
    int fsize;
    FILE*  fp;
    MSGraph<sWord> vp;

    memset(&vp, 0, sizeof(MSGraph<sWord>));

    fsize = file_size(fn);
    if (fsize<=0) {
        vp.xs = JBXL_GRAPH_NOFILE_ERROR;
        return vp;
    }

    if ((fp=fopen(fn,"r"))==NULL) {
        vp.xs = JBXL_GRAPH_OPFILE_ERROR;
        return vp;
    }

    vp = readDicomData(fp, fsize);
    fclose(fp);

    return vp;
}

Here is the call graph for this function:

MSGraph<T> jbxl::readGraphicFile	(	const char *	fname,
		CmnHead *	chd = NULL,
		bool	cnt = false
	)			[inline]

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]	chd	USERSET_DATA指定の場合，ファイルのヘッダ情報を入れた CmnHead
[out]	chd	CmnHeadにも格納したい場合は，そのアドレスを指定．
	cnt	カウンタ（プログレスバー）を使用するかどうか？

Returns:

読み込んだグラフィックデータと，それを記述する共通ヘッダ．

エラーなら MSGraph.isNull()が真，または CmnHead.kind = HEADER_NONE となる．
またエラーの種類により MSGraph.stateが変化する.

Return values:

	JBXL_GRAPH_HEADER_ERROR	state ファイルのヘッダ読み取りエラー．
	JBXL_GRAPH_MEMORY_ERROR	state メモリエラー．

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 173 of file Gio.h.

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.

{
    MSGraph<T> vp;
    CmnHead    hd;
    CVCounter* counter = NULL;

    counter = GetUsableGlobalCounter();
    if (counter!=NULL) {
        counter->SetMax(100);
        counter->MakeChildCounter(80);
    }

    vp.init();

    hd = readXHeadFile(fname, chd, cnt);
    if (counter!=NULL) counter->DeleteChildCounter();   

    // Error
    if (hd.kind==HEADER_NONE) {
        free_CmnHead(&hd);
        if (hd.xsize<0) vp.state = hd.xsize;
        else            vp.state = JBXL_GRAPH_HEADER_ERROR;
        return vp;
    }

    // Unknown Data
    int chk = hd.kind & 0x00ff;
    if (chk==UN_KNOWN_DATA) {
        if (chd!=NULL) *chd = hd;
        else  free_CmnHead(&hd);
        vp.state = JBXL_GRAPH_HEADER_ERROR;
        return vp;
    }

    if (counter!=NULL) counter->MakeChildCounter(80);

    if (cnt) {
        CVCounter* counter = GetUsableGlobalCounter();
        if (counter!=NULL) counter->SetTitle("画像データへ変換");
    } 

    if (chd!=NULL) {
        *chd = hd;
        chd->grptr = chd->buf = NULL;
    }

    vp = copyCmnHead2MSGraph<T>(hd, CH2MG_NORMAL, cnt);
    free_CmnHead(&hd);
    if (vp.gp==NULL) return vp;

    if (ZeroBase!=0) {
        vp.base += ZeroBase;
        for (int i=0; i<vp.xs*vp.ys*vp.zs; i++) vp.gp[i] += (T)ZeroBase;
    }

    if (counter!=NULL){
        counter->DeleteChildCounter();
        counter->PutFill();
    }

    return  vp;
}

Here is the call graph for this function:

MSGraph<T> jbxl::readGraphicSlices	(	const char *	fmt,
		int	fst,
		int	fnd,
		CmnHead *	chd = NULL,
		bool	cnt = false
	)			[inline]

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	最後に読み込むファイルの番号（ファイル名の中にその数字がなければならない）
	chd	CmnHeadにもデータを格納したい場合はそのアドレスを指定． または DICOM_DATA, USERSET_DATA指定時のヘッダ情報を格納する．
	cnt	仮想カウンタを使用するか?

Returns:

MSGraph型の読み込んだ画像データ

例

    vp = readGraphicSlices("i%02d", 0, 10); // i00 〜 i10 までの11枚の画像データを読み込んで，vpに格納．

Definition at line 262 of file Gio.h.

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, MSGraph< T >::max, 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.

{
    int   i, k, l, m, chk, kind;
    int   xsize, ysize, zsize, nsize, psize;    // zsize: 1枚の画像のZサイズ．
                                                // nsize: 出来上がりの 3D画像のZサイズ
    char* fr_name;                      
    CmnHead    dhd, hd;
    MSGraph<T> vp, gd;

    if (chd!=NULL) {
        DEBUG_MESG("readGraphicSlices: Called with kind = 0x%04x\n", chd->kind);
    }
    else {
        DEBUG_MESG("readGraphicSlices: Called with NULL Header\n");
    }

    gd.init();
    vp.init();

    // 1枚目（ヘッダ情報）の読み出し
    fr_name = numbering_name(fmt, fst);
    dhd = readXHead(fr_name, chd);
    freeNull(fr_name);

    chk = dhd.kind & 0x00ff;
    if (dhd.kind==HEADER_NONE || chk==UN_KNOWN_DATA) {
        DEBUG_MODE PRINT_MESG("readGraphicSlices: ヘッダ読み込みエラー： kind = %d\n", dhd.kind);
        free_CmnHead(&dhd);
        vp.state = JBXL_GRAPH_HEADER_ERROR;
        vp.zs = fst;
        return vp;
    }
    kind  = dhd.kind;
    xsize = dhd.xsize;
    ysize = dhd.ysize;
    zsize = Max(dhd.zsize, 1);
    nsize = zsize*(Xabs(fnd - fst) + 1);
    psize = xsize*ysize*zsize;
    if (dhd.depth==16) gd.color = GRAPH_COLOR_MONO16;
    else               gd.color = GRAPH_COLOR_MONO;

    // カウンタ
    CVCounter* counter = NULL;
    if (nsize>=10 && cnt) {
        counter = GetUsableGlobalCounter();
        if (counter!=NULL) {
            //counter->SetTitle("マルチファイル読み込み中");
            counter->SetMax(nsize/10);
            counter->SetPos(1);
        }
    }

    // Z軸の歪, ベース，rbound の設定
    if (dhd.buf!=NULL && (chk==CT_DATA || chk==CT_3DM || chk==DICOM_DATA)) {
        sWord* rz  = (sWord*)dhd.buf;
        if (rz[9]==RZXY_RATE || checkBit(dhd.kind, HAS_RZXY)) {
            double rzm = rz[8]/(double)rz[9];
            if (rzm<5.0 && rzm>0.) gd.RZxy = rzm;
        }

        if (rz[10]!=0 && checkBit(dhd.kind, HAS_BASE)) {
            gd.base = (T)rz[10];
        }

        if (checkBit(dhd.kind, HAS_RBOUND)) {
            gd.rbound.xmin = rz[6];
            gd.rbound.xmax = rz[7];
            gd.rbound.ymin = rz[4];
            gd.rbound.ymax = rz[5];
            gd.rbound.zmin = rz[2];
            gd.rbound.zmax = rz[3];
        }
    }
    free_CmnHead(&dhd);

    dhd.kind = kind;
    if (chd!=NULL) dhd.kind |= chd->kind & 0xff00;      // オプション
    *chd = getinfo_CmnHead(dhd);

    // データ読み込み（Z軸方向） 1枚目から
    gd.getm(xsize, ysize, nsize);
    if (gd.isNull()) return gd;

    l = 0;
    k = fst;
    m = Sign(fnd - fst);
    while(k != fnd+m){
        fr_name = numbering_name(fmt, k);
        hd = readCmnHeadFile(fr_name, &dhd, false); // カウンタ無効
        free(fr_name);

        chk = hd.kind & 0x00ff;
        if (hd.kind==HEADER_NONE || chk==UN_KNOWN_DATA) {
            DEBUG_MESG("readGraphicSlices: データ読み込みエラー： n = %d, kind = %d\n", k, hd.kind);
            free_CmnHead(&hd);
            if (l==0) {     // 1枚目でエラー
                gd.free();
                vp.state = JBXL_GRAPH_HEADER_ERROR;
                vp.zs = k;
                return vp;
            }
            else {          // 途中までは読み込み完了
                gd.state = l;
                gd.zs = l*zsize;
                break;
            }
        }

        vp = copyCmnHead2MSGraph<T>(hd, CH2MG_NOPARM, false);   // カウンタ無効
        if (vp.isNull()) {
            free_CmnHead(&hd);
            gd.free();
            vp.free();
            vp.state = JBXL_GRAPH_MEMORY_ERROR;
            vp.zs = k;
            return vp;
        }

        // gd へコピー
        for (i=0; i<psize; i++) gd.gp[i + psize*l] = vp.gp[i] + ZeroBase;
        if (l==0) {
            gd.min = vp.min;
            gd.max = vp.max;
        }
        else {
            gd.min = Min(gd.min, vp.min);
            gd.max = Max(gd.max, vp.max);
        }

        // 後始末
        free_CmnHead(&hd);
        vp.free();
        k += m;
        l++;

        // カウンタ
        if (counter!=NULL && l%10==0) {
            counter->StepIt();
            if (counter->isCanceled()) {    // キャンセル
                gd.free();
                vp.state = JBXL_GRAPH_CANCEL;
                vp.zs = k;
                return vp;
            }
        }
    }
    gd.state = l;
    gd.base += ZeroBase;

    if (!checkBit(kind, HAS_RBOUND)) gd.rbound.set(0, gd.xs-1, 0, gd.ys-1, 0, gd.zs-1);
    if (chd!=NULL) {
        if ((chd->kind&0x00ff)==USERSET_DATA) {
            CVCounter* counter = GetUsableGlobalCounter();
            if (counter!=NULL) counter->SetTitle("Converting Data");
            *chd = copyMSGraph2CmnHead(gd);
        }
    }
    if (counter!=NULL) {
        counter->PutFill();
        //counter->Stop();
    }
   
    return gd;
}

Here is the call graph for this function:

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_ntoh	trueの場合，エンディアンの変換を行わない．

Returns:

読み込んだグラフィックデータの共通ヘッダ．
エラー場合 kindメンバは HEADER_NONEとなる．またエラーの種類により xsizeが変化する．

Return values:

-2

xsize メモリエラー．

Definition at line 358 of file Gio.cpp.

References CmnHead::bsize, CmnHead::buf, CmnHead::depth, freeNull(), CmnHead::grptr, HEADER_NONE, JBXL_GRAPH_MEMORY_ERROR, CmnHead::kind, CmnHead::lsize, MOON_DATA, ntoh_st, CmnHead::xsize, CmnHead::ysize, and CmnHead::zsize.

Referenced by readCmnHeadFile(), readMoonFile(), and readXHeadFile().

{
    int i;
    CTHead chd;
    CmnHead hd;

    hd.kind  = HEADER_NONE;
    hd.bsize = 64;      // Moon形式のヘッダサイズ

    // ヘッダ読み込み
    fseek(fp, 0, 0);
    fread((void*)&chd, hd.bsize, 1, fp);
    ntoh_st(&chd, 2);

    hd.xsize = chd.xsize - chd.cutleft - chd.cutright;
    hd.ysize = chd.ysize - chd.cutup   - chd.cutdown;
    hd.zsize = 1;
    hd.depth = 16;
    hd.lsize = hd.xsize*hd.ysize*(hd.depth/8);
    hd.buf   = NULL;
    hd.grptr = NULL;
    if (fsz>0 && fsz!=hd.bsize+hd.lsize) return hd;
    
    hd.buf   = (uByte*)malloc(hd.bsize);
    if (hd.buf==NULL) {
        hd.xsize = JBXL_GRAPH_MEMORY_ERROR;
        return hd;
    }
    hd.kind  = MOON_DATA;
    memcpy(hd.buf, &chd, hd.bsize);

    hd.grptr = (uByte*)malloc(hd.lsize);
    if (hd.grptr==NULL) {
        freeNull(hd.buf);
        hd.xsize = JBXL_GRAPH_MEMORY_ERROR;
        hd.kind  = HEADER_NONE;
        return hd;
    }

    fseek(fp, hd.bsize, 0);
    fread(hd.grptr, hd.lsize, 1, fp);

    if (!no_ntoh) {
        sWord* wptr = (sWord*)hd.grptr;
        for (i=0; i<hd.xsize*hd.ysize; i++) wptr[i] = ntohs(wptr[i]);
    }
    return hd;
}

Here is the call graph for this function:

Here is the caller graph for this function:

CmnHead readMoonFile	(	const char *	fn,
		bool	no_ntoh = false
	)

CmnHead jbxl::readMoonFile(const char* fn, bool no_ntoh)

MOON_DATA形式（16bit）のグラフィックファイルを読み込む．

Parameters:

	fn	読み込むを行うファイル名．
	no_ntoh	trueの場合，エンディアンの変換を行わない．

Returns:

読み込んだグラフィックデータの共通ヘッダ．
エラー場合 kindメンバは HEADER_NONEとなる．またエラーの種類により xsizeが変化する．

Return values:

JBXL_GRAPH_MEMORY_ERROR

xsize メモリエラー．

Definition at line 320 of file Gio.cpp.

References file_size(), HEADER_NONE, JBXL_GRAPH_NOFILE_ERROR, JBXL_GRAPH_OPFILE_ERROR, CmnHead::kind, readMoonData(), and CmnHead::xsize.

{
    CmnHead hd;
    FILE* fp;
    unsigned int fsz;

    memset(&hd, 0, sizeof(CmnHead));
    hd.kind  = HEADER_NONE;

    fsz = file_size(fn);
    if (fsz==0) {
        hd.xsize = JBXL_GRAPH_NOFILE_ERROR;
        return hd;
    }
    if ((fp=fopen(fn,"rb"))==NULL) {
        hd.xsize = JBXL_GRAPH_OPFILE_ERROR;
        return hd;
    }

    hd = readMoonData(fp, fsz, no_ntoh);
    return hd;
}

Here is the call graph for this function:

CmnHead readRasData

(

FILE *

fp

)

CmnHead jbxl::readRasData(FILE* fp)

SUN RASTER形式のグラフィックファイルを読み込む．

Parameters:

fp

読み込むを行うファイルのファイル識別子．

Returns:

読み込んだグラフィックデータの共通ヘッダ．エラー場合 kindメンバは HEADER_NONEとなる．

Return values:

JBXL_GRAPH_MEMORY_ERROR

xsize メモリエラー．

Bug:

24ビット以上のエンディアン処理は未実装

Definition at line 32 of file Gio.cpp.

References CmnHead::bsize, CmnHead::buf, CmnHead::depth, freeNull(), CmnHead::grptr, HEADER_NONE, JBXL_GRAPH_MEMORY_ERROR, CmnHead::kind, CmnHead::lsize, ntoh_st, RAS_DATA, RasHead::ras_depth, RasHead::ras_height, RasHead::ras_width, CmnHead::xsize, CmnHead::ysize, and CmnHead::zsize.

Referenced by readCmnHeadFile(), readRasFile(), and readXHeadFile().

{
    RasHead rhd;
    CmnHead  hd;
    int  i, linebyte, databyte;
    uByte null[2], *buf;
    sWord* wptr;

    hd.kind  = RAS_DATA;
    hd.bsize = 32;
    hd.buf   = NULL;
    hd.grptr = NULL;

    fseek(fp, 0, 0);
    fread(&rhd, hd.bsize, 1, fp);
    ntoh_st(&rhd, 4);

    hd.xsize = rhd.ras_width;
    hd.ysize = rhd.ras_height;
    hd.zsize = 1;
    hd.depth = rhd.ras_depth;
    hd.lsize = hd.xsize*hd.ysize*((hd.depth+7)/8);
    hd.buf   = (uByte*)malloc(hd.bsize);
    if (hd.buf==NULL) {
        hd.xsize = JBXL_GRAPH_MEMORY_ERROR;
        hd.kind  = HEADER_NONE;
        return hd;
    }
    memcpy(hd.buf, (uByte*)&rhd, hd.bsize);

    hd.grptr = (uByte*)malloc(hd.lsize);
    if (hd.grptr==NULL) {
        freeNull(hd.buf);
        hd.xsize = JBXL_GRAPH_MEMORY_ERROR;
        hd.kind  = HEADER_NONE;
        return hd;
    }
    buf = (uByte*)hd.grptr;

    fseek(fp, rhd.ras_maplength, 1); 

    databyte = hd.xsize*((hd.depth+7)/8);
    linebyte = rhd.ras_length/hd.ysize;

    if (databyte==linebyte) {
        fread(buf, hd.lsize, 1, fp);
    }
    else {
        for (i=0; i<hd.ysize; i++) {
            fread(buf, databyte, 1, fp);
            fread(null, linebyte-databyte, 1, fp);
            buf += databyte;
        }
    }

    if (hd.depth==16){
        wptr = (sWord*)hd.grptr;
        for(i=0; i<hd.xsize*hd.ysize; i++) wptr[i] = ntohs(wptr[i]);
    }

    return hd;
}

Here is the call graph for this function:

Here is the caller graph for this function:

MSGraph<T> jbxl::readRasFile

(

const char *

fname

)

[inline]

template <typename t>=""> MSGraph<T> readRasFile(const char *fname)

Definition at line 587 of file Gio.h.

References CH2MG_NORMAL, MSGraph< T >::init(), and readRasData().

{
    MSGraph<T> vp;
    CmnHead    hd;
    FILE* fp;

    vp.init();
    fp = fopen(fname, "rb");
    if (fp==NULL) return vp;

    hd = readRasData(fp);
    fclose(fp);

    vp = copyCmnHead2MSGraph<T>(hd, CH2MG_NORMAL);
    return vp;
}

Here is the call graph for this function:

DllExport STLData * ReadSTLFile	(	char *	fname,
		long int *	fno
	)

STLData* jbxl::ReadSTLFile(char* fname, unsigned int* fno)

STLファイルを読み込むラッパー関数．アスキー，バイナリを自動判別．

読み込んだファセットの数(fno)を返す．

Definition at line 25 of file STL.cpp.

References DEBUG_MODE, PRINT_MESG, ReadSTLFileA(), and ReadSTLFileB().

{
    FILE*  fp;
    struct stat stbuf;
    STLData* stldata;
    unsigned int temp;

    fp = fopen(fname, "rb");
    if (fp==NULL) return NULL;
    fseek(fp, 80, SEEK_SET);
    fread(&temp, 4, 1, fp);
    fclose(fp);
    *fno = (long int)temp;

    stat(fname, &stbuf);
    if (stbuf.st_size == (*fno)*50+84) {    // ファイルサイズのチェック
        stldata = ReadSTLFileB(fname, fno); // バイナリファイル
    }
    else {
        stldata = ReadSTLFileA(fname, fno); // アスキーファイル
    }

    if (stldata==NULL) {
        if (*fno!=0) {
            DEBUG_MODE PRINT_MESG("ReadSTLFile: メモリの確保に失敗．\n");
        }
        else {
            DEBUG_MODE PRINT_MESG("ReadSTLFile: データの読み込みに失敗．\n");
        }
    }
    else {
        DEBUG_MODE PRINT_MESG("ReadSTLFile: file name = %s\n", fname);
        DEBUG_MODE PRINT_MESG("ReadSTLFile: read facet No. = %d\n", *fno);
    }

    return  stldata;
}

Here is the call graph for this function:

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.

References CHAR_TAB, LBUF, and strncasecmp.

Referenced by ReadSTLFile().

{
    FILE* fp;
    STLData*  stldata = NULL;
    float  vect[3];
    char   buffer[LBUF], dummy[LBUF], *pbuf;
    int    vno=0;

    // ファイルをオープンしてデータ数を数える．
    *fno = 0;
    fp = fopen(fname, "r");
    if (fp==NULL) return NULL;
    
    fgets(buffer, LBUF, fp);
    while (!feof(fp)) {
        pbuf = buffer;
        while(*pbuf==' '||*pbuf==CHAR_TAB) pbuf++; 

        if (!strncasecmp(pbuf, "facet ",  6)) (*fno)++;
        if (!strncasecmp(pbuf, "vertex ", 7)) vno++;
        fgets(buffer, LBUF, fp);
    }
    fclose(fp);

    // メモリの確保
    if (vno!=0 && vno==(*fno)*3) {
        stldata = (STLData*)malloc(sizeof(STLData)*(*fno));
    }
    if (stldata==NULL) {
        *fno = 0;
        return NULL;
    }

    // もう一度ファイルをオープンして，データを読み込む．
    int i=0, j=0;
    fp = fopen(fname, "r");
    if (fp==NULL) return NULL;

    fgets(buffer, LBUF, fp);
    while (!feof(fp)) {
        pbuf = buffer;
        while(*pbuf==' '||*pbuf==CHAR_TAB) pbuf++; 

        if (!strncasecmp(pbuf, "facet ", 6)) {                      // 法線ベクトル
            sscanf(buffer, "%s %s %f %f %f", dummy, dummy, &vect[0], &vect[1], &vect[2]);
            for (int k=0; k<3; k++) stldata[i].vect[k] = vect[k];
            j = 3;
        }
        else if (!strncasecmp(pbuf, "vertex ", 7) && j>=3 && j<12) {// 座標
            sscanf(buffer, "%s %f %f %f", dummy, &vect[0], &vect[1], &vect[2]);
            for (int k=0; k<3; k++) stldata[i].vect[j+k] = vect[k];
            j += 3;
            if (j==12) i++;
        }
        fgets(buffer, LBUF, fp); 
    }
    fclose(fp);

    return  stldata;
}

Here is the caller graph for this function:

DllExport STLData * ReadSTLFileB	(	char *	fname,
		long int *	fno
	)

STLData* jbxl::ReadSTLFileB(char* fname, long int* fno)

バイナリ形式の STLファイルを読み込み，読み込んだファセットの数を返す．

Definition at line 180 of file STL.cpp.

References STLData::vect.

Referenced by ReadSTLFile().

{
    FILE* fp;
    char  message[81];          // STLのファイルメッセージ
    tmpSTLData* tmp_stldata;
    STLData*    stldata;
    STLData*    exdata; 

    fp = fopen(fname, "rb");
    if (fp==NULL) return NULL;
    fread(message, 80, 1, fp);
    message[80] = '\0';         // STLのファイルメッセージ(message[]）80Byteは未使用
    
    fread(fno, 4, 1, fp);
    tmp_stldata = (tmpSTLData*)malloc(sizeof(tmpSTLData)*(*fno));
    if (tmp_stldata==NULL) return NULL;
    fread(tmp_stldata, sizeof(tmpSTLData), *fno, fp);
    fclose(fp);

    stldata = (STLData*)malloc(sizeof(STLData)*(*fno));
    if (stldata==NULL) {
        free(tmp_stldata);
        return NULL;
    }

    for (int i=0; i<(*fno); i++) {
        exdata = (STLData*)(&tmp_stldata[i]);       // アドレスの読み替え（50Byteの構造体を作れないため）
        for (int j=0; j<12; j++) {
            stldata[i].vect[j] = exdata->vect[j];   // データの移動
        }
    }

    free(tmp_stldata);
    return  stldata;
}

Here is the caller graph for this function:

TGAImage readTGAData

(

FILE *

fp

)

TGAImage jbxl::readTGAData(FILE* fp)

TGAファイルを読み込んで，TGAImage構造体へデータを格納する．

Parameters:

fp

読み込むファイルの記述子

Returns:

TGAImage データ．gp==NULL の場合，state に情報が入る．

Return values:

	JBXL_GRAPH_OPFILE_ERROR	state: ファイルオープンエラー
	JBXL_GRAPH_HEADER_ERROR	state: 不正ファイル（TGAファイルでない？）
	JBXL_GRAPH_MEMORY_ERROR	state: メモリエラー

Definition at line 163 of file TgaTool.cpp.

References TGAImage::free(), JBXL_GRAPH_IVDARG_ERROR, PRINT_MESG, and TGAImage::state.

Referenced by readTGAFile().

{
    TGAImage tga;

    fseek(fp, 0, 0);
    tga.free();

    /**********************************************************************/
    PRINT_MESG("**********************************************\n");
    PRINT_MESG("ERROR: jbxl::readTGAData() is not implemeted!!\n");
    PRINT_MESG("**********************************************\n");
    tga.state = JBXL_GRAPH_IVDARG_ERROR;
    /**********************************************************************/

    return tga;
}

Here is the call graph for this function:

Here is the caller graph for this function:

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_ERROR	state: ファイルオープンエラー
	JBXL_GRAPH_HEADER_ERROR	state: 不正ファイル（TGAファイルでない？）
	JBXL_GRAPH_MEMORY_ERROR	state: メモリエラー

Definition at line 132 of file TgaTool.cpp.

References TGAImage::gp, JBXL_GRAPH_OPFILE_ERROR, readTGAData(), and TGAImage::state.

{
    TGAImage tga;
    FILE*  fp;

    fp = fopen(fname, "rb");
    if (fp==NULL) {
        tga.gp   = NULL;
        tga.state = JBXL_GRAPH_OPFILE_ERROR;
        return tga;
    }

    tga = readTGAData(fp);
    fclose(fp);

    return tga;
}

Here is the call graph for this function:

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_ERROR	xsize オペレータ指定のヘッダがない．
	JBXL_GRAPH_MEMORY_ERROR	xsize メモリエラー．
	JBXL_GRAPH_CANCEL	xsize キャンセル．

Bug:

24ビット以上のエンディアン処理は未実装

Definition at line 222 of file Gio.cpp.

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_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().

{
    CmnHead hd;
    init_CmnHead(&hd);
    CVCounter* counter = NULL;

    if (chd==NULL) {
        hd.xsize = JBXL_GRAPH_MEMORY_ERROR;
        return hd;
    }
    else if ((chd->kind&0x0ff)!=USERSET_DATA) {
        hd.xsize = JBXL_GRAPH_MEMORY_ERROR;
        return hd;
    }
    hd = *chd;

    // ヘッダ読み込み
    fseek(fp, 0, 0);
    hd.buf = (uByte*)malloc(hd.bsize);
    if (hd.buf==NULL) {
        hd.xsize = JBXL_GRAPH_MEMORY_ERROR;
        hd.kind  = HEADER_NONE;
        return hd;
    }
    fread((void*)hd.buf, hd.bsize, 1, fp);

    // カウンタ
    if (hd.zsize>=10 && cnt) {
        counter = GetUsableGlobalCounter();
        if (counter!=NULL) {
            //counter->SetTitle("ユーザ指定ファイル読み込み中");
            counter->SetMax((hd.zsize+1)/10);
            counter->SetPos(1);
        }
    }

    hd.grptr = (uByte*)malloc(hd.lsize);
    if (hd.grptr==NULL) {
        freeNull(hd.buf);
        hd.xsize = JBXL_GRAPH_MEMORY_ERROR;
        hd.kind  = HEADER_NONE;
        return hd;
    }

    fseek(fp, hd.bsize, 0);

    if (counter==NULL) {
        fread(hd.grptr, hd.lsize, 1, fp);
    }
    else {
        int psize = hd.xsize*hd.ysize*((hd.depth+7)/8);
        for (int i=0; i<hd.zsize; i++) {
            fread(hd.grptr+i*psize, psize, 1, fp);
            if (i%10==0) {
                counter->StepIt();
                if (counter->isCanceled()) {    // キャンセル
                    free_CmnHead(&hd);
                    hd.xsize = JBXL_GRAPH_CANCEL;
                    hd.kind  = HEADER_NONE;
                    return hd;
                }
            }
        }
    }

    if (hd.depth==16) {
        if (checkBit(chd->kind, HAS_LENDIAN) && is_little_endian()) {
            // CPU とファイルが同じ Little Endianなので，何もしない．
        }
        else {
            sWord* wptr = (sWord*)hd.grptr;
            for (int i=0; i<hd.xsize*hd.ysize*hd.zsize; i++) wptr[i] = ntohs(wptr[i]);
        }
    }

    if (counter!=NULL) counter->PutFill();
    return hd;
}

Here is the call graph for this function:

Here is the caller graph for this function:

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 666 of file Gio.cpp.

References CTHead::anydata, CmnHead::bsize, CmnHead::buf, CTHead::cutdown, CTHead::cutleft, CTHead::cutright, CTHead::cutup, CmnHead::depth, DICOM_DATA, dicomHeader(), file_size(), free_Buffer(), free_CmnHead(), CmnHead::grptr, HAS_RZXY, HEADER_NONE, 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().

{
    FILE    *fp;
    int    fsz, hsz, csz;
    CmnHead hd;

    hsz = sizeof(CmnHead);
    memset(&hd, 0, hsz);
    hd.kind = HEADER_NONE;

    fsz = (int)file_size(fn);
    if (fsz<=0) {
        hd.xsize = JBXL_GRAPH_NOFILE_ERROR;
        return hd;
    }

    // オペレータ指定のデータ形式を確認（予めヘッダに情報が設定されている）
    //
    if (chd!=NULL && (chd->kind&0x00ff)==USERSET_DATA) {
        if (chd->zsize<=0) chd->zsize = 1;
        chd->lsize = chd->xsize*chd->ysize*chd->zsize*((chd->depth+7)/8);
        if (fsz==(int)(chd->bsize+chd->lsize)) {    // ファイルサイズのチェック
            return *chd;
        }
    }

    if ((fp=fopen(fn,"rb"))==NULL) {
        hd.xsize = JBXL_GRAPH_OPFILE_ERROR;
        return hd;
    }

    // 共通ヘッダの読み込み
    //
    fseek(fp, 0, 0);
    fread(&hd, hsz, 1, fp);
    hd.grptr = NULL;
    ntoh_st(&hd, 4);

    // Sun Raster
    if (hd.kind==RAS_MAGIC) {
        hd.kind = RAS_DATA;
        PRINT_MESG("readXHead: Sun Raster File\n");
        fclose(fp);
        hd.depth = hd.zsize;
        hd.zsize = 1;
        hd.lsize = file_size(fn) - sizeof(RasHead);
        hd.bsize = 0;
        hd.buf = NULL;
        hd.grptr = NULL;
        return hd;
    }

    // Common ヘッダ
    if (hd.kind>0 && hd.kind<=NUM_KDATA && fsz==(int)(hsz+hd.bsize+hd.lsize)) {
        if (hd.zsize<=0) hd.zsize = 1;
        if (hd.bsize>0) {
            hd.buf = (uByte*)malloc(hd.bsize);
            if (hd.buf==NULL) {
                free_CmnHead(&hd);
                hd.xsize = JBXL_GRAPH_MEMORY_ERROR;
                hd.kind  = HEADER_NONE;
                fclose(fp);
                return hd;
            }

            fseek(fp, hsz, 0);
            fread(hd.buf, hd.bsize, 1, fp);
            ntoh_ar((sWord*)hd.buf, hd.bsize);      
        }

        PRINT_MESG("readXHead: Common ヘッダ\n");
        PRINT_MESG("readXHead: ヘッダ種別     kind  = %d\n", hd.kind);
        PRINT_MESG("readXHead: ファイルサイズ fsz   = %d\n", fsz);
        PRINT_MESG("readXHead: ヘッダサイズ   hsz   = %d\n", sizeof(CmnHead));
        PRINT_MESG("readXHead: ヘッダバッファ bsize = %d\n", hd.bsize);
        PRINT_MESG("readXHead: データサイズ   lsize = %d\n", hd.lsize);
        PRINT_MESG("readXHead: サイズ         %dx%dx%d %d\n", hd.xsize, hd.ysize, hd.zsize, hd.depth);
        
        fclose(fp);
        return hd;
    }
    memset(&hd, 0, hsz);

    // CT File (Moon)
    //
    CTHead cthd;
    csz = sizeof(CTHead);
    fseek(fp, 0, 0);
    fread(&cthd, csz, 1, fp);
    ntoh_st(&cthd, 2);

    hd.xsize = cthd.xsize - cthd.cutleft - cthd.cutright;
    hd.ysize = cthd.ysize - cthd.cutup   - cthd.cutdown;
    hd.zsize = 1;
    hd.depth = 16;
    hd.bsize = csz;
    hd.lsize = hd.xsize*hd.ysize*hd.zsize*((hd.depth+7)/8);

    if (fsz==(int)(hd.bsize+hd.lsize)) {
        hd.kind = MOON_DATA;
        hd.buf  = (uByte*)malloc(csz);
        if (hd.buf==NULL) {
            free_CmnHead(&hd);
            hd.xsize = JBXL_GRAPH_MEMORY_ERROR;
            hd.kind  = HEADER_NONE;
            fclose(fp);
            return hd;
        }
        memcpy(hd.buf, &cthd, csz);

        PRINT_MESG("readXHead: CT ファイル\n");
        PRINT_MESG("readXHead: ヘッダ種別     kind  = %d\n", hd.kind);
        PRINT_MESG("readXHead: ファイルサイズ fsz   = %d\n", fsz);
        PRINT_MESG("readXHead: ヘッダサイズ   hsz   = %d\n", sizeof(CmnHead));
        PRINT_MESG("readXHead: ヘッダバッファ bsize = %d\n", hd.bsize);
        PRINT_MESG("readXHead: データサイズ   lsize = %d\n", hd.lsize);
        PRINT_MESG("readXHead: サイズ         %dx%dx%d %d\n", hd.xsize, hd.ysize, hd.zsize, hd.depth);

        fclose(fp);
        return hd;
    }
    memset(&hd, 0, hsz);

    // Dicom
    //
    int   ls, sz, dsize, xsize, ysize, depth;
    double rzxy;

    sz = dicomHeader(fp, fsz, &dsize, &xsize, &ysize, &depth, &rzxy);
    ls = xsize*ysize*((depth+7)/8);
    if (sz>0 && dsize==ls) {
        hd.kind  = DICOM_DATA;
        hd.xsize = xsize;
        hd.ysize = ysize;
        hd.zsize = 1;
        hd.depth = depth;
        hd.bsize = sizeof(CTHead);
        hd.lsize = ls;
        hd.buf   = (uByte*)malloc(hd.bsize);
        hd.grptr = NULL; 
                                 
        CTHead* pcthd = (CTHead*)hd.buf;
        memset(pcthd, 0, hd.bsize);
        pcthd->xsize  = hd.xsize;
        pcthd->ysize  = hd.ysize;

        if (rzxy>0.0) {
            pcthd->anydata[0] = (sWord)(rzxy*RZXY_RATE);
            pcthd->anydata[1] = RZXY_RATE;
            hd.kind |= HAS_RZXY;
        }

        fclose(fp);
        return hd;
    }

    // Well Known ファイル
    //
    fseek(fp, 0, 0);
    Buffer buf = read_Buffer_data(fp, 32);


    // TIFF
    /*
    if (head[0]=='I' && head[1]=='I') {
        if (head[2]==0x2a && head[3]==0x00) {
            PRINT_MESG("readXHead: TIFFデータ形式\n");
            hd.kind = TIFF_DATA;
            fclose(fp);
            return hd;
        }
    }
    if (head[0]=='M' && head[1]=='M') {
        if (head[2]==0x00 && head[3]==0x2a) {
            PRINT_MESG("readXHead: TIFFデータ形式\n");
            hd.kind = TIFF_DATA;
            fclose(fp);
            return hd;
        }
    }*/

#ifdef  ENABLE_JPEGLIB
    // JPEG
    if (isJPEGHeader(buf)) {
        PRINT_MESG("readXHead: JPEGデータ形式\n");
        hd.kind = JPEG_RGB_DATA;    // JPEG_RGB_DATA or JPEG_MONO_DATA
        fclose(fp);
        free_Buffer(&buf);
        return hd;
    }
#endif

    free_Buffer(&buf);

    // Another Unknown File Format
    //
    PRINT_MESG("readXHead: 未知のデータ形式\n");
    memset(&hd, 0, hsz);
    hd.kind  = UN_KNOWN_DATA;
    hd.lsize = fsz;

    fclose(fp);
    return hd;
}

Here is the call graph for this function:

Here is the caller graph for this function:

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]	chd	USERSET_DATA指定の場合，ファイルのヘッダ情報を入れる． またはファイルに関するオプション情報も指定できる（現在はエンディアンの情報のみ）．
	cnt	仮想カウンタを使用するか？

Returns:

読み込んだグラフィックデータを記述する共通ヘッダ．
エラーなら kind = HEADER_NONE となる．またエラーの種類により xsizeが変化する．

Return values:

	JBXL_GRAPH_OPFILE_ERROR	xsize ファイルオープンエラー．
	JBXL_GRAPH_MEMORY_ERROR	xsize メモリエラー．
	JBXL_GRAPH_CANCEL	xsize キャンセル by ユーザ

Bug:

Common形式の画素深度が 24,32bitの場合のエンディアン処理が未実装

Definition at line 909 of file Gio.cpp.

References CmnHead::bsize, CmnHead::buf, checkBit, CmnHead::depth, DICOM_DATA, file_size(), free_Buffer(), free_CmnHead(), GetUsableGlobalCounter(), MSGraph< T >::gp, CmnHead::grptr, HAS_LENDIAN, HAS_RZXY, HEADER_NONE, is_little_endian(), CVCounter::isCanceled(), 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, CmnHead::xsize, MSGraph< T >::ys, CmnHead::ysize, MSGraph< T >::zs, and CmnHead::zsize.

Referenced by readGraphicFile().

{
    FILE* fp;
    int  fsz, hsz;
    bool  no_ntoh = false;
    CmnHead hd;
    CVCounter* counter = NULL;

    memset(&hd, 0, sizeof(CmnHead));
    hd.kind = HEADER_NONE;

    fsz = (int)file_size(fn);
    if (fsz==0) {
        hd.xsize = JBXL_GRAPH_NOFILE_ERROR;
        return hd;
    }

    if ((fp=fopen(fn,"rb"))==NULL) {
        hd.xsize = JBXL_GRAPH_OPFILE_ERROR;
        return hd;
    }

    // オペレータ指定のデータ形式を確認（予めヘッダに情報が設定されている）
    //
    if (chd!=NULL) {
        // ファイルとCPUのエンディアンが同じ
        if (checkBit(chd->kind, HAS_LENDIAN) && is_little_endian()) {
            no_ntoh = true;
        }

        // オペレータ指定のデータ形式．カウンタ未サポート
        if ((chd->kind&0x00ff)==USERSET_DATA) {
            if (chd->zsize<=0) chd->zsize = 1;
            chd->lsize = chd->xsize*chd->ysize*chd->zsize*((chd->depth+7)/8);
            if (fsz==(int)(chd->bsize+chd->lsize)) {        // ファイルサイズのチェック
                PRINT_MESG("readXHeadFile: オペレータ指定のデータ形式\n");
                hd = readUserSetData(fp, chd, true);        // カウンタ有効 

                // 24, 32bit 未対応
                if (hd.depth==16 && !no_ntoh) {
                    sWord* wptr = (sWord*)hd.grptr;
                    for (int i=0; i<hd.xsize*hd.ysize*hd.zsize; i++) {
                        wptr[i] = ntohs(wptr[i]);
                    }
                }

                fclose(fp);
                return hd;
            }
        }
    }

    // 共通ヘッダの読み込み
    //
    hsz = sizeof(CmnHead);
    fseek(fp, 0, 0);
    fread(&hd, hsz, 1, fp);
    ntoh_st(&hd, 4);

    // Sun Raster
    if (hd.kind==RAS_MAGIC) {
        PRINT_MESG("readXHeadFile: Sun Rasterデータ形式\n");
        hd = readRasData(fp); 
        fclose(fp);
        return hd;
    }

    // Common形式 
    // データ読み取りでは hd.lsize==0 のファイルサイズ無効（CT_RGN_SL）はまだサポートされていない
    if (hd.kind>0 && hd.kind<=NUM_KDATA && fsz==(int)(hsz+hd.bsize+hd.lsize)) {
        PRINT_MESG("readXHeadFile: Commonデータ形式\n");
        if (hd.zsize<=0) hd.zsize = 1;

        // カウンタ
        if (hd.zsize>=10 && cnt) {
            counter = GetUsableGlobalCounter();
            if (counter!=NULL) {
                //counter->SetTitle("Commonファイル読み込み中");
                counter->SetMax(hd.zsize/10);
                counter->SetPos(0);
            }
        }
        
        if (hd.bsize>0) hd.buf = (uByte*)malloc(hd.bsize);
        hd.grptr = (uByte*)malloc(hd.lsize);
        if ((hd.bsize>0&&hd.buf==NULL) || hd.grptr==NULL) {
            free_CmnHead(&hd);
            hd.xsize = JBXL_GRAPH_MEMORY_ERROR;
            hd.kind  = HEADER_NONE;
            fclose(fp);
            return hd;
        }
        fseek(fp, hsz, 0);
        if (hd.bsize>0) {
            fread(hd.buf, hd.bsize, 1, fp);
            ntoh_ar((sWord*)hd.buf, hd.bsize);
        }
        
        // ヘッダのみ
        if (hd.lsize==0) {
            fclose(fp);
            if (counter!=NULL) counter->PutFill();
            return hd;
        }

        // データ本体
        if (counter==NULL) {
            fread(hd.grptr, hd.lsize, 1, fp);
        }
        else {
            int psize = hd.xsize*hd.ysize*((hd.depth+7)/8);
            for (int i=0; i<hd.zsize; i++) {
                fread(hd.grptr+i*psize, psize, 1, fp);
                if (i%10==0) {
                    counter->StepIt();
                    if (counter->isCanceled()) {    // キャンセル
                        //counter->Stop();
                        free_CmnHead(&hd);
                        hd.xsize = JBXL_GRAPH_CANCEL;
                        hd.kind  = HEADER_NONE;
                        fclose(fp);
                        return hd;
                    }
                }
            }
        }

        // 24, 32bit 未対応
        if (hd.depth==16 && !no_ntoh) {
            sWord* wptr = (sWord*)hd.grptr;
            for (int i=0; i<hd.xsize*hd.ysize*hd.zsize; i++) {
                wptr[i] = ntohs(wptr[i]);
            }
        }

        fclose(fp);
        if (counter!=NULL) counter->PutFill();
        return hd;
    }
    memset(&hd, 0, hsz);

    // Moon形式 16bit
    //
    hd = readMoonData(fp, fsz, no_ntoh);
    if ((hd.kind & 0x00ff)==MOON_DATA) {
        PRINT_MESG("readXHeadFile: Moonデータ形式\n");
        fclose(fp);
        return hd;
    }
    memset(&hd, 0, hsz);

    // DICOMファイル
    //
    MSGraph<sWord> vp = readDicomData(fp, fsz);
    if (vp.gp!=NULL) {
        PRINT_MESG("readXHeadFile: DICOMデータ形式\n");
        hd.kind  = DICOM_DATA;
        hd.xsize = vp.xs;
        hd.ysize = vp.ys;
        hd.zsize = vp.zs;
        hd.depth = 16;
        hd.bsize = sizeof(CTHead);
        hd.lsize = vp.xs*vp.ys*vp.zs*2;
        hd.buf   = (uByte*)malloc(hd.bsize);
        hd.grptr = (uByte*)vp.gp;
                
        CTHead* pcthd = (CTHead*)hd.buf;
        memset(pcthd, 0, hd.bsize);
        pcthd->xsize  = (sWord)hd.xsize;
        pcthd->ysize  = (sWord)hd.ysize;
        //pcthd->ctmin  = 0;
        //pcthd->ctmax  = 0;
        //pcthd->cutup  = 0;
        //pcthd->cutdown  = 0;
        //pcthd->cutleft  = 0;
        //pcthd->cutright = 0;
        
        if (vp.RZxy>0.0) {
            pcthd->anydata[0] = (sWord)(vp.RZxy*RZXY_RATE);
            pcthd->anydata[1] = RZXY_RATE;
            hd.kind |= HAS_RZXY;
        }

        if (!no_ntoh) {
            sWord* wptr = (sWord*)hd.grptr;
            for (int i=0; i<hd.xsize*hd.ysize*hd.zsize; i++) {
                wptr[i] = ntohs(wptr[i]);
            }
        }

        fclose(fp);
        return hd;
    }

    // Well Known ファイル
    //
    fseek(fp, 0, 0);
    Buffer buf = read_Buffer_data(fp, 32);

    // TIFF
    /*
    fread(head, 32, 1, fp);
    if (head[0]=='I' && head[1]=='I') {
        if (head[2]==0x2a && head[3]==0x00) {
            PRINT_MESG("readXHeadFile: TIFFデータ形式\n");
            hd.kind = TIFF_DATA;
            //fclose(fp);
            //return hd;
        }
    }
    if (head[0]=='M' && head[1]=='M') {
        if (head[2]==0x00 && head[3]==0x2a) {
            PRINT_MESG("readXHeadFile: TIFFデータ形式\n");
            hd.kind = TIFF_DATA;
            //fclose(fp);
            //return hd;
        }
    }*/

#ifdef  ENABLE_JPEGLIB
    // JPEG
    if (isJPEGHeader(buf)) {
        PRINT_MESG("readXHeadFile: JPEGデータ形式\n");
        JPEGImage jpg = readJPEGData(fp);
        hd = JPEGImage2CmnHead(jpg);

        if (hd.zsize==1) hd.kind = JPEG_MONO_DATA;
        jpg.free();
        free_Buffer(&buf);
        fclose(fp);
        return hd;
    }
#endif

    free_Buffer(&buf);

    // 解析不能．データのまま読み込み　UN_KNOWN_DATA
    //
    PRINT_MESG("readXHeadFile: 未知のデータ形式\n");
    memset(&hd, 0, hsz);

    hd.grptr = (uByte*)malloc(fsz);
    if (hd.grptr==NULL) {
        hd.xsize = JBXL_GRAPH_MEMORY_ERROR;
        hd.kind  = HEADER_NONE;
        fclose(fp);
        return hd;
    }
    fseek(fp, 0, 0);
    fread(hd.grptr, fsz, 1, fp);

    hd.kind  = UN_KNOWN_DATA;
    hd.lsize = fsz;

    fclose(fp);
    return hd;
}

Here is the call graph for this function:

Here is the caller graph for this function:

MSGraph<T> jbxl::reduce_MSGraph	(	MSGraph< T >	vp,
		double	rc,
		int	mode = ON
	)			[inline]

Definition at line 1847 of file Graph.h.

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.

{
    int  xss, yss, ps, pz, py;
    MSGraph<T> vx;

    vx.init();

    if (vp.gp==NULL) {
        vx.state = JBXL_GRAPH_NODATA_ERROR;
        return vx;
    }
    if (rc==0.0) {
        vx.state = JBXL_GRAPH_IVDARG_ERROR;
        return vx;
    }
    else if (rc<0.0) rc = -rc;

    xss = (int)(vp.xs/rc);
    yss = (int)(vp.ys/rc);

    vx.set(xss, yss, vp.zs);
    if (vx.isNull()) return vx;
    vx.color = vp.color;

    ps = xss*yss;

    if (mode==ON) {
        int ii, jj, kk, ll, ss, nn;

        for(int z=0; z<vx.zs; z++) {
            pz = z*ps;
            for(int j=0; j<yss; j++) {
                py = pz + j*xss;
                for(int i=0; i<xss; i++) {
                    ii = (int)(i*rc);
                    jj = (int)(j*rc);
                    if (ii>=vp.xs) ii = vp.xs - 1;
                    if (jj>=vp.ys) jj = vp.ys - 1;

                    ss = nn = 0;
                    for(int l=jj; l<jj+(int)rc; l++) {
                        ll = l;
                        if (ll>=vp.ys) ll = vp.ys - 1;
                        for(int k=ii; k<ii+(int)rc; k++) {
                            kk = k;
                            if (kk>=vp.xs) kk = vp.xs - 1;
                            ss += vp.point(kk, ll, z);
                            nn++;
                        }
                    }
                    vx.gp[py+i] = ss/nn;
                }
            }
        }
    }

    else {
        int ii, jj;

        for(int k=0; k<vx.zs; k++) {
            pz = k*ps;
            for(int j=0; j<yss; j++) {
                py = pz + j*xss;
                for(int i=0; i<xss; i++) {
                    ii = (int)(i*rc);
                    jj = (int)(j*rc);
                    if (ii>=vp.xs) ii = vp.xs - 1;
                    if (jj>=vp.ys) jj = vp.ys - 1;
                    vx.gp[py+i] = vp.point(ii, jj, k);
                }
            }
        }
    }

    return vx;
}

Here is the call graph for this function:

DllExport void ReverseContours

(

BREP_SOLID *

solid

)

void jbxl::ReverseContours(BREP_SOLID* solid)

削除マークの付いたFacet(Contour)を削除し，同じ頂点を持つContourを裏返して登録する. もし，登録した Contourに多重 Edgeがある場合は登録を中止する．
ただし，読み込み（初期）データは削除しない．

Contours List と Wings Listの内容は保障される．

Definition at line 545 of file TriBrep.cpp.

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().

{
    // 全ての Facetに対して
    BREP_SHELL_LIST shells = solid->shells;
    BREP_SHELL_LIST::iterator ishell;
    for (ishell=shells.begin(); ishell!=shells.end(); ishell++){
        BREP_FACET_LIST::iterator ifacet;
        for (ifacet =(*ishell)->facets.begin(); ifacet!=(*ishell)->facets.end(); ifacet++){
            // 削除マークが付いているなら
            if ((*ifacet)->deletable && !(*ifacet)->notdelete) {
                // 逆周りで頂点を Vector vに格納
                BREP_VERTEX*  v[3];
                BREP_FACET*   pbfc;
                BREP_CONTOUR* pbcn;
                BREP_CONTOUR_LIST::iterator icon;
                for (icon=(*ifacet)->outer_contours.begin(); icon!=(*ifacet)->outer_contours.end(); icon++) {
                    BREP_WING* wing = (*icon)->wing;
                    for (int i=0; i<3; i++) {
                        v[i] = wing->vertex;
                        wing = wing->prev;
                    }
                }

                // 削除マークが付いている Facetを削除
                pbfc   = *ifacet;
                ifacet = (*ishell)->facets.erase(ifacet);
                ifacet--;
                pbfc->shell = NULL;
                delete(pbfc);

                // 裏返しの Contourを登録
                pbfc = new BREP_FACET(*ishell);
                pbcn = CreateContourByVertex(pbfc, v); 
                if (pbcn!=NULL) {
                    if (DupEdgeNumber(pbcn)==0) {
                        pbfc->CloseData();
                    }
                    else {
                        FastDeleteFacet(pbfc);
                    }
                }
                else {
                    FastDeleteFacet(pbfc);
                }
            }
        }
    }

    CreateContoursList(solid);  
    CreateWingsList(solid);
}

Here is the call graph for this function:

Here is the caller graph for this function:

uWord jbxl::RGB2Word	(	uWord	r,
		uWord	g,
		uWord	b
	)			[inline]

Definition at line 1066 of file Gdata.h.

References isLittleEndian, and swap_byte().

Referenced by _linecopy_MAT2MSG_C3().

{
    r = (int)(((r&0x00ff)>>3)<<11);
    g = (int)(((g&0x00ff)>>2)<<5);
    b = (int) ((b&0x00ff)>>3);
    uWord c = (uWord)(r + g + b);

    if (isLittleEndian) swap_byte(&c, 2, 2);
    return  c;
}

Here is the call graph for this function:

Here is the caller graph for this function:

MSGraph<T> jbxl::rotate_MSGraph	(	MSGraph< T >	vp,
		double	th,
		int	mode = ON
	)			[inline]

Definition at line 1992 of file Graph.h.

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

{
    MSGraph<T> vs;
    double cst = cos(th);
    double snt = cos(th);
    int   xys = (int)sqrt(vp.xs*vp.xs+vp.ys*vp.ys) + 1;

    vs = rotate_MSGraph<T>(vp, xys, xys, cst, snt, mode);
    return vs;
}

MSGraph<T> jbxl::rotate_MSGraph	(	MSGraph< T >	vp,
		int	xs,
		int	ys,
		double	cst,
		double	snt,
		int	mode = ON
	)			[inline]

template <typename t>=""> MSGraph<T> rotate_MSGraph(MSGraph<T> vp, int xs, int ys, double cst, double snt, int mode=ON)

反時計回りに画像を回転させる

Definition at line 1931 of file Graph.h.

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.

{
    MSGraph<T> vs;
    T   pt;
    int  i, j, m, n;
    int  ps, px, pz;
    double u, t, x, y, a, b;

    vs.set(xs, ys, vp.zs, vp.zero, vp.base);
    if (vs.isNull()) return vs;
    vs.color = vp.color;

    ps = vs.xs*vs.ys;

    for (int k=0; k<vs.zs; k++) {
        pz = k*ps;
        for (int jj=0; jj<vs.ys; jj++) {
            px = pz + jj*vs.xs;
            for (int ii=0; ii<vs.xs; ii++) {
                u = ii - (vs.xs-1)/2.;
                t = (vs.ys-1)/2. - jj;
                x =   u*cst + t*snt;
                y = - u*snt + t*cst;
                a = x + (vp.xs-1)/2.;
                b = (vp.ys-1)/2. - y;
                i = (int)a;
                j = (int)b;
                
                if (i<0 || i>=vp.xs || j<0 || j>=vp.ys) {
                    pt = vs.zero;
                }
                else {
                    if (mode==ON) {
                        if (a>=0.) a = a - i;
                        else       a = 0.;
                        if (b>=0.) b = b - j;
                        else       b = 0.;

                        m = i + 1;
                        n = j + 1;
                        if (m>=vp.xs) m = vp.xs - 1;
                        if (n>=vp.ys) n = vp.ys - 1;
                        pt = (T)((1.-a)*(1.-b)*vp.point(i, j, k) + (1.-a)*b*vp.point(i, n, k) 
                                                                 + a*(1.-b)*vp.point(m, j, k) + a*b*vp.point(m, n, k) + 0.5);
                    }
                    else {
                        pt = vp.point(i, j, k);
                    }
                }
                vs.gp[px+ii] = pt;
            }
        }
    }

    return vs;
}

Here is the call graph for this function:

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]	x	in: X座標．out: 回転後のX座標．
[in,out]	y	in: Y座標．out: 回転後のY座標．
	sxc	回転前の座標の中心の X座標
	syc	回転前の座標の中心の Y座標
	dxc	回転後の座標の中心の X座標
	dyc	回転後の座標の中心の Y座標
	cst	回転角 cosθ
	snt	回転角 sinθ

Definition at line 28 of file Graph.cpp.

Referenced by rotate_point_angle().

{
    double a, b, u, t;

    a = x - sxc;
    b = syc - y;
    u = a*cst - b*snt;
    t = a*snt + b*cst;
    x = (int)(u + dxc + 0.5);
    y = (int)(dyc - t + 0.5);

    return;
}

Here is the caller graph for this function:

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]	x	in: X座標．out: 回転後のX座標．
[in,out]	y	in: Y座標．out: 回転後のY座標．
	sxc	回転前の座標の中心の X座標
	syc	回転前の座標の中心の Y座標
	dxc	回転後の座標の中心の X座標
	dyc	回転後の座標の中心の Y座標
	th	回転角（ラジアン）

Definition at line 55 of file Graph.cpp.

References rotate_point().

{
    double cst = (double)cos(th);
    double snt = (double)sin(th);

    rotate_point(x, y, sxc, syc, dxc, dyc, cst, snt);

    return;
}

Here is the call graph for this function:

Vector<T> jbxl::RotMatrix2ExtEulerXYZ	(	Matrix< T >	mtx,
		Vector< T > *	vct = NULL
	)			[inline]

Definition at line 1162 of file Rotation.h.

References Matrix< T >::element().

Referenced by RotMatrix2Quaternion().

{
    T m11 = mtx.element(1, 1);
    T m12 = mtx.element(1, 2);
    T m13 = mtx.element(1, 3);
    T m21 = mtx.element(2, 1);
    T m31 = mtx.element(3, 1);
    T m32 = mtx.element(3, 2);
    T m33 = mtx.element(3, 3);

    Vector<T> eul = RotMatrixElements2ExtEulerXYZ<T>(m11, m12, m13, m21, m31, m32, m33, vct);

    return eul;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Vector<T> jbxl::RotMatrix2ExtEulerXZY	(	Matrix< T >	mtx,
		Vector< T > *	vct = NULL
	)			[inline]

Definition at line 1195 of file Rotation.h.

References Matrix< T >::element().

Referenced by Quaternion2ExtEulerXZY().

{
    T m11 = mtx.element(1, 1);
    T m12 = mtx.element(1, 2);
    T m13 = mtx.element(1, 3);
    T m21 = mtx.element(2, 1);
    T m22 = mtx.element(2, 2);
    T m23 = mtx.element(2, 3);
    T m31 = mtx.element(3, 1);

    Vector<T> eul = RotMatrixElements2ExtEulerXZY<T>(m11, m12, m13, m21, m22, m23, m31, vct);

    return eul;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Vector<T> jbxl::RotMatrix2ExtEulerYXZ	(	Matrix< T >	mtx,
		Vector< T > *	vct = NULL
	)			[inline]

Definition at line 1227 of file Rotation.h.

References Matrix< T >::element().

Referenced by Quaternion2ExtEulerYXZ().

{
    T m12 = mtx.element(1, 2);
    T m21 = mtx.element(2, 1);
    T m22 = mtx.element(2, 2);
    T m23 = mtx.element(2, 3);
    T m31 = mtx.element(3, 1);
    T m32 = mtx.element(3, 2);
    T m33 = mtx.element(3, 3);

    Vector<T> eul = RotMatrixElements2ExtEulerYXZ<T>(m12, m21, m22, m23, m31, m32, m33, vct);

    return eul;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Vector<T> jbxl::RotMatrix2ExtEulerYZX	(	Matrix< T >	mtx,
		Vector< T > *	vct = NULL
	)			[inline]

Definition at line 1211 of file Rotation.h.

References Matrix< T >::element().

Referenced by Quaternion2ExtEulerYZX().

{
    T m11 = mtx.element(1, 1);
    T m12 = mtx.element(1, 2);
    T m13 = mtx.element(1, 3);
    T m21 = mtx.element(2, 1);
    T m22 = mtx.element(2, 2);
    T m31 = mtx.element(3, 1);
    T m32 = mtx.element(3, 2);

    Vector<T> eul = RotMatrixElements2ExtEulerYZX<T>(m11, m12, m13, m21, m22, m31, m32, vct);

    return eul;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Vector<T> jbxl::RotMatrix2ExtEulerZXY	(	Matrix< T >	mtx,
		Vector< T > *	vct = NULL
	)			[inline]

Definition at line 1243 of file Rotation.h.

References Matrix< T >::element().

Referenced by Quaternion2ExtEulerZXY().

{
    T m12 = mtx.element(1, 2);
    T m13 = mtx.element(1, 3);
    T m21 = mtx.element(2, 1);
    T m22 = mtx.element(2, 2);
    T m23 = mtx.element(2, 3);
    T m32 = mtx.element(3, 2);
    T m33 = mtx.element(3, 3);

    Vector<T> eul = RotMatrixElements2ExtEulerZXY<T>(m12, m13, m21, m22, m23, m32, m33, vct);

    return eul;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Vector<T> jbxl::RotMatrix2ExtEulerZYX	(	Matrix< T >	mtx,
		Vector< T > *	vct
	)			[inline]

Definition at line 1179 of file Rotation.h.

References Matrix< T >::element().

Referenced by Quaternion2ExtEulerZYX().

{
    T m11 = mtx.element(1, 1);
    T m12 = mtx.element(1, 2);
    T m13 = mtx.element(1, 3);
    T m21 = mtx.element(2, 1);
    T m23 = mtx.element(2, 3);
    T m31 = mtx.element(3, 1);
    T m33 = mtx.element(3, 3);

    Vector<T> eul = RotMatrixElements2ExtEulerZYX<T>(m11, m12, m13, m21, m23, m31, m33, vct);

    return eul;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Quaternion<T> jbxl::RotMatrix2Quaternion

(

Matrix< T >

mtx

)

[inline]

Definition at line 1331 of file Rotation.h.

References RotMatrix2ExtEulerXYZ(), and Quaternion< T >::setExtEulerXYZ().

{
    Quaternion<T> qut;
    Vector<T> xyz = RotMatrix2ExtEulerXYZ(mtx);
    qut.setExtEulerXYZ(xyz);

    return qut;
}

Here is the call graph for this function:

Vector<T> jbxl::RotMatrixElements2ExtEulerXYZ	(	T	m11,
		T	m12,
		T	m13,
		T	m21,
		T	m31,
		T	m32,
		T	m33,
		Vector< T > *	vct = NULL
	)			[inline]

Definition at line 817 of file Rotation.h.

References PI, PI_DIV2, Vector< T >::set(), Vector< T >::x, Xabs, Vector< T >::y, Vector< T >::z, and Zero_Eps.

{
    Vector<T> eul((T)0.0, (T)0.0, (T)0.0, (T)0.0, -(T)1.0);
    Vector<T> ev[2];
    T arctang;

    if (m31<-(T)1.0 || m31>(T)1.0) return eul;

    if ((T)1.0-m31<(T)Zero_Eps || (T)1.0+m31<(T)Zero_Eps) {
        if ((T)1.0-m31<Zero_Eps) {              // m31==1.0
            ev[0].y = ev[1].y = -(T)PI_DIV2;
            ev[0].z = (T)0.0;
            ev[1].z = (T)PI_DIV2;
            arctang = (T)atan2(-m12, -m13);
            ev[0].x = arctang - ev[0].z;
            ev[1].x = arctang - ev[1].z;
        }
        else {                                  // m31==-1.0
            ev[0].y = ev[1].y = (T)PI_DIV2;
            ev[0].z = (T)0.0;
            ev[1].z = (T)PI_DIV2;
            arctang = (T)atan2(m12, m13);
            ev[0].x = arctang + ev[0].z;
            ev[1].x = arctang + ev[1].z;
        }
    }

    else {
        ev[0].y = -(T)asin(m31); 
        if (ev[0].y>=(T)0.0) ev[1].y =   (T)PI - ev[0].y;    // 別解
        else                   ev[1].y = - (T)PI - ev[0].y;

        T cy1 = (T)cos(ev[0].y);
        T cy2 = (T)cos(ev[1].y);
        if (Xabs(cy1)<(T)Zero_Eps || Xabs(cy2)<(T)Zero_Eps) return eul;

        ev[0].x = (T)atan2(m32/cy1, m33/cy1);
        ev[0].z = (T)atan2(m21/cy1, m11/cy1);

        if (ev[0].x>=(T)0.0) ev[1].x = ev[0].x - (T)PI;
        else                 ev[1].x = ev[0].x + (T)PI;
        if (ev[0].z>=(T)0.0) ev[1].z = ev[0].z - (T)PI;
        else                 ev[1].z = ev[0].z + (T)PI;
    }

    //
    // XYZ
    if (vct!=NULL) {
        vct[0].set(ev[0].x, ev[0].y, ev[0].z);
        vct[1].set(ev[1].x, ev[1].y, ev[1].z);
    }
    eul.set(ev[0].x, ev[0].y, ev[0].z);

    return eul;
}

Here is the call graph for this function:

Vector<T> jbxl::RotMatrixElements2ExtEulerXZY	(	T	m11,
		T	m12,
		T	m13,
		T	m21,
		T	m22,
		T	m23,
		T	m31,
		Vector< T > *	vct = NULL
	)			[inline]

Definition at line 931 of file Rotation.h.

References PI, PI_DIV2, Vector< T >::set(), Vector< T >::x, Xabs, Vector< T >::y, Vector< T >::z, and Zero_Eps.

{
    Vector<T> eul((T)0.0, (T)0.0, (T)0.0, (T)0.0, -(T)1.0);
    Vector<T> ev[2];
    T arctang;

    if (m21<-(T)1.0 || m21>(T)1.0) return eul;

    if ((T)1.0-m21<(T)Zero_Eps || (T)1.0+m21<(T)Zero_Eps) {    
        if ((T)1.0-m21<(T)Zero_Eps) {           // m21==1.0
            ev[0].z = ev[1].z = (T)PI_DIV2;
            ev[0].y = (T)0.0;
            ev[1].y = (T)PI_DIV2;
            arctang = (T)atan2(m13, -m12);
            ev[0].x = arctang - ev[0].y;
            ev[1].x = arctang - ev[1].y;
        }
        else {                                  // m21==-1.0
            ev[0].z = ev[1].y = -(T)PI_DIV2;
            ev[0].y = (T)0.0;
            ev[1].y = (T)PI_DIV2;
            arctang = (T)atan2(-m13, m12);
            ev[0].x = arctang + ev[0].y;
            ev[1].x = arctang + ev[1].y;
        }
    }

    else {
        ev[0].z = (T)asin(m21); 
        if (ev[0].z>=(T)0.0) ev[1].z =  (T)PI - ev[0].z;
        else                 ev[1].z = -(T)PI - ev[0].z;

        T cz1 = (T)cos(ev[0].z);
        T cz2 = (T)cos(ev[1].z);
        if (Xabs(cz1)<(T)Zero_Eps || Xabs(cz2)<(T)Zero_Eps) return eul;

        ev[0].x = (T)atan2(-m23/cz1, m22/cz1);
        ev[0].y = (T)atan2(-m31/cz1, m11/cz1);

        if (ev[0].x>=(T)0.0) ev[1].x = ev[0].x - (T)PI;
        else                 ev[1].x = ev[0].x + (T)PI;
        if (ev[0].y>=(T)0.0) ev[1].y = ev[0].y - (T)PI;
        else                 ev[1].y = ev[0].y + (T)PI;
    }

    //
    // XZY
    if (vct!=NULL) {
        vct[0].set(ev[0].x, ev[0].z, ev[0].y);
        vct[1].set(ev[1].x, ev[1].z, ev[1].y);
    }
    eul.set(ev[0].x, ev[0].z, ev[0].y);

    return eul;
}

Here is the call graph for this function:

Vector<T> jbxl::RotMatrixElements2ExtEulerYXZ	(	T	m12,
		T	m21,
		T	m22,
		T	m23,
		T	m31,
		T	m32,
		T	m33,
		Vector< T > *	vct = NULL
	)			[inline]

Definition at line 1045 of file Rotation.h.

References PI, PI_DIV2, Vector< T >::set(), Vector< T >::x, Xabs, Vector< T >::y, Vector< T >::z, and Zero_Eps.

{
    Vector<T> eul((T)0.0, (T)0.0, (T)0.0, (T)0.0, -(T)1.0);
    Vector<T> ev[2];
    T arctang;

    if (m32<-(T)1.0 || m32>(T)1.0) return eul;

    if ((T)1.0-m32<(T)Zero_Eps || (T)1.0+m32<(T)Zero_Eps) {    
        if ((T)1.0-m32<(T)Zero_Eps) {           // m32==1.0
            ev[0].x = ev[1].x = (T)PI_DIV2;
            ev[0].z = (T)0.0;
            ev[1].z = (T)PI_DIV2;
            arctang = (T)atan2(m21, -m23);
            ev[0].y = arctang - ev[0].z;
            ev[1].y = arctang - ev[1].z;
        }
        else {                                  // m32==-1.0
            ev[0].x = ev[1].x = -(T)PI_DIV2;
            ev[0].z = (T)0.0;
            ev[1].z = (T)PI_DIV2;
            arctang = (T)atan2(-m21, m23);
            ev[0].y = arctang + ev[0].z;
            ev[1].y = arctang + ev[1].z;
        }
    }

    else {
        ev[0].x = (T)asin(m32); 
        if (ev[0].x>=0.0) ev[1].x =  (T)PI - ev[0].x;
        else              ev[1].x = -(T)PI - ev[0].x;

        T cx1 = (T)cos(ev[0].x);
        T cx2 = (T)cos(ev[1].x);
        if (Xabs(cx1)<(T)Zero_Eps || Xabs(cx2)<(T)Zero_Eps) return eul;

        ev[0].y = (T)atan2(-m31/cx1, m33/cx1);
        ev[0].z = (T)atan2(-m12/cx1, m22/cx1);

        if (ev[0].y>=(T)0.0) ev[1].y = ev[0].y - (T)PI;
        else                 ev[1].y = ev[0].y + (T)PI;
        if (ev[0].z>=(T)0.0) ev[1].z = ev[0].z - (T)PI;
        else                 ev[1].z = ev[0].z + (T)PI;
    }

    //
    // YXZ
    if (vct!=NULL) {
        vct[0].set(ev[0].y, ev[0].x, ev[0].z);
        vct[1].set(ev[1].y, ev[1].x, ev[1].z);
    }
    eul.set(ev[0].y, ev[0].x, ev[0].z);

    return eul;
}

Here is the call graph for this function:

Vector<T> jbxl::RotMatrixElements2ExtEulerYZX	(	T	m11,
		T	m12,
		T	m13,
		T	m21,
		T	m22,
		T	m31,
		T	m32,
		Vector< T > *	vct = NULL
	)			[inline]

Definition at line 988 of file Rotation.h.

References PI, PI_DIV2, Vector< T >::set(), Vector< T >::x, Xabs, Vector< T >::y, Vector< T >::z, and Zero_Eps.

{
    Vector<T> eul((T)0.0, (T)0.0, (T)0.0, (T)0.0, -(T)1.0);
    Vector<T> ev[2];
    T arctang;

    if (m12<-(T)1.0 || m12>(T)1.0) return eul;

    if ((T)1.0-m12<(T)Zero_Eps || (T)1.0+m12<(T)Zero_Eps) {    
        if (1.0-m12<Zero_Eps) {                 // m12==1.0
            ev[0].z = ev[1].z = -(T)PI_DIV2;
            ev[0].y = (T)0.0;
            ev[1].y = (T)PI_DIV2;
            arctang = (T)atan2(-m31, -m21);
            ev[0].x = arctang - ev[0].y;
            ev[1].x = arctang - ev[1].y;
        }
        else {                                  // m12==-1.0
            ev[0].z = ev[1].y = (T)PI_DIV2;
            ev[0].y = (T)0.0;
            ev[1].y = (T)PI_DIV2;
            arctang = (T)atan2(m31, m21);
            ev[0].x = arctang + ev[0].y;
            ev[1].x = arctang + ev[1].y;
        }
    }

    else {
        ev[0].z = -(T)asin(m12); 
        if (ev[0].z>=0.0) ev[1].z =  (T)PI - ev[0].z;
        else              ev[1].z = -(T)PI - ev[0].z;

        T cz1 = (T)cos(ev[0].z);
        T cz2 = (T)cos(ev[1].z);
        if (Xabs(cz1)<(T)Zero_Eps || Xabs(cz2)<(T)Zero_Eps) return eul;

        ev[0].x = (T)atan2(m32/cz1, m22/cz1);
        ev[0].y = (T)atan2(m13/cz1, m11/cz1);

        if (ev[0].x>=(T)0.0) ev[1].x = ev[0].x - (T)PI;
        else                 ev[1].x = ev[0].x + (T)PI;
        if (ev[0].y>=(T)0.0) ev[1].y = ev[0].y - (T)PI;
        else                 ev[1].y = ev[0].y + (T)PI;
    }

    //
    // YZX
    if (vct!=NULL) {
        vct[0].set(ev[0].y, ev[0].z, ev[0].x);
        vct[1].set(ev[1].y, ev[1].z, ev[1].x);
    }
    eul.set(ev[0].y, ev[0].z, ev[0].x);

    return eul;
}

Here is the call graph for this function:

Vector<T> jbxl::RotMatrixElements2ExtEulerZXY	(	T	m12,
		T	m13,
		T	m21,
		T	m22,
		T	m23,
		T	m32,
		T	m33,
		Vector< T > *	vct = NULL
	)			[inline]

Definition at line 1102 of file Rotation.h.

References PI, PI_DIV2, Vector< T >::set(), Vector< T >::x, Xabs, Vector< T >::y, Vector< T >::z, and Zero_Eps.

{
    Vector<T> eul((T)0.0, (T)0.0, (T)0.0, (T)0.0, -(T)1.0);
    Vector<T> ev[2];
    T arctang;

    if (m23<-(T)1.0 || m23>(T)1.0) return eul;

    if ((T)1.0-m23<(T)Zero_Eps || (T)1.0+m23<(T)Zero_Eps) {    
        if ((T)1.0-m23<(T)Zero_Eps) {           // m23==1.0
            ev[0].x = ev[1].x = -(T)PI_DIV2;
            ev[0].z = (T)0.0;
            ev[1].z = (T)PI_DIV2;
            arctang = (T)atan2(-m12, -m32);
            ev[0].y = arctang - ev[0].z;
            ev[1].y = arctang - ev[1].z;
        }
        else {                                  // m23==-1.0
            ev[0].x = ev[1].x = (T)PI_DIV2;
            ev[0].z = (T)0.0;
            ev[1].z = (T)PI_DIV2;
            arctang = (T)atan2(m12, m32);
            ev[0].y = arctang + ev[0].z;
            ev[1].y = arctang + ev[1].z;
        }
    }

    else {
        ev[0].x = -(T)asin(m23); 
        if (ev[0].x>=(T)0.0) ev[1].x =  (T)PI - ev[0].x;
        else                 ev[1].x = -(T)PI - ev[0].x;

        T cx1 = (T)cos(ev[0].x);
        T cx2 = (T)cos(ev[1].x);
        if (Xabs(cx1)<(T)Zero_Eps || Xabs(cx2)<(T)Zero_Eps) return eul;

        ev[0].y = (T)atan2(m13/cx1, m33/cx1);
        ev[0].z = (T)atan2(m21/cx1, m22/cx1);

        if (ev[0].y>=(T)0.0) ev[1].y = ev[0].y - (T)PI;
        else                 ev[1].y = ev[0].y + (T)PI;
        if (ev[0].z>=(T)0.0) ev[1].z = ev[0].z - (T)PI;
        else                 ev[1].z = ev[0].z + (T)PI;
    }

    //
    // ZXY
    if (vct!=NULL) {
        vct[0].set(ev[0].z, ev[0].x, ev[0].y);
        vct[1].set(ev[1].z, ev[1].x, ev[1].y);
    }
    eul.set(ev[0].z, ev[0].x, ev[0].y);

    return eul;
}

Here is the call graph for this function:

Vector<T> jbxl::RotMatrixElements2ExtEulerZYX	(	T	m11,
		T	m12,
		T	m13,
		T	m21,
		T	m23,
		T	m31,
		T	m33,
		Vector< T > *	vct = NULL
	)			[inline]

Definition at line 874 of file Rotation.h.

References PI, PI_DIV2, Vector< T >::set(), Vector< T >::x, Xabs, Vector< T >::y, Vector< T >::z, and Zero_Eps.

{
    Vector<T> eul((T)0.0, (T)0.0, (T)0.0, (T)0.0, -(T)1.0);
    Vector<T> ev[2];
    T arctang;

    if (m13<-(T)1.0 || m13>(T)1.0) return eul;

    if ((T)1.0-m13<(T)Zero_Eps || (T)1.0+m13<(T)Zero_Eps) {    
        if ((T)1.0-m13<(T)Zero_Eps) {           // m13==1.0
            ev[0].y = ev[1].y = (T)PI_DIV2;
            ev[0].z = (T)0.0;
            ev[1].z = (T)PI_DIV2;
            arctang = (T)atan2(m21, -m31);
            ev[0].x = (T)arctang - ev[0].z;
            ev[1].x = (T)arctang - ev[1].z;
        }
        else {                                  // m13==-1.0
            ev[0].y = ev[1].y = -(T)PI_DIV2;
            ev[0].z = (T)0.0;
            ev[1].z = (T)PI_DIV2;
            arctang = (T)atan2(-m21, m31);
            ev[0].x = (T)arctang + ev[0].z;
            ev[1].x = (T)arctang + ev[1].z;
        }
    }

    else {
        ev[0].y = (T)asin(m13); 
        if (ev[0].y>=0.0) ev[1].y =  (T)PI - ev[0].y;
        else              ev[1].y = -(T)PI - ev[0].y;

        T cy1 = (T)cos(ev[0].y);
        T cy2 = (T)cos(ev[1].y);
        if (Xabs(cy1)<Zero_Eps || Xabs(cy2)<Zero_Eps) return eul;

        ev[0].x = atan2(-m23/cy1, m33/cy1);
        ev[0].z = atan2(-m12/cy1, m11/cy1);

        if (ev[0].x>=(T)0.0) ev[1].x = ev[0].x - (T)PI;
        else                 ev[1].x = ev[0].x + (T)PI;
        if (ev[0].z>=(T)0.0) ev[1].z = ev[0].z - (T)PI;
        else                 ev[1].z = ev[0].z + (T)PI;
    }

    //
    // ZYX
    if (vct!=NULL) {
        vct[0].set(ev[0].z, ev[0].y, ev[0].x);
        vct[1].set(ev[1].z, ev[1].y, ev[1].x);
    }
    eul.set(ev[0].z, ev[0].y, ev[0].x);

    return eul;
}

Here is the call graph for this function:

bool jbxl::same_vector	(	Vector< T >	v1,
		Vector< T >	v2
	)			[inline]

v1, v2 が同じ点かチェックする．信頼度は考慮しない．

Definition at line 229 of file Vector.h.

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

{
    T dx = v1.x - v2.x;
    T dy = v1.y - v2.y;
    T dz = v1.z - v2.z;
    T d2 = dx*dx + dy*dy + dz*dz;
    double t2 = Vector_Tolerance*Vector_Tolerance;

    if ((double)d2>t2) return false;
    return true;
}

DllExport bool SamePlaneContour	(	BREP_CONTOUR *	contour1,
		BREP_CONTOUR *	contour2,
		int &	lineno
	)

Definition at line 1191 of file TriBrep.cpp.

References BREP_CONTOUR::directRS, Max, BREP_WING::next, TVectorMultiTolerance(), BREP_WING::vertex, Vertex2TVector(), BREP_CONTOUR::wing, Xabs, and Zero_Eps.

Referenced by IsCollisionContours().

{
    double  um, umt, tm, tmt;
    BREP_WING* wing = contour1->wing;
    TVector<double>  directB, directQ;

    lineno = 0;
    for (int i=0; i<3; i++) {
        directB = Vertex2TVector(wing->next->vertex)     - Vertex2TVector(wing->vertex);
        directQ = Vertex2TVector(contour2->wing->vertex) - Vertex2TVector(wing->vertex);
        um  = contour2->directRS*directB;
        tm  = contour2->directRS*directQ;
        umt = TVectorMultiTolerance(contour2->directRS, directB);
        tmt = TVectorMultiTolerance(contour2->directRS, directQ);
        if (Xabs(um)<Max(umt, Zero_Eps) && Xabs(tm)<Max(tmt, Zero_Eps)) {
            lineno++;
        }
    }

    if (lineno>=2) return true;
    return  false;
}

Here is the call graph for this function:

Here is the caller graph for this function:

MSGraph<T> jbxl::scalingMSGraph2D	(	MSGraph< T >	vp,
		double	scale
	)			[inline]

Definition at line 958 of file Gdata.h.

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.

{
    MSGraph<T> xp;

    if (scale==0.0) return xp;

    int xs = (int)(vp.xs*scale);
    int ys = (int)(vp.ys*scale);
    int zs = vp.zs;
    int ps = xs*ys;
    if (vp.xs*scale-xs>0.0) xs++;
    if (vp.ys*scale-ys>0.0) ys++;

    xp.set(xs, ys, zs);
    xp.getm();
    xp.color = vp.color;

    for (int kk=0; kk<zs; kk++) {
        int posk = kk*ps;
        //
        for (int jj=0; jj<ys; jj++) {
            int posj = jj*xs + posk;
            double y = jj/scale;
            int j = (int)y;
            int n = j + 1;
            if (j>vp.ys-1) j = vp.ys-1;
            if (n>vp.ys-1) n = vp.ys-1;
            double bt = y - j;
            //
            for (int ii=0; ii<xs; ii++) {
                double x = ii/scale;
                int i = (int)x;
                int m = i + 1;
                if (j>vp.xs-1) j = vp.xs-1;
                if (n>vp.xs-1) n = vp.xs-1;
                double al = x - i;
                
                T a = vp.point(i, j, kk);
                T b = vp.point(m, j, kk);
                T c = vp.point(i, n, kk);
                T d = vp.point(m, n, kk);
                T p = (T)(a*(1.0-al)*(1.0-bt) + b*al*(1.0-bt) + c*(1.0-al)*bt + d*al*bt);

                xp.gp[ii+posj] = p;
            }
        }
    }
        
    return xp;
}

Here is the call graph for this function:

void jbxl::set_around_MSGraph	(	MSGraph< T >	vp,
		int	cc = 0,
		int	size = 1
	)			[inline]

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 2069 of file Graph.h.

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

Referenced by Density_Mask().

{
    int   i, j, px1, px2;
/*
    for (i=0; i<vp.xs; i++){
        px1 = i;
        px2 = (vp.ys-1)*vp.xs + i;
        vp.gp[px1] = (T)cc;
        vp.gp[px2] = (T)cc;
    }

    for (j=1; j<vp.ys-1; j++){
        px1 = j*vp.xs;
        px2 = (j+1)*vp.xs - 1;
        vp.gp[px1] = (T)cc;
        vp.gp[px2] = (T)cc;
    }
*/
    for(j=0; j<vp.ys; j++) {
        px1 = j*vp.xs; 
        px2 = (j+1)*vp.xs-size;
        for(i=0; i<size; i++) {
            vp.gp[i+px1] = (T)cc; 
            vp.gp[i+px2] = (T)cc;
        }
    }

    for(j=0; j<size; j++) { 
        px1 = j*vp.xs;
        px2 = (j+vp.ys-size)*vp.xs;
        for(i=0; i<vp.xs; i++) vp.gp[i+px1] = (T)cc;
        for(i=0; i<vp.xs; i++) vp.gp[i+px2] = (T)cc;
    }

}

Here is the caller graph for this function:

void jbxl::SetAbsVectorTolerance

(

double

tol

)

[inline]

Definition at line 56 of file Tolerance.h.

References Abs_Vector_Tolerance.

{ Abs_Vector_Tolerance = tol; }

void jbxl::SetAbsVertexTolerance

(

double

tol

)

[inline]

Definition at line 57 of file Tolerance.h.

References Abs_Vertex_Tolerance.

{ Abs_Vertex_Tolerance = tol; }

void jbxl::SetCollisionTolerance

(

double

tol

)

[inline]

Definition at line 54 of file Tolerance.h.

References Collision_Tolerance.

{ Collision_Tolerance = tol; }

DllExport void SetDeletableContoursByEdge

(

BREP_EDGE *

edge

)

void jbxl::SetDeletableContoursByEdge(BREP_EDGE* edge)

Edgeに関連付けられた Contourに削除可能のマークをつける．削除は行わない．

Definition at line 834 of file TriBrep.cpp.

References BREP_WING::contour, BREP_FACET::deletable, BREP_EDGE::edge_list, BREP_CONTOUR::facet, BREP_EDGE::wing1, and BREP_EDGE::wing2.

Referenced by IsForbiddenEdge().

{
    if (edge->edge_list!=NULL) {
        BREP_EDGE_LIST::iterator iedge;
        for (iedge=edge->edge_list->begin(); iedge!=edge->edge_list->end(); iedge++){
            if ((*iedge)->wing1->contour!=NULL) {
                (*iedge)->wing1->contour->facet->deletable = true;
            }
            if ((*iedge)->wing2->contour!=NULL) {
                (*iedge)->wing2->contour->facet->deletable = true;
            }
        }
    }
    else {
        if (edge->wing1->contour!=NULL) {
            edge->wing1->contour->facet->deletable = true;
        }
        if (edge->wing2->contour!=NULL) {
            edge->wing2->contour->facet->deletable = true;
        }
    }
}

Here is the caller graph for this function:

void jbxl::SetEdgeTolerance

(

double

tol

)

[inline]

Definition at line 52 of file Tolerance.h.

References Edge_Tolerance.

{ Edge_Tolerance = tol; }

void jbxl::SetFacetTolerance

(

double

tol

)

[inline]

Definition at line 53 of file Tolerance.h.

References Facet_Tolerance.

{ Facet_Tolerance = tol; }

void jbxl::SetGlobalCounter

(

CVCounter *

counter

)

[inline]

Definition at line 192 of file ClassBox.h.

References GLCounter.

Referenced by zzSobel().

{ GLCounter = counter;}

Here is the caller graph for this function:

void jbxl::SetGlobalDisplay

(

CVDisplay *

disp

)

[inline]

Definition at line 74 of file ClassBox.h.

References GLDisplay.

{ GLDisplay = disp;}

void jbxl::SetGlobalFrame

(

CVFrame *

frm

)

[inline]

Definition at line 45 of file ClassBox.h.

References GLFrame.

{ GLFrame = frm;}

void jbxl::SetGlobalTextDocument

(

CVTextDocument *

doc

)

[inline]

Definition at line 119 of file ClassBox.h.

References GLTextDocument.

{ GLTextDocument = doc;}

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 457 of file TriBrep.cpp.

References BREP_VERTEX::distance2.

Referenced by FillShortageWings_Near().

{
    BREP_VERTEX_LIST::iterator ivert;
    for (ivert=list->begin(); ivert!=list->end(); ivert++){
        if (vrtx==(*ivert)) return; // 既に登録済み
        if (vrtx->distance2 < (*ivert)->distance2) {
            list->insert(ivert, vrtx);
            return;
        }
    }
    if (ivert==list->end()) list->push_back(vrtx);
    return;
}

Here is the caller graph for this function:

void jbxl::SetSINTolerance

(

double

tol

)

[inline]

Definition at line 55 of file Tolerance.h.

References Sin_Tolerance.

{ Sin_Tolerance = tol; }

void jbxl::SetVectorTolerance

(

double

tol

)

[inline]

Definition at line 50 of file Tolerance.h.

References Vector_Tolerance.

{ Vector_Tolerance = tol; }

void jbxl::SetVertexTolerance

(

double

tol

)

[inline]

Definition at line 51 of file Tolerance.h.

References Vertex_Tolerance.

{ Vertex_Tolerance = tol; }

void jbxl::SetZeroEPS

(

double

eps

)

[inline]

Definition at line 49 of file Tolerance.h.

References Zero_Eps.

{ Zero_Eps = eps; }

Quaternion<T> jbxl::SlerpQuaternion	(	Quaternion< T >	qa,
		Quaternion< T >	qb,
		T	t
	)			[inline]

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 1542 of file Rotation.h.

References Quaternion< T >::getMathAngle(), Quaternion< T >::getVector(), Quaternion< T >::n, Vector< T >::normalize(), Quaternion< T >::normalize(), PI, PI2, Quaternion< T >::s, Quaternion< T >::setRotation(), Sin_Tolerance, Quaternion< T >::x, Xabs, Quaternion< T >::y, and Quaternion< T >::z.

{
    if (qa.n!=(T)1.0) qa.normalize();
    if (qb.n!=(T)1.0) qb.normalize();
    
    //
    T             dot;
    Quaternion<T> qc;

    //
    Vector<T> va = qa.getVector();
    Vector<T> vb = qb.getVector();
    va.normalize();
    vb.normalize();

    //
    dot = va*vb;
    if (dot>(T)1.0)       dot =  1.0;
    else if (dot<-(T)1.0) dot = -1.0;

    // 回転軸が変わらない場合
    if (dot>(T)1.0-Sin_Tolerance) {
        T anga = qa.getMathAngle();
        T angb = qb.getMathAngle();
        T angd = angb - anga;
        if (angd<-(T)PI)     angd += (T)PI2; 
        else if (angd>(T)PI) angd -= (T)PI2;

        T angc = anga + t*angd;
        qc.setRotation(angc, va);
        qc.normalize();
        return qc;
    }

    // 回転軸が反転する場合
//    else if (dot<-(T)1.0+(T)Sin_Tolerance) {
    else if (dot<-(T)0.99) {
        T anga = qa.getMathAngle();
        T angb = - qb.getMathAngle();
        T angd = angb - anga;
        if (angd<-(T)PI)     angd += (T)PI2; 
        else if (angd>(T)PI) angd -= (T)PI2;

        T angc = anga + t*angd;
        qc.setRotation(angc, va);
        qc.normalize();
        return qc;
    }

    // SLERP
    dot = qa.x*qb.x + qa.y*qb.y + qa.z*qb.z + qa.s*qb.s;
    if (dot>(T)1.0) dot = (T)1.0;
    else if (dot<(T)0.0) {
        if (t<=(T)0.5) return qa;
        else           return qb;
    }
    //if (dot<0.0) DEBUG_WARN("SlerpQuaternion: dot = %f", dot);

    //
    T th = (T)acos(dot);
    T sn = (T)sin(th);
    if (Xabs(sn)<(T)Sin_Tolerance) return qa;

    //
    qc = qa*((T)sin(((T)1.0-t)*th)/sn) + qb*((T)sin(t*th)/sn);
    qc.normalize();

    return qc;
}

Here is the call graph for this function:

MSGraph<T> jbxl::TGAImage2MSGraph

(

TGAImage

tga

)

[inline]

template <typename t>=""> MSGraph<T> TGAImage2MSGraph(TGAImage tga)

Tgaイメージデータを MSGraph型イメージデータに変換する

Parameters:

tga

Tgaイメージデータ

Returns:

MSGraphイメージデータ

Return values:

	JBXL_GRAPH_NODATA_ERROR	state データ無し
	JBXL_GRAPH_MEMORY_ERROR	state メモリ確保エラー

Definition at line 76 of file TgaTool.h.

References TGAImage::col, MSGraph< T >::color, MSGraph< T >::gp, GRAPH_COLOR_BGR, GRAPH_COLOR_BGRA, GRAPH_COLOR_MA, GRAPH_COLOR_MONO, 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.

{
    MSGraph<T> vp;

    if (tga.isNull()) {
        vp.state = JBXL_GRAPH_NODATA_ERROR;
        return vp;
    }

    vp.set(tga.xs, tga.ys, tga.col);
    if (vp.isNull()) return vp;
    //
    if      (tga.col==4) vp.color = GRAPH_COLOR_BGRA;
    else if (tga.col==3) vp.color = GRAPH_COLOR_BGR;
    else if (tga.col==2) vp.color = GRAPH_COLOR_MA;
    else if (tga.col==1) vp.color = GRAPH_COLOR_MONO;
    else {
        vp.state = JBXL_GRAPH_IVDARG_ERROR;
        return vp;
    }

    for (int k=0; k<tga.col; k++) {
        int zp = k*tga.xs*tga.ys;
        for (int j=0; j<tga.ys; j++) {
            int yp = zp + j*tga.xs;
            for (int i=0; i<tga.xs; i++) {
                vp.gp[yp + i] = (T)tga.point(i, j, k);
            }
        }
    }

    return vp;
}

Here is the call graph for this function:

void jbxl::ToPola	(	Vector< T >	nv,
		double &	cst,
		double &	snt,
		double &	csf,
		double &	snf,
		double	pcsf = 0.0,
		double	psnf = 1.0
	)			[inline]

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]	pcsf	sinθ≒0 の場合に csfに代入される．連続計算の場合に直前の cosφの値を指定する．
[in]	psnf	sinθ≒0 の場合に snfに代入される．連続計算の場合に直前の sinφの値を指定する．

Definition at line 692 of file Graph.h.

References Vector< T >::n, Vector< T >::normalize(), Sign, Sin_Tolerance, Vector< T >::x, Vector< T >::y, and Vector< T >::z.

Referenced by Local2World().

{
    if (nv.n!=1.0) nv.normalize();
    if (nv.z<-1.0) nv.z = -1.0;
    if (nv.z> 1.0) nv.z =  1.0;
    cst = nv.z;
    snt = sqrt(1.0-nv.z*nv.z);

    if (snt<Sin_Tolerance) {
        cst = Sign(cst);
        snt = 0.0;
        csf = pcsf;
        snf = psnf;
    }
    else {
        csf = nv.x/snt;
        snf = nv.y/snt;
    }
/*  
    if (*snt<Sin_Tolerance) {
        *cst = Sign(*cst);
        *snt = 0.0;
    }

    double rr = sqrt(nv.x*nv.x + nv.y*nv.y);
    if (rr<=Zero_Eps) {
        *csf = 0.0;
        *snf = 1.0;
    }
    else {
        *csf = nv.x/rr;
        *snf = nv.y/rr;
    }
*/  
    return;
}

Here is the call graph for this function:

Here is the caller graph for this function:

T jbxl::TVectorMultiTolerance	(	TVector< T >	a,
		TVector< T >	b
	)			[inline]

Definition at line 186 of file TVector.h.

References Vector< T >::n, and TVector< T >::t.

Referenced by CollisionTriContour2D(), CollisionTriContour3D(), and SamePlaneContour().

{ return  (T)(a.n*b.t + a.t*b.n); }

Here is the caller graph for this function:

Quaternion<T> jbxl::V2VQuaternion	(	Vector< T >	a,
		Vector< T >	b
	)			[inline]

Definition at line 1444 of file Rotation.h.

References Vector< T >::c, Quaternion< 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.

{
    Quaternion<T> qut((T)1.0, (T)0.0, (T)0.0, (T)0.0, (T)1.0);

    a.normalize();
    b.normalize();
    if (a.n<(T)Zero_Eps || b.n<(T)Zero_Eps) return qut;
    
    Vector<T> nr = a^b;
    nr.normalize();

    T cs2 = (a*b)/(T)2.0;            // θ/2 = 0〜π/2
    
    T sn;
    if (cs2>(T)0.5) sn = (T)0.0;
    else            sn = (T)sqrt(0.5 - cs2);

    if (Xabs(sn-(T)1.0)<(T)Zero_Eps) {
        Vector<T> c = a + b;
        if (c.norm()<(T)1.0) {
            qut.setRotation(PI,  nr);
            if (nr.n<Zero_Eps) {
                qut.s = (T)0.0;
                qut.n = (T)0.0;
                qut.c = -(T)1.0;
            }
        }
        else {
            qut.setRotation((T)0.0, nr);
        }
        return qut;
    }

    T cs;
    if (cs2<-(T)0.5) cs = (T)0.0;
    else             cs = (T)sqrt(0.5 + cs2);

    //
    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);
    else           qut.set(cs, nr.x*sn, nr.y*sn, nr.z*sn, (T)1.0, (T)Min(a.c, b.c));
    
    return qut;
}

Here is the call graph for this function:

double jbxl::VectorAngle	(	Vector< T >	a,
		Vector< T >	b,
		Vector< T >	c
	)			[inline]

Definition at line 269 of file Vector.h.

References VectorAngle().

{
    return VectorAngle(b-a, c-b);
}

Here is the call graph for this function:

double jbxl::VectorAngle	(	Vector< T >	a,
		Vector< T >	b
	)			[inline]

Definition at line 255 of file Vector.h.

References Vector< T >::n, Vector< T >::normalize(), PI, and Zero_Eps.

Referenced by VectorAngle().

{
    a.normalize();
    b.normalize();
    if (a.n<Zero_Eps || b.n<Zero_Eps) return 0.0;

    double cs = a*b;
    if      (cs>=1.0)  return 0.0;
    else if (cs<=-1.0) return PI;
    
    return acos(a*b);
}

Here is the call graph for this function:

Here is the caller graph for this function:

double jbxl::VectorDist	(	const Vector< T >	a,
		const Vector< T >	b
	)			[inline]

Definition at line 205 of file Vector.h.

{
    //return (b-a).n;
    return (b-a).norm();
}

T* jbxl::VectorInvRotation	(	T *	v,
		Quaternion< T >	q
	)			[inline]

Definition at line 1419 of file Rotation.h.

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

{
    T x, y, z;

    x = (q.s*q.s + q.x*q.x - q.y*q.y -q.z*q.z)*v[0] +
        ((T)2.0*q.x*q.y + (T)2.0*q.s*q.z)*v[1] +
        ((T)2.0*q.x*q.z - (T)2.0*q.s*q.y)*v[2];

    y = ((T)2.0*q.x*q.y - (T)2.0*q.s*q.z)*v[0] +
        (q.s*q.s - q.x*q.x + q.y*q.y - q.z*q.z)*v[1] +
        ((T)2.0*q.y*q.z + (T)2.0*q.s*q.x)*v[2];

    z = ((T)2.0*q.x*q.z + (T)2.0*q.s*q.y)*v[0] +
        ((T)2.0*q.y*q.z - (T)2.0*q.s*q.x)*v[1] +
        (q.s*q.s - q.x*q.x - q.y*q.y + q.z*q.z)*v[2];

    v[0] = x;
    v[1] = y;
    v[2] = z;

    return v;
}

Vector<T> jbxl::VectorInvRotation	(	Vector< T >	v,
		Quaternion< T >	q
	)			[inline]

Definition at line 1373 of file Rotation.h.

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

Referenced by AffineTrans< double >::execInvRotate().

{
    Vector<T> vect;

    vect.x = (q.s*q.s + q.x*q.x - q.y*q.y -q.z*q.z)*v.x +
             ((T)2.0*q.x*q.y + (T)2.0*q.s*q.z)*v.y +
             ((T)2.0*q.x*q.z - (T)2.0*q.s*q.y)*v.z;

    vect.y = ((T)2.0*q.x*q.y - (T)2.0*q.s*q.z)*v.x +
             (q.s*q.s - q.x*q.x + q.y*q.y - q.z*q.z)*v.y +
             ((T)2.0*q.y*q.z + (T)2.0*q.s*q.x)*v.z;

    vect.z = ((T)2.0*q.x*q.z + (T)2.0*q.s*q.y)*v.x +
             ((T)2.0*q.y*q.z - (T)2.0*q.s*q.x)*v.y +
             (q.s*q.s - q.x*q.x - q.y*q.y + q.z*q.z)*v.z;

    return vect;
}

Here is the caller graph for this function:

T* jbxl::VectorRotation	(	T *	v,
		Quaternion< T >	q
	)			[inline]

Definition at line 1394 of file Rotation.h.

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

{
    T x, y, z;

    x = (q.s*q.s + q.x*q.x - q.y*q.y -q.z*q.z)*v[0] +
        ((T)2.0*q.x*q.y - (T)2.0*q.s*q.z)*v[1] +
        ((T)2.0*q.x*q.z + (T)2.0*q.s*q.y)*v[2];

    y = ((T)2.0*q.x*q.y + (T)2.0*q.s*q.z)*v[0] +
        (q.s*q.s - q.x*q.x + q.y*q.y - q.z*q.z)*v[1] +
        ((T)2.0*q.y*q.z - (T)2.0*q.s*q.x)*v[2];

    z = ((T)2.0*q.x*q.z - (T)2.0*q.s*q.y)*v[0] +
        ((T)2.0*q.y*q.z + (T)2.0*q.s*q.x)*v[1] +
        (q.s*q.s - q.x*q.x - q.y*q.y + q.z*q.z)*v[2];

    v[0] = x;
    v[1] = y;
    v[2] = z;

    return v;
}

Vector<T> jbxl::VectorRotation	(	Vector< T >	v,
		Quaternion< T >	q
	)			[inline]

ベクトル回転の高速計算

See also:

http://www.euclideanspace.com/maths/algebra/realNormedAlgebra/quaternions/transforms/

Definition at line 1352 of file Rotation.h.

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

Referenced by TriPolyData::execRotate(), FacetBaseData::execRotate(), and AffineTrans< double >::execRotate().

{
    Vector<T> vect;

    vect.x = (q.s*q.s + q.x*q.x - q.y*q.y -q.z*q.z)*v.x +
             ((T)2.0*q.x*q.y - (T)2.0*q.s*q.z)*v.y +
             ((T)2.0*q.x*q.z + (T)2.0*q.s*q.y)*v.z;

    vect.y = ((T)2.0*q.x*q.y + (T)2.0*q.s*q.z)*v.x +
             (q.s*q.s - q.x*q.x + q.y*q.y - q.z*q.z)*v.y +
             ((T)2.0*q.y*q.z - (T)2.0*q.s*q.x)*v.z;

    vect.z = ((T)2.0*q.x*q.z - (T)2.0*q.s*q.y)*v.x +
             ((T)2.0*q.y*q.z + (T)2.0*q.s*q.x)*v.y +
             (q.s*q.s - q.x*q.x - q.y*q.y + q.z*q.z)*v.z;

    return vect;
}

Here is the caller graph for this function:

DllExport TVector< double > Vertex2TVector

(

BREP_VERTEX *

v

)

Definition at line 1088 of file Brep.cpp.

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().

{
    TVector<double>  tv;

    tv.x   = v->point.x;
    tv.y   = v->point.y;
    tv.z   = v->point.z;
    tv.n   = sqrt(tv.x*tv.x + tv.y*tv.y + tv.z*tv.z);
    tv.t   = v->tolerance;
    
    return  tv;
}

Here is the caller graph for this function:

MSGraph<Vector<R> > jbxl::vNabla

(

MSGraph< T >

vp

)

[inline]

template <typename R, typename T> MSGraph<Vector<R> > vNabla(MSGraph<T> vp)

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

Parameters:

vp

計算対象となるグラフィックデータ構造体．

Returns:

ナブラ．ベクトル型グラフィックデータ．

Definition at line 647 of file Gmt.h.

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.

{
    int   i;
    MSGraph<R>  px, py, pz;
    MSGraph<Vector<R> > nv;

    //MSGraph<Vector<R> > nv(vp.xs, vp.ys, vp.zs);
    nv.xs = vp.xs;
    nv.ys = vp.ys;
    nv.zs = vp.zs;
    nv.zero.set(vp.zero, vp.zero, vp.zero);
    nv.base.set(vp.base, vp.base, vp.base);
    nv.RZxy = vp.RZxy;
    nv.rbound = vp.rbound;

    nv.gp = (Vector<R>*)malloc(sizeof(Vector<R>)*nv.xs*nv.ys*nv.zs);
    if (nv.isNull()) {
        DEBUG_MODE PRINT_MESG("vNabla: No More Memory!!\n");
        nv.state = JBXL_GRAPH_MEMORY_ERROR;
        return nv;
    }
    for (i=0; i<vp.xs*vp.ys*vp.zs; i++) {
        nv.gp[i] = nv.base;
    }
         
    px = xSobel<R>(vp);
    if (px.gp==NULL) {
        nv.state = px.state;
        return nv;
    }

    py = ySobel<R>(vp);
    if (py.gp==NULL) {
        px.free();
        nv.state = py.state;
        return nv;
    }

    pz = zSobel<R>(vp);     // 2Dなら 0が入る
    if (pz.gp==NULL) {
        px.free();
        py.free();
        nv.state = pz.state;
        return nv;
    }

    for (i=0; i<vp.xs*vp.ys*vp.zs; i++) {
        (nv.gp[i])->set_Vector(px.gp[i], py.gp[i], pz.gp[i]);
    }

    px.free();
    py.free();
    pz.free();

    return nv;
}

Here is the call graph for this function:

Quaternion<T> jbxl::VPPQuaternion	(	Vector< T >	a,
		Vector< T >	b,
		Vector< T >	c
	)			[inline]

Definition at line 1502 of file Rotation.h.

References Vector< T >::c.

{
    Quaternion<T> qut((T)1.0, (T)0.0, (T)0.0, (T)0.0, (T)1.0);

    if (a.c<(T)0.0 || b.c<(T)0.0 || c.c<(T)0.0) return qut;

    qut = V2VQuaternion<T>(a, c-b);
    return qut;
}

void jbxl::wCircle3D	(	MSGraph< T >	vp,
		Vector< double >	ox,
		Vector< double >	ex,
		double	rr,
		int	cc,
		int	mode
	)			[inline]

Definition at line 182 of file Window.h.

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.

{
    double rate = Max(vp.wRateX, vp.wRateY);
    rate = Max(rate, vp.wRateZ);
    int r = (int)(rr*rate);

    ox.x = (vp.wZeroX - ox.x)*vp.wRateX;
    ox.y = (ox.y - vp.wZeroY)*vp.wRateY;
    ox.z = (vp.wZeroZ - ox.z)*vp.wRateZ;

    ex.x = -ex.x*vp.wRateX;
    ex.y =  ex.y*vp.wRateY;
    ex.z = -ex.z*vp.wRateZ;

    MSGraph_Circle3D(vp, ox, ex, r, cc, mode);
}

Here is the call graph for this function:

void jbxl::wDraw	(	MSGraph< T > *	vp,
		double	x,
		double	y,
		int	cc
	)			[inline]

template <typename t>=""> void wDraw(MSGraph<T>* vp, double x, double y, int cc)

ワールド座標系で現地点から指定した地点へ線を引く．指定した地点が現地点となる．

Parameters:

	vp	操作対象のグラフィックデータ．
	x	線の終点の x座標(ワールド座標系)．
	y	線の終点の y座標(ワールド座標系)．
	cc	線の輝度値．

Definition at line 211 of file Window.h.

References MSGraph< T >::wNowX.

{
    wLine<T>(*vp, vp->wNowX, vp->wNowY, x, y, cc);
    vp->wMove(x, y);
}

void jbxl::wDraw3D	(	MSGraph< T > *	vp,
		double	x,
		double	y,
		double	z,
		int	cc
	)			[inline]

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 230 of file Window.h.

References MSGraph< T >::wNowX.

{
    wLine3D<T>(*vp, vp->wNowX, vp->wNowY, vp->wNowZ, x, y, z, cc);
    vp->wMove(x, y, z);
}

void jbxl::wDraw_rel	(	MSGraph< T > *	vp,
		double	x,
		double	y,
		int	cc
	)			[inline]

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 248 of file Window.h.

References MSGraph< T >::wNowX, and MSGraph< T >::wNowY.

{
    double x2 = vp->wNowX + x;
    double y2 = vp->wNowY + y;

    wLine<T>(*vp, vp->wNowX, vp->wNowY, x2, y2, cc);
    vp->wMove(x2, y2);
}

void jbxl::wDraw_rel3D	(	MSGraph< T > *	vp,
		double	x,
		double	y,
		double	z,
		int	cc
	)			[inline]

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 270 of file Window.h.

References MSGraph< T >::wNowX, MSGraph< T >::wNowY, and MSGraph< T >::wNowZ.

{
    double x2 = vp->wNowX + x;
    double y2 = vp->wNowY + y;
    double z2 = vp->wNowZ + z;

    wLine3D<T>(*vp, vp->wNowX, vp->wNowY, vp->wNowZ, x2, y2, z2, cc);
    vp->wMove(x2, y2, z2);
}

T jbxl::wGetPixel	(	MSGraph< T >	vp,
		double	x,
		double	y
	)			[inline]

template <typename t>=""> T wGetPixel(MSGraph<T> vp, double x, double y)

ワールド座標系の点のデータを得る．

Parameters:

	vp	操作対象のグラフィックデータ．
	x	点の x座標(ワールド座標系)．
	y	点の y座標(ワールド座標系)．

Definition at line 93 of file Window.h.

References MSGraph< T >::point(), MSGraph< T >::wRateX, MSGraph< T >::wRateY, MSGraph< T >::wZeroX, MSGraph< T >::wZeroY, MSGraph< T >::ys, and MSGraph< T >::zero.

{
    int i = (int)((x - vp.wZeroX)*vp.wRateX);
    int j = (int)((vp.wZeroY - y)*vp.wRateY);

    if (i>=0 && i<vp.xs && j>=0 && j<vp.ys) return vp.point(i, j);
    else  return vp.zero;
}

Here is the call graph for this function:

T jbxl::wGetPixel3D	(	MSGraph< T >	vp,
		double	x,
		double	y,
		double	z
	)			[inline]

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 114 of file Window.h.

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.

{
    int i = (int)((vp.wZeroX - x)*vp.wRateX);
    int j = (int)((y - vp.wZeroY)*vp.wRateY);
    int k = (int)((vp.wZeroZ - z)*vp.wRateZ);

    if (i>=0 && i<vp.xs && j>=0 && j<vp.ys && k>=0 && k<vp.zs) return vp.point(i, j, k);
    else  return vp.zero;
}

Here is the call graph for this function:

void jbxl::wLine	(	MSGraph< T >	vp,
		double	x1,
		double	y1,
		double	x2,
		double	y2,
		int	cc
	)			[inline]

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 138 of file Window.h.

References MSGraph< T >::wRateX, MSGraph< T >::wRateY, MSGraph< T >::wZeroX, and MSGraph< T >::wZeroY.

{
    int  i1, j1, i2, j2;

    i1 = (int)((x1 - vp.wZeroX)*vp.wRateX);
    i2 = (int)((x2 - vp.wZeroX)*vp.wRateX);
    j1 = (int)((vp.wZeroY - y1)*vp.wRateY);
    j2 = (int)((vp.wZeroY - y2)*vp.wRateY);

    MSGraph_Line<T>(vp, i1, j1, i2, j2, cc);
}

void jbxl::wLine3D	(	MSGraph< T >	vp,
		double	x1,
		double	y1,
		double	z1,
		double	x2,
		double	y2,
		double	z2,
		int	cc
	)			[inline]

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 166 of file Window.h.

References MSGraph< T >::wRateX, MSGraph< T >::wRateY, MSGraph< T >::wRateZ, MSGraph< T >::wZeroX, MSGraph< T >::wZeroY, and MSGraph< T >::wZeroZ.

{
    int  i1, j1, k1, i2, j2, k2;

    i1 = (int)((vp.wZeroX - x1)*vp.wRateX);
    i2 = (int)((vp.wZeroX - x2)*vp.wRateX);
    j1 = (int)((y1 - vp.wZeroY)*vp.wRateY);
    j2 = (int)((y2 - vp.wZeroY)*vp.wRateY);
    k1 = (int)((vp.wZeroZ - z1)*vp.wRateZ);
    k2 = (int)((vp.wZeroZ - z2)*vp.wRateZ);

    MSGraph_Line3D<T>(vp, i1, j1, k1, i2, j2, k2, cc);
}

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 1519 of file Gio.cpp.

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, CmnHead::depth, 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().

{
    CTHead  chd;
    CmnHead cmd;
    CVCounter* counter = NULL;
    sByte* ptr;
    int i, j, k, l;
    int csize, psize;
    int kind = hd->kind & 0x00ff;

    if (kind==UN_KNOWN_DATA) return JBXL_GRAPH_HEADER_ERROR;

    // SUN RASTER
    if (kind==RAS_DATA) {
        //csize = writeRasData(fp, hd, hd->depth);
        csize = writeRasData(fp, hd, 8);
        return csize;
    }

#ifdef  ENABLE_JPEGLIB
    // JPEG
    if (kind==JPEG_RGB_DATA   || kind==JPEG_MONO_DATA   || kind==JPEG_ARGB_DATA || kind==JPEG_RGBA_DATA ||
        kind==JPEG16_RGB_DATA || kind==JPEG16_ARGB_DATA || kind==JPEG16_RGBA_DATA) {
        JPEGImage jpg = CmnHead2JPEGImage(*hd);
        csize = writeJPEGData(fp, jpg, 100);
        jpg.free();
        return csize;
    }
#endif

    // TIFF
    /*if (kind==TIFF_DATA) {
        csize = 
        return csize;
    }*/

    // CT : ヘッダの準備
    if (hd->zsize<=0) hd->zsize = 1;
    if (hd->depth<=0) hd->depth = 16;

    psize = hd->xsize*hd->ysize*((hd->depth+7)/8); 
    hd->lsize = psize*hd->zsize;
    ptr = (sByte*)malloc(hd->lsize);
    if (ptr==NULL) return JBXL_GRAPH_MEMORY_ERROR;

    // CTHead chd を作る．
    if (kind==CT_DATA || kind==CT_3DM || kind==CT_3D_VOL) {
        PRINT_MESG("writeCmnHeadData: CTデータ\n");
        PRINT_MESG("writeCmnHeadData: ヘッダバッファ bsize = %d\n", hd->bsize);
        PRINT_MESG("writeCmnHeadData: データサイズ   lsize = %d\n", hd->lsize);
        PRINT_MESG("writeCmnHeadData: サイズ         %dx%dx%d %d\n", hd->xsize, hd->ysize, hd->zsize, hd->depth);

        memcpy(&chd, hd->buf, hd->bsize);
        chd.anydata[2] += TempBase;
        hton_st(&chd, 2);

        memcpy(ptr, hd->grptr, hd->lsize);
    }
    else if (kind==MOON_DATA || kind==USERSET_DATA) {   
        chd.xsize   = htons((sWord)hd->xsize);
        chd.ysize   = htons((sWord)hd->ysize);
        chd.ctmin   = 0;
        chd.ctmax   = 0;
        chd.cutup   = 0;
        chd.cutdown = 0;
        chd.cutleft = 0;
        chd.cutright= 0;

        k = l = 0;
        if (hd->depth<16){   
            for (i=0; i<hd->xsize*hd->ysize; i++) {
                for (j=0; j<hd->depth/8; j++) ptr[k++] = 0x00;
                for (j=hd->depth/8; j<2; j++) ptr[k++] = hd->grptr[l++];
            }
        }
        else if (hd->depth==16) {
            for (i=0; i<hd->xsize*hd->ysize; i++) {
                for (j=0; j<2; j++) ptr[k++] = hd->grptr[l++];
            }
        }
        else {
            for (i=0; i<hd->xsize*hd->ysize; i++) {
                for (j=0; j<2; j++) ptr[k++] = hd->grptr[l++];
                l += (hd->depth)/8 - 2;
            }
        }
    }
    else {
        PRINT_MESG("writeCmnHeadData: サポートしていないヘッダタイプ %d\n", hd->kind);
        free(ptr);
        return 0;
    }

    // データ書き込み
    csize = 0;
    // 共通ヘッダ書き込み
    if (kind==CT_DATA || kind==CT_3DM || kind==CT_3D_VOL) {
        // カウンタ
        if (hd->zsize>=10 && cnt) {
            counter = GetUsableGlobalCounter();
            if (counter!=NULL) {
                //counter->SetTitle("Commonファイル書き込み中");
                counter->SetMax((hd->zsize+1)/10);
                counter->SetPos(1);
            }
        }

        cmd = *hd;
        cmd.grptr = NULL;
        hton_st(&cmd, 4);
        csize = sizeof(CmnHead);
        fwrite(&cmd, csize, 1, fp);
    }

    // CTヘッダ書き込み
    fwrite(&chd, sizeof(CTHead), 1, fp);
    csize += sizeof(CTHead);

    // 本体データ書き込み
    hton_ar((sWord*)ptr, hd->lsize);

    if (counter==NULL) {
        fwrite(ptr, hd->lsize, 1, fp);
        csize += hd->lsize;
    }
    else {
        for (i=0; i<hd->zsize; i++) {
            fseek(fp, csize, 0);
            fwrite(ptr+i*psize, psize, 1, fp);
            csize += psize;
            if (i%10==0) {
                counter->StepIt();
                if (counter->isCanceled()) {    // キャンセル
                    free(ptr);
                    return JBXL_GRAPH_CANCEL;
                }
            }
        }
    }

    free(ptr);
    if (counter!=NULL) counter->PutFill();

    return  csize;
}

Here is the call graph for this function:

Here is the caller graph for this function:

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 1431 of file Gio.cpp.

References CmnHead::bsize, CmnHead::depth, file_size(), 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().

{
    CmnHead cmd;
    FILE* fp;
    int  csize, psize;
    int  kind = hd->kind & 0x0ff;

    if (kind==UN_KNOWN_DATA) return JBXL_GRAPH_HEADER_ERROR;
    if (hd==NULL || hd->lsize==0) return JBXL_GRAPH_IVDARG_ERROR;

    if ((fp=fopen(fn,"wb"))==NULL) {
        PRINT_MESG("WRITECMNHEADFILE: エラー：ファイルオープン失敗\n");
        return JBXL_GRAPH_OPFILE_ERROR;
    }
    PRINT_MESG("writeCmnHeadFile: ファイル種別 = %d で書き込み中．%dx%dx%d\n", hd->kind, hd->xsize, hd->ysize, hd->zsize);

    // Write File
    csize = writeCmnHeadData(fp, hd, cnt);
    fclose(fp);
    if (csize<0) return (int)csize;
    
    // SUN RASTER
    if (kind==RAS_DATA) return csize;

    // JPEG
    if (kind==JPEG_RGB_DATA   || kind==JPEG_MONO_DATA) return csize;
    if (kind==JPEG_ARGB_DATA  || kind==JPEG_RGBA_DATA) return csize;
    if (kind==JPEG16_RGB_DATA || kind==JPEG16_ARGB_DATA || kind==JPEG16_RGBA_DATA) return csize;

    // TIFF
    //if (kind==TIFF_DATA) return csize;

    // 書き込みチェック
    int fsz = (int)file_size(fn);
    if (kind==MOON_DATA) psize = hd->bsize+hd->lsize;
    else psize = sizeof(CmnHead)+hd->bsize+hd->lsize;

    if (fsz!=psize) {
        PRINT_MESG("WRITECMNHEADFILE: エラー：書き込みファイルのサイズが合わない %d != %d\n", psize, fsz);
        return JBXL_GRAPH_WRFILE_ERROR;
    }
    if (kind==MOON_DATA) return psize;

    if ((fp=fopen(fn,"rb"))==NULL) {
        PRINT_MESG("WRITECMNHEADFILE: エラー：ファイル検査：再オープン失敗\n");
        return JBXL_GRAPH_RDFILE_ERROR;
    }
 
    fread((sByte*)&cmd, sizeof(CmnHead), 1, fp);
    ntoh_st(&cmd, 4);
    if (cmd.xsize!=hd->xsize || cmd.ysize!=hd->ysize || cmd.zsize!=hd->zsize ||
        cmd.bsize!=hd->bsize || cmd.lsize!=hd->lsize || cmd.depth!=hd->depth || cmd.kind!=hd->kind) {
        PRINT_MESG("WRITECMNHEADFILE: エラー：ファイルヘッダ検査：ヘッダ異常\n");
        fclose(fp);
        return JBXL_GRAPH_HEADER_ERROR;
    }

    fclose(fp);
    return  csize;
}

Here is the call graph for this function:

Here is the caller graph for this function:

int jbxl::writeGraphicFile	(	const char *	fname,
		MSGraph< T >	vp,
		int	kind = 0,
		int	mlt = FALSE,
		int	fnum = 0,
		int	tnum = 0,
		bool	cnt = false
	)			[inline]

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	データ形式 + 属性ビット
	mlt	3Dデータとして保存しない
	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 459 of file Gio.h.

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.

{
    int     ret;
    CmnHead hd;
    CTHead* chd;

    if (fnum<0)            fnum = 0;
    else if (fnum>vp.zs-1) fnum = vp.zs - 1;
    if (tnum<fnum)         tnum = fnum;
    else if (tnum>vp.zs-1) tnum = vp.zs - 1;

    // for JPEG
    if ((kind&0x00ff)==JPEG_RGB_DATA) {
        if      (vp.color==GRAPH_COLOR_ARGB)   kind = (kind&0xff00) + JPEG_ARGB_DATA;
        else if (vp.color==GRAPH_COLOR_RGBA)   kind = (kind&0xff00) + JPEG_RGBA_DATA;

        if      (vp.color==GRAPH_COLOR_RGB16)  kind = (kind&0xff00) + JPEG16_RGB_DATA;
        else if (vp.color==GRAPH_COLOR_ARGB16) kind = (kind&0xff00) + JPEG16_ARGB_DATA;
        else if (vp.color==GRAPH_COLOR_RGBA16) kind = (kind&0xff00) + JPEG16_RGBA_DATA;
    }

    //
    hd.xsize = vp.xs;
    hd.ysize = vp.ys;
    hd.zsize = tnum - fnum + 1; //vp.zs;
    hd.depth = sizeof(T)*8;
    hd.grptr = (uByte*)(vp.gp + vp.xs*vp.ys*fnum);
    if (kind==0) {
        hd.kind  = CT_3DM;
        if (hd.zsize==1) hd.kind = CT_DATA;
    }
    else hd.kind = kind;

    hd.lsize = hd.zsize*hd.ysize*hd.zsize*2;
    hd.bsize = sizeof(CTHead);
    hd.buf   = (uByte*)malloc(hd.bsize);
    if (hd.buf==NULL) return JBXL_GRAPH_OPFILE_ERROR;
    memset(hd.buf, 0, hd.bsize);

    chd           = (CTHead*)hd.buf;
    chd->xsize    = (sWord)vp.xs;
    chd->ysize    = (sWord)vp.ys;
    chd->ctmin    = (sWord)vp.rbound.zmin;
    chd->ctmax    = (sWord)vp.rbound.zmax;
    chd->cutup    = (sWord)vp.rbound.ymin;
    chd->cutdown  = (sWord)vp.rbound.ymax;
    chd->cutleft  = (sWord)vp.rbound.xmin;
    chd->cutright = (sWord)vp.rbound.xmax;
    hd.kind      |= HAS_RBOUND;

    if (vp.RZxy!=1.0) {
        chd->anydata[0] = (sWord)(vp.RZxy*RZXY_RATE);
        chd->anydata[1] = (sWord)RZXY_RATE;
        hd.kind        |= HAS_RZXY;
    }

    if (vp.base!=0) {
        chd->anydata[2] = (sWord)vp.base + TempBase;
        hd.kind        |= HAS_BASE;
    }

    // 通常の保存
    if (!mlt) {
        ret = writeCmnHeadFile(fname, &hd, cnt);
    }

    // マルチスライス
    else {
        // カウンタ
        CVCounter* counter = NULL;
        if (hd.zsize>=10 && cnt) {
            counter = GetUsableGlobalCounter();
            if (counter!=NULL) {
                counter->SetMax((hd.zsize+1)/10);
                counter->SetPos(1);
            }
        }

        char filename[LNAME];
        int num = hd.zsize;
        int cnt = fnum;
        hd.zsize = 1;

        for (int i=0; i<num; i++) {
            snprintf(filename, LNAME-2, fname, cnt);
            hd.grptr = (uByte*)(vp.gp + vp.xs*vp.ys*cnt);
            ret = writeCmnHeadFile(filename, &hd, false);
            
            if (counter!=NULL && i%10==0) {
                counter->StepIt();
                if (counter->isCanceled()) {    // キャンセル
                    if (hd.buf!=NULL) free(hd.buf);
                    return JBXL_GRAPH_CANCEL;
                }
            }
            if (ret<0) break;
            cnt++;
        }
        if (counter!=NULL) counter->PutFill();
    }

    if (hd.buf!=NULL) free(hd.buf);
    
    return ret;
}

Here is the call graph for this function:

int writeRasData	(	FILE *	fp,
		CmnHead *	hd,
		int	obit = 8
	)

int jbxl::writeRasData(FILE* fp, CmnHead* hd, int obit)

色々な画像データをSUN RASTER型式でファイルに保存する．

Parameters:

	fp	保存するファイルポインタ．
	hd	保存するデータを既述した共通ヘッダ．
	obit	SUN RASTERの 1ピクセルのビット数(8, 24をサポート)．

Return values:

	>0	書き込んだバイト数．
	JBXL_GRAPH_MEMORY_ERROR	メモリエラー．

Definition at line 109 of file Gio.cpp.

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, RAS_MAGIC, RasHead::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().

{
    RasHead shd;
    int  i, j, k, l, linebyte, databyte, depth, lsize;
    uByte null=0x00, *ptr, *buf;

    obit = Xabs(obit);
    if (hd->kind == RAS_DATA) {
        unsigned int u;
        memcpy((sByte*)&shd, hd->buf, hd->bsize);
        ptr = (uByte*)malloc(hd->lsize);
        if (ptr==NULL)  return JBXL_GRAPH_MEMORY_ERROR;
        lsize = hd->lsize;
        for (u=0; u<hd->lsize; u++) ptr[u] = hd->grptr[u];
    }
    else { // CT -> RAS 
        if (hd->depth==16) {

            if (obit==8) depth = 8;
            else         depth = 24;

            lsize = hd->xsize*hd->ysize*depth/8;
            buf = (uByte*)malloc(lsize);
            if (buf==NULL)  return JBXL_GRAPH_MEMORY_ERROR;

            if (obit==8) {
                int  max = 255; // 8bit mode での最大値 
                uWord* wp = (uWord*)hd->grptr;
                for (i=0; i<hd->xsize*hd->ysize; i++) {
                    max = Max(max, wp[i]);
                }
                for (i=0; i<hd->ysize*hd->xsize; i++) {
                    buf[i] = 255*wp[i]/max;
                }
            }
            else {
                k = l = 0;
                for (i=0; i<hd->ysize*hd->xsize; i++) {
                    buf[k++] = hd->grptr[l++];
                    buf[k++] = hd->grptr[l++];
                    buf[k++] = null;
                }
            }
        }
        else {
            depth = hd->depth;
            lsize = hd->lsize;
            buf   = (uByte*)hd->grptr;
        }

        databyte = hd->xsize*depth/8;
        linebyte = lsize/hd->ysize;
        if (linebyte%2==1) {
            linebyte++;
            lsize = linebyte*hd->ysize;
        }

        shd.ras_magic    = RAS_MAGIC;
        shd.ras_width    = hd->xsize;
        shd.ras_height   = hd->ysize;
        shd.ras_depth    = depth;
        shd.ras_length   = lsize;
        shd.ras_type     = RT_STANDARD;
        shd.ras_maptype  = RMT_NONE;
        shd.ras_maplength= 0;

        ptr = (uByte*)malloc(lsize);
        if (ptr==NULL) {
            if (hd->depth==16) free(buf);
            return -2;
        }

        k = l = 0;
        for (i=0 ; i<hd->ysize; i++) {
            for (j=0; j<databyte; j++)          ptr[k++] = buf[l++];
            for (j=0; j<linebyte-databyte; j++) ptr[k++] = null;
        }

        if (hd->depth==16) free(buf);
    }

    hton_st(&shd, 4);
    fwrite(&shd, sizeof(RasHead), 1, fp);
    fwrite(ptr, lsize, 1, fp);

    free(ptr);
    return  sizeof(RasHead)+lsize;
}

Here is the caller graph for this function:

int jbxl::writeRasFile	(	const char *	fname,
		MSGraph< T >	vp
	)			[inline]

template <typename t>=""> int writeRasFile(const char *fname, MSGraph<T> vp)

Definition at line 569 of file Gio.h.

References copyMSGraph2CmnHead(), JBXL_GRAPH_IVDARG_ERROR, JBXL_GRAPH_OPFILE_ERROR, JBXL_NORMAL, and writeRasData().

{
    if (fname==NULL) return JBXL_GRAPH_IVDARG_ERROR;

    FILE* fp = fopen(fname, "wb");
    if (fp==NULL) return JBXL_GRAPH_OPFILE_ERROR;

    CmnHead hd = copyMSGraph2CmnHead(vp);
    writeRasData(fp, &hd);

    fclose(fp);
    return JBXL_NORMAL;
}

Here is the call graph for this function:

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 93 of file STL.cpp.

References DEBUG_MODE, PRINT_MESG, WriteSTLFileA(), and WriteSTLFileB().

{
    int nn;

    if (ascii) nn = WriteSTLFileA(fname, solid_list);
    else       nn = WriteSTLFileB(fname, solid_list);

    if (nn<0) DEBUG_MODE PRINT_MESG("WriteSTLFile: ファイルオープンエラー．\n");
    return nn;
}

Here is the call graph for this function:

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 73 of file STL.cpp.

References DEBUG_MODE, PRINT_MESG, WriteSTLFileA(), and WriteSTLFileB().

{
    int nn;

    if (ascii) nn = WriteSTLFileA(fname, solid);
    else       nn = WriteSTLFileB(fname, solid);

    if (nn<0) DEBUG_MODE PRINT_MESG("WriteSTLFile: ファイルオープンエラー．\n");
    return nn;
}

Here is the call graph for this function:

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 303 of file STL.cpp.

References BREP_WING::next, BREP_VERTEX::point, BREP_WING::vertex, Vector< T >::x, Vector< T >::y, and Vector< T >::z.

{
    FILE* fp;
    int   nn = 0;
    
    fp = fopen(fname, "wa");
    if (fp==NULL) return -1;

    fprintf(fp, "solid %s\n", fname);

    BREP_SOLID_LIST::iterator isolid;
    for (isolid=solid_list.begin(); isolid!=solid_list.end(); isolid++){
        //
        BREP_CONTOUR_LIST::iterator icon;
        for (icon=(*isolid)->contours.begin(); icon!=(*isolid)->contours.end(); icon++){
            fprintf(fp, "facet normal %g %g %g\n", (*icon)->normal.x, (*icon)->normal.y, (*icon)->normal.z);
            fprintf(fp, "    outer loop\n");
    
            BREP_WING* wing = (*icon)->wing;
            for (int i=0; i<3; i++) {
                Vector<double> vect = wing->vertex->point;
                fprintf(fp, "        vertex %g %g %g\n", vect.x, vect.y, vect.z);
                wing = wing->next;
            }
            fprintf(fp,"    endloop\n");
            fprintf(fp,"endfacet\n");
            nn++;
        }
    }
    fprintf(fp, "endsolid %s\n", fname);
    fclose(fp);

    return nn;
}

DllExport int WriteSTLFileA	(	char *	fname,
		BREP_SOLID *	solid
	)

int jbxl::WriteSTLFileA(char* fname, BREP_SOLID* solid)

BREP_SOLID のデータをアスキー形式の STLファイルとして書き込む

Definition at line 223 of file STL.cpp.

References BREP_SOLID::contours, BREP_WING::next, BREP_VERTEX::point, BREP_WING::vertex, Vector< T >::x, Vector< T >::y, and Vector< T >::z.

Referenced by BrepSolidList::outputFile(), and WriteSTLFile().

{
    FILE* fp;
    int   nn = 0;
    
    fp = fopen(fname, "w");
    if (fp==NULL) return -1;

    fprintf(fp, "solid %s\n", fname);

    BREP_CONTOUR_LIST::iterator icon;
    for (icon=solid->contours.begin(); icon!=solid->contours.end(); icon++){
        fprintf(fp, "facet normal %g %g %g\n", (*icon)->normal.x, (*icon)->normal.y, (*icon)->normal.z);
        fprintf(fp, "    outer loop\n");

        BREP_WING* wing = (*icon)->wing;
        for (int i=0; i<3; i++) {
            Vector<double> vect = wing->vertex->point;
            fprintf(fp, "        vertex %g %g %g\n", vect.x, vect.y, vect.z);
            wing = wing->next;
        }
        fprintf(fp,"    endloop\n");
        fprintf(fp,"endfacet\n");
        nn++;
    }
    fprintf(fp, "endsolid %s\n", fname);
    fclose(fp);

    return nn;
}

Here is the caller graph for this function:

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 345 of file STL.cpp.

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

{
    FILE* fp;
    int   fno = 0;
    char  message[80]="STL Binary Data Program  by Fumi.Iseki";
    STLData  stldata; 

    fp = fopen(fname, "wb");
    if (fp==NULL) return -1;

    BREP_SOLID_LIST::iterator isolid;
    for (isolid=solid_list.begin(); isolid!=solid_list.end(); isolid++){
        fno += (int)((*isolid)->contours.size());
    }
    fwrite(message, 80, 1, fp);
    fwrite(&fno, 4, 1, fp);

    //
    for (isolid=solid_list.begin(); isolid!=solid_list.end(); isolid++){
        //
        BREP_CONTOUR_LIST::iterator icon;
        for (icon=(*isolid)->contours.begin(); icon!=(*isolid)->contours.end(); icon++){
            stldata.vect[0] = (float)(*icon)->normal.x;
            stldata.vect[1] = (float)(*icon)->normal.y;
            stldata.vect[2] = (float)(*icon)->normal.z;

            BREP_WING* wing = (*icon)->wing;
            for (int i=0; i<3; i++) {
                Vector<double> vect = wing->vertex->point;
                stldata.vect[3*i+3] = (float)vect.x;
                stldata.vect[3*i+4] = (float)vect.y;
                stldata.vect[3*i+5] = (float)vect.z;
                wing = wing->next;
            }
            fwrite(&stldata, 50, 1, fp);
        }
    }
    fclose(fp);

    return fno;
}

DllExport int WriteSTLFileB	(	char *	fname,
		BREP_SOLID *	solid
	)

int jbxl::WriteSTLFileB(char* fname, BREP_SOLID* solid)

BREP_SOLID のデータをバイナリ形式の STLファイルとして書き込む

Definition at line 261 of file STL.cpp.

References BREP_SOLID::contours, STLData::vect, Vector< T >::x, Vector< T >::y, and Vector< T >::z.

Referenced by BrepSolidList::outputFile(), and WriteSTLFile().

{
    FILE* fp;
    int   fno;
    char  message[80]="STL Binary Data Program  by Fumi.Iseki";
    STLData  stldata; 

    fp = fopen(fname, "wb");
    if (fp==NULL) return -1;

    fno = (int)solid->contours.size();
    fwrite(message, 80, 1, fp);
    fwrite(&fno, 4, 1, fp);

    BREP_CONTOUR_LIST::iterator icon;
    for (icon=solid->contours.begin(); icon!=solid->contours.end(); icon++){
        stldata.vect[0] = (float)(*icon)->normal.x;
        stldata.vect[1] = (float)(*icon)->normal.y;
        stldata.vect[2] = (float)(*icon)->normal.z;

        BREP_WING* wing = (*icon)->wing;
        for (int i=0; i<3; i++) {
            Vector<double> vect = wing->vertex->point;
            stldata.vect[3*i+3] = (float)vect.x;
            stldata.vect[3*i+4] = (float)vect.y;
            stldata.vect[3*i+5] = (float)vect.z;
            wing = wing->next;
        }
        fwrite(&stldata, 50, 1, fp);
    }
    fclose(fp);

    return fno;
}

Here is the caller graph for this function:

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_ERROR	tga にデータが無い
	JBXL_GRAPH_IVDARG_ERROR	サポート外のチャンネル数

Definition at line 232 of file TgaTool.cpp.

References TGAImage::col, TGAImage::gp, TGAImage::hd, is_little_endian(), JBXL_GRAPH_IVDARG_ERROR, JBXL_GRAPH_NODATA_ERROR, JBXL_GRAPH_OPFILE_ERROR, TGA_HEADER_SIZE, TGAImage::xs, and TGAImage::ys.

Referenced by writeTGAFile().

{
    if (fp==NULL) return JBXL_GRAPH_OPFILE_ERROR;
    if (tga.col<=0 || tga.col>4) return JBXL_GRAPH_IVDARG_ERROR;
    if (tga.gp==NULL) return JBXL_GRAPH_NODATA_ERROR;

    // Header  http://3dtech.jp/wiki/index.php?TGA画像フォーマット詳細
    memset(tga.hd, 0, TGA_HEADER_SIZE);
    if (tga.col==3 || tga.col==4) tga.hd[2] = 2;    // Full Color
    else                          tga.hd[2] = 3;    // Gray Scale

    unsigned short int* size = (unsigned short int*)&(tga.hd[12]);
    if (is_little_endian()) {
        size[0] = tga.xs;
        size[1] = tga.ys;
    }
    else {
        size[0] = htons(tga.xs);
        size[1] = htons(tga.ys);
    }

    tga.hd[16] = tga.col*8;
    tga.hd[17] = 0x08 | 0x20;       // 0x0x8: αチャンネル深度, 0x20: Y方向:Top->Down

    fwrite(tga.hd, TGA_HEADER_SIZE, 1, fp);

    // Data
    int len = tga.xs*tga.ys*tga.col;
    fwrite(tga.gp, len, 1, fp);

    return 0;
}

Here is the call graph for this function:

Here is the caller graph for this function:

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_ERROR	tga にデータが無い
	JBXL_GRAPH_IVDARG_ERROR	ファイル名が NULL, or サポート外のチャンネル数

Definition at line 196 of file TgaTool.cpp.

References TGAImage::col, TGAImage::gp, JBXL_GRAPH_IVDARG_ERROR, JBXL_GRAPH_NODATA_ERROR, JBXL_GRAPH_OPFILE_ERROR, and writeTGAData().

{
    FILE*  fp;
    int    ret;

    if (fname==NULL) return JBXL_GRAPH_IVDARG_ERROR;
    if (tga.col<=0 || tga.col>4) return JBXL_GRAPH_IVDARG_ERROR;
    if (tga.gp==NULL) return JBXL_GRAPH_NODATA_ERROR;

    fp = fopen(fname, "wb");
    if (fp==NULL) {
        return JBXL_GRAPH_OPFILE_ERROR;
    }

    ret = writeTGAData(fp, tga);
    fclose(fp); 

    return ret;
}

Here is the call graph for this function:

void jbxl::wSetPixel	(	MSGraph< T >	vp,
		double	x,
		double	y,
		int	cc
	)			[inline]

template <typename t>=""> void wSetPixel(MSGraph<T> vp, double x, double y, int cc)

ワールド座標系に点を打つ．

Parameters:

	vp	操作対象のグラフィックデータ．
	x	点の x座標(ワールド座標系)．
	y	点の y座標(ワールド座標系)．
	cc	点の輝度値．

Definition at line 52 of file Window.h.

References MSGraph< T >::point(), MSGraph< T >::wRateX, MSGraph< T >::wRateY, MSGraph< T >::wZeroX, MSGraph< T >::wZeroY, and MSGraph< T >::ys.

{
    int i = (int)((x - vp.wZeroX)*vp.wRateX);
    int j = (int)((vp.wZeroY - y)*vp.wRateY);

    if (i>=0 && i<vp.xs && j>=0 && j<vp.ys) vp.point(i, j) = (T)cc;
}

Here is the call graph for this function:

void jbxl::wSetPixel3D	(	MSGraph< T >	vp,
		double	x,
		double	y,
		double	z,
		int	cc
	)			[inline]

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 73 of file Window.h.

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.

{
    int i = (int)((vp.wZeroX - x)*vp.wRateX);
    int j = (int)((y - vp.wZeroY)*vp.wRateY);
    int k = (int)((vp.wZeroZ - z)*vp.wRateZ);

    if (i>=0 && i<vp.xs && j>=0 && j<vp.ys && k>=0 && k<vp.zs) vp.point(i, j, k) = (T)cc;
}

Here is the call graph for this function:

MSGraph<T> jbxl::x_reverse_MSGraph	(	MSGraph< T >	vp,
		bool	ecnt = false
	)			[inline]

template <typename t>=""> MSGraph<T> x_reverse_MSGraph(MSGraph<T> vp, bool ecnt=false)

グラフィックデータの x軸を反転させる．

Parameters:

	vp	操作対象となるグラフィックデータ構造体．
	ecnt	仮想カウンタを使用するか?

Returns:

反転したグラフィックデータ．

Definition at line 2015 of file Graph.h.

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.

{
    int  i, j, k, cy, cz;
    MSGraph<T> wp;
    CVCounter* counter = NULL;
    
    wp.init();

    if (ecnt) counter = GetUsableGlobalCounter();
    if (counter!=NULL) {
        if (counter->isCanceled()) {
            wp.state = JBXL_GRAPH_CANCEL;
            return wp;
        }
        counter->SetMax(vp.zs);
    }

    wp.set(vp.xs, vp.ys, vp.zs, vp.zero, vp.base, vp.RZxy);
    if (wp.isNull()) return wp;
    wp.color = vp.color;

    for (k=0; k<vp.zs; k++) {
        cz = k*vp.xs*vp.ys;
        for (j=0; j<vp.ys; j++) {
            cy = cz + j*vp.xs;
            for (i=0; i<vp.xs; i++) {
                wp.gp[cy + i] = vp.gp[cy + vp.xs - 1 - i];
            }
        }

        // Counter
        if (counter!=NULL) {
            counter->StepIt();
            if (counter->isCanceled()) {
                wp.state = JBXL_GRAPH_CANCEL;
                return wp;
            }
        }
    }

    return wp;
}

Here is the call graph for this function:

MSGraph<R> jbxl::xSobel

(

MSGraph< T >

vp

)

[inline]

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

グラフィックデータの X方向微分(Sobel)を計算する．

Parameters:

vp

計算対象となるグラフィックデータ構造体．

Returns:

処理されたグラフィックデータ．

Definition at line 158 of file Gmt.h.

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.

{
    int  i, j, k;
    int  pl, nx, ny, nz;
    R    da, db, dc, dd, de, nr;
    MSGraph<R> xp;
 
    xp.mimicry(vp);
    xp.base = xp.zero = 0;

    if (xp.isNull()) {
        DEBUG_MODE PRINT_MESG("XSOBEL: No More Memory!!!\n");
        xp.state = JBXL_GRAPH_MEMORY_ERROR;
        return xp;
    }

    // カウンタ
    CVCounter*   vcounter = NULL;
    if (vp.zs>2) vcounter = GetUsableGlobalCounter();
    if (vcounter!=NULL) vcounter->SetMax(vp.zs);

    pl = vp.xs*vp.ys;
    for (k=0; k<vp.zs; k++) {
        nz = k*pl;
        for (j=1; j<vp.ys-1; j++) {
            ny = nz + j*vp.xs;
            for (i=1; i<vp.xs-1; i++) {
                nx = ny + i;
                da = vp.gp[nx+1-vp.xs] - vp.gp[nx-1-vp.xs];                 //  1/4 * (da+dc)
                db = vp.gp[nx+1]       - vp.gp[nx-1];                       //  1/2 * db
                dc = vp.gp[nx+1+vp.xs] - vp.gp[nx-1+vp.xs];
                //da = vp.point(i+1, j-1, k) - vp.point(i-1, j-1, k);       //  1/4 * (da+dc)
                //db = vp.point(i+1, j,   k) - vp.point(i-1, j,   k);       //  1/2 * db
                //dc = vp.point(i+1, j+1, k) - vp.point(i-1, j+1, k);

                if (k==0 || k==vp.zs-1) {
                    dd = de = 0;
                    nr = 8;
                }
                else {
                    dd = vp.gp[nx+1-pl] - vp.gp[nx-1-pl];                   // 1/4 * (dd+de)
                    de = vp.gp[nx+1+pl] - vp.gp[nx-1+pl];
                    //dd = vp.point(i+1, j, k-1) - vp.point(i-1, j, k-1);   // 1/4 * (dd+de)
                    //de = vp.point(i+1, j, k+1) - vp.point(i-1, j, k+1);
                    nr = 12;
                }

                xp.gp[nx] = (R)((da + 2.*db + dc + dd + de)/nr);
            }
        }
        if (vcounter!=NULL) vcounter->StepIt();
    }

    return xp;
}

Here is the call graph for this function:

MSGraph<R> jbxl::xxSobel

(

MSGraph< T >

vp

)

[inline]

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

グラフィックデータの X方向の 2階微分(Sobel)を計算する．

Parameters:

vp

計算対象となるグラフィックデータ構造体．

Returns:

処理されたグラフィックデータ．

Definition at line 382 of file Gmt.h.

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.

{
    int  i, j, k;
    int  pl, nx, ny, nz, pl2, xs, xs2;
    R    da, db, dc, dd, de;
    R    df, dg, dh, di, dj, dk, dl, dm, nr;
    MSGraph<R> xp;
   
    xp.mimicry(vp);
    xp.base = xp.zero = 0;

    if (xp.isNull()) {
        DEBUG_MODE PRINT_MESG("XXSOBEL: No More Memory!!\n");
        xp.state = JBXL_GRAPH_MEMORY_ERROR;
        return xp;
    }
    
    // カウンタ
    CVCounter*   vcounter = NULL;
    if (vp.zs>2) vcounter = GetUsableGlobalCounter();
    if (vcounter!=NULL) vcounter->SetMax(vp.zs);

    pl  = vp.xs*vp.ys;
    pl2 = 2*pl;
    xs  = vp.xs;
    xs2 = 2*vp.xs;

    for (k=0; k<vp.zs; k++) {
        nz = k*pl;
        for (j=2; j<vp.ys-2; j++) {
            ny = nz + j*vp.xs;
            for (i=2; i<vp.xs-2; i++) {
                nx = ny + i;
                da = vp.gp[nx+2-xs2] - 2*vp.gp[nx-xs2] + vp.gp[nx-2-xs2];
                db = vp.gp[nx+2-xs ] - 2*vp.gp[nx-xs]  + vp.gp[nx-2-xs];
                dc = vp.gp[nx+2]     - 2*vp.gp[nx]     + vp.gp[nx-2];
                dd = vp.gp[nx+2+xs]  - 2*vp.gp[nx+xs]  + vp.gp[nx-2+xs];
                de = vp.gp[nx+2+xs2] - 2*vp.gp[nx+xs2] + vp.gp[nx-2+xs2];
                //da = vp.point(i+2, j-2, k) - 2*vp.point(i, j-2, k) + vp.point(i-2, j-2, k);
                //db = vp.point(i+2, j-1, k) - 2*vp.point(i, j-1, k) + vp.point(i-2, j-1, k);
                //dc = vp.point(i+2, j,   k) - 2*vp.point(i, j,   k) + vp.point(i-2, j,   k);
                //dd = vp.point(i+2, j+1, k) - 2*vp.point(i, j+1, k) + vp.point(i-2, j+1, k);
                //de = vp.point(i+2, j+2, k) - 2*vp.point(i, j+2, k) + vp.point(i-2, j+2, k);

                if (k==0 || k==vp.zs-1) {
                    dc = (R)(6.*dc);
                    df = dg = dh = di = dj = dk = dl = dm = 0;
                    nr = 64;
                }
                else {
                    dc = (R)(8.*dc);
                    df = vp.gp[nx+2-xs-pl] - 2*vp.gp[nx-xs-pl] + vp.gp[nx-2-xs-pl];
                    dg = vp.gp[nx+2   -pl] - 2*vp.gp[nx   -pl] + vp.gp[nx-2   -pl];
                    dh = vp.gp[nx+2+xs-pl] - 2*vp.gp[nx+xs-pl] + vp.gp[nx-2+xs-pl];
                    di = vp.gp[nx+2-xs+pl] - 2*vp.gp[nx-xs+pl] + vp.gp[nx-2-xs+pl];
                    dj = vp.gp[nx+2   +pl] - 2*vp.gp[nx   +pl] + vp.gp[nx-2   +pl];
                    dk = vp.gp[nx+2+xs+pl] - 2*vp.gp[nx+xs+pl] + vp.gp[nx-2+xs+pl];
                    //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);
                    //dg = vp.point(i+2, j,   k-1) - 2*vp.point(i, j ,  k-1) + vp.point(i-2, j,   k-1);
                    //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);
                    //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);
                    //dj = vp.point(i+2, j,   k+1) - 2*vp.point(i, j,   k+1) + vp.point(i-2, j,   k+1);
                    //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);

                    if (k==1 || k==vp.zs-2) {
                        dl = dm = 0;
                        nr = 136;
                    }
                    else {
                        dl = vp.gp[nx+2-pl2] - 2*vp.gp[nx-pl2] + vp.gp[nx-2-pl2];
                        dm = vp.gp[nx+2+pl2] - 2*vp.gp[nx+pl2] + vp.gp[nx-2+pl2];\
                        //dl = vp.point(i+2, j, k-2) - 2*vp.point(i, j, k-2) + vp.point(i-2, j, k-2);
                        //dm = vp.point(i+2, j, k+2) - 2*vp.point(i, j, k+2) + vp.point(i-2, j, k+2);
                        nr = 144;
                    }
                }
                xp.gp[nx] = (R)((dc + 4.*(db+dd+dg+dj) + 2.*(df+dh+di+dk) + da+de+dl+dm)/nr);
            }
        }
        if (vcounter!=NULL) vcounter->StepIt();
    }
    
    return xp;
}

Here is the call graph for this function:

MSGraph<R> jbxl::ySobel

(

MSGraph< T >

vp

)

[inline]

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

グラフィックデータの Y方向微分(Sobel)を計算する．

Parameters:

vp

計算対象となるグラフィックデータ構造体．

Returns:

処理されたグラフィックデータ．

Definition at line 223 of file Gmt.h.

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.

{
    int  i, j, k;
    int  pl, nx, ny, nz;
    R    da, db, dc, dd, de, nr;
    MSGraph<R> xp;
 
    xp.mimicry(vp);
    xp.base = xp.zero = 0;

    if (xp.isNull()) {
        DEBUG_MODE PRINT_MESG("YSOBEL: No More Memory!!\n");
        xp.state = JBXL_GRAPH_MEMORY_ERROR;
        return xp;
    }

    // カウンタ
    CVCounter*   vcounter = NULL;
    if (vp.zs>2) vcounter = GetUsableGlobalCounter();
    if (vcounter!=NULL) vcounter->SetMax(vp.zs);

    pl = vp.xs*vp.ys;
    for (k=0; k<vp.zs; k++) {
        nz = k*pl;
        for (j=1; j<vp.ys-1; j++) {
            ny = nz + j*vp.xs;
            for (i=1; i<vp.xs-1; i++) {
                nx = ny + i;
                da = vp.gp[nx-1+vp.xs] - vp.gp[nx-1-vp.xs];
                db = vp.gp[nx  +vp.xs] - vp.gp[nx  -vp.xs];
                dc = vp.gp[nx+1+vp.xs] - vp.gp[nx+1-vp.xs];
                //da = vp.point(i-1, j+1, k) - vp.point(i-1, j-1, k);
                //db = vp.point(i  , j+1, k) - vp.point(i,   j-1, k);
                //dc = vp.point(i+1, j+1, k) - vp.point(i+1, j-1, k);

                if (k==0 || k==vp.zs-1) {
                    dd = de = 0;
                    nr = 8;
                }
                else {
                    dd = vp.gp[nx+vp.xs-pl] - vp.gp[nx-vp.xs-pl];
                    de = vp.gp[nx+vp.xs+pl] - vp.gp[nx-vp.xs+pl];
                    //dd = vp.point(i, j+1, k-1) - vp.point(i, j-1, k-1);
                    //de = vp.point(i, j+1, k+1) - vp.point(i, j-1, k+1);
                    nr = 12;
                }   

                xp.gp[nx] = (R)((da + 2.*db + dc + dd + de)/nr);
            }
        }
        if (vcounter!=NULL) vcounter->StepIt();
    }

    return xp;
}

Here is the call graph for this function:

MSGraph<R> jbxl::yySobel

(

MSGraph< T >

vp

)

[inline]

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

グラフィックデータの Y方向の 2階微分(Sobel)を計算する．

Parameters:

vp

計算対象となるグラフィックデータ構造体．

Returns:

処理されたグラフィックデータ．

Definition at line 476 of file Gmt.h.

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.

{
    int  i, j, k;
    int  pl, nx, ny, nz, pl2, xs, xs2;
    R    da, db, dc, dd, de;
    R    df, dg, dh, di, dj, dk, dl, dm, nr;
    MSGraph<R> xp;
    
    xp.mimicry(vp);
    xp.base = xp.zero = 0;

    if (xp.isNull()) {
        DEBUG_MODE PRINT_MESG("YYSOBEL: No More Memory!!\n");
        xp.state = JBXL_GRAPH_MEMORY_ERROR;
        return xp;
    }
 
    // カウンタ
    CVCounter*   vcounter = NULL;
    if (vp.zs>2) vcounter = GetUsableGlobalCounter();
    if (vcounter!=NULL) vcounter->SetMax(vp.zs);

    pl  = vp.xs*vp.ys;
    pl2 = 2*pl;
    xs  = vp.xs;
    xs2 = 2*vp.xs;

    for (k=0; k<vp.zs; k++) {
        nz = k*pl;
        for (j=2; j<vp.ys-2; j++) {
            ny = nz + j*vp.xs;
            for (i=2; i<vp.xs-2; i++) {
                nx = ny + i;
                da = vp.gp[nx-2+xs2] - 2*vp.gp[nx-2] + vp.gp[nx-2-xs2];
                db = vp.gp[nx-1+xs2] - 2*vp.gp[nx-1] + vp.gp[nx-1-xs2];
                dc = vp.gp[nx  +xs2] - 2*vp.gp[nx]   + vp.gp[nx  -xs2];
                dd = vp.gp[nx+1+xs2] - 2*vp.gp[nx+1] + vp.gp[nx+1-xs2];
                de = vp.gp[nx+2+xs2] - 2*vp.gp[nx+2] + vp.gp[nx+2-xs2];
                //da = vp.point(i-2, j+2, k) - 2*vp.point(i-2, j, k) + vp.point(i-2, j-2, k);
                //db = vp.point(i-1, j+2, k) - 2*vp.point(i-1, j, k) + vp.point(i-1, j-2, k);
                //dc = vp.point(i,   j+2, k) - 2*vp.point(i,   j, k) + vp.point(i,   j-2, k);
                //dd = vp.point(i+1, j+2, k) - 2*vp.point(i+1, j, k) + vp.point(i+1, j-2, k);
                //de = vp.point(i+2, j+2, k) - 2*vp.point(i+2, j, k) + vp.point(i+2, j-2, k);

                if (k==0 || k==vp.zs-1) {
                    dc = (R)(6.*dc);
                    df = dg = dh = di = dj = dk = dl = dm = 0;
                    nr = 64;
                }
                else {
                    dc = (R)(8.*dc);
                    df = vp.gp[nx-1+xs2-pl] - 2*vp.gp[nx-1-pl] + vp.gp[nx-1-xs2-pl];
                    dg = vp.gp[nx  +xs2-pl] - 2*vp.gp[nx  -pl] + vp.gp[nx  -xs2-pl];
                    dh = vp.gp[nx+1+xs2-pl] - 2*vp.gp[nx+1-pl] + vp.gp[nx+1-xs2-pl];
                    di = vp.gp[nx-1+xs2+pl] - 2*vp.gp[nx-1+pl] + vp.gp[nx-1-xs2+pl];
                    dj = vp.gp[nx  +xs2+pl] - 2*vp.gp[nx  +pl] + vp.gp[nx  -xs2+pl];
                    dk = vp.gp[nx+1+xs2+pl] - 2*vp.gp[nx+1+pl] + vp.gp[nx+1-xs2+pl];                
                    //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);
                    //dg = vp.point(i,   j+2, k-1) - 2*vp.point(i,   j, k-1) + vp.point(i,   j-2, k-1);
                    //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);
                    //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);
                    //dj = vp.point(i,   j+2, k+1) - 2*vp.point(i,   j, k+1) + vp.point(i,   j-2, k+1);
                    //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);

                    if (k==1 || k==vp.zs-2) {
                        dl = dm = 0;
                        nr = 136;
                    }
                    else {
                        dl = vp.gp[nx+xs2-pl2] - 2*vp.gp[nx-pl2] + vp.gp[nx-xs2-pl2];
                        dm = vp.gp[nx+xs2+pl2] - 2*vp.gp[nx+pl2] + vp.gp[nx-xs2+pl2];
                        //dl = vp.point(i, j+2, k-2) - 2*vp.point(i, j, k-2) + vp.point(i, j-2, k-2);
                        //dm = vp.point(i, j+2, k+2) - 2*vp.point(i, j, k+2) + vp.point(i, j-2, k+2);
                        nr = 144;
                    }
                }
                xp.gp[nx] = (R)((dc + 4.*(db+dd+dg+dj) + 2.*(df+dh+di+dk) + da+de+dl+dm)/nr);
            }
        }
        if (vcounter!=NULL) vcounter->StepIt();
    }

    return xp;
}

Here is the call graph for this function:

MSGraph<T> jbxl::zoom_MSGraph	(	MSGraph< T >	vp,
		double	zm,
		int	mode = ON
	)			[inline]

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 1765 of file Graph.h.

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().

{
    int  xss, yss, ps, pz, py;
    MSGraph<T> vx;

    vx.init();

    if (vp.gp==NULL) {
        vx.state = JBXL_GRAPH_NODATA_ERROR;
        return vx;
    }
    if (zm==0.0) {
        vx.state = JBXL_GRAPH_IVDARG_ERROR;
        return vx;
    }
    else if (zm<0.0) zm = -zm;

    xss = (int)(vp.xs*zm) + 1;
    yss = (int)(vp.ys*zm) + 1;

    vx.set(xss, yss, vp.zs);
    if (vx.isNull()) return vx;
    vx.color = vp.color;

    ps = xss*yss;

    if (mode==ON) {
        int    ii, jj, kk, ll;
        double xx, yy, al, bt;

        for(int k=0; k<vx.zs; k++) {
            pz = k*ps;
            for(int j=0; j<yss; j++) {
                py = pz + j*xss;
                for(int i=0; i<xss; i++) {
                    xx = i/zm;
                    yy = j/zm;
                    ii = (int)xx;
                    jj = (int)yy;
                    if (ii>=vp.xs) ii = vp.xs - 1;
                    if (jj>=vp.ys) jj = vp.ys - 1;

                    kk = ii + 1;
                    ll = jj + 1;
                    if (kk>=vp.xs) kk = vp.xs - 1;
                    if (ll>=vp.ys) ll = vp.ys - 1;

                    if (xx>=0.) al = xx - ii;
                    else        al = 0.;
                    if (yy>=0.) bt = yy - jj;
                    else        bt = 0.;

                    vx.gp[py+i] = (T)((1.-al)*(1.-bt)*vp.point(ii, jj, k) + al*(1.-bt)*vp.point(kk, jj, k) 
                                                        + (1.-al)*bt*vp.point(ii, ll, k) + al*bt*vp.point(kk, ll, k) + 0.5);
                }
            }
        }
    }

    else {
        int ii, jj;

        for(int k=0; k<vx.zs; k++) {
            pz = k*ps;
            for(int j=0; j<yss; j++) {
                py = pz + j*xss;
                for(int i=0; i<xss; i++) {
                    ii = (int)(i/zm);
                    jj = (int)(j/zm);
                    vx.gp[py+i] = vp.point(ii, jj, k);
                }
            }
        }
    }

    return vx;
}

Here is the call graph for this function:

Here is the caller graph for this function:

MSGraph<R> jbxl::zSobel

(

MSGraph< T >

vp

)

[inline]

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

グラフィックデータの Z方向微分(Sobel)を計算する．

Parameters:

vp

計算対象となるグラフィックデータ構造体．

Returns:

処理されたグラフィックデータ．

Definition at line 288 of file Gmt.h.

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.

{
    int  i, j, k;
    int  pl, nx, ny, nz;
    R    da, db, dc, dd, de;
    MSGraph<R> xp;

    xp.mimicry(vp);
    xp.base = xp.zero = 0;

    if (xp.isNull()) {
        DEBUG_MODE PRINT_MESG("ZSOBEL: No More Memory!!\n");
        xp.state = JBXL_GRAPH_MEMORY_ERROR;
        return xp;
    }
    if (vp.zs<2) {
        xp.state = JBXL_GRAPH_NODATA_ERROR;
        return xp;      // 0 のグラフィックデータを返す
    }

    // カウンタ
    CVCounter*   vcounter = NULL;
    if (vp.zs>2) vcounter = GetUsableGlobalCounter();
    if (vcounter!=NULL) vcounter->SetMax(vp.zs-1);

    pl = vp.xs*vp.ys;
    for (k=1; k<vp.zs-1; k++) {
        nz = k*pl;
        for (j=1; j<vp.ys-1; j++) {
            ny = nz + j*vp.xs;
            for (i=1; i<vp.xs-1; i++) {
                nx = ny +i;
                da = vp.gp[nx-1+pl]     - vp.gp[nx-1-pl];
                db = vp.gp[nx+1+pl]     - vp.gp[nx+1-pl];
                dc = vp.gp[nx  +pl]     - vp.gp[nx  -pl];
                dd = vp.gp[nx-vp.xs+pl] - vp.gp[nx-vp.xs-pl];
                de = vp.gp[nx+vp.xs+pl] - vp.gp[nx+vp.xs-pl];
                //da = vp.point(i-1, j, k+1) - vp.point(i-1, j, k-1);
                //db = vp.point(i+1, j, k+1) - vp.point(i+1, j, k-1);
                //dc = vp.point(i,   j, k+1) - vp.point(i,   j, k-1);
                //dd = vp.point(i, j-1, k+1) - vp.point(i, j-1, k-1);
                //de = vp.point(i, j+1, k+1) - vp.point(i, j+1, k-1);
                xp.gp[nx] = (R)((da + db + 2.*dc + dd + de)/12.);
            }
        }
        if (vcounter!=NULL) vcounter->StepIt();
    }

    // k==0 and k==vp.zs-1
    nz = (vp.zs-1)*pl;
    for (j=1; j<vp.ys-1; j++) {
        ny = j*vp.xs;
        for (i=1; i<vp.xs-1; i++) {
            nx = ny + i;
            da = vp.gp[nx];
            db = vp.gp[nx+pl];
            dc = vp.gp[nx+1    +pl] + vp.gp[nx-1    +pl];
            dd = vp.gp[nx+vp.xs+pl] + vp.gp[nx-vp.xs+pl];
            //da = vp.point(i, j, 0);
            //db = vp.point(i, j, 1);       
            //dc = vp.point(i+1, j, 1) + vp.point(i-1, j, 1);
            //dd = vp.point(i, j+1, 1) + vp.point(i, j-1, 1);
            xp.gp[nx] = (R)((2.*db + dc + dd)/6. - da);
        }

        ny = ny + nz;
        for (i=1; i<vp.xs-1; i++) {
            nx = ny + i;
            da = vp.gp[nx];
            db = vp.gp[nx-pl];
            dc = vp.gp[nx+1    -pl] + vp.gp[nx-1    -pl];
            dd = vp.gp[nx+vp.xs-pl] + vp.gp[nx-vp.xs-pl];
            //da = vp.point(i, j, vp.zs-1);
            //db = vp.point(i, j, vp.zs-2);
            //dc = vp.point(i+1, j, vp.zs-2) + vp.point(i-1, j, vp.zs-2);
            //dd = vp.point(i, j+1, vp.zs-2) + vp.point(i, j-1, vp.zs-2);
            xp.gp[nx] = (R)(da - (2.*db + dc + dd)/6.);
        }
    }

    if (vcounter!=NULL) vcounter->PutFill();

    return xp;
}

Here is the call graph for this function:

MSGraph<R> jbxl::zzSobel

(

MSGraph< T >

vp

)

[inline]

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

グラフィックデータの Z方向の 2階微分(Sobel)を計算する．

Parameters:

vp

計算対象となるグラフィックデータ構造体．

Returns:

処理されたグラフィックデータ．

Definition at line 570 of file Gmt.h.

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.

{
    int  i, j, k;
    R    da, db, dc, dd, de;
    R    df, dg, dh, di, dj, dk, dl, dm;
    MSGraph<R>  pp, xp;
    
    if (vp.zs<2) {      // 0 のグラフィックデータを返す
        pp.mimicry(vp);
        pp.state = JBXL_GRAPH_NODATA_ERROR;
        return pp;
    }

    // カウンタ
    CVCounter* vcounter = NULL;
    CVCounter* ccounter = NULL;
    if (vp.zs>2) vcounter = GetUsableGlobalCounter();
    if (vcounter!=NULL) {
        vcounter->SetMax(200);
        ccounter = vcounter->MakeChildCounter(100);
        SetGlobalCounter(ccounter);
    }

    pp = zSobel<R>(vp);

    if (vcounter!=NULL) {
        vcounter->DeleteChildCounter();
        ccounter = vcounter->MakeChildCounter(100);
        SetGlobalCounter(ccounter);
    }

    if (!pp.isNull()) {
        xp = zSobel<R>(pp);
        pp.free();
    }
    else xp = pp;

    if (vcounter!=NULL) {
        vcounter->DeleteChildCounter();
        SetGlobalCounter(vcounter);
        vcounter->PutFill();
    }

/*  if (vp.zs<5) return xp;
    for (k=2; k<vp.zs-2; k++) {
        for (j=2; j<vp.ys-2; j++) {
        for (i=2; i<vp.xs-2; i++) {
            da = vp.point(i,   j,   k+2) - 2*vp.point(i,   j,   k) + vp.point(i,   j,   k-2);
            db = vp.point(i+1, j,   k+2) - 2*vp.point(i+1, j,   k) + vp.point(i+1, j,   k-2);
            dc = vp.point(i-1, j,   k+2) - 2*vp.point(i-1, j,   k) + vp.point(i-1, j,   k-2);
            dd = vp.point(i,   j+1, k+2) - 2*vp.point(i,   j+1, k) + vp.point(i,   j+1, k-2);
            de = vp.point(i,   j-1, k+2) - 2*vp.point(i,   j-1, k) + vp.point(i,   j-1, k-2);
            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);
            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);
            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);
            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);
            dj = vp.point(i+2, j,   k+2) - 2*vp.point(i+2, j,   k) + vp.point(i+2, j,   k-2);
            dk = vp.point(i-2, j,   k+2) - 2*vp.point(i-2, j,   k) + vp.point(i-2, j,   k-2);
            dl = vp.point(i,   j+2, k+2) - 2*vp.point(i,   j+2, k) + vp.point(i,   j+2, k-2);
            dm = vp.point(i,   j-2, k+2) - 2*vp.point(i,   j-2, k) + vp.point(i,   j-2, k-2);
            xp.point(i, j, k) = (R)((8.*da + 4.*(db+dc+dd+de) + 2.*(df+dg+dh+di) +dj+dk+dl+dm)/144.);
        }
        }
    }
*/
    return xp;
}

Here is the call graph for this function:

---

Variable Documentation

double Abs_Vector_Tolerance = 1.0e-4

Definition at line 23 of file Tolerance.cpp.

Referenced by SetAbsVectorTolerance().

double Abs_Vertex_Tolerance = 1.0e-4

Definition at line 24 of file Tolerance.cpp.

Referenced by BREP_VERTEX::BREP_VERTEX(), BREP_VERTEX::ComputeTolerance(), and SetAbsVertexTolerance().

class DllExport BREP_CONTOUR

Definition at line 37 of file Brep.h.

Referenced by CreateContour(), and CreateContourByVertex().

class DllExport BREP_EDGE

Definition at line 38 of file Brep.h.

Referenced by CreateEdge().

class DllExport BREP_FACET

Definition at line 36 of file Brep.h.

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

class DllExport BREP_SHELL

Definition at line 35 of file Brep.h.

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

class DllExport BREP_SOLID

Definition at line 34 of file Brep.h.

Referenced by BrepSolidList::addSolid(), MeshObjectNode::computeVertexByBREP(), and BrepSolidList::getMerge().

class DllExport BREP_VERTEX

Definition at line 40 of file Brep.h.

Referenced by CreateContourByVector().

class DllExport BREP_WING

Definition at line 39 of file Brep.h.

Referenced by BREP_EDGE::BREP_EDGE().

double Collision_Tolerance = 1.0e-2

Definition at line 25 of file Tolerance.cpp.

Referenced by CollisionTriContour2D(), CollisionTriContour3D(), IsInTriangle(), and SetCollisionTolerance().

double Edge_Tolerance = 1.0e-12

Definition at line 19 of file Tolerance.cpp.

Referenced by BREP_EDGE::BREP_EDGE(), and SetEdgeTolerance().

double Facet_Tolerance = 1.0e-12

Definition at line 20 of file Tolerance.cpp.

Referenced by BREP_FACET::BREP_FACET(), BREP_FACET::ComputePlaneEquation(), and SetFacetTolerance().

CVCounter * GLCounter = NULL

Definition at line 24 of file ClassBox.cpp.

Referenced by ClearGlobalCounter(), GetUsableGlobalCounter(), and SetGlobalCounter().

CVDisplay * GLDisplay = NULL

Definition at line 18 of file ClassBox.cpp.

Referenced by ClearGlobalDisplay(), and SetGlobalDisplay().

CVFrame * GLFrame = NULL

Definition at line 17 of file ClassBox.cpp.

Referenced by ClearGlobalFrame(), and SetGlobalFrame().

CVTextDocument * GLTextDocument = NULL

Definition at line 19 of file ClassBox.cpp.

Referenced by ClearGlobalTextDocument(), and SetGlobalTextDocument().

class DllExport OctreeNode

Definition at line 41 of file Brep.h.

Referenced by BREP_SOLID::BREP_SOLID().

class DllExport Quaternion

Definition at line 24 of file Rotation.h.

double Sin_Tolerance = 1.0e-6

Definition at line 26 of file Tolerance.cpp.

Referenced by SetSINTolerance(), SlerpQuaternion(), and ToPola().

int TempBase = 0

Definition at line 15 of file Gdata.cpp.

Referenced by writeCmnHeadData(), and writeGraphicFile().

double Vector_Tolerance = 1.0e-6

Definition at line 17 of file Tolerance.cpp.

Referenced by same_vector(), and SetVectorTolerance().

double Vertex_Tolerance = 1.0e-6

Definition at line 18 of file Tolerance.cpp.

Referenced by BREP_VERTEX::ComputeTolerance(), and SetVertexTolerance().

double Zero_Eps = 1.0e-6

Definition at line 29 of file Tolerance.cpp.

Referenced by CollisionTriContour2D(), CollisionTriContour3D(), IsAtLine(), Vector< T >::normalize(), Quaternion< T >::normalize(), ProportionVector(), RotMatrixElements2ExtEulerXYZ(), RotMatrixElements2ExtEulerXZY(), RotMatrixElements2ExtEulerYXZ(), RotMatrixElements2ExtEulerYZX(), RotMatrixElements2ExtEulerZXY(), RotMatrixElements2ExtEulerZYX(), SamePlaneContour(), SetZeroEPS(), V2VQuaternion(), and VectorAngle().

double Zero_Eps2 = Zero_Eps*Zero_Eps

Definition at line 30 of file Tolerance.cpp.

int ZeroBase = 0

Definition at line 14 of file Gdata.cpp.

Referenced by readGraphicFile(), and readGraphicSlices().