代码搜索:intersection

找到约 1,060 项符合「intersection」的源代码

代码结果 1,060
www.eeworm.com/read/469416/6976233

m myintersect.m

function C = myintersect(A,B) % MYINTERSECT Intersection of two sets of positive integers (much faster than built-in intersect) % C = myintersect(A,B) A = A(:)'; B = B(:)'; if isempty(A) ma
www.eeworm.com/read/332978/7142009

java sets.java

//: net/mindview/util/Sets.java package net.mindview.util; import java.util.*; public class Sets { public static Set union(Set a, Set b) { Set result = new HashSet(a);
www.eeworm.com/read/461182/7232380

h primitiveshapes.h

#ifndef _PRIMITIVES_ #define _PRIMITIVES_ #include "BaseShapes.h" #include "RGBpixmap.h" #include //@$@$@$@$@$@$@$@$@$@ Plane class @$@$@$@$@$@$@$@$@$ class Plane : public Shape {
www.eeworm.com/read/458510/7295297

cpp xintersection.cpp

#include "XMathLib.h" #include "XGeomLib.h" #include "XGVolume.h" using namespace XMathLib; namespace XGeomLib { //计算三角形和面之间的交线. float InterSection(XTriangle& tri,XTriangle& tri2,XLin
www.eeworm.com/read/447300/7554557

mdl powerwindow.mdl

Model { Name "powerwindow" Version 4.00 SampleTimeColors off LibraryLinkDisplay "none" WideLines off ShowLineDimensions off ShowPortDataTypes off ShowStorageC
www.eeworm.com/read/444297/7614364

m histogramme.m

clear all, close all, u= imread('intersection.tif');figure, imshow(u); u=im2double(u); figure, imshow(u); % figure,imhist(u); i=im2bw(u); j=bwselect(i); figure,imshow(j);
www.eeworm.com/read/440287/7691014

m scpoi.m

function [u, v] = scPOI(r, x) %scPOI: calculates the point of intersection of the circles defining r and x % % SYNOPSIS: % Calculates the point of intersection of the circle describing r and
www.eeworm.com/read/244728/12847478

html maincog3dtest.html

COG 2.1: Intersection with 3D box Intersection with another cube In this variant, instead of the cube [-1,1]3 , the intersection
www.eeworm.com/read/243219/12954501

c maze.c

//迷宫 #include #include typedef struct { int left; int forward; int right; }InterSection; typedef struct { int mazeSize; InterSection *intSec; int Exit; }Maze;
www.eeworm.com/read/140851/13058767

m myintersect.m

function C = myintersect(A,B) % MYINTERSECT Intersection of two sets of positive integers (much faster than built-in intersect) % C = myintersect(A,B) A = A(:)'; B = B(:)'; if isempty(A) ma