birkir

function Cube({ position }: { position?: number[] | THREE.Vector3 }) {
  const mesh = useRef<THREE.Mesh>();
  const touched = useTouch(mesh);

  return (
    <mesh ref={mesh} castShadow receiveShadow position={position}>
      <boxGeometry attach="geometry" args={[1, 1, 1]} />
      <meshStandardMaterial
        attach="material"
        color={touched ? 0xff0000 : 0xffffff}

petrsm

	//
	// CatmullRomLength()
	//
	//
	//*******************************************************************************************
	template <typename T>
	T CatmullRomLength(	const CVector2<T>	&p0, 
						const CVector2<T>	&p1, 
						const CVector2<T>	&p2, 
						const CVector2<T>	&p3,

petrsm

	//
	// CatmullRomCurveProjectPt()
	//
	//
	//*******************************************************************************************
	template <typename T>
	T CatmullRomCurveProjectPt(	const CVector2<T> &p0, 
								const CVector2<T> &p1, 
								const CVector2<T> &p2, 
								const CVector2<T> &p3, 

grahamboree

using System.Collections.Generic;
using UnityEngine;

public interface QuadtreeItem {
	Rect GetBounds();
}

public class QuadtreeNode<T> where T : QuadtreeItem {
	const int MAX_DEPTH = 10;

bberak

import React, { PureComponent } from "react";
import { StyleSheet } from "react-native";
import ReglView from "./ReglView";
import mat4 from "gl-mat4";
import bunny from "bunny";

export default class Bunny extends PureComponent {
  drawCommand = regl => {
    return regl({
      vert: `

max-mapper

rpgove

license: gpl-3.0
height: 600

armollica

veltman

Smooth transitioning US tour in the same vein as this example. Steps:

1. Compares both shapes and adds evenly-spaced points to whichever polygon has fewer so that both have the same number of points
2. Picks the winding of the first polygon that minimizes the sum of the squared distances between point pairs

Some possible improvements:

• Adding additional points to both shapes first such that every segment longer than a certain distance is bisected
• Tweaking the placement of added points with simulated annealing
• Using a cost function that factors in self-intersections at the halfway mark in addition to distance traveled

marcin-chwedczuk

#!/usr/bin/env node

const NKEYS = 4;

function arrayOfSize(size) {
    var a = Array(size);

    for (var i = 0; i < size; i += 1)
        a[i] = null;