diff options
| author | neodarz <neodarz@neodarz.net> | 2018-08-11 20:21:34 +0200 |
|---|---|---|
| committer | neodarz <neodarz@neodarz.net> | 2018-08-11 20:21:34 +0200 |
| commit | 0ea5fc66924303d1bf73ba283a383e2aadee02f2 (patch) | |
| tree | 2568e71a7ccc44ec23b8bb3f0ff97fb6bf2ed709 /pipermail/nel/2001-December/000835.html | |
| download | nevrax-website-self-hostable-0ea5fc66924303d1bf73ba283a383e2aadee02f2.tar.xz nevrax-website-self-hostable-0ea5fc66924303d1bf73ba283a383e2aadee02f2.zip | |
Initial commit
Diffstat (limited to '')
| -rw-r--r-- | pipermail/nel/2001-December/000835.html | 65 |
1 files changed, 65 insertions, 0 deletions
diff --git a/pipermail/nel/2001-December/000835.html b/pipermail/nel/2001-December/000835.html new file mode 100644 index 00000000..879947d3 --- /dev/null +++ b/pipermail/nel/2001-December/000835.html @@ -0,0 +1,65 @@ +<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2//EN"> +<HTML> + <HEAD> + <TITLE> [Nel] Max Bezier Patches + </TITLE> + <LINK REL="Index" HREF="index.html" > + <LINK REL="made" HREF="mailto:nel%40nevrax.org"> + <META NAME="robots" CONTENT="index,nofollow"> + + <LINK REL="Previous" HREF="000833.html"> + <LINK REL="Next" HREF="000836.html"> + </HEAD> + <BODY BGCOLOR="#ffffff"> + <H1>[Nel] Max Bezier Patches + </H1> + <B>Nel List + </B> + <A HREF="mailto:nel%40nevrax.org" + TITLE="[Nel] Max Bezier Patches">nel@nevrax.org + </A><BR> + <I>Tue, 25 Dec 2001 08:45:26 -0800</I> + <P><UL> + <LI> Previous message: <A HREF="000833.html">[Nel] Building Nel +</A></li> + <LI> Next message: <A HREF="000836.html">[Nel] Re: Nel digest, Vol 1 #210 - 1 msg +</A></li> + <LI> <B>Messages sorted by:</B> + <a href="date.html#835">[ date ]</a> + <a href="thread.html#835">[ thread ]</a> + <a href="subject.html#835">[ subject ]</a> + <a href="author.html#835">[ author ]</a> + </LI> + </UL> + <HR> +<!--beginarticle--> +<PRE> +><i> Unfortunately there appears to be no information whatsoever on the +</I>><i> interconnectivity of the patches. Therefore, I can either add +</I>><i> some complex +</I> +If these are Bezier patches, then the outer control points (the four +corners) will be shared with the neighbours; two corners per +neighbour. This seems to me to be equivalent to finding adjacent +triangles using shared edges, which certainly isn't complicated math +(although the simplest implementation takes O(n^2) time). + + + +</PRE> +<!--endarticle--> + <HR> + <P><UL> + <!--threads--> + <LI> Previous message: <A HREF="000833.html">[Nel] Building Nel +</A></li> + <LI> Next message: <A HREF="000836.html">[Nel] Re: Nel digest, Vol 1 #210 - 1 msg +</A></li> + <LI> <B>Messages sorted by:</B> + <a href="date.html#835">[ date ]</a> + <a href="thread.html#835">[ thread ]</a> + <a href="subject.html#835">[ subject ]</a> + <a href="author.html#835">[ author ]</a> + </LI> + </UL> +</body></html> |