代码搜索：intersection
找到约 1,060 项符合「intersection」的源代码
代码结果 1,060
www.eeworm.com/read/338238/12317250
cpp regionlevel.cpp
#include "RegionLevel.h"
bool RegionLevel::addRegion(Region& region) {
region_iterator riter = begin();
while (riter != end()) {
Nodes inter_nodes;
riter->intersection(region,inter_nodes
www.eeworm.com/read/130301/14198459
cpp hello.cpp
#include
#include "quad.h"
void PrintResults(quadratic &gook);
void Intersection(quadratic &mutha, quadratic &phuqa);
int main( void )
{
A: char choice;
double a, b, c, d, e, f;
www.eeworm.com/read/228533/14380240
c raypoly.c
/*
An Efficient Ray/Polygon Intersection
by Didier Badouel
from "Graphics Gems", Academic Press, 1990
just code, not a procedure.
*/
/* the value of t is computed.
* i1 and i2 come from the polygon
www.eeworm.com/read/233925/4663522
run
#! /bin/bash
echo Generating dataset
../Generator 1000 100 > mix
echo Creating new R-Tree and Querying
../RTreeLoad mix tree 20 intersection > res
echo Running exhaustive search
../Exhaustive mix i
www.eeworm.com/read/180500/5283163
java setmodel.java
package org.w3c.rdf.model;
/**
* An RDF model that natively supports set operations `union', `difference' and `intersection'.
*
* @see org.w3c.rdf.util.SetOperations
*/
public interface SetModel
www.eeworm.com/read/270032/11050860
c raypolygon.c
/*
An Efficient Ray/Polygon Intersection
by Didier Badouel
from "Graphics Gems", Academic Press, 1990
just code, not a procedure.
*/
/* the value of t is computed.
* i1 and i2 come from the polygon
www.eeworm.com/read/270032/11050926
c circlerect.c
/*
Fast Circle-Rectangle Intersection Checking
by Clifford A. Shaffer
from "Graphics Gems", Academic Press, 1990
*/
#include "GraphicsGems.h"
boolean Check_Intersect(R, C, Rad)
/* Return TRUE iff
www.eeworm.com/read/427909/8913669
m rectintsparse.m
function [overlap, normoverlap] = rectintSparse(A,B)
%
% A(i,:) = [x y w h]
% B(j,:) = [x y w h]
% overlap(i,j) = area of intersection
% normoverla(i,j)
%
% Same as built-in rectint, but uses l