split up

2013-06-24 01:50:37 +02:00
parent 36de337e25
commit 83cd73156a
454 changed files with 30032 additions and 348 deletions
--- a/vtm/.classpath
+++ b/vtm/.classpath
@@ -0,0 +1,8 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<classpath>
+	<classpathentry kind="src" path="src"/>
+	<classpathentry kind="src" path="jni/builder"/>
+	<classpathentry kind="con" path="org.eclipse.jdt.launching.JRE_CONTAINER"/>
+	<classpathentry combineaccessrules="false" kind="src" path="/gdx-jnigen"/>
+	<classpathentry kind="output" path="bin"/>
+</classpath>
--- a/vtm/.cproject
+++ b/vtm/.cproject
@@ -0,0 +1,139 @@
+<?xml version="1.0" encoding="UTF-8" standalone="no"?>
+<?fileVersion 4.0.0?>
+
+<cproject storage_type_id="org.eclipse.cdt.core.XmlProjectDescriptionStorage">
+	<storageModule moduleId="org.eclipse.cdt.core.settings">
+		<cconfiguration id="cdt.managedbuild.config.gnu.so.debug.1302880850">
+			<storageModule buildSystemId="org.eclipse.cdt.managedbuilder.core.configurationDataProvider" id="cdt.managedbuild.config.gnu.so.debug.1302880850" moduleId="org.eclipse.cdt.core.settings" name="Debug">
+				<externalSettings>
+					<externalSetting>
+						<entry flags="VALUE_WORKSPACE_PATH" kind="includePath" name="/vtm"/>
+						<entry flags="VALUE_WORKSPACE_PATH" kind="libraryPath" name="/vtm/Debug"/>
+						<entry flags="RESOLVED" kind="libraryFile" name="vtm"/>
+					</externalSetting>
+				</externalSettings>
+				<extensions>
+					<extension id="org.eclipse.cdt.core.ELF" point="org.eclipse.cdt.core.BinaryParser"/>
+					<extension id="org.eclipse.cdt.core.GmakeErrorParser" point="org.eclipse.cdt.core.ErrorParser"/>
+					<extension id="org.eclipse.cdt.core.CWDLocator" point="org.eclipse.cdt.core.ErrorParser"/>
+					<extension id="org.eclipse.cdt.core.GCCErrorParser" point="org.eclipse.cdt.core.ErrorParser"/>
+					<extension id="org.eclipse.cdt.core.GASErrorParser" point="org.eclipse.cdt.core.ErrorParser"/>
+					<extension id="org.eclipse.cdt.core.GLDErrorParser" point="org.eclipse.cdt.core.ErrorParser"/>
+				</extensions>
+			</storageModule>
+			<storageModule moduleId="cdtBuildSystem" version="4.0.0">
+				<configuration artifactExtension="so" artifactName="${ProjName}" buildArtefactType="org.eclipse.cdt.build.core.buildArtefactType.sharedLib" buildProperties="org.eclipse.cdt.build.core.buildType=org.eclipse.cdt.build.core.buildType.debug,org.eclipse.cdt.build.core.buildArtefactType=org.eclipse.cdt.build.core.buildArtefactType.sharedLib" cleanCommand="rm -rf" description="" id="cdt.managedbuild.config.gnu.so.debug.1302880850" name="Debug" parent="cdt.managedbuild.config.gnu.so.debug">
+					<folderInfo id="cdt.managedbuild.config.gnu.so.debug.1302880850." name="/" resourcePath="">
+						<toolChain id="cdt.managedbuild.toolchain.gnu.so.debug.1994265409" name="Linux GCC" superClass="cdt.managedbuild.toolchain.gnu.so.debug">
+							<targetPlatform id="cdt.managedbuild.target.gnu.platform.so.debug.1427402895" name="Debug Platform" superClass="cdt.managedbuild.target.gnu.platform.so.debug"/>
+							<builder buildPath="${workspace_loc:/vtm/Debug}" id="cdt.managedbuild.target.gnu.builder.so.debug.51093045" keepEnvironmentInBuildfile="false" managedBuildOn="true" name="Gnu Make Builder" superClass="cdt.managedbuild.target.gnu.builder.so.debug"/>
+							<tool id="cdt.managedbuild.tool.gnu.archiver.base.1242453014" name="GCC Archiver" superClass="cdt.managedbuild.tool.gnu.archiver.base"/>
+							<tool id="cdt.managedbuild.tool.gnu.cpp.compiler.so.debug.12288890" name="GCC C++ Compiler" superClass="cdt.managedbuild.tool.gnu.cpp.compiler.so.debug">
+								<option id="gnu.cpp.compiler.so.debug.option.optimization.level.1140656435" name="Optimization Level" superClass="gnu.cpp.compiler.so.debug.option.optimization.level" value="gnu.cpp.compiler.optimization.level.none" valueType="enumerated"/>
+								<option id="gnu.cpp.compiler.so.debug.option.debugging.level.1344560191" name="Debug Level" superClass="gnu.cpp.compiler.so.debug.option.debugging.level" value="gnu.cpp.compiler.debugging.level.max" valueType="enumerated"/>
+							</tool>
+							<tool id="cdt.managedbuild.tool.gnu.c.compiler.so.debug.294732242" name="GCC C Compiler" superClass="cdt.managedbuild.tool.gnu.c.compiler.so.debug">
+								<option defaultValue="gnu.c.optimization.level.none" id="gnu.c.compiler.so.debug.option.optimization.level.861729628" name="Optimization Level" superClass="gnu.c.compiler.so.debug.option.optimization.level" valueType="enumerated"/>
+								<option id="gnu.c.compiler.so.debug.option.debugging.level.565711573" name="Debug Level" superClass="gnu.c.compiler.so.debug.option.debugging.level" value="gnu.c.debugging.level.max" valueType="enumerated"/>
+								<option id="gnu.c.compiler.option.include.paths.1108285515" name="Include paths (-I)" superClass="gnu.c.compiler.option.include.paths" valueType="includePath">
+									<listOptionValue builtIn="false" value="/usr/lib/jvm/java-6-sun/include"/>
+									<listOptionValue builtIn="false" value="/usr/lib/jvm/java-6-sun/include/linux"/>
+								</option>
+								<option id="gnu.c.compiler.option.preprocessor.def.symbols.1521107011" name="Defined symbols (-D)" superClass="gnu.c.compiler.option.preprocessor.def.symbols" valueType="definedSymbols">
+									<listOptionValue builtIn="false" value="TRILIBRARY"/>
+									<listOptionValue builtIn="false" value="REDUCED"/>
+									<listOptionValue builtIn="false" value="CDT_ONLY"/>
+									<listOptionValue builtIn="false" value="NO_TIMER"/>
+								</option>
+								<option id="gnu.c.compiler.option.misc.other.209711446" name="Other flags" superClass="gnu.c.compiler.option.misc.other" value="-c -fmessage-length=0 -std=c99 -O" valueType="string"/>
+								<inputType id="cdt.managedbuild.tool.gnu.c.compiler.input.1678549853" superClass="cdt.managedbuild.tool.gnu.c.compiler.input"/>
+							</tool>
+							<tool id="cdt.managedbuild.tool.gnu.c.linker.so.debug.555828890" name="GCC C Linker" superClass="cdt.managedbuild.tool.gnu.c.linker.so.debug">
+								<option defaultValue="true" id="gnu.c.link.so.debug.option.shared.1663904410" name="Shared (-shared)" superClass="gnu.c.link.so.debug.option.shared" valueType="boolean"/>
+								<inputType id="cdt.managedbuild.tool.gnu.c.linker.input.971579103" superClass="cdt.managedbuild.tool.gnu.c.linker.input">
+									<additionalInput kind="additionalinputdependency" paths="$(USER_OBJS)"/>
+									<additionalInput kind="additionalinput" paths="$(LIBS)"/>
+								</inputType>
+							</tool>
+							<tool id="cdt.managedbuild.tool.gnu.cpp.linker.so.debug.272802024" name="GCC C++ Linker" superClass="cdt.managedbuild.tool.gnu.cpp.linker.so.debug">
+								<option defaultValue="true" id="gnu.cpp.link.so.debug.option.shared.318004293" name="Shared (-shared)" superClass="gnu.cpp.link.so.debug.option.shared" valueType="boolean"/>
+							</tool>
+							<tool id="cdt.managedbuild.tool.gnu.assembler.so.debug.125939788" name="GCC Assembler" superClass="cdt.managedbuild.tool.gnu.assembler.so.debug">
+								<inputType id="cdt.managedbuild.tool.gnu.assembler.input.1459864375" superClass="cdt.managedbuild.tool.gnu.assembler.input"/>
+							</tool>
+						</toolChain>
+					</folderInfo>
+				</configuration>
+			</storageModule>
+			<storageModule moduleId="org.eclipse.cdt.core.externalSettings"/>
+		</cconfiguration>
+		<cconfiguration id="cdt.managedbuild.config.gnu.so.release.1093038142">
+			<storageModule buildSystemId="org.eclipse.cdt.managedbuilder.core.configurationDataProvider" id="cdt.managedbuild.config.gnu.so.release.1093038142" moduleId="org.eclipse.cdt.core.settings" name="Release">
+				<externalSettings>
+					<externalSetting>
+						<entry flags="VALUE_WORKSPACE_PATH" kind="includePath" name="/vtm"/>
+						<entry flags="VALUE_WORKSPACE_PATH" kind="libraryPath" name="/vtm/Release"/>
+						<entry flags="RESOLVED" kind="libraryFile" name="vtm"/>
+					</externalSetting>
+				</externalSettings>
+				<extensions>
+					<extension id="org.eclipse.cdt.core.ELF" point="org.eclipse.cdt.core.BinaryParser"/>
+					<extension id="org.eclipse.cdt.core.GmakeErrorParser" point="org.eclipse.cdt.core.ErrorParser"/>
+					<extension id="org.eclipse.cdt.core.CWDLocator" point="org.eclipse.cdt.core.ErrorParser"/>
+					<extension id="org.eclipse.cdt.core.GCCErrorParser" point="org.eclipse.cdt.core.ErrorParser"/>
+					<extension id="org.eclipse.cdt.core.GASErrorParser" point="org.eclipse.cdt.core.ErrorParser"/>
+					<extension id="org.eclipse.cdt.core.GLDErrorParser" point="org.eclipse.cdt.core.ErrorParser"/>
+				</extensions>
+			</storageModule>
+			<storageModule moduleId="cdtBuildSystem" version="4.0.0">
+				<configuration artifactExtension="so" artifactName="${ProjName}" buildArtefactType="org.eclipse.cdt.build.core.buildArtefactType.sharedLib" buildProperties="org.eclipse.cdt.build.core.buildType=org.eclipse.cdt.build.core.buildType.release,org.eclipse.cdt.build.core.buildArtefactType=org.eclipse.cdt.build.core.buildArtefactType.sharedLib" cleanCommand="rm -rf" description="" id="cdt.managedbuild.config.gnu.so.release.1093038142" name="Release" parent="cdt.managedbuild.config.gnu.so.release">
+					<folderInfo id="cdt.managedbuild.config.gnu.so.release.1093038142." name="/" resourcePath="">
+						<toolChain id="cdt.managedbuild.toolchain.gnu.so.release.1456866661" name="Linux GCC" superClass="cdt.managedbuild.toolchain.gnu.so.release">
+							<targetPlatform id="cdt.managedbuild.target.gnu.platform.so.release.1160849033" name="Debug Platform" superClass="cdt.managedbuild.target.gnu.platform.so.release"/>
+							<builder buildPath="${workspace_loc:/vtm/Release}" id="cdt.managedbuild.target.gnu.builder.so.release.1254122047" keepEnvironmentInBuildfile="false" managedBuildOn="true" name="Gnu Make Builder" superClass="cdt.managedbuild.target.gnu.builder.so.release"/>
+							<tool id="cdt.managedbuild.tool.gnu.archiver.base.938017760" name="GCC Archiver" superClass="cdt.managedbuild.tool.gnu.archiver.base"/>
+							<tool id="cdt.managedbuild.tool.gnu.cpp.compiler.so.release.239216259" name="GCC C++ Compiler" superClass="cdt.managedbuild.tool.gnu.cpp.compiler.so.release">
+								<option id="gnu.cpp.compiler.so.release.option.optimization.level.190990620" name="Optimization Level" superClass="gnu.cpp.compiler.so.release.option.optimization.level" value="gnu.cpp.compiler.optimization.level.most" valueType="enumerated"/>
+								<option id="gnu.cpp.compiler.so.release.option.debugging.level.1872766321" name="Debug Level" superClass="gnu.cpp.compiler.so.release.option.debugging.level" value="gnu.cpp.compiler.debugging.level.none" valueType="enumerated"/>
+							</tool>
+							<tool id="cdt.managedbuild.tool.gnu.c.compiler.so.release.150046973" name="GCC C Compiler" superClass="cdt.managedbuild.tool.gnu.c.compiler.so.release">
+								<option defaultValue="gnu.c.optimization.level.most" id="gnu.c.compiler.so.release.option.optimization.level.2056925709" name="Optimization Level" superClass="gnu.c.compiler.so.release.option.optimization.level" valueType="enumerated"/>
+								<option id="gnu.c.compiler.so.release.option.debugging.level.1512319317" name="Debug Level" superClass="gnu.c.compiler.so.release.option.debugging.level" value="gnu.c.debugging.level.none" valueType="enumerated"/>
+								<inputType id="cdt.managedbuild.tool.gnu.c.compiler.input.1696669033" superClass="cdt.managedbuild.tool.gnu.c.compiler.input"/>
+							</tool>
+							<tool id="cdt.managedbuild.tool.gnu.c.linker.so.release.1189053227" name="GCC C Linker" superClass="cdt.managedbuild.tool.gnu.c.linker.so.release">
+								<option defaultValue="true" id="gnu.c.link.so.release.option.shared.659733290" name="Shared (-shared)" superClass="gnu.c.link.so.release.option.shared" valueType="boolean"/>
+								<inputType id="cdt.managedbuild.tool.gnu.c.linker.input.968578047" superClass="cdt.managedbuild.tool.gnu.c.linker.input">
+									<additionalInput kind="additionalinputdependency" paths="$(USER_OBJS)"/>
+									<additionalInput kind="additionalinput" paths="$(LIBS)"/>
+								</inputType>
+							</tool>
+							<tool id="cdt.managedbuild.tool.gnu.cpp.linker.so.release.1446182349" name="GCC C++ Linker" superClass="cdt.managedbuild.tool.gnu.cpp.linker.so.release">
+								<option defaultValue="true" id="gnu.cpp.link.so.release.option.shared.394882440" name="Shared (-shared)" superClass="gnu.cpp.link.so.release.option.shared" valueType="boolean"/>
+							</tool>
+							<tool id="cdt.managedbuild.tool.gnu.assembler.so.release.71992373" name="GCC Assembler" superClass="cdt.managedbuild.tool.gnu.assembler.so.release">
+								<inputType id="cdt.managedbuild.tool.gnu.assembler.input.1607122818" superClass="cdt.managedbuild.tool.gnu.assembler.input"/>
+							</tool>
+						</toolChain>
+					</folderInfo>
+				</configuration>
+			</storageModule>
+			<storageModule moduleId="org.eclipse.cdt.core.externalSettings"/>
+		</cconfiguration>
+	</storageModule>
+	<storageModule moduleId="cdtBuildSystem" version="4.0.0">
+		<project id="vtm.cdt.managedbuild.target.gnu.so.62997407" name="Shared Library" projectType="cdt.managedbuild.target.gnu.so"/>
+	</storageModule>
+	<storageModule moduleId="scannerConfiguration">
+		<autodiscovery enabled="true" problemReportingEnabled="true" selectedProfileId=""/>
+		<scannerConfigBuildInfo instanceId="cdt.managedbuild.config.gnu.so.release.1093038142;cdt.managedbuild.config.gnu.so.release.1093038142.;cdt.managedbuild.tool.gnu.c.compiler.so.release.150046973;cdt.managedbuild.tool.gnu.c.compiler.input.1696669033">
+			<autodiscovery enabled="true" problemReportingEnabled="true" selectedProfileId="org.eclipse.cdt.managedbuilder.core.GCCManagedMakePerProjectProfileC"/>
+		</scannerConfigBuildInfo>
+		<scannerConfigBuildInfo instanceId="cdt.managedbuild.config.gnu.so.debug.1302880850;cdt.managedbuild.config.gnu.so.debug.1302880850.;cdt.managedbuild.tool.gnu.c.compiler.so.debug.294732242;cdt.managedbuild.tool.gnu.c.compiler.input.1678549853">
+			<autodiscovery enabled="true" problemReportingEnabled="true" selectedProfileId="org.eclipse.cdt.managedbuilder.core.GCCManagedMakePerProjectProfileC"/>
+		</scannerConfigBuildInfo>
+	</storageModule>
+	<storageModule moduleId="refreshScope" versionNumber="1">
+		<resource resourceType="PROJECT" workspacePath="/vtm"/>
+	</storageModule>
+</cproject>
--- a/vtm/.project
+++ b/vtm/.project
@@ -0,0 +1,36 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<projectDescription>
+	<name>vtm</name>
+	<comment></comment>
+	<projects>
+	</projects>
+	<buildSpec>
+		<buildCommand>
+			<name>org.eclipse.ui.externaltools.ExternalToolBuilder</name>
+			<triggers>full,incremental,</triggers>
+			<arguments>
+				<dictionary>
+					<key>LaunchConfigHandle</key>
+					<value>&lt;project&gt;/.externalToolBuilders/org.eclipse.cdt.managedbuilder.core.genmakebuilder (1).launch</value>
+				</dictionary>
+			</arguments>
+		</buildCommand>
+		<buildCommand>
+			<name>org.eclipse.jdt.core.javabuilder</name>
+			<arguments>
+			</arguments>
+		</buildCommand>
+		<buildCommand>
+			<name>org.eclipse.cdt.managedbuilder.core.ScannerConfigBuilder</name>
+			<triggers>full,incremental,</triggers>
+			<arguments>
+			</arguments>
+		</buildCommand>
+	</buildSpec>
+	<natures>
+		<nature>org.eclipse.jdt.core.javanature</nature>
+		<nature>org.eclipse.cdt.core.cnature</nature>
+		<nature>org.eclipse.cdt.managedbuilder.core.managedBuildNature</nature>
+		<nature>org.eclipse.cdt.managedbuilder.core.ScannerConfigNature</nature>
+	</natures>
+</projectDescription>
--- a/vtm/.settings/org.eclipse.cdt.codan.core.prefs
+++ b/vtm/.settings/org.eclipse.cdt.codan.core.prefs
@@ -0,0 +1,66 @@
+eclipse.preferences.version=1
+org.eclipse.cdt.codan.checkers.errnoreturn=Warning
+org.eclipse.cdt.codan.checkers.errnoreturn.params={implicit\=>false}
+org.eclipse.cdt.codan.checkers.errreturnvalue=Error
+org.eclipse.cdt.codan.checkers.errreturnvalue.params={}
+org.eclipse.cdt.codan.checkers.noreturn=Error
+org.eclipse.cdt.codan.checkers.noreturn.params={implicit\=>false}
+org.eclipse.cdt.codan.internal.checkers.AbstractClassCreation=-Error
+org.eclipse.cdt.codan.internal.checkers.AbstractClassCreation.params={launchModes\=>{RUN_ON_FULL_BUILD\=>false,RUN_ON_INC_BUILD\=>false,RUN_AS_YOU_TYPE\=>true,RUN_ON_DEMAND\=>true}}
+org.eclipse.cdt.codan.internal.checkers.AmbiguousProblem=-Error
+org.eclipse.cdt.codan.internal.checkers.AmbiguousProblem.params={launchModes\=>{RUN_ON_FULL_BUILD\=>false,RUN_ON_INC_BUILD\=>false,RUN_AS_YOU_TYPE\=>true,RUN_ON_DEMAND\=>true}}
+org.eclipse.cdt.codan.internal.checkers.AssignmentInConditionProblem=Warning
+org.eclipse.cdt.codan.internal.checkers.AssignmentInConditionProblem.params={}
+org.eclipse.cdt.codan.internal.checkers.AssignmentToItselfProblem=Error
+org.eclipse.cdt.codan.internal.checkers.AssignmentToItselfProblem.params={}
+org.eclipse.cdt.codan.internal.checkers.CaseBreakProblem=Warning
+org.eclipse.cdt.codan.internal.checkers.CaseBreakProblem.params={no_break_comment\=>"no break",last_case_param\=>true,empty_case_param\=>false}
+org.eclipse.cdt.codan.internal.checkers.CatchByReference=Warning
+org.eclipse.cdt.codan.internal.checkers.CatchByReference.params={unknown\=>false,exceptions\=>()}
+org.eclipse.cdt.codan.internal.checkers.CircularReferenceProblem=-Error
+org.eclipse.cdt.codan.internal.checkers.CircularReferenceProblem.params={launchModes\=>{RUN_ON_FULL_BUILD\=>false,RUN_ON_INC_BUILD\=>false,RUN_AS_YOU_TYPE\=>true,RUN_ON_DEMAND\=>true}}
+org.eclipse.cdt.codan.internal.checkers.FieldResolutionProblem=-Error
+org.eclipse.cdt.codan.internal.checkers.FieldResolutionProblem.params={launchModes\=>{RUN_ON_FULL_BUILD\=>false,RUN_ON_INC_BUILD\=>false,RUN_AS_YOU_TYPE\=>true,RUN_ON_DEMAND\=>true}}
+org.eclipse.cdt.codan.internal.checkers.FunctionResolutionProblem=-Error
+org.eclipse.cdt.codan.internal.checkers.FunctionResolutionProblem.params={launchModes\=>{RUN_ON_FULL_BUILD\=>false,RUN_ON_INC_BUILD\=>false,RUN_AS_YOU_TYPE\=>true,RUN_ON_DEMAND\=>true}}
+org.eclipse.cdt.codan.internal.checkers.InvalidArguments=-Error
+org.eclipse.cdt.codan.internal.checkers.InvalidArguments.params={launchModes\=>{RUN_ON_FULL_BUILD\=>false,RUN_ON_INC_BUILD\=>false,RUN_AS_YOU_TYPE\=>true,RUN_ON_DEMAND\=>true}}
+org.eclipse.cdt.codan.internal.checkers.InvalidTemplateArgumentsProblem=-Error
+org.eclipse.cdt.codan.internal.checkers.InvalidTemplateArgumentsProblem.params={launchModes\=>{RUN_ON_FULL_BUILD\=>false,RUN_ON_INC_BUILD\=>false,RUN_AS_YOU_TYPE\=>true,RUN_ON_DEMAND\=>true}}
+org.eclipse.cdt.codan.internal.checkers.LabelStatementNotFoundProblem=-Error
+org.eclipse.cdt.codan.internal.checkers.LabelStatementNotFoundProblem.params={launchModes\=>{RUN_ON_FULL_BUILD\=>false,RUN_ON_INC_BUILD\=>false,RUN_AS_YOU_TYPE\=>true,RUN_ON_DEMAND\=>true}}
+org.eclipse.cdt.codan.internal.checkers.MemberDeclarationNotFoundProblem=-Error
+org.eclipse.cdt.codan.internal.checkers.MemberDeclarationNotFoundProblem.params={launchModes\=>{RUN_ON_FULL_BUILD\=>false,RUN_ON_INC_BUILD\=>false,RUN_AS_YOU_TYPE\=>true,RUN_ON_DEMAND\=>true}}
+org.eclipse.cdt.codan.internal.checkers.MethodResolutionProblem=-Error
+org.eclipse.cdt.codan.internal.checkers.MethodResolutionProblem.params={launchModes\=>{RUN_ON_FULL_BUILD\=>false,RUN_ON_INC_BUILD\=>false,RUN_AS_YOU_TYPE\=>true,RUN_ON_DEMAND\=>true}}
+org.eclipse.cdt.codan.internal.checkers.NamingConventionFunctionChecker=-Info
+org.eclipse.cdt.codan.internal.checkers.NamingConventionFunctionChecker.params={pattern\=>"^[a-z]",macro\=>true,exceptions\=>()}
+org.eclipse.cdt.codan.internal.checkers.NonVirtualDestructorProblem=Warning
+org.eclipse.cdt.codan.internal.checkers.NonVirtualDestructorProblem.params={}
+org.eclipse.cdt.codan.internal.checkers.OverloadProblem=-Error
+org.eclipse.cdt.codan.internal.checkers.OverloadProblem.params={launchModes\=>{RUN_ON_FULL_BUILD\=>false,RUN_ON_INC_BUILD\=>false,RUN_AS_YOU_TYPE\=>true,RUN_ON_DEMAND\=>true}}
+org.eclipse.cdt.codan.internal.checkers.RedeclarationProblem=-Error
+org.eclipse.cdt.codan.internal.checkers.RedeclarationProblem.params={launchModes\=>{RUN_ON_FULL_BUILD\=>false,RUN_ON_INC_BUILD\=>false,RUN_AS_YOU_TYPE\=>true,RUN_ON_DEMAND\=>true}}
+org.eclipse.cdt.codan.internal.checkers.RedefinitionProblem=-Error
+org.eclipse.cdt.codan.internal.checkers.RedefinitionProblem.params={launchModes\=>{RUN_ON_FULL_BUILD\=>false,RUN_ON_INC_BUILD\=>false,RUN_AS_YOU_TYPE\=>true,RUN_ON_DEMAND\=>true}}
+org.eclipse.cdt.codan.internal.checkers.ReturnStyleProblem=-Warning
+org.eclipse.cdt.codan.internal.checkers.ReturnStyleProblem.params={}
+org.eclipse.cdt.codan.internal.checkers.ScanfFormatStringSecurityProblem=-Warning
+org.eclipse.cdt.codan.internal.checkers.ScanfFormatStringSecurityProblem.params={}
+org.eclipse.cdt.codan.internal.checkers.StatementHasNoEffectProblem=Warning
+org.eclipse.cdt.codan.internal.checkers.StatementHasNoEffectProblem.params={macro\=>true,exceptions\=>()}
+org.eclipse.cdt.codan.internal.checkers.SuggestedParenthesisProblem=Warning
+org.eclipse.cdt.codan.internal.checkers.SuggestedParenthesisProblem.params={paramNot\=>false}
+org.eclipse.cdt.codan.internal.checkers.SuspiciousSemicolonProblem=Warning
+org.eclipse.cdt.codan.internal.checkers.SuspiciousSemicolonProblem.params={else\=>false,afterelse\=>false}
+org.eclipse.cdt.codan.internal.checkers.TypeResolutionProblem=-Error
+org.eclipse.cdt.codan.internal.checkers.TypeResolutionProblem.params={launchModes\=>{RUN_ON_FULL_BUILD\=>false,RUN_ON_INC_BUILD\=>false,RUN_AS_YOU_TYPE\=>true,RUN_ON_DEMAND\=>true}}
+org.eclipse.cdt.codan.internal.checkers.UnusedFunctionDeclarationProblem=Warning
+org.eclipse.cdt.codan.internal.checkers.UnusedFunctionDeclarationProblem.params={macro\=>true}
+org.eclipse.cdt.codan.internal.checkers.UnusedStaticFunctionProblem=Warning
+org.eclipse.cdt.codan.internal.checkers.UnusedStaticFunctionProblem.params={macro\=>true}
+org.eclipse.cdt.codan.internal.checkers.UnusedVariableDeclarationProblem=Warning
+org.eclipse.cdt.codan.internal.checkers.UnusedVariableDeclarationProblem.params={macro\=>true,exceptions\=>("@(\#)","$Id")}
+org.eclipse.cdt.codan.internal.checkers.VariableResolutionProblem=-Error
+org.eclipse.cdt.codan.internal.checkers.VariableResolutionProblem.params={launchModes\=>{RUN_ON_FULL_BUILD\=>false,RUN_ON_INC_BUILD\=>false,RUN_AS_YOU_TYPE\=>true,RUN_ON_DEMAND\=>true}}
+useParentScope=false
--- a/vtm/assets/styles/carto.xml
+++ b/vtm/assets/styles/carto.xml
@@ -0,0 +1,712 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<rendertheme xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+  map-background="#fffcfa" version="1" xmlns="http://mapsforge.org/renderTheme"
+  xsi:schemaLocation="http://mapsforge.org/renderTheme ../renderTheme.xsd"> <!-- fdfdfc"> -->
+  <style-text name="road" fill="#101010" font-size="16" k="name" priority="2"
+    stroke="#eeeeee" stroke-width="2.0" />
+  <style-text name="major-road" fill="#101010" font-size="16" font-style="bold"
+    k="name" priority="1" stroke="#eeeeee" stroke-width="2.0" />
+  <!-- <style-area name="residential" fill="#e0dfde" fade="10"/> -->
+  <style-area name="residential" fade="10" fill="#e8e7e3" />
+  <style-area name="railway|industrial" fade="10" fill="#e6e3e5" />
+  <!-- "#f0fae7" mint green -->
+  <!-- <style-area name="farmland" fill="#fff8bf" fade="11" /> -->
+  <!-- <style-area name="farmland" fill="#f1ebb2" fade="11" /> -->
+  <style-area name="farmland" fade="11" fill="#e7dab5" />
+  <!-- fade out at z=7, blend over to 'blend-fill' in z=11 -->
+  <!-- <style-area name="forest|wood" fill="#ebefe5" fade="7" blend="11"
+    blend-fill="#cee0bc"/> d3dec8 -->
+  <style-area name="forest|wood" blend="10" blend-fill="#9ac56e" fade="7" fill="#d1dbc7" />
+  <!-- grass|meadow|garden|grassland|scrub -->
+  <style-area name="greens" fade="10" fill="#c9dc91" />
+  <!-- <style-area name="greens" fill="#d2e5ce" fade="10" /> -->
+  <!-- marsh|wetland|nature_reserve -->
+  <style-area name="greens2" fade="12" fill="#deecb9" />
+  <!-- park|common|green|cemetery|golf_course|dog_park -->
+  <style-area name="park" fade="11" fill="#a3ca7b" />
+  <!-- de:Kleingartengebiet -->
+  <style-area name="allotments" fade="12" fill="#efeae0" />
+  <!-- de:Steinbruch, Schotter-, Kies-, Sand- und Tongrube -->
+  <style-area name="quarry" fade="10" fill="#ddddcc" />
+  <style-area name="military" fade="10" fill="#eeedea" />
+  <style-line name="residential" stroke="#ffffff" width="1.3" />
+  <style-line name="residential:bridge" cap="square" from="residential" />
+  <!-- when inheriting another style with 'from' then 'witdth' is meant relative
+    to the parent -->
+  <style-line name="pedestrian" from="residential" width="-0.4" />
+  <style-line name="pedestrian:bridge" cap="square" from="pedestrian" />
+  <style-line name="highway:z11" stroke="#fcba5a" width="1.8" />
+  <!-- <style-line name="highway:z11:bridge" from="highway:z11" cap="butt"
+    /> -->
+  <style-line name="trunk_link" cap="butt" stroke="#fee16e" width="1.3" />
+  <style-line name="trunk" stroke="#fedb52" width="1.6" />
+  <style-line name="primary:z11" stroke="#fdeb05" width="1.5" />
+  <style-line name="secondary:z11" from="primary:z11" width="-0.1" />
+  <style-line name="tertiary" from="residential" stroke="#fefefa" width="0.2" />
+  <style-line name="construction" stroke="#e0e0e0" width="1.2" />
+  <style-line name="highway-service" from="residential" width="-0.6" />
+  <!-- track|footway|path|cycleway -->
+  <style-line name="footway" cap="butt" fix="true" stipple="4"
+    stipple-stroke="#d35c48" stipple-width="0.6" stroke="#aaffffff" width="1.8" />
+  <style-line name="highway:cycleway" from="footway" stipple-stroke="#4040ee"
+    width="0.1" />
+  <style-line name="highway:track" from="footway" stipple="4" stipple-stroke="#a39b68"
+    width="0.1" />
+  <style-line name="highway:path" from="footway" stipple="4" stipple-stroke="#837b58"
+    width="0.1" />
+  <!-- <style-line name="footway:z16" from="footway" width="-0.95" fixed="false"
+    fade="-1"/> -->
+  <style-line name="footway:z17" stroke="#faf8f5" width="0.3" />
+  <!-- de: ein Weg der für Reiter vorgeshen ist.. -->
+  <style-line name="bridleway" cap="butt" from="footway" stipple-stroke="#837b58"
+    stroke="#d3cb98" width="0.1" />
+  <style-line name="steps" cap="butt" fix="true" stipple="2" stipple-stroke="#be6253"
+    stipple-width="1.0" stroke="#aaffffff" width="4.2" />
+  <style-line name="water:outline" cap="butt" fix="true" stroke="#a4bbcc"
+    width="1.0" />
+  <style-line name="water" cap="butt" stroke="#afc5e3" width="1.0" />
+  <!-- <style-area name="water" fill="#97b7e5" /> -->
+  <style-area name="water" fill="#afc5e3" />
+  <!-- no-go area boundary -->
+  <style-line name="fence" cap="butt" fix="true" stroke="#444444" width="1.2" />
+  <style-line name="aeroway:runway" cap="butt" stroke="#c8ccbe" width="1.8" />
+  <!-- <style-line name="building" stroke="#c9c3c1" width="1.0" fix="true"
+    cap="butt" fade="15"/> -->
+  <!--
+    <style-line name="building" stroke="#d0cec8" width="1.0" fix="true"
+    cap="butt" fade="15"/>
+    <style-area name="building" fill="#e9e6e3" fade="15"/>
+  -->
+  <style-line name="building" cap="butt" fade="15" fix="true" stroke="#b7b6b3"
+    width="1.0" />
+  <!-- <style-area name="building" fill="#eae8e6" fade="15"/> -->
+  <style-area name="building" fade="15" fill="#f2f0eb" />
+  <!-- ways -->
+  <m e="way">
+    <!-- landuse base -->
+    <m k="landuse">
+
+      <m v="industrial|railway">
+        <use-area name="railway|industrial" />
+      </m>
+
+      <m v="school">
+        <!-- <area fill="#cdabde" /> -->
+        <area fade="15" fill="#cdbbca" />
+        <line cap="butt" fade="15" fix="true" stroke="#9aabae" width="1.0" />
+      </m>
+
+      <m v="hospital">
+        <area fill="#e6e4c5" />
+      </m>
+
+      <m v="parking">
+        <area fill="#f4f4f4" stroke="#d4d4d4" stroke-width="0.2" />
+      </m>
+
+      <m v="cemetery">
+        <use-area name="park" />
+      </m>
+
+      <m v="park">
+        <use-area name="park" />
+      </m>
+
+      <!-- Heideland, keep below forest -->
+      <m v="sand" zoom-min="11">
+        <area fade="11" fill="#fffad1" />
+      </m>
+
+      <m v="wood">
+        <use-area name="forest|wood" />
+      </m>
+
+      <m v="pitch">
+        <area fill="#f4f4de" />
+        <line cap="butt" fix="true" stroke="#d9d9a3" width="1.0" />
+      </m>
+      <m v="swimming_pool">
+        <area fill="#d4ebfc" stroke="#6060ff" stroke-width="0.2" />
+      </m>
+
+    </m>
+
+    <m k="water">
+      <use-area name="water" />
+      <!-- <use-line name="water:outline"/> -->
+    </m>
+
+    <!-- waterways -->
+    <m k="waterway">
+      <m k="type" v="ditch|drain">
+        <use-line name="water" fix="true" width="0.1" />
+      </m>
+      <m k="type" v="canal">
+        <use-line name="water" width="-0.2" />
+      </m>
+      <m k="type" v="stream">
+        <use-line name="water" fix="true" width="0.2" />
+      </m>
+      <m k="type" v="river">
+        <m zoom-min="12">
+          <use-line name="water" width="0.3" />
+        </m>
+        <m zoom-max="11">
+          <use-line name="water" fade="7" fix="true" width="0.3" />
+        </m>
+      </m>
+    </m>
+
+
+    <!-- outline 0 -->
+    <style-outline name="glow" blur="1.0" stroke="#000000" width="0.2" />
+    <style-outline name="0" stroke="#44000000" width="0.1" />
+    <!-- tunnel -->
+
+    <m k="tunnel" v="yes" zoom-min="11">
+      <!-- highway tunnels -->
+
+      <m zoom-min="16">
+        <m v="steps">
+          <use-line name="steps" />
+          <!-- <use-outline name="0"/> -->
+        </m>
+        <!--
+          <m v="track|footway|path|cycleway" zoom-min="16">
+          <use-line name="footway:z16"/>
+          </m>
+        -->
+      </m>
+      <m zoom-min="14">
+        <m v="footway">
+          <use-line name="footway" />
+        </m>
+        <m v="cycleway">
+          <use-line name="highway:cycleway" />
+        </m>
+        <m v="track">
+          <use-line name="highway:track" />
+        </m>
+        <m v="path">
+          <use-line name="highway:path" />
+        </m>
+        <m v="bridleway">
+          <use-line name="bridleway" />
+        </m>
+        <m v="construction">
+          <use-line name="construction" />
+          <use-outline name="0" />
+        </m>
+        <m v="service">
+          <m k="service" v="~|parking_aisle">
+            <use-line name="highway-service" />
+            <use-outline name="0" />
+          </m>
+        </m>
+      </m>
+      <m v="trunk_link|motorway_link">
+        <use-line name="trunk_link" />
+        <use-outline name="0" />
+        <use-text name="major-road" />
+      </m>
+      <m zoom-min="13">
+        <m v="byway|pedestrian">
+          <use-line name="pedestrian" />
+          <use-outline name="0" />
+          <use-text name="road" />
+        </m>
+        <m v="residential|road|unclassified|living_street">
+          <use-line name="residential" />
+          <use-outline name="0" />
+          <use-text name="road" />
+        </m>
+      </m>
+      <m v="tertiary|secondary_link">
+        <use-line name="tertiary" />
+        <use-outline name="0" />
+        <use-text name="road" />
+      </m>
+      <m v="secondary|primary_link">
+        <use-line name="secondary:z11" />
+        <use-outline name="0" />
+        <use-text name="major-road" />
+      </m>
+      <m v="primary">
+        <use-line name="primary:z11" />
+        <use-outline name="0" />
+        <use-text name="major-road" />
+      </m>
+      <m v="trunk">
+        <use-line name="trunk" blur="0.3" />
+        <use-outline name="0" />
+        <!-- <use-outline name="glow"/> -->
+        <use-text name="major-road" />
+      </m>
+      <m v="motorway">
+        <use-line name="highway:z11" blur="0.3" />
+        <use-outline name="0" />
+        <!-- <use-outline name="glow"/> -->
+        <use-text name="major-road" />
+      </m>
+
+      <!-- railway tunnel -->
+      <m k="railway">
+        <!--
+          <m k="railway" v="tram|subway|light_rail|narrow_gauge">
+          <line stroke="#a0a0a0" width="0.8" cap="butt" fix="true"/>
+          </m>
+        -->
+        <m k="railway" v="rail">
+          <line cap="butt" fix="true" stroke="#aa888888" width="0.9" />
+        </m>
+      </m>
+    </m> <!-- end tunnel -->
+    <!-- platform cores -->
+    <m k="highway|railway|public_transport" v="platform">
+      <m closed="yes">
+        <area fill="#dbdbc9" />
+      </m>
+      <m closed="no">
+        <line stroke="#dbdbc9" width="0.3" />
+      </m>
+    </m>
+    <!-- runways areas -->
+    <m k="aeroway">
+      <m closed="yes" v="aerodrome">
+        <area fill="#e8ecde" />
+      </m>
+      <!-- A place where planes are parked -->
+      <m v="apron">
+        <area fill="#f0f0f0" />
+      </m>
+      <!-- TODO taxiway, helipad, runway -->
+    </m>
+
+    <!-- turning circles -->
+    <!--
+      <m k="highway" v="turning_circle"> <circle r="1.5" scale-radius="true"
+      fill="#707070" />
+      </m>
+    -->
+    <!-- building -->
+    <m k="building">
+      <m zoom-max="16" zoom-min="14">
+        <use-area name="building" fade="14" />
+        <use-line name="building" fade="14" />
+        <!--
+          <line stroke="#c9c3c1" width="1.0" fix="true" cap="butt" fade="15"/>
+          <area fill="#e9e6e3" fade="15" />
+        -->
+      </m>
+      <m zoom-min="17">
+        <caption fill="#4040ff" font-size="10" font-style="bold" k="name" stroke="#ffffff"
+          stroke-width="2.0" />
+        <caption fill="#606060" font-size="10" font-style="bold" k="addr:housenumber"
+          stroke="#ffffff" stroke-width="2.0" />
+      </m>
+    </m>
+
+    <!-- outline 1 - 4 -->
+    <style-outline name="1" stroke="#aa807040" width="0.1" />
+    <style-outline name="2" stroke="#c0c0c0" width="0.1" />
+    <style-outline name="primary" stroke="#aa7f7700" width="0.1" />
+    <style-outline name="motorway" stroke="#aa805f2e" width="0.1" />
+
+    <m zoom-max="10">
+
+      <m v="main">
+        <!-- <line cap="butt" fade="5" fix="true" stroke="#e2cf5d" width="1.5" /> -->
+        <line cap="butt" fade="8" fix="true" stroke="#c6c5a2" width="1.3" />
+      </m>
+
+      <m v="motorway">
+        <line cap="butt" fade="6" fix="true" stroke="#deb683" width="1.5" />
+      </m>
+
+      <!-- <m k="class" v="-main|motorway">
+        <line cap="butt" fix="true" stroke="#00ff00" width="1.8" />
+        </m>
+      -->
+
+    </m>
+
+    <m zoom-min="11">
+
+      <m zoom-min="14">
+        <m v="footway">
+          <use-line name="footway" />
+        </m>
+        <m v="cycleway">
+          <use-line name="highway:cycleway" />
+        </m>
+        <m v="track">
+          <use-line name="highway:track" />
+        </m>
+        <m v="path">
+          <use-line name="highway:path" />
+        </m>
+        <m v="bridleway">
+          <use-line name="bridleway" />
+        </m>
+        <m v="construction">
+          <use-line name="construction" />
+          <use-outline name="1" />
+        </m>
+        <m v="service">
+          <m k="service" v="-|parking_aisle">
+            <use-line name="highway-service" />
+            <use-outline name="1" />
+          </m>
+          <m k="service" v="parking_aisle" zoom-min="16">
+            <use-line name="highway-service" width="-0.4" />
+            <use-outline name="1" />
+          </m>
+        </m>
+      </m>
+
+      <m v="trunk_link|motorway_link">
+        <use-line name="trunk_link" />
+        <use-outline name="motorway" />
+        <use-text name="major-road" />
+      </m>
+
+      <m zoom-min="13">
+        <m v="byway|pedestrian">
+          <use-line name="residential" width="-0.4" />
+          <use-outline name="1" />
+          <use-text name="road" />
+        </m>
+        <m v="street|street_limited">
+          <use-line name="residential" />
+          <use-outline name="1" />
+          <use-text name="road" />
+        </m>
+      </m>
+
+      <m v="tertiary|secondary_link">
+        <use-line name="tertiary" />
+        <use-outline name="1" />
+        <use-text name="road" />
+      </m>
+      <m v="secondary|primary_link">
+        <!-- <line stroke="#fff939" width="1.6" /> -->
+        <use-line name="secondary:z11" />
+        <use-outline name="primary" />
+        <use-text name="major-road" />
+      </m>
+      <m v="main">
+        <use-line name="primary:z11" />
+        <use-outline name="primary" />
+        <use-text name="major-road" />
+      </m>
+      <m v="trunk">
+        <use-line name="trunk" />
+        <use-outline name="motorway" />
+        <use-text name="major-road" />
+      </m>
+      <m v="motorway">
+        <use-line name="highway:z11" />
+        <use-outline name="motorway" />
+        <use-text name="major-road" />
+      </m>
+
+      <m k="bridge" v="yes">
+        <style-outline name="bridge" stroke="#aa202020" width="0.08" />
+        <m zoom-min="16">
+          <m v="steps">
+            <use-line name="steps" />
+            <!-- <use-outline name="bridge"/> -->
+          </m>
+        </m>
+        <m v="track|footway|path|cycleway" zoom-min="15">
+          <use-line name="footway:z17" cap="butt" />
+          <use-outline name="bridge" />
+        </m>
+        <m zoom-min="14">
+          <m v="footway">
+            <use-line name="footway" />
+          </m>
+          <m v="cycleway">
+            <use-line name="highway:cycleway" />
+          </m>
+          <m v="track">
+            <use-line name="highway:track" />
+          </m>
+          <m v="path">
+            <use-line name="highway:path" />
+          </m>
+          <m v="bridleway">
+            <use-line name="bridleway" />
+          </m>
+          <m v="construction">
+            <use-line name="construction" cap="square" />
+            <use-outline name="bridge" />
+          </m>
+          <m v="service">
+            <use-line name="highway-service" cap="square" />
+            <use-outline name="bridge" />
+          </m>
+        </m>
+
+        <m v="byway|pedestrian">
+          <use-line name="pedestrian:bridge" />
+          <use-outline name="bridge" />
+          <use-text name="road" />
+        </m>
+
+        <m v="street|street_limited">
+          <use-line name="residential:bridge" />
+          <use-outline name="bridge" />
+          <use-text name="road" />
+        </m>
+
+        <m v="main">
+          <use-line name="primary:z11" cap="square" />
+          <use-outline name="bridge" />
+          <use-text name="major-road" />
+        </m>
+
+        <m v="motorway">
+          <use-line name="highway:z11" cap="square" />
+          <use-outline name="bridge" />
+          <use-text name="major-road" />
+        </m>
+      </m> <!-- end bridge=yes -->
+    </m> <!-- end zoom-min=11 -->
+
+
+    <!-- runways cores -->
+    <m k="aeroway">
+      <m v="runway">
+        <use-line name="aeroway:runway" />
+      </m>
+      <m v="taxiway">
+        <use-line name="aeroway:runway" width="-0.8" />
+      </m>
+    </m>
+    <!-- man_made features -->
+    <!--
+      <m k="man_made" v="pier">
+      <m closed="no">
+      <line stroke="#d0d0d0" width="0.4" cap="butt" />
+      <line stroke="#e4e4e4" width="0.3" cap="butt" />
+      </m>
+      <m closed="yes">
+      <area fill="#e4e4e4" stroke="#d0d0d0" stroke-width="0.05" />
+      </m>
+      </m>
+    -->
+    <!-- barriers -->
+    <m k="barrier">
+      <!--
+        <m v="fence|wall|city_wall" zoom-min="15"> <line
+        stroke="#909090" width="0.1" cap="butt" /> </m>
+      -->
+      <m v="retaining_wall" zoom-min="15">
+        <line cap="butt" fix="true" stroke="#888888" width="1.1" />
+      </m>
+    </m>
+    <!-- non-physical routes -->
+    <!--
+      <m k="route" v="ferry"> <line stroke="#707070" width="0.3"
+      stroke-dasharray="15,10" cap="butt" /> </m>
+    -->
+    <!-- aerial ways -->
+    <!--
+      <m k="aerialway"> <line stroke="#202020" width="0.4"
+      cap="butt" /> <m k="aerialway" v="cable_car"> <lineSymbol
+      src="jar:/org/mapsforge/android/maps/rendertheme/osmarender/symbols/cable_car.png"
+      /> </m> <m k="aerialway" v="chair_lift"> <lineSymbol
+      src="jar:/org/mapsforge/android/maps/rendertheme/osmarender/symbols/chair_lift_2.png"
+      /> </m> <m k="aerialway" v="gondola"> <lineSymbol src="jar:/org/mapsforge/android/maps/rendertheme/osmarender/symbols/gondola.png"
+      /> </m> <m zoom-min="14"> <text k="name"
+      font-style="bold"
+      font-size="10" fill="#606060" stroke="#ffffff" width="2.0" /> </m>
+      </m>
+    -->
+    <!-- railway (no tunnel) -->
+    <m k="road" zoom-min="12">
+      <m k="railway" v="station">
+        <area fill="#dbdbc9" stroke="#707070" stroke-width="0.3" />
+      </m>
+      <!-- railway bridge casings -->
+      <m zoom-min="14">
+        <m k="bridge" v="yes|true">
+          <m k="railway" v="tram">
+            <line cap="butt" fix="true" stroke="#777777" width="0.9" />
+          </m>
+          <m k="railway" v="subway|light_rail|narrow_gauge">
+            <line cap="butt" fix="true" stroke="#777777" width="0.9" />
+          </m>
+          <m k="railway" v="rail">
+            <line cap="butt" fix="true" stroke="#777777" width="0.9" />
+          </m>
+        </m>
+      </m>
+      <!-- railway casings and cores -->
+      <m k="railway" v="tram" zoom-min="15">
+        <line fix="true" stroke="#887766" width="1.0" />
+      </m>
+      <m k="railway" v="light_rail|subway|narrow_gauge" zoom-min="14">
+        <line cap="butt" fix="true" stroke="#a0a0a0" width="0.9" />
+      </m>
+      <m k="class" v="major_rail" zoom-max="13">
+        <line cap="butt" fade="12" fix="true" stroke="#ddaa9988" width="1.0" />
+      </m>
+      <m k="class" v="major_rail" zoom-min="14">
+        <line cap="butt" fade="12" fix="true" stipple="10" stipple-stroke="#ffffff"
+          stipple-width="0.8" stroke="#aaa6a4" width="2.0" />
+      </m>
+      <!--
+        <m k="railway" v="rail" zoom-max="14" zoom-min="13">
+        <line stroke="#8888aa" width="0.6" cap="butt"
+        fix="true" />
+        </m>
+      -->
+      <!--
+        <m k="railway" v="rail" zoom-max="13" zoom-min="11">
+        <line stroke="#bbbbcc" width="0.8" cap="butt" fix="true" />
+        </m>
+      -->
+      <!-- whatever railway:spur means ... -->
+      <m k="railway" v="disused|spur|abandoned|preserved">
+        <line cap="butt" fade="12" fix="true" stroke="#cccccc" width="0.8" />
+      </m>
+    </m>
+    <!-- non-physical boundaries -->
+    <!--
+      <m k="boundary"> <m k="boundary" v="national_park">
+      <line stroke="#4ef94b" width="0.25" stroke-dasharray="15, 5, 5, 5"
+      />
+    -->
+    <m k="boundary" v="national_park">
+      <area fill="#d7e6b0" />
+    </m>
+
+    <m k="admin" v="yes">
+      <m k="admin_level">
+
+        <m k="admin_level" v="4">
+          <line cap="butt" fix="true" stroke="#afa0dd" width="1.0" />
+        </m>
+        <m k="admin_level" v="3">
+          <line cap="butt" fix="true" stroke="#0000ff" width="0.95" />
+        </m>
+        <m k="admin_level" v="2">
+          <line cap="butt" fix="true" stroke="#808080" width="1.0" />
+          <!-- stipple-width="1.0" stipple="4" stipple-stroke="#606060"/> -->
+        </m>
+      </m>
+    </m>
+
+
+    <m k="debug" v="area">
+      <line cap="butt" fix="true" stroke="#ff0000" width="1.2" />
+      <area fill="#880000ff" />
+      <caption fill="#ff0000" font-size="15" k="name" stroke="#444444"
+        stroke-width="2.0" />
+    </m>
+    <m k="debug" v="way">
+      <line cap="butt" fix="true" stroke="#00ffff" width="1.5" />
+      <caption fill="#00ffff" font-size="15" k="name" stroke="#444444"
+        stroke-width="2.0" />
+    </m>
+    <m k="debug" v="box">
+      <line cap="butt" fix="true" stroke="#000000" width="1.5" />
+    </m>
+
+
+
+  </m>
+
+
+
+  <m e="node">
+    <!-- barrier -->
+    <m k="barrier" v="bollard">
+      <circle fill="#909090" r="1.5" />
+    </m>
+    <m k="debug">
+      <caption fill="#0000ff" font-size="16" k="name" />
+    </m>
+    <!-- highway -->
+    <!--
+      <m k="highway"> <m k="highway" v="turning_circle">
+      <circle r="1.4" scale-radius="true" fill="#ffffff" /> </m> </m>
+    -->
+    <!-- historic -->
+    <!--
+      <m k="historic"> <circle r="3" fill="#4040ff" stroke="#606060"
+      width="1.5" /> <m zoom-min="17"> <caption
+      k="name" dy="-10" font-style="bold" font-size="10" fill="#4040ff" stroke="#ffffff"
+      width="2.0" /> </m> </m>
+    -->
+    <!-- house numbers -->
+    <!--
+      <m k="addr:housenumber" zoom-min="18"> <caption
+      k="addr:housenumber" font-style="bold" font-size="10" fill="#606060"
+      stroke="#ffffff"
+      width="2.0" /> </m>
+    -->
+    <!-- place -->
+    <m k="place_label">
+      <m v="suburb" zoom-max="14">
+        <caption fill="#606060" font-size="17" font-style="italic" k="name"
+          priority="4" stroke="#ffffff" stroke-width="2.0" />
+      </m>
+      <m v="village" zoom-max="14">
+        <caption fill="#2020cc" font-size="17" k="name" priority="3" stroke="#ffffff"
+          stroke-width="2.0" />
+      </m>
+      <m v="island" zoom-min="10">
+        <caption fill="#000000" font-size="20" font-style="bold" k="name"
+          priority="1" stroke="#ffffff" stroke-width="2.0" />
+      </m>
+      <m v="town">
+        <caption fill="#000000" font-size="19" k="name" priority="2" stroke="#ffffff"
+          stroke-width="2.0" />
+      </m>
+      <m v="city">
+        <caption fill="#000000" font-size="20" k="name" priority="1" stroke="#ffffff"
+          stroke-width="2.0" />
+      </m>
+    </m>
+    <m k="country_label">
+      <caption fill="#000000" font-size="20" font-style="bold" k="name" priority="0"
+        stroke="#ffffff" stroke-width="2.0" />
+    </m>
+
+    <!-- railway -->
+    <m k="railway">
+      <m v="station" zoom-min="14">
+        <circle fill="#ec2d2d" r="6" stroke="#606060" stroke-width="1.5" />
+        <!--
+          <caption k="name" dy="-10" font-style="bold" font-size="13" fill="#ec2d2d"
+          stroke="#ffffff" stroke-width="2.0" />
+        -->
+      </m>
+      <m v="halt|tram_stop" zoom-min="17">
+        <circle fill="#ec2d2d" r="4" stroke="#606060" stroke-width="1.5" />
+        <!--
+          <caption k="name" dy="-15" font-style="bold" font-size="11" fill="#ec2d2d"
+          stroke="#ffffff" stroke-width="2.0" />
+        -->
+      </m>
+    </m>
+    <!-- aeroway -->
+    <m k="aeroway">
+      <m k="aeroway" v="helipad" zoom-min="17">
+        <symbol src="jar:symbols/helipad.png" />
+      </m>
+      <m k="aeroway" v="aerodrome|airport" zoom-max="13">
+        <symbol src="jar:symbols/airport.png" />
+      </m>
+    </m>
+
+    <m k="building_label" zoom-min="14">
+        <caption fill="#1d2e6f" font-size="14" style="italic" k="name" priority="20"
+        stroke="#9daeef" stroke-width="0.8" />
+    </m>
+
+  </m>
+</rendertheme>
--- a/vtm/assets/styles/default.xml
+++ b/vtm/assets/styles/default.xml
--- a/vtm/assets/styles/maki.png
+++ b/vtm/assets/styles/maki.png
--- a/vtm/assets/styles/osmarender.xml
+++ b/vtm/assets/styles/osmarender.xml
--- a/vtm/assets/styles/symbols/airport.png
+++ b/vtm/assets/styles/symbols/airport.png
--- a/vtm/assets/styles/symbols/alpine_hut.png
+++ b/vtm/assets/styles/symbols/alpine_hut.png
--- a/vtm/assets/styles/symbols/atm.png
+++ b/vtm/assets/styles/symbols/atm.png
--- a/vtm/assets/styles/symbols/bakery.png
+++ b/vtm/assets/styles/symbols/bakery.png
--- a/vtm/assets/styles/symbols/bank.png
+++ b/vtm/assets/styles/symbols/bank.png
--- a/vtm/assets/styles/symbols/bench.png
+++ b/vtm/assets/styles/symbols/bench.png
--- a/vtm/assets/styles/symbols/bicycle_rental.png
+++ b/vtm/assets/styles/symbols/bicycle_rental.png
--- a/vtm/assets/styles/symbols/bus.png
+++ b/vtm/assets/styles/symbols/bus.png
--- a/vtm/assets/styles/symbols/bus_sta.png
+++ b/vtm/assets/styles/symbols/bus_sta.png
--- a/vtm/assets/styles/symbols/cable_car.png
+++ b/vtm/assets/styles/symbols/cable_car.png
--- a/vtm/assets/styles/symbols/cafe.png
+++ b/vtm/assets/styles/symbols/cafe.png
--- a/vtm/assets/styles/symbols/campSite.png
+++ b/vtm/assets/styles/symbols/campSite.png
--- a/vtm/assets/styles/symbols/cave_entrance.png
+++ b/vtm/assets/styles/symbols/cave_entrance.png
--- a/vtm/assets/styles/symbols/chair_lift_2.png
+++ b/vtm/assets/styles/symbols/chair_lift_2.png
--- a/vtm/assets/styles/symbols/church.png
+++ b/vtm/assets/styles/symbols/church.png
--- a/vtm/assets/styles/symbols/cinema.png
+++ b/vtm/assets/styles/symbols/cinema.png
--- a/vtm/assets/styles/symbols/drinking_water.png
+++ b/vtm/assets/styles/symbols/drinking_water.png
--- a/vtm/assets/styles/symbols/fastfood.png
+++ b/vtm/assets/styles/symbols/fastfood.png
--- a/vtm/assets/styles/symbols/firebrigade.png
+++ b/vtm/assets/styles/symbols/firebrigade.png
--- a/vtm/assets/styles/symbols/florist.png
+++ b/vtm/assets/styles/symbols/florist.png
--- a/vtm/assets/styles/symbols/fountain.png
+++ b/vtm/assets/styles/symbols/fountain.png
--- a/vtm/assets/styles/symbols/gondola.png
+++ b/vtm/assets/styles/symbols/gondola.png
--- a/vtm/assets/styles/symbols/helipad.png
+++ b/vtm/assets/styles/symbols/helipad.png
--- a/vtm/assets/styles/symbols/hospital.png
+++ b/vtm/assets/styles/symbols/hospital.png
--- a/vtm/assets/styles/symbols/hostel.png
+++ b/vtm/assets/styles/symbols/hostel.png
--- a/vtm/assets/styles/symbols/hotel.png
+++ b/vtm/assets/styles/symbols/hotel.png
--- a/vtm/assets/styles/symbols/information.png
+++ b/vtm/assets/styles/symbols/information.png
--- a/vtm/assets/styles/symbols/kindergarten.png
+++ b/vtm/assets/styles/symbols/kindergarten.png
--- a/vtm/assets/styles/symbols/library.png
+++ b/vtm/assets/styles/symbols/library.png
--- a/vtm/assets/styles/symbols/mosque.png
+++ b/vtm/assets/styles/symbols/mosque.png
--- a/vtm/assets/styles/symbols/oneway.png
+++ b/vtm/assets/styles/symbols/oneway.png
--- a/vtm/assets/styles/symbols/parking.png
+++ b/vtm/assets/styles/symbols/parking.png
--- a/vtm/assets/styles/symbols/peak.png
+++ b/vtm/assets/styles/symbols/peak.png
--- a/vtm/assets/styles/symbols/petrolStation.png
+++ b/vtm/assets/styles/symbols/petrolStation.png
--- a/vtm/assets/styles/symbols/pharmacy.png
+++ b/vtm/assets/styles/symbols/pharmacy.png
--- a/vtm/assets/styles/symbols/playground.png
+++ b/vtm/assets/styles/symbols/playground.png
--- a/vtm/assets/styles/symbols/postbox.png
+++ b/vtm/assets/styles/symbols/postbox.png
--- a/vtm/assets/styles/symbols/postoffice.png
+++ b/vtm/assets/styles/symbols/postoffice.png
--- a/vtm/assets/styles/symbols/pub.png
+++ b/vtm/assets/styles/symbols/pub.png
--- a/vtm/assets/styles/symbols/railway-crossing-small.png
+++ b/vtm/assets/styles/symbols/railway-crossing-small.png
--- a/vtm/assets/styles/symbols/railway-crossing.png
+++ b/vtm/assets/styles/symbols/railway-crossing.png
--- a/vtm/assets/styles/symbols/recycling.png
+++ b/vtm/assets/styles/symbols/recycling.png
--- a/vtm/assets/styles/symbols/restaurant.png
+++ b/vtm/assets/styles/symbols/restaurant.png
--- a/vtm/assets/styles/symbols/school.png
+++ b/vtm/assets/styles/symbols/school.png
--- a/vtm/assets/styles/symbols/shelter.png
+++ b/vtm/assets/styles/symbols/shelter.png
--- a/vtm/assets/styles/symbols/soccer-borderless.png
+++ b/vtm/assets/styles/symbols/soccer-borderless.png
--- a/vtm/assets/styles/symbols/supermarket.png
+++ b/vtm/assets/styles/symbols/supermarket.png
--- a/vtm/assets/styles/symbols/synagogue.png
+++ b/vtm/assets/styles/symbols/synagogue.png
--- a/vtm/assets/styles/symbols/telephone.png
+++ b/vtm/assets/styles/symbols/telephone.png
--- a/vtm/assets/styles/symbols/tennis.png
+++ b/vtm/assets/styles/symbols/tennis.png
--- a/vtm/assets/styles/symbols/theatre.png
+++ b/vtm/assets/styles/symbols/theatre.png
--- a/vtm/assets/styles/symbols/toilets.png
+++ b/vtm/assets/styles/symbols/toilets.png
--- a/vtm/assets/styles/symbols/traffic_signal.png
+++ b/vtm/assets/styles/symbols/traffic_signal.png
--- a/vtm/assets/styles/symbols/tree.png
+++ b/vtm/assets/styles/symbols/tree.png
--- a/vtm/assets/styles/symbols/university.png
+++ b/vtm/assets/styles/symbols/university.png
--- a/vtm/assets/styles/symbols/viewpoint.png
+++ b/vtm/assets/styles/symbols/viewpoint.png
--- a/vtm/assets/styles/symbols/vulcan.png
+++ b/vtm/assets/styles/symbols/vulcan.png
--- a/vtm/assets/styles/symbols/windmill.png
+++ b/vtm/assets/styles/symbols/windmill.png
--- a/vtm/assets/styles/tronrender.xml
+++ b/vtm/assets/styles/tronrender.xml
--- a/vtm/jni/Android.mk
+++ b/vtm/jni/Android.mk
@@ -0,0 +1,17 @@
+LOCAL_PATH:= $(call my-dir)
+include $(CLEAR_VARS)
+ 
+LOCAL_MODULE    := vtm-jni
+LOCAL_C_INCLUDES := . 
+ 
+LOCAL_CFLAGS := $(LOCAL_C_INCLUDES:%=-I%) -O2 -Wall -D__ANDROID__ -Wall -std=c99 -O2 -DTRILIBRARY -DREDUCED -DCDT_ONLY -DNO_TIMER
+LOCAL_CPPFLAGS := $(LOCAL_C_INCLUDES:%=-I%) -O2 -Wall -D__ANDROID__ -Wall -std=c99 -O2 -DTRILIBRARY -DREDUCED -DCDT_ONLY -DNO_TIMER
+LOCAL_LDLIBS := -lm -llog
+LOCAL_ARM_MODE  := arm
+ 
+LOCAL_SRC_FILES := gl/utils.c\
+	triangle/triangle_dbg.c\
+	triangle/TriangleJni.c\
+	triangle/triangle.c
+ 
+include $(BUILD_SHARED_LIBRARY)
--- a/vtm/jni/Application.mk
+++ b/vtm/jni/Application.mk
@@ -0,0 +1 @@
+APP_ABI := armeabi armeabi-v7a
--- a/vtm/jni/build-android32.xml
+++ b/vtm/jni/build-android32.xml
@@ -0,0 +1,33 @@
+<project name="android-natives" basedir="." default="postcompile">
+	<property environment="env" />
+	<!--  the suffix ndk-build executable -->	
+	<property name="ndkSuffix" value="" />
+
+	<target name="clean" depends="check-for-ndk" if="has-ndk-build">
+		<exec executable="${env.NDK_HOME}/ndk-build${ndkSuffix}" failonerror="true">
+			<arg value="clean"/>
+		</exec>
+	</target>
+
+	<target name="precompile" depends="check-for-ndk">
+		
+	</target>
+
+	<target name="compile-natives" depends="precompile" if="has-ndk-build">
+		<echo>ndk_home: ${env.NDK_HOME}</echo>
+		<exec executable="${env.NDK_HOME}/ndk-build${ndkSuffix}" failonerror="true"/>
+	</target>
+	
+	<target name="postcompile" depends="compile-natives">
+		
+	</target>
+
+	<target name="check-for-ndk">
+		<condition property="ndk-build-found">
+			<available file="ndk-build${ndkSuffix}" filepath="${env.NDK_HOME}"/>
+		</condition>
+		<condition property="has-ndk-build">
+			<equals arg1="${ndk-build-found}" arg2="true"/>
+		</condition>
+	</target>
+</project>
--- a/vtm/jni/build-linux64.xml
+++ b/vtm/jni/build-linux64.xml
@@ -0,0 +1,147 @@
+<project name="vtm-jni-Linux-64" basedir="." default="postcompile">
+	<!-- include the environment -->
+	<property environment="env"/>	
+	<!-- output directory for temporary object files -->
+	<property name="buildDir" value="target/linux64" />
+	<!-- output directory for the shared library -->
+	<property name="libsDir" value="../libs/linux64" />
+	<!-- the name of the shared library -->
+	<property name="libName" value="libvtm-jni64.so"/>
+	<!-- the jni header jniPlatform to use -->
+	<property name="jniPlatform" value="linux"/>
+	<!-- the compilerPrefix for the C & C++ compilers -->
+	<property name="compilerPrefix" value=""/>
+	<!--  the compilerSuffix for the C & C++ compilers -->	
+	<property name="compilerSuffix" value="" />	
+	
+	<!-- define gcc compiler, options and files to compile -->
+	<property name="gcc" value="${compilerPrefix}gcc${compilerSuffix}"/>	
+	<property name="gcc-opts" value="-c -Wall -O2 -mfpmath=sse -msse -fmessage-length=0 -m64 -fPIC -Wall -std=c99 -O2 -DTRILIBRARY -DREDUCED -DCDT_ONLY -DNO_TIMER"/>
+	<fileset id="gcc-files" dir="./">
+		<exclude name="target/"/>		
+				<include name="memcpy_wrap.c"/>
+		<include name="gl/utils.c"/>
+		<include name="triangle/TriangleJni.c"/>
+		<include name="triangle/triangle.c"/>
+		<include name="triangle/triangle_dbg.c"/>
+
+		
+	</fileset>
+	
+	<!-- define g++ compiler, options and files to compile -->
+	<property name="g++" value="${compilerPrefix}g++${compilerSuffix}"/>
+	<property name="g++-opts" value="-c -Wall -O2 -mfpmath=sse -msse -fmessage-length=0 -m64 -fPIC -Wall -std=c99 -O2 -DTRILIBRARY -DREDUCED -DCDT_ONLY -DNO_TIMER"/>
+	<fileset id="g++-files" dir="./">
+		<exclude name="target/"/>
+				<include name="**/*.cpp"/>
+
+		
+	</fileset>
+
+	<!-- define linker and options -->
+	<property name="linker" value="${compilerPrefix}g++${compilerSuffix}"/>
+	<property name="linker-opts" value="-shared -m64 -Wl,-wrap,memcpy"/>
+	<property name="libraries" value=""/>
+	
+	<!-- cleans the build directory, removes all object files and shared libs -->
+	<target name="clean">
+		<delete includeemptydirs="true" quiet="true">
+			<fileset dir="${buildDir}"/>
+			<fileset dir="${libsDir}" includes="**/*" excludes="**/.svn"/>
+		</delete>
+	</target>
+	
+	<target name="precompile">
+		<condition property="compiler-found">
+			<and>
+				<or>
+					<!-- Include both b/c Windows might be either -->
+					<available file="${g++}" filepath="${env.PATH}"/>
+					<available file="${g++}" filepath="${env.Path}"/>
+				</or>
+				<or>
+					<!-- Include both b/c Windows might be either -->
+					<available file="${gcc}" filepath="${env.PATH}"/>
+					<available file="${gcc}" filepath="${env.Path}"/>
+				</or>
+			</and>
+		</condition>
+		<condition property="has-compiler">
+			<equals arg1="${compiler-found}" arg2="true"/>
+		</condition>
+		
+	</target>
+	
+	<target name="create-build-dir" depends="precompile" if="has-compiler">
+		<!-- FIXME this is pretty nasty :/ -->
+		<copy todir="${buildDir}">
+			<fileset refid="g++-files"/>
+			<fileset refid="gcc-files"/>
+		</copy>
+		<delete>
+			<fileset dir="${buildDir}">
+				<include name="*"/>
+				<exclude name="*.o"/>
+			</fileset>
+		</delete>
+	</target>
+
+	<!-- compiles all C and C++ files to object files in the build directory -->
+	<target name="compile" depends="create-build-dir" if="has-compiler">
+		<mkdir dir="${buildDir}"/>
+		<apply failonerror="true" executable="${g++}" dest="${buildDir}" verbose="true">
+			<arg line="${g++-opts}"/>
+			<arg value="-Ijni-headers"/>
+			<arg value="-Ijni-headers/${jniPlatform}"/>
+			<arg value="-I."/>
+						<arg value="-I."/>
+
+			<srcfile/>
+			<arg value="-o"/>
+			<targetfile/>
+			<fileset refid="g++-files"/>
+			<compositemapper>
+				<mapper type="glob" from="*.cpp" to="*.o"/>
+				<mapper type="glob" from="*.mm" to="*.o"/>
+			</compositemapper>
+		</apply>
+		<apply failonerror="true" executable="${gcc}" dest="${buildDir}" verbose="true">
+			<arg line="${gcc-opts}"/>
+			<arg value="-Ijni-headers"/>
+			<arg value="-Ijni-headers/${jniPlatform}"/>
+			<arg value="-I."/>
+						<arg value="-I."/>
+
+			<srcfile/>
+			<arg value="-o"/>
+			<targetfile/>
+			<fileset refid="gcc-files"/>
+			<compositemapper>
+				<mapper type="glob" from="*.c" to="*.o"/>
+				<mapper type="glob" from="*.m" to="*.o"/>
+			</compositemapper>
+		</apply>
+	</target>	
+
+	<!-- links the shared library based on the previously compiled object files -->	
+	<target name="link" depends="compile" if="has-compiler">
+		<fileset dir="${buildDir}" id="objFileSet">
+			<patternset>
+				<include name="**/*.o" />
+			</patternset>
+		</fileset>
+		<pathconvert pathsep=" " property="objFiles" refid="objFileSet" />
+		<mkdir dir="${libsDir}" />
+		<exec executable="${linker}" failonerror="true" dir="${buildDir}">
+			<arg line="${linker-opts}" />
+			<arg value="-o" />
+			<arg path="${libsDir}/${libName}" />
+			<arg line="${objFiles}"/>
+			<arg line="${libraries}" />
+		</exec>
+	</target>	
+	
+	<target name="postcompile" depends="link">
+		
+	</target>
+</project>
--- a/vtm/jni/build.xml
+++ b/vtm/jni/build.xml
@@ -0,0 +1,23 @@
+<project name="vtm-jni-natives" basedir="." default="all">
+	<target name="clean">
+		<ant antfile="build-linux64.xml" target="clean"/>
+		<ant antfile="build-android32.xml" target="clean"/>
+
+	</target>
+	
+	<target name="compile-natives">
+		<ant antfile="build-linux64.xml"/>
+		<ant antfile="build-android32.xml"/>
+
+	</target>
+	
+	<target name="pack-natives">
+		<jar destfile="../libs/vtm-jni-natives.jar">
+			<fileset dir="../libs/linux64" includes="libvtm-jni64.so"/>
+			<fileset dir="../libs/android32" includes="libvtm-jni.so"/>
+
+		</jar>
+	</target>
+
+	<target name="all" depends="compile-natives,pack-natives"/>
+</project>
--- a/vtm/jni/builder/org/oscim/jni/JniBuilder.java
+++ b/vtm/jni/builder/org/oscim/jni/JniBuilder.java
@@ -0,0 +1,80 @@
+package org.oscim.jni;
+
+
+import com.badlogic.gdx.jnigen.AntScriptGenerator;
+import com.badlogic.gdx.jnigen.BuildConfig;
+import com.badlogic.gdx.jnigen.BuildTarget;
+import com.badlogic.gdx.jnigen.BuildTarget.TargetOs;
+
+public class JniBuilder {
+	public static void main(String[] args) {
+		String[] headers = { "." };
+		String[] sources = { "gl/utils.c", "triangle/TriangleJni.c", "triangle/triangle.c", "triangle/triangle_dbg.c"  };
+		String cflags = " -Wall -std=c99 -O2 -DTRILIBRARY -DREDUCED -DCDT_ONLY -DNO_TIMER"; // -Werror";
+
+		BuildTarget win32home = BuildTarget.newDefaultTarget(TargetOs.Windows,
+				false);
+		win32home.compilerPrefix = "";
+		win32home.buildFileName = "build-windows32home.xml";
+		win32home.excludeFromMasterBuildFile = true;
+		win32home.headerDirs = headers;
+		win32home.cIncludes = sources;
+		win32home.cFlags += cflags;
+		win32home.cppFlags += cflags;
+
+		BuildTarget win32 = BuildTarget.newDefaultTarget(TargetOs.Windows,
+				false);
+		win32.headerDirs = headers;
+		win32.cIncludes = sources;
+		win32.cFlags += cflags;
+		win32.cppFlags += cflags;
+
+		BuildTarget win64 = BuildTarget
+				.newDefaultTarget(TargetOs.Windows, true);
+		win64.headerDirs = headers;
+		win64.cIncludes = sources;
+		win64.cFlags += cflags;
+		win64.cppFlags += cflags;
+
+		BuildTarget lin32 = BuildTarget.newDefaultTarget(TargetOs.Linux, false);
+		lin32.headerDirs = headers;
+		lin32.cIncludes = sources;
+		lin32.cFlags += cflags;
+		lin32.cppFlags += cflags;
+
+		BuildTarget lin64 = BuildTarget.newDefaultTarget(TargetOs.Linux, true);
+		lin64.headerDirs = headers;
+		lin64.cIncludes = sources;
+		lin64.cFlags += cflags;
+		lin64.cppFlags += cflags;
+
+		// BuildTarget mac = BuildTarget.newDefaultTarget(TargetOs.MacOsX,
+		// false);
+		// mac.headerDirs = headers;
+		// mac.cIncludes = sources;
+		// mac.cFlags += cflags;
+		// mac.cppFlags += cflags;
+		// mac.linkerFlags += " -framework CoreServices -framework Carbon";
+
+		BuildTarget android = BuildTarget.newDefaultTarget(TargetOs.Android,
+				false);
+		android.headerDirs = headers;
+		android.cIncludes = sources;
+		android.cFlags += cflags;
+		android.cppFlags += cflags;
+		android.linkerFlags += " -llog";
+		// BuildTarget ios = BuildTarget.newDefaultTarget(TargetOs.IOS, false);
+		// ios.headerDirs = headers;
+		// ios.cIncludes = sources;
+		// ios.cFlags += cflags;
+		// ios.cppFlags += cflags;
+
+		//new NativeCodeGenerator().generate();
+		new AntScriptGenerator().generate(new BuildConfig("vtm-jni"),
+				//win32home, win32, win64, lin32,
+				lin64, android);
+//		BuildExecutor.executeAnt("jni/build-windows32home.xml", "-v clean");
+//		BuildExecutor.executeAnt("jni/build-windows32home.xml", "-v");
+//		BuildExecutor.executeAnt("jni/build.xml", "pack-natives -v");
+	}
+}
--- a/vtm/jni/gl/utils.c
+++ b/vtm/jni/gl/utils.c
@@ -0,0 +1,487 @@
+#include <jni.h>
+
+#include <stdlib.h>
+#include <math.h>
+#include <string.h>
+#include <alloca.h>
+#include <math.h>
+#include <stdint.h>
+
+//#ifndef uintptr_t
+//typedef unsigned long           uintptr_t;
+//#endif
+
+#ifndef M_PI
+#define M_PI 3.14159265358979323846
+#endif
+
+#if 0
+#ifdef __ANDROID__
+#include <GLES2/gl2.h>
+#include <GLES2/gl2ext.h>
+#include <android/log.h>
+
+#define JNI(X) JNIEXPORT Java_org_oscim_utils_GlUtils_##X
+
+
+#define COLOR_R(C) (((C >> 16) & 0xff) / 255.0f)
+#define COLOR_G(C) (((C >> 8) & 0xff) / 255.0f)
+#define COLOR_B(C) (((C >> 0) & 0xff) / 255.0f)
+#define COLOR_A(C) (((C >> 24) & 0xff) / 255.0f)
+
+void JNI(setColor)(JNIEnv *env, jclass* clazz, jint location, jint c, jfloat alpha)
+{
+
+  if (alpha >= 1)
+    alpha = COLOR_A(c);
+  else if (alpha < 0)
+    alpha = 0;
+  else
+    alpha *= COLOR_A(c);
+
+  if (alpha == 1)
+    {
+      glUniform4f((GLint) location,
+          (GLfloat) COLOR_R(c),
+          (GLfloat) COLOR_G(c),
+          (GLfloat) COLOR_B(c),
+          (GLfloat) alpha);
+    }
+  else
+    {
+      glUniform4f((GLint) location,
+          (GLfloat) (COLOR_R(c) * alpha),
+          (GLfloat) (COLOR_G(c) * alpha),
+          (GLfloat) (COLOR_B(c) * alpha),
+          (GLfloat) alpha);
+    }
+}
+
+void JNI(setColorBlend)(JNIEnv *env, jclass* clazz, jint location, jint c1, jint c2, jfloat mix)
+{
+  float a1 = COLOR_A(c1) * (1 - mix);
+  float a2 = COLOR_A(c2) * mix;
+
+  glUniform4f((GLint) location,
+      (GLfloat) (COLOR_R(c1) * a1 + COLOR_R(c2) * a2),
+      (GLfloat) (COLOR_G(c1) * a1 + COLOR_G(c2) * a2),
+      (GLfloat) (COLOR_B(c1) * a1 + COLOR_B(c2) * a2),
+      (GLfloat) (a1 + a2));
+}
+#endif // __ANDROID__
+#endif // 0
+
+#undef JNI
+#define JNI(X) JNIEXPORT Java_org_oscim_utils_Matrix4_##X
+
+#define CAST(x) (float *)(uintptr_t) x
+#define MAT_SIZE 16 * sizeof(float)
+
+static const float identity[] =
+      { 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1 };
+
+static inline void
+multiplyMM(float* r, const float* lhs, const float* rhs);
+
+static inline void
+setRotateM(float* rm, int rmOffset, float a, float x, float y, float z);
+
+static inline void
+transposeM(float* mTrans, int mTransOffset, float* m, int mOffset);
+
+static inline void
+matrix4_proj(float* mat, float* vec);
+
+jlong JNI(alloc)(JNIEnv *env, jclass* clazz)
+{
+  return (long) calloc(16, sizeof(float));
+}
+
+jobject JNI(getBuffer)(JNIEnv *env, jclass* clazz,jlong ptr){
+   return (*env)->NewDirectByteBuffer(env,(char*)(uintptr_t)ptr, 16*sizeof(float));
+}
+
+void JNI(delete)(JNIEnv* env, jclass* clazz, jlong ptr)
+{
+  free(CAST(ptr));
+}
+#if 0
+void JNI(setAsUniform)(JNIEnv* env, jclass* clazz, jlong ptr, jint location)
+{
+  float* m = CAST(ptr);
+
+  glUniformMatrix4fv((GLint) location, (GLsizei) 1, (GLboolean) 0, (GLfloat *) m);
+}
+#endif
+
+void JNI(setValueAt)(JNIEnv* env, jclass* clazz, jlong ptr, jint pos, jfloat value)
+{
+  float* m = CAST(ptr);
+  if (pos > -1 && pos < 16)
+    m[pos] = value;
+}
+
+void JNI(identity)(JNIEnv* env, jclass* clazz, jlong ptr)
+{
+  float* m = CAST(ptr);
+  memcpy(m, identity, MAT_SIZE);
+}
+
+void JNI(setScale)(JNIEnv* env, jclass* clazz, jlong ptr, jfloat sx, jfloat sy, jfloat sz)
+{
+  float* m = CAST(ptr);
+  memcpy(m, identity, MAT_SIZE);
+  m[0] = sx;
+  m[5] = sy;
+  m[10] = sz;
+}
+
+void JNI(setTranslation)(JNIEnv* env, jclass* clazz, jlong ptr, jfloat x, jfloat y, jfloat z)
+{
+  float* m = CAST(ptr);
+  memcpy(m, identity, MAT_SIZE);
+  m[12] = x;
+  m[13] = y;
+  m[14] = z;
+}
+
+void JNI(setRotation)(JNIEnv* env, jclass* clazz, jlong ptr, jfloat a, jfloat x, jfloat y, jfloat z)
+{
+  float* m = CAST(ptr);
+  setRotateM(m, 0, a, x, y, z);
+}
+
+void JNI(setTransScale)(JNIEnv* env, jclass* clazz, jlong ptr, jfloat tx, jfloat ty, jfloat scale)
+{
+  float* m = CAST(ptr);
+  memcpy(m, identity, MAT_SIZE);
+  m[0] = scale;
+  m[5] = scale;
+  m[12] = tx;
+  m[13] = ty;
+}
+
+// set matrix from float array
+void JNI(set)(JNIEnv* env, jclass* clazz, jlong ptr, jfloatArray obj_mat)
+{
+  float* m = CAST(ptr);
+  float* mat = (float*) (*env)->GetPrimitiveArrayCritical(env, obj_mat, 0);
+
+  memcpy(m, mat, MAT_SIZE);
+
+  (*env)->ReleasePrimitiveArrayCritical(env, obj_mat, mat, JNI_ABORT);
+}
+
+// get float array from matrix
+void JNI(get)(JNIEnv* env, jclass* clazz, jlong ptr, jfloatArray obj_mat)
+{
+  float* m = CAST(ptr);
+  float* mat = (float*) (*env)->GetPrimitiveArrayCritical(env, obj_mat, 0);
+
+  memcpy(mat, m, MAT_SIZE);
+
+  (*env)->ReleasePrimitiveArrayCritical(env, obj_mat, mat, 0);
+}
+
+void JNI(mul)(JNIEnv* env, jclass* clazz, jlong ptr_a, jlong ptr_b)
+{
+  float* mata = CAST(ptr_a);
+  float* matb = CAST(ptr_b);
+
+  multiplyMM(mata, mata, matb);
+}
+
+void JNI(copy)(JNIEnv* env, jclass* clazz, jlong ptr_dst, jlong ptr_src)
+{
+  float* dst = CAST(ptr_dst);
+  float* src = CAST(ptr_src);
+
+  memcpy(dst, src, MAT_SIZE);
+}
+
+void JNI(smul)(JNIEnv* env, jclass* clazz, jlong ptr_r, jlong ptr_a, jlong ptr_b)
+{
+  float* matr = CAST(ptr_r);
+  float* mata = CAST(ptr_a);
+  float* matb = CAST(ptr_b);
+
+  multiplyMM(matr, mata, matb);
+}
+
+void JNI(smulrhs)(JNIEnv* env, jclass* clazz, jlong ptr_r, jlong ptr_rhs)
+{
+  float* matr = CAST(ptr_r);
+  float* mata = alloca(16 * sizeof(float));
+  float* matb = CAST(ptr_rhs);
+
+  memcpy(mata, matr, 16 * sizeof(float));
+
+  multiplyMM(matr, mata, matb);
+}
+
+void JNI(smullhs)(JNIEnv* env, jclass* clazz, jlong ptr_r, jlong ptr_lhs)
+{
+  float* matr = CAST(ptr_r);
+  float* mata = CAST(ptr_lhs);
+  float* matb = alloca(16 * sizeof(float));
+
+  memcpy(matb, matr, 16 * sizeof(float));
+
+  multiplyMM(matr, mata, matb);
+}
+
+
+void JNI(strans)(JNIEnv* env, jclass* clazz, jlong ptr_r, jlong ptr_a)
+{
+  float* matr = CAST(ptr_r);
+  float* mata = CAST(ptr_a);
+
+  transposeM(matr, 0, mata, 0);
+}
+
+void JNI(prj)(JNIEnv* env, jclass* clazz, jlong ptr, jfloatArray obj_vec)
+{
+  float* m = CAST(ptr);
+  float* vec = (float*) (*env)->GetPrimitiveArrayCritical(env, obj_vec, 0);
+
+  matrix4_proj(m, vec);
+
+  (*env)->ReleasePrimitiveArrayCritical(env, obj_vec, vec, 0);
+}
+
+static float someRandomEpsilon = 1.0f / (1 << 11);
+
+void JNI(addDepthOffset)(JNIEnv* env, jclass* clazz, jlong ptr, jint delta)
+{
+  float* m = CAST(ptr);
+
+  // from http://www.mathfor3dgameprogramming.com/code/Listing9.1.cpp
+  //		float n = MapViewPosition.VIEW_NEAR;
+  //		float f = MapViewPosition.VIEW_FAR;
+  //		float pz = 1;
+  //		float epsilon = -2.0f * f * n * delta / ((f + n) * pz * (pz + delta));
+
+  m[10] *= 1.0f + someRandomEpsilon * delta;
+}
+
+/*
+ * Copyright 2007, The Android Open Source Project
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+// from android/platform_frameworks_base/blob/master/core/jni/android/opengl/util.cpp
+#define I(_i, _j) ((_j)+ 4*(_i))
+
+static inline void
+multiplyMM(float* r, const float* lhs, const float* rhs)
+{
+  for (int i = 0; i < 4; i++)
+    {
+      register const float rhs_i0 = rhs[I(i,0)];
+      register float ri0 = lhs[I(0,0)] * rhs_i0;
+      register float ri1 = lhs[I(0,1)] * rhs_i0;
+      register float ri2 = lhs[I(0,2)] * rhs_i0;
+      register float ri3 = lhs[I(0,3)] * rhs_i0;
+      for (int j = 1; j < 4; j++)
+        {
+          register const float rhs_ij = rhs[I(i,j)];
+          ri0 += lhs[I(j,0)] * rhs_ij;
+          ri1 += lhs[I(j,1)] * rhs_ij;
+          ri2 += lhs[I(j,2)] * rhs_ij;
+          ri3 += lhs[I(j,3)] * rhs_ij;
+        }
+      r[I(i,0)] = ri0;
+      r[I(i,1)] = ri1;
+      r[I(i,2)] = ri2;
+      r[I(i,3)] = ri3;
+    }
+}
+
+//static inline
+//void
+//mx4transform(float x, float y, float z, float w, const float* pM, float* pDest)
+//{
+//  pDest[0] = pM[0 + 4 * 0] * x + pM[0 + 4 * 1] * y + pM[0 + 4 * 2] * z + pM[0 + 4 * 3] * w;
+//  pDest[1] = pM[1 + 4 * 0] * x + pM[1 + 4 * 1] * y + pM[1 + 4 * 2] * z + pM[1 + 4 * 3] * w;
+//  pDest[2] = pM[2 + 4 * 0] * x + pM[2 + 4 * 1] * y + pM[2 + 4 * 2] * z + pM[2 + 4 * 3] * w;
+//
+//  pDest[3] = pM[3 + 4 * 0] * x + pM[3 + 4 * 1] * y + pM[3 + 4 * 2] * z + pM[3 + 4 * 3] * w;
+//}
+
+/**
+ * Computes the length of a vector
+ *
+ * @param x x coordinate of a vector
+ * @param y y coordinate of a vector
+ * @param z z coordinate of a vector
+ * @return the length of a vector
+ */
+static inline float
+length(float x, float y, float z)
+{
+  return (float) sqrt(x * x + y * y + z * z);
+}
+/**
+ * Rotates matrix m by angle a (in degrees) around the axis (x, y, z)
+ * @param rm returns the result
+ * @param rmOffset index into rm where the result matrix starts
+ * @param a angle to rotate in degrees
+ * @param x scale factor x
+ * @param y scale factor y
+ * @param z scale factor z
+ */
+
+static inline void
+setRotateM(float* rm, int rmOffset, float a, float x, float y, float z)
+{
+  rm[rmOffset + 3] = 0;
+  rm[rmOffset + 7] = 0;
+  rm[rmOffset + 11] = 0;
+  rm[rmOffset + 12] = 0;
+  rm[rmOffset + 13] = 0;
+  rm[rmOffset + 14] = 0;
+  rm[rmOffset + 15] = 1;
+  a *= (float) (M_PI / 180.0f);
+  float s = (float) sin(a);
+  float c = (float) cos(a);
+  if (1.0f == x && 0.0f == y && 0.0f == z)
+    {
+      rm[rmOffset + 5] = c;
+      rm[rmOffset + 10] = c;
+      rm[rmOffset + 6] = s;
+      rm[rmOffset + 9] = -s;
+      rm[rmOffset + 1] = 0;
+      rm[rmOffset + 2] = 0;
+      rm[rmOffset + 4] = 0;
+      rm[rmOffset + 8] = 0;
+      rm[rmOffset + 0] = 1;
+    }
+  else if (0.0f == x && 1.0f == y && 0.0f == z)
+    {
+      rm[rmOffset + 0] = c;
+      rm[rmOffset + 10] = c;
+      rm[rmOffset + 8] = s;
+      rm[rmOffset + 2] = -s;
+      rm[rmOffset + 1] = 0;
+      rm[rmOffset + 4] = 0;
+      rm[rmOffset + 6] = 0;
+      rm[rmOffset + 9] = 0;
+      rm[rmOffset + 5] = 1;
+    }
+  else if (0.0f == x && 0.0f == y && 1.0f == z)
+    {
+      rm[rmOffset + 0] = c;
+      rm[rmOffset + 5] = c;
+      rm[rmOffset + 1] = s;
+      rm[rmOffset + 4] = -s;
+      rm[rmOffset + 2] = 0;
+      rm[rmOffset + 6] = 0;
+      rm[rmOffset + 8] = 0;
+      rm[rmOffset + 9] = 0;
+      rm[rmOffset + 10] = 1;
+    }
+  else
+    {
+      float len = length(x, y, z);
+      if (1.0f != len)
+        {
+          float recipLen = 1.0f / len;
+          x *= recipLen;
+          y *= recipLen;
+          z *= recipLen;
+        }
+      float nc = 1.0f - c;
+      float xy = x * y;
+      float yz = y * z;
+      float zx = z * x;
+      float xs = x * s;
+      float ys = y * s;
+      float zs = z * s;
+      rm[rmOffset + 0] = x * x * nc + c;
+      rm[rmOffset + 4] = xy * nc - zs;
+      rm[rmOffset + 8] = zx * nc + ys;
+      rm[rmOffset + 1] = xy * nc + zs;
+      rm[rmOffset + 5] = y * y * nc + c;
+      rm[rmOffset + 9] = yz * nc - xs;
+      rm[rmOffset + 2] = zx * nc - ys;
+      rm[rmOffset + 6] = yz * nc + xs;
+      rm[rmOffset + 10] = z * z * nc + c;
+    }
+}
+
+/**
+ * Transposes a 4 x 4 matrix.
+ *
+ * @param mTrans the array that holds the output inverted matrix
+ * @param mTransOffset an offset into mInv where the inverted matrix is
+ *        stored.
+ * @param m the input array
+ * @param mOffset an offset into m where the matrix is stored.
+ */
+static inline void
+transposeM(float* mTrans, int mTransOffset, float* m, int mOffset)
+{
+  for (int i = 0; i < 4; i++)
+    {
+      int mBase = i * 4 + mOffset;
+      mTrans[i + mTransOffset] = m[mBase];
+      mTrans[i + 4 + mTransOffset] = m[mBase + 1];
+      mTrans[i + 8 + mTransOffset] = m[mBase + 2];
+      mTrans[i + 12 + mTransOffset] = m[mBase + 3];
+    }
+}
+/*******************************************************************************
+ * Copyright 2011 See libgdx AUTHORS file.
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *   http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ ******************************************************************************/
+// from /gdx/src/com/badlogic/gdx/math/Matrix4.java
+#define M00 0
+#define M01 4
+#define M02 8
+#define M03 12
+#define M10 1
+#define M11 5
+#define M12 9
+#define M13 13
+#define M20 2
+#define M21 6
+#define M22 10
+#define M23 14
+#define M30 3
+#define M31 7
+#define M32 11
+#define M33 15
+
+static inline void
+matrix4_proj(float* mat, float* vec)
+{
+  float inv_w = 1.0f / (vec[0] * mat[M30] + vec[1] * mat[M31] + vec[2] * mat[M32] + mat[M33]);
+  float x = (vec[0] * mat[M00] + vec[1] * mat[M01] + vec[2] * mat[M02] + mat[M03]) * inv_w;
+  float y = (vec[0] * mat[M10] + vec[1] * mat[M11] + vec[2] * mat[M12] + mat[M13]) * inv_w;
+  float z = (vec[0] * mat[M20] + vec[1] * mat[M21] + vec[2] * mat[M22] + mat[M23]) * inv_w;
+  vec[0] = x;
+  vec[1] = y;
+  vec[2] = z;
+}
--- a/vtm/jni/target/linux64/gl/utils.c
+++ b/vtm/jni/target/linux64/gl/utils.c
@@ -0,0 +1,487 @@
+#include <jni.h>
+
+#include <stdlib.h>
+#include <math.h>
+#include <string.h>
+#include <alloca.h>
+#include <math.h>
+#include <stdint.h>
+
+//#ifndef uintptr_t
+//typedef unsigned long           uintptr_t;
+//#endif
+
+#ifndef M_PI
+#define M_PI 3.14159265358979323846
+#endif
+
+#if 0
+#ifdef __ANDROID__
+#include <GLES2/gl2.h>
+#include <GLES2/gl2ext.h>
+#include <android/log.h>
+
+#define JNI(X) JNIEXPORT Java_org_oscim_utils_GlUtils_##X
+
+
+#define COLOR_R(C) (((C >> 16) & 0xff) / 255.0f)
+#define COLOR_G(C) (((C >> 8) & 0xff) / 255.0f)
+#define COLOR_B(C) (((C >> 0) & 0xff) / 255.0f)
+#define COLOR_A(C) (((C >> 24) & 0xff) / 255.0f)
+
+void JNI(setColor)(JNIEnv *env, jclass* clazz, jint location, jint c, jfloat alpha)
+{
+
+  if (alpha >= 1)
+    alpha = COLOR_A(c);
+  else if (alpha < 0)
+    alpha = 0;
+  else
+    alpha *= COLOR_A(c);
+
+  if (alpha == 1)
+    {
+      glUniform4f((GLint) location,
+          (GLfloat) COLOR_R(c),
+          (GLfloat) COLOR_G(c),
+          (GLfloat) COLOR_B(c),
+          (GLfloat) alpha);
+    }
+  else
+    {
+      glUniform4f((GLint) location,
+          (GLfloat) (COLOR_R(c) * alpha),
+          (GLfloat) (COLOR_G(c) * alpha),
+          (GLfloat) (COLOR_B(c) * alpha),
+          (GLfloat) alpha);
+    }
+}
+
+void JNI(setColorBlend)(JNIEnv *env, jclass* clazz, jint location, jint c1, jint c2, jfloat mix)
+{
+  float a1 = COLOR_A(c1) * (1 - mix);
+  float a2 = COLOR_A(c2) * mix;
+
+  glUniform4f((GLint) location,
+      (GLfloat) (COLOR_R(c1) * a1 + COLOR_R(c2) * a2),
+      (GLfloat) (COLOR_G(c1) * a1 + COLOR_G(c2) * a2),
+      (GLfloat) (COLOR_B(c1) * a1 + COLOR_B(c2) * a2),
+      (GLfloat) (a1 + a2));
+}
+#endif // __ANDROID__
+#endif // 0
+
+#undef JNI
+#define JNI(X) JNIEXPORT Java_org_oscim_utils_Matrix4_##X
+
+#define CAST(x) (float *)(uintptr_t) x
+#define MAT_SIZE 16 * sizeof(float)
+
+static const float identity[] =
+      { 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1 };
+
+static inline void
+multiplyMM(float* r, const float* lhs, const float* rhs);
+
+static inline void
+setRotateM(float* rm, int rmOffset, float a, float x, float y, float z);
+
+static inline void
+transposeM(float* mTrans, int mTransOffset, float* m, int mOffset);
+
+static inline void
+matrix4_proj(float* mat, float* vec);
+
+jlong JNI(alloc)(JNIEnv *env, jclass* clazz)
+{
+  return (long) calloc(16, sizeof(float));
+}
+
+jobject JNI(getBuffer)(JNIEnv *env, jclass* clazz,jlong ptr){
+   return (*env)->NewDirectByteBuffer(env,(char*)(uintptr_t)ptr, 16*sizeof(float));
+}
+
+void JNI(delete)(JNIEnv* env, jclass* clazz, jlong ptr)
+{
+  free(CAST(ptr));
+}
+#if 0
+void JNI(setAsUniform)(JNIEnv* env, jclass* clazz, jlong ptr, jint location)
+{
+  float* m = CAST(ptr);
+
+  glUniformMatrix4fv((GLint) location, (GLsizei) 1, (GLboolean) 0, (GLfloat *) m);
+}
+#endif
+
+void JNI(setValueAt)(JNIEnv* env, jclass* clazz, jlong ptr, jint pos, jfloat value)
+{
+  float* m = CAST(ptr);
+  if (pos > -1 && pos < 16)
+    m[pos] = value;
+}
+
+void JNI(identity)(JNIEnv* env, jclass* clazz, jlong ptr)
+{
+  float* m = CAST(ptr);
+  memcpy(m, identity, MAT_SIZE);
+}
+
+void JNI(setScale)(JNIEnv* env, jclass* clazz, jlong ptr, jfloat sx, jfloat sy, jfloat sz)
+{
+  float* m = CAST(ptr);
+  memcpy(m, identity, MAT_SIZE);
+  m[0] = sx;
+  m[5] = sy;
+  m[10] = sz;
+}
+
+void JNI(setTranslation)(JNIEnv* env, jclass* clazz, jlong ptr, jfloat x, jfloat y, jfloat z)
+{
+  float* m = CAST(ptr);
+  memcpy(m, identity, MAT_SIZE);
+  m[12] = x;
+  m[13] = y;
+  m[14] = z;
+}
+
+void JNI(setRotation)(JNIEnv* env, jclass* clazz, jlong ptr, jfloat a, jfloat x, jfloat y, jfloat z)
+{
+  float* m = CAST(ptr);
+  setRotateM(m, 0, a, x, y, z);
+}
+
+void JNI(setTransScale)(JNIEnv* env, jclass* clazz, jlong ptr, jfloat tx, jfloat ty, jfloat scale)
+{
+  float* m = CAST(ptr);
+  memcpy(m, identity, MAT_SIZE);
+  m[0] = scale;
+  m[5] = scale;
+  m[12] = tx;
+  m[13] = ty;
+}
+
+// set matrix from float array
+void JNI(set)(JNIEnv* env, jclass* clazz, jlong ptr, jfloatArray obj_mat)
+{
+  float* m = CAST(ptr);
+  float* mat = (float*) (*env)->GetPrimitiveArrayCritical(env, obj_mat, 0);
+
+  memcpy(m, mat, MAT_SIZE);
+
+  (*env)->ReleasePrimitiveArrayCritical(env, obj_mat, mat, JNI_ABORT);
+}
+
+// get float array from matrix
+void JNI(get)(JNIEnv* env, jclass* clazz, jlong ptr, jfloatArray obj_mat)
+{
+  float* m = CAST(ptr);
+  float* mat = (float*) (*env)->GetPrimitiveArrayCritical(env, obj_mat, 0);
+
+  memcpy(mat, m, MAT_SIZE);
+
+  (*env)->ReleasePrimitiveArrayCritical(env, obj_mat, mat, 0);
+}
+
+void JNI(mul)(JNIEnv* env, jclass* clazz, jlong ptr_a, jlong ptr_b)
+{
+  float* mata = CAST(ptr_a);
+  float* matb = CAST(ptr_b);
+
+  multiplyMM(mata, mata, matb);
+}
+
+void JNI(copy)(JNIEnv* env, jclass* clazz, jlong ptr_dst, jlong ptr_src)
+{
+  float* dst = CAST(ptr_dst);
+  float* src = CAST(ptr_src);
+
+  memcpy(dst, src, MAT_SIZE);
+}
+
+void JNI(smul)(JNIEnv* env, jclass* clazz, jlong ptr_r, jlong ptr_a, jlong ptr_b)
+{
+  float* matr = CAST(ptr_r);
+  float* mata = CAST(ptr_a);
+  float* matb = CAST(ptr_b);
+
+  multiplyMM(matr, mata, matb);
+}
+
+void JNI(smulrhs)(JNIEnv* env, jclass* clazz, jlong ptr_r, jlong ptr_rhs)
+{
+  float* matr = CAST(ptr_r);
+  float* mata = alloca(16 * sizeof(float));
+  float* matb = CAST(ptr_rhs);
+
+  memcpy(mata, matr, 16 * sizeof(float));
+
+  multiplyMM(matr, mata, matb);
+}
+
+void JNI(smullhs)(JNIEnv* env, jclass* clazz, jlong ptr_r, jlong ptr_lhs)
+{
+  float* matr = CAST(ptr_r);
+  float* mata = CAST(ptr_lhs);
+  float* matb = alloca(16 * sizeof(float));
+
+  memcpy(matb, matr, 16 * sizeof(float));
+
+  multiplyMM(matr, mata, matb);
+}
+
+
+void JNI(strans)(JNIEnv* env, jclass* clazz, jlong ptr_r, jlong ptr_a)
+{
+  float* matr = CAST(ptr_r);
+  float* mata = CAST(ptr_a);
+
+  transposeM(matr, 0, mata, 0);
+}
+
+void JNI(prj)(JNIEnv* env, jclass* clazz, jlong ptr, jfloatArray obj_vec)
+{
+  float* m = CAST(ptr);
+  float* vec = (float*) (*env)->GetPrimitiveArrayCritical(env, obj_vec, 0);
+
+  matrix4_proj(m, vec);
+
+  (*env)->ReleasePrimitiveArrayCritical(env, obj_vec, vec, 0);
+}
+
+static float someRandomEpsilon = 1.0f / (1 << 11);
+
+void JNI(addDepthOffset)(JNIEnv* env, jclass* clazz, jlong ptr, jint delta)
+{
+  float* m = CAST(ptr);
+
+  // from http://www.mathfor3dgameprogramming.com/code/Listing9.1.cpp
+  //		float n = MapViewPosition.VIEW_NEAR;
+  //		float f = MapViewPosition.VIEW_FAR;
+  //		float pz = 1;
+  //		float epsilon = -2.0f * f * n * delta / ((f + n) * pz * (pz + delta));
+
+  m[10] *= 1.0f + someRandomEpsilon * delta;
+}
+
+/*
+ * Copyright 2007, The Android Open Source Project
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+// from android/platform_frameworks_base/blob/master/core/jni/android/opengl/util.cpp
+#define I(_i, _j) ((_j)+ 4*(_i))
+
+static inline void
+multiplyMM(float* r, const float* lhs, const float* rhs)
+{
+  for (int i = 0; i < 4; i++)
+    {
+      register const float rhs_i0 = rhs[I(i,0)];
+      register float ri0 = lhs[I(0,0)] * rhs_i0;
+      register float ri1 = lhs[I(0,1)] * rhs_i0;
+      register float ri2 = lhs[I(0,2)] * rhs_i0;
+      register float ri3 = lhs[I(0,3)] * rhs_i0;
+      for (int j = 1; j < 4; j++)
+        {
+          register const float rhs_ij = rhs[I(i,j)];
+          ri0 += lhs[I(j,0)] * rhs_ij;
+          ri1 += lhs[I(j,1)] * rhs_ij;
+          ri2 += lhs[I(j,2)] * rhs_ij;
+          ri3 += lhs[I(j,3)] * rhs_ij;
+        }
+      r[I(i,0)] = ri0;
+      r[I(i,1)] = ri1;
+      r[I(i,2)] = ri2;
+      r[I(i,3)] = ri3;
+    }
+}
+
+//static inline
+//void
+//mx4transform(float x, float y, float z, float w, const float* pM, float* pDest)
+//{
+//  pDest[0] = pM[0 + 4 * 0] * x + pM[0 + 4 * 1] * y + pM[0 + 4 * 2] * z + pM[0 + 4 * 3] * w;
+//  pDest[1] = pM[1 + 4 * 0] * x + pM[1 + 4 * 1] * y + pM[1 + 4 * 2] * z + pM[1 + 4 * 3] * w;
+//  pDest[2] = pM[2 + 4 * 0] * x + pM[2 + 4 * 1] * y + pM[2 + 4 * 2] * z + pM[2 + 4 * 3] * w;
+//
+//  pDest[3] = pM[3 + 4 * 0] * x + pM[3 + 4 * 1] * y + pM[3 + 4 * 2] * z + pM[3 + 4 * 3] * w;
+//}
+
+/**
+ * Computes the length of a vector
+ *
+ * @param x x coordinate of a vector
+ * @param y y coordinate of a vector
+ * @param z z coordinate of a vector
+ * @return the length of a vector
+ */
+static inline float
+length(float x, float y, float z)
+{
+  return (float) sqrt(x * x + y * y + z * z);
+}
+/**
+ * Rotates matrix m by angle a (in degrees) around the axis (x, y, z)
+ * @param rm returns the result
+ * @param rmOffset index into rm where the result matrix starts
+ * @param a angle to rotate in degrees
+ * @param x scale factor x
+ * @param y scale factor y
+ * @param z scale factor z
+ */
+
+static inline void
+setRotateM(float* rm, int rmOffset, float a, float x, float y, float z)
+{
+  rm[rmOffset + 3] = 0;
+  rm[rmOffset + 7] = 0;
+  rm[rmOffset + 11] = 0;
+  rm[rmOffset + 12] = 0;
+  rm[rmOffset + 13] = 0;
+  rm[rmOffset + 14] = 0;
+  rm[rmOffset + 15] = 1;
+  a *= (float) (M_PI / 180.0f);
+  float s = (float) sin(a);
+  float c = (float) cos(a);
+  if (1.0f == x && 0.0f == y && 0.0f == z)
+    {
+      rm[rmOffset + 5] = c;
+      rm[rmOffset + 10] = c;
+      rm[rmOffset + 6] = s;
+      rm[rmOffset + 9] = -s;
+      rm[rmOffset + 1] = 0;
+      rm[rmOffset + 2] = 0;
+      rm[rmOffset + 4] = 0;
+      rm[rmOffset + 8] = 0;
+      rm[rmOffset + 0] = 1;
+    }
+  else if (0.0f == x && 1.0f == y && 0.0f == z)
+    {
+      rm[rmOffset + 0] = c;
+      rm[rmOffset + 10] = c;
+      rm[rmOffset + 8] = s;
+      rm[rmOffset + 2] = -s;
+      rm[rmOffset + 1] = 0;
+      rm[rmOffset + 4] = 0;
+      rm[rmOffset + 6] = 0;
+      rm[rmOffset + 9] = 0;
+      rm[rmOffset + 5] = 1;
+    }
+  else if (0.0f == x && 0.0f == y && 1.0f == z)
+    {
+      rm[rmOffset + 0] = c;
+      rm[rmOffset + 5] = c;
+      rm[rmOffset + 1] = s;
+      rm[rmOffset + 4] = -s;
+      rm[rmOffset + 2] = 0;
+      rm[rmOffset + 6] = 0;
+      rm[rmOffset + 8] = 0;
+      rm[rmOffset + 9] = 0;
+      rm[rmOffset + 10] = 1;
+    }
+  else
+    {
+      float len = length(x, y, z);
+      if (1.0f != len)
+        {
+          float recipLen = 1.0f / len;
+          x *= recipLen;
+          y *= recipLen;
+          z *= recipLen;
+        }
+      float nc = 1.0f - c;
+      float xy = x * y;
+      float yz = y * z;
+      float zx = z * x;
+      float xs = x * s;
+      float ys = y * s;
+      float zs = z * s;
+      rm[rmOffset + 0] = x * x * nc + c;
+      rm[rmOffset + 4] = xy * nc - zs;
+      rm[rmOffset + 8] = zx * nc + ys;
+      rm[rmOffset + 1] = xy * nc + zs;
+      rm[rmOffset + 5] = y * y * nc + c;
+      rm[rmOffset + 9] = yz * nc - xs;
+      rm[rmOffset + 2] = zx * nc - ys;
+      rm[rmOffset + 6] = yz * nc + xs;
+      rm[rmOffset + 10] = z * z * nc + c;
+    }
+}
+
+/**
+ * Transposes a 4 x 4 matrix.
+ *
+ * @param mTrans the array that holds the output inverted matrix
+ * @param mTransOffset an offset into mInv where the inverted matrix is
+ *        stored.
+ * @param m the input array
+ * @param mOffset an offset into m where the matrix is stored.
+ */
+static inline void
+transposeM(float* mTrans, int mTransOffset, float* m, int mOffset)
+{
+  for (int i = 0; i < 4; i++)
+    {
+      int mBase = i * 4 + mOffset;
+      mTrans[i + mTransOffset] = m[mBase];
+      mTrans[i + 4 + mTransOffset] = m[mBase + 1];
+      mTrans[i + 8 + mTransOffset] = m[mBase + 2];
+      mTrans[i + 12 + mTransOffset] = m[mBase + 3];
+    }
+}
+/*******************************************************************************
+ * Copyright 2011 See libgdx AUTHORS file.
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *   http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ ******************************************************************************/
+// from /gdx/src/com/badlogic/gdx/math/Matrix4.java
+#define M00 0
+#define M01 4
+#define M02 8
+#define M03 12
+#define M10 1
+#define M11 5
+#define M12 9
+#define M13 13
+#define M20 2
+#define M21 6
+#define M22 10
+#define M23 14
+#define M30 3
+#define M31 7
+#define M32 11
+#define M33 15
+
+static inline void
+matrix4_proj(float* mat, float* vec)
+{
+  float inv_w = 1.0f / (vec[0] * mat[M30] + vec[1] * mat[M31] + vec[2] * mat[M32] + mat[M33]);
+  float x = (vec[0] * mat[M00] + vec[1] * mat[M01] + vec[2] * mat[M02] + mat[M03]) * inv_w;
+  float y = (vec[0] * mat[M10] + vec[1] * mat[M11] + vec[2] * mat[M12] + mat[M13]) * inv_w;
+  float z = (vec[0] * mat[M20] + vec[1] * mat[M21] + vec[2] * mat[M22] + mat[M23]) * inv_w;
+  vec[0] = x;
+  vec[1] = y;
+  vec[2] = z;
+}
--- a/vtm/jni/target/linux64/triangle/TriangleJni.c
+++ b/vtm/jni/target/linux64/triangle/TriangleJni.c
@@ -0,0 +1,308 @@
+#include <jni.h>
+#include <string.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <math.h>
+#include "triangle.h"
+
+#ifdef __ANDROID__
+#include <android/log.h>
+#define printf(...) __android_log_print(ANDROID_LOG_DEBUG, "Triangle", __VA_ARGS__)
+#endif
+
+// from www.ecse.rpi.edu/Homepages/wrf/Research/Short_Notes/pnpoly.html
+#if 0
+int pnpoly(int nvert, float *vert, float testx, float testy)
+{
+   int i, j, c = 0;
+   for (i = 0, j = (nvert-1)*2; i < nvert * 2; j = i++)
+   {
+      if ( ((vert[i*2+1] > testy) != (vert[j*j+1] > testy)) &&
+            (testx < (vert[j*2]-vert[i*2])
+                  * (testy - vert[i*2+1])
+                  / (vert[j*2+1]-vert[i*2+1]) + vert[i*2]) )
+      c = !c;
+   }
+   return c;
+}
+
+int compare_dups(const void *a, const void *b) {
+   int da = *((const long*) a);
+   int db = *((const long*) b);
+   return (da > db) - (da < db);
+}
+
+void shiftSegment(TriangleIO *in, int *seg, int pos) {
+   int size = (in->numberofsegments - pos - 1) * sizeof(int) * 2;
+   printf("shift %d - %d %d\n", size, in->numberofsegments, pos);
+   if (size > 0)
+      memmove(seg, seg + 2, size);
+
+   in->numberofsegments -= 1;
+}
+struct {
+   int p1;
+   int p2;
+} segment;
+
+#endif
+
+static void printPoly(TriangleIO *in) {
+   // print poly format to check with triangle/showme
+   printf("%d 2 0 0\n", in->numberofpoints);
+   for (int j = 0; j < in->numberofpoints; j++)
+      printf("%d %f %f\n", j, in->pointlist[j*2], in->pointlist[j*2+1]);
+
+   int *seg = in->segmentlist;
+   printf("%d 0\n", in->numberofsegments);
+   for (int j = 0; j < in->numberofsegments; j++, seg += 2)
+      printf("%d %d %d\n", j, *seg, *(seg+1));
+
+   printf("%d 0\n", in->numberofholes);
+   for (int j = 0; j < in->numberofholes; j++) {
+      printf("%d %f %f\n", j, in->holelist[j*2], in->holelist[j*2+1]);
+   }
+}
+
+jint Java_org_oscim_renderer_sublayers_ExtrusionLayer_triangulate(JNIEnv *env, jclass c,
+      jfloatArray obj_points, jint pos, jint len, jint num_rings, jobject indice_buf, jint offset) {
+
+   jshort* indices = (jshort*) (*env)->GetDirectBufferAddress(env, indice_buf);
+   jboolean isCopy;
+
+   float* orig_points = (float*) (*env)->GetPrimitiveArrayCritical(env, obj_points, &isCopy);
+   if (orig_points == NULL)
+      return 0;
+
+   float *points = orig_points + pos;
+
+   TriangleIO in, out;
+
+   memset(&in, 0, sizeof(TriangleIO));
+
+   in.numberofpoints = len >> 1;
+   in.pointlist = (float *) points;
+
+   // check if explicitly closed
+   if (in.pointlist[0] == in.pointlist[indices[0] - 2]
+         && in.pointlist[1] == in.pointlist[indices[0] - 1]) {
+      int point = 0;
+      for (int i = 0; i < num_rings; i++) {
+         // remove last point in ring
+         indices[i] -= 2;
+         int last = point + (indices[i] >> 1);
+
+         if (in.numberofpoints - last > 1)
+            memmove(in.pointlist + (last * 2), in.pointlist + ((last + 1) * 2),
+                  (in.numberofpoints - last - 1) * 2 * sizeof(float));
+
+         in.numberofpoints--;
+         point = last;
+      }
+   }
+
+   int dups = 0;
+
+   float *i_points = points;
+   int *skip_list = NULL;
+
+   // check for duplicate vertices and keep a list
+   // of dups and the first occurence
+   for (int i = 0; i < in.numberofpoints - 1; i++) {
+      float x = *i_points++;
+      float y = *i_points++;
+      float *j_points = i_points;
+
+      for (int j = i + 1; j < in.numberofpoints; j++, j_points += 2) {
+         if ((*j_points == x) && (*(j_points + 1) == y)) {
+            skip_list = realloc(skip_list, (dups + 2) * 2 * sizeof(int));
+            skip_list[dups * 2 + 0] = j;
+            skip_list[dups * 2 + 1] = i;
+            dups++;
+         }
+      }
+   }
+
+   in.segmentlist = (int *) malloc(in.numberofpoints * 2 * sizeof(int));
+   in.numberofsegments = in.numberofpoints;
+   in.numberofholes = num_rings - 1;
+
+   int *rings = NULL;
+   if (in.numberofholes > 0) {
+      in.holelist = (float *) malloc(in.numberofholes * 2 * sizeof(float));
+      rings = (int*) malloc(num_rings * sizeof(int));
+   }
+
+   int *seg = in.segmentlist;
+   float *hole = in.holelist;
+
+   // counter going through all points
+   int point;
+   // counter going through all rings
+   int ring;
+
+   // assign all points to segments for each ring
+   for (ring = 0, point = 0; ring < num_rings; ring++, point++) {
+      int len;
+      int num_points = indices[ring] >> 1;
+
+      if (rings)
+         rings[ring] = num_points;
+
+      // add holes: we need a point inside the hole...
+      // this is just a heuristic, assuming that two
+      // 'parallel' lines have a distance of at least
+      // 1 unit. you'll notice when things went wrong
+      // when the hole is rendered instead of the poly
+      if (ring > 0) {
+         int k = point * 2;
+
+         float nx = in.pointlist[k++];
+         float ny = in.pointlist[k++];
+
+         float cx = 0, cy = 0, vx = 0, vy = 0;
+
+         // try to find a large enough segment
+         for (len = (point + num_points) * 2; k < len;) {
+            cx = nx;
+            cy = ny;
+
+            nx = in.pointlist[k++];
+            ny = in.pointlist[k++];
+
+            vx = nx - cx;
+            vy = ny - cy;
+
+            if (vx > 4 || vx < -4 || vy > 4 || vy < -4)
+               break;
+         }
+
+         float a = sqrt(vx * vx + vy * vy);
+
+         float ux = -vy / a;
+         float uy = vx / a;
+
+         float centerx = cx + vx / 2.0 - (ux * 0.1);
+         float centery = cy + vy / 2.0 - (uy * 0.1);
+
+         *hole++ = centerx;
+         *hole++ = centery;
+      }
+
+      // close ring
+      int last = point + (num_points - 1);
+      *seg++ = last;
+      *seg++ = point;
+
+      for (len = point + num_points - 1; point < len; point++) {
+         *seg++ = point;
+         *seg++ = point + 1;
+      }
+   }
+
+   if (dups) {
+      for (int i = 0; i < dups; i++) {
+         printf("duplicate points at %d, %d: %f,%f\n",
+               skip_list[i*2], skip_list[i*2+1],
+               in.pointlist[skip_list[i*2+1]*2],
+               in.pointlist[skip_list[i*2+1]*2+1]);
+      }
+      printPoly(&in);
+
+      // replace duplicate positions with first occurence
+      for (int i = 0; i < dups; i++) {
+         // position of the duplicate vertex
+         int pos = skip_list[i * 2] - i;
+         // first vertex
+         int replacement = skip_list[i * 2 + 1];
+
+         seg = in.segmentlist;
+         for (int j = 0; j < in.numberofsegments * 2; j++, seg++) {
+            if (*seg == pos) {
+               printf("%d: %d <- %d", j, pos, replacement);
+               *seg = replacement;
+            }
+         }
+      }
+   }
+
+   memset(&out, 0, sizeof(TriangleIO));
+   out.trianglelist = (INDICE*) indices;
+
+   // p - use polygon input, for CDT
+   // z - zero offset array offsets...
+   // P - no poly output
+   // N - no node output
+   // B - no bound output
+   // Q - be quiet!
+
+   TriangleOptions opt;
+   memset(&opt, 0, sizeof(TriangleOptions));
+
+   opt.dwyer = 1;
+   opt.steiner = -1;
+   opt.order = 1;
+   opt.maxarea = -1.0;
+
+   opt.poly = 1;
+   opt.usesegments = 1;
+   opt.nopolywritten = 1;
+   opt.nonodewritten = 1;
+   opt.nobound = 1;
+   opt.quiet = 1;
+
+   triangulate(&opt, &in, &out, (TriangleIO *) NULL);
+
+   if (in.numberofpoints < out.numberofpoints) {
+      // TODO rerun with 'nonodewritten = 0'
+      printf( "polygon input is bad! points in:%d out%d\n", in.numberofpoints, out.numberofpoints);
+      out.numberoftriangles = 0;
+   }
+   else if (out.trianglelist)
+   {
+      // scale to stride and add offset
+      short stride = 2;
+
+      if (offset < 0)
+         offset = 0;
+
+      INDICE *tri = out.trianglelist;
+
+      for (int n = out.numberoftriangles * 3; n > 0; n--, tri++)
+         *tri = *tri * stride + offset;
+
+      // when a ring has an odd number of points one (or rather two)
+      // additional vertices will be added. so the following rings
+      // needs extra offset...
+      int start = offset;
+      for (int j = 0, m = in.numberofholes; j < m; j++) {
+         start += rings[j] * stride;
+
+         // even number of points?
+         if (!(rings[j] & 1))
+            continue;
+
+         tri = out.trianglelist;
+         int n = out.numberoftriangles * 3;
+
+         for (; n-- > 0; tri++)
+            if (*tri >= start)
+               *tri += stride;
+
+         start += stride;
+      }
+   }
+   else
+   {
+      printf( "triangle failed %d\n", out.numberofpoints);
+   }
+
+   (*env)->ReleasePrimitiveArrayCritical(env, obj_points, orig_points, JNI_ABORT);
+
+   free(in.segmentlist);
+   free(in.holelist);
+   free(rings);
+   free(skip_list);
+
+   return out.numberoftriangles;
+}
--- a/vtm/jni/target/linux64/triangle/triangle.c
+++ b/vtm/jni/target/linux64/triangle/triangle.c
--- a/vtm/jni/target/linux64/triangle/triangle_dbg.c
+++ b/vtm/jni/target/linux64/triangle/triangle_dbg.c
@@ -0,0 +1,441 @@
+#include "triangle_private.h"
+
+/*****************************************************************************/
+/*                                                                           */
+/*  quality_statistics()   Print statistics about the quality of the mesh.   */
+/*                                                                           */
+/*****************************************************************************/
+
+void quality_statistics(struct mesh *m, struct behavior *b) {
+   struct otri triangleloop;
+   vertex p[3];
+   REAL cossquaretable[8];
+   REAL ratiotable[16];
+   REAL dx[3], dy[3];
+   REAL edgelength[3];
+   REAL dotproduct;
+   REAL cossquare;
+   REAL triarea;
+   REAL shortest, longest;
+   REAL trilongest2;
+   REAL smallestarea, biggestarea;
+   REAL triminaltitude2;
+   REAL minaltitude;
+   REAL triaspect2;
+   REAL worstaspect;
+   REAL smallestangle, biggestangle;
+   REAL radconst, degconst;
+   int angletable[18];
+   int aspecttable[16];
+   int aspectindex;
+   int tendegree;
+   int acutebiggest;
+   int i, ii, j, k;
+
+   printf("Mesh quality statistics:\n\n");
+   radconst = PI / 18.0;
+   degconst = 180.0 / PI;
+   for (i = 0; i < 8; i++) {
+      cossquaretable[i] = cos(radconst * (REAL) (i + 1));
+      cossquaretable[i] = cossquaretable[i] * cossquaretable[i];
+   }
+   for (i = 0; i < 18; i++) {
+      angletable[i] = 0;
+   }
+
+   ratiotable[0] = 1.5;
+   ratiotable[1] = 2.0;
+   ratiotable[2] = 2.5;
+   ratiotable[3] = 3.0;
+   ratiotable[4] = 4.0;
+   ratiotable[5] = 6.0;
+   ratiotable[6] = 10.0;
+   ratiotable[7] = 15.0;
+   ratiotable[8] = 25.0;
+   ratiotable[9] = 50.0;
+   ratiotable[10] = 100.0;
+   ratiotable[11] = 300.0;
+   ratiotable[12] = 1000.0;
+   ratiotable[13] = 10000.0;
+   ratiotable[14] = 100000.0;
+   ratiotable[15] = 0.0;
+   for (i = 0; i < 16; i++) {
+      aspecttable[i] = 0;
+   }
+
+   worstaspect = 0.0;
+   minaltitude = m->xmax - m->xmin + m->ymax - m->ymin;
+   minaltitude = minaltitude * minaltitude;
+   shortest = minaltitude;
+   longest = 0.0;
+   smallestarea = minaltitude;
+   biggestarea = 0.0;
+   worstaspect = 0.0;
+   smallestangle = 0.0;
+   biggestangle = 2.0;
+   acutebiggest = 1;
+
+   traversalinit(&m->triangles);
+   triangleloop.tri = triangletraverse(m);
+   triangleloop.orient = 0;
+   while (triangleloop.tri != (triangle *) NULL) {
+      org(triangleloop, p[0]);
+      dest(triangleloop, p[1]);
+      apex(triangleloop, p[2]);
+      trilongest2 = 0.0;
+
+      for (i = 0; i < 3; i++) {
+         j = plus1mod3[i];
+         k = minus1mod3[i];
+         dx[i] = p[j][0] - p[k][0];
+         dy[i] = p[j][1] - p[k][1];
+         edgelength[i] = dx[i] * dx[i] + dy[i] * dy[i];
+         if (edgelength[i] > trilongest2) {
+            trilongest2 = edgelength[i];
+         }
+         if (edgelength[i] > longest) {
+            longest = edgelength[i];
+         }
+         if (edgelength[i] < shortest) {
+            shortest = edgelength[i];
+         }
+      }
+
+      triarea = counterclockwise(m, b, p[0], p[1], p[2]);
+      if (triarea < smallestarea) {
+         smallestarea = triarea;
+      }
+      if (triarea > biggestarea) {
+         biggestarea = triarea;
+      }
+      triminaltitude2 = triarea * triarea / trilongest2;
+      if (triminaltitude2 < minaltitude) {
+         minaltitude = triminaltitude2;
+      }
+      triaspect2 = trilongest2 / triminaltitude2;
+      if (triaspect2 > worstaspect) {
+         worstaspect = triaspect2;
+      }
+      aspectindex = 0;
+      while ((triaspect2 > ratiotable[aspectindex] * ratiotable[aspectindex]) && (aspectindex < 15)) {
+         aspectindex++;
+      }
+      aspecttable[aspectindex]++;
+
+      for (i = 0; i < 3; i++) {
+         j = plus1mod3[i];
+         k = minus1mod3[i];
+         dotproduct = dx[j] * dx[k] + dy[j] * dy[k];
+         cossquare = dotproduct * dotproduct / (edgelength[j] * edgelength[k]);
+         tendegree = 8;
+         for (ii = 7; ii >= 0; ii--) {
+            if (cossquare > cossquaretable[ii]) {
+               tendegree = ii;
+            }
+         }
+         if (dotproduct <= 0.0) {
+            angletable[tendegree]++;
+            if (cossquare > smallestangle) {
+               smallestangle = cossquare;
+            }
+            if (acutebiggest && (cossquare < biggestangle)) {
+               biggestangle = cossquare;
+            }
+         }
+         else {
+            angletable[17 - tendegree]++;
+            if (acutebiggest || (cossquare > biggestangle)) {
+               biggestangle = cossquare;
+               acutebiggest = 0;
+            }
+         }
+      }
+      triangleloop.tri = triangletraverse(m);
+   }
+
+   shortest = sqrt(shortest);
+   longest = sqrt(longest);
+   minaltitude = sqrt(minaltitude);
+   worstaspect = sqrt(worstaspect);
+   smallestarea *= 0.5;
+   biggestarea *= 0.5;
+   if (smallestangle >= 1.0) {
+      smallestangle = 0.0;
+   }
+   else {
+      smallestangle = degconst * acos(sqrt(smallestangle));
+   }
+   if (biggestangle >= 1.0) {
+      biggestangle = 180.0;
+   }
+   else {
+      if (acutebiggest) {
+         biggestangle = degconst * acos(sqrt(biggestangle));
+      }
+      else {
+         biggestangle = 180.0 - degconst * acos(sqrt(biggestangle));
+      }
+   }
+
+   printf("  Smallest area: %16.5g   |  Largest area: %16.5g\n", smallestarea, biggestarea);
+   printf("  Shortest edge: %16.5g   |  Longest edge: %16.5g\n", shortest, longest);
+   printf(
+         "  Shortest altitude: %12.5g   |  Largest aspect ratio: %8.5g\n\n", minaltitude, worstaspect);
+
+   printf("  Triangle aspect ratio histogram:\n");
+   printf(
+         "  1.1547 - %-6.6g    :  %8d    | %6.6g - %-6.6g     :  %8d\n", ratiotable[0], aspecttable[0], ratiotable[7], ratiotable[8], aspecttable[8]);
+   for (i = 1; i < 7; i++) {
+      printf(
+            "  %6.6g - %-6.6g    :  %8d    | %6.6g - %-6.6g     :  %8d\n", ratiotable[i - 1], ratiotable[i], aspecttable[i], ratiotable[i + 7], ratiotable[i + 8], aspecttable[i + 8]);
+   }
+   printf(
+         "  %6.6g - %-6.6g    :  %8d    | %6.6g -            :  %8d\n", ratiotable[6], ratiotable[7], aspecttable[7], ratiotable[14], aspecttable[15]);
+   printf("  (Aspect ratio is longest edge divided by shortest altitude)\n\n");
+
+   printf("  Smallest angle: %15.5g   |  Largest angle: %15.5g\n\n", smallestangle, biggestangle);
+
+   printf("  Angle histogram:\n");
+   for (i = 0; i < 9; i++) {
+      printf(
+            "    %3d - %3d degrees:  %8d    |    %3d - %3d degrees:  %8d\n", i * 10, i * 10 + 10, angletable[i], i * 10 + 90, i * 10 + 100, angletable[i + 9]);
+   }
+   printf("\n");
+}
+
+/*****************************************************************************/
+/*                                                                           */
+/*  statistics()   Print all sorts of cool facts.                            */
+/*                                                                           */
+/*****************************************************************************/
+
+void statistics(struct mesh *m, struct behavior *b) {
+   printf("\nStatistics:\n\n");
+   printf("  Input vertices: %d\n", m->invertices);
+   if (b->refine) {
+      printf("  Input triangles: %d\n", m->inelements);
+   }
+   if (b->poly) {
+      printf("  Input segments: %d\n", m->insegments);
+      if (!b->refine) {
+         printf("  Input holes: %d\n", m->holes);
+      }
+   }
+
+   printf("\n  Mesh vertices: %ld\n", m->vertices.items - m->undeads);
+   printf("  Mesh triangles: %ld\n", m->triangles.items);
+   printf("  Mesh edges: %ld\n", m->edges);
+   printf("  Mesh exterior boundary edges: %ld\n", m->hullsize);
+   if (b->poly || b->refine) {
+      printf("  Mesh interior boundary edges: %ld\n", m->subsegs.items - m->hullsize);
+      printf("  Mesh subsegments (constrained edges): %ld\n", m->subsegs.items);
+   }
+   printf("\n");
+
+   if (b->verbose) {
+      quality_statistics(m, b);
+      printf("Memory allocation statistics:\n\n");
+      printf("  Maximum number of vertices: %ld\n", m->vertices.maxitems);
+      printf("  Maximum number of triangles: %ld\n", m->triangles.maxitems);
+      if (m->subsegs.maxitems > 0) {
+         printf("  Maximum number of subsegments: %ld\n", m->subsegs.maxitems);
+      }
+      if (m->viri.maxitems > 0) {
+         printf("  Maximum number of viri: %ld\n", m->viri.maxitems);
+      }
+      if (m->badsubsegs.maxitems > 0) {
+         printf("  Maximum number of encroached subsegments: %ld\n", m->badsubsegs.maxitems);
+      }
+      if (m->badtriangles.maxitems > 0) {
+         printf("  Maximum number of bad triangles: %ld\n", m->badtriangles.maxitems);
+      }
+      if (m->flipstackers.maxitems > 0) {
+         printf("  Maximum number of stacked triangle flips: %ld\n", m->flipstackers.maxitems);
+      }
+      if (m->splaynodes.maxitems > 0) {
+         printf("  Maximum number of splay tree nodes: %ld\n", m->splaynodes.maxitems);
+      }
+      printf(
+            "  Approximate heap memory use (bytes): %ld\n\n", m->vertices.maxitems * m->vertices.itembytes + m->triangles.maxitems * m->triangles.itembytes + m->subsegs.maxitems * m->subsegs.itembytes + m->viri.maxitems * m->viri.itembytes + m->badsubsegs.maxitems * m->badsubsegs.itembytes + m->badtriangles.maxitems * m->badtriangles.itembytes + m->flipstackers.maxitems * m->flipstackers.itembytes + m->splaynodes.maxitems * m->splaynodes.itembytes);
+
+      printf("Algorithmic statistics:\n\n");
+      if (!b->weighted) {
+         printf("  Number of incircle tests: %ld\n", m->incirclecount);
+      }
+      else {
+         printf("  Number of 3D orientation tests: %ld\n", m->orient3dcount);
+      }
+      printf("  Number of 2D orientation tests: %ld\n", m->counterclockcount);
+      if (m->hyperbolacount > 0) {
+         printf("  Number of right-of-hyperbola tests: %ld\n", m->hyperbolacount);
+      }
+      if (m->circletopcount > 0) {
+         printf("  Number of circle top computations: %ld\n", m->circletopcount);
+      }
+      if (m->circumcentercount > 0) {
+         printf("  Number of triangle circumcenter computations: %ld\n", m->circumcentercount);
+      }
+      printf("\n");
+   }
+}
+
+/********* Debugging routines begin here                             *********/
+/**                                                                         **/
+/**                                                                         **/
+
+/*****************************************************************************/
+/*                                                                           */
+/*  printtriangle()   Print out the details of an oriented triangle.         */
+/*                                                                           */
+/*  I originally wrote this procedure to simplify debugging; it can be       */
+/*  called directly from the debugger, and presents information about an     */
+/*  oriented triangle in digestible form.  It's also used when the           */
+/*  highest level of verbosity (`-VVV') is specified.                        */
+/*                                                                           */
+/*****************************************************************************/
+
+void printtriangle(struct mesh *m, struct behavior *b, struct otri *t) {
+   struct otri printtri;
+   struct osub printsh;
+   vertex printvertex;
+
+   printf("triangle x%lx with orientation %d:\n", (unsigned long) t->tri, t->orient);
+   decode(t->tri[0], printtri);
+   if (printtri.tri == m->dummytri) {
+      printf("    [0] = Outer space\n");
+   }
+   else {
+      printf("    [0] = x%lx  %d\n", (unsigned long) printtri.tri, printtri.orient);
+   }
+   decode(t->tri[1], printtri);
+   if (printtri.tri == m->dummytri) {
+      printf("    [1] = Outer space\n");
+   }
+   else {
+      printf("    [1] = x%lx  %d\n", (unsigned long) printtri.tri, printtri.orient);
+   }
+   decode(t->tri[2], printtri);
+   if (printtri.tri == m->dummytri) {
+      printf("    [2] = Outer space\n");
+   }
+   else {
+      printf("    [2] = x%lx  %d\n", (unsigned long) printtri.tri, printtri.orient);
+   }
+
+   org(*t, printvertex);
+   if (printvertex == (vertex) NULL)
+      printf("    Origin[%d] = NULL\n", (t->orient + 1) % 3 + 3);
+   else
+      printf(
+            "    Origin[%d] = x%lx  (%.12g, %.12g)\n", (t->orient + 1) % 3 + 3, (unsigned long) printvertex, printvertex[0], printvertex[1]);
+   dest(*t, printvertex);
+   if (printvertex == (vertex) NULL)
+      printf("    Dest  [%d] = NULL\n", (t->orient + 2) % 3 + 3);
+   else
+      printf(
+            "    Dest  [%d] = x%lx  (%.12g, %.12g)\n", (t->orient + 2) % 3 + 3, (unsigned long) printvertex, printvertex[0], printvertex[1]);
+   apex(*t, printvertex);
+   if (printvertex == (vertex) NULL)
+      printf("    Apex  [%d] = NULL\n", t->orient + 3);
+   else
+      printf(
+            "    Apex  [%d] = x%lx  (%.12g, %.12g)\n", t->orient + 3, (unsigned long) printvertex, printvertex[0], printvertex[1]);
+
+   if (b->usesegments) {
+      sdecode(t->tri[6], printsh);
+      if (printsh.ss != m->dummysub) {
+         printf("    [6] = x%lx  %d\n", (unsigned long) printsh.ss, printsh.ssorient);
+      }
+      sdecode(t->tri[7], printsh);
+      if (printsh.ss != m->dummysub) {
+         printf("    [7] = x%lx  %d\n", (unsigned long) printsh.ss, printsh.ssorient);
+      }
+      sdecode(t->tri[8], printsh);
+      if (printsh.ss != m->dummysub) {
+         printf("    [8] = x%lx  %d\n", (unsigned long) printsh.ss, printsh.ssorient);
+      }
+   }
+
+   if (b->vararea) {
+      printf("    Area constraint:  %.4g\n", areabound(*t));
+   }
+}
+
+/*****************************************************************************/
+/*                                                                           */
+/*  printsubseg()   Print out the details of an oriented subsegment.         */
+/*                                                                           */
+/*  I originally wrote this procedure to simplify debugging; it can be       */
+/*  called directly from the debugger, and presents information about an     */
+/*  oriented subsegment in digestible form.  It's also used when the highest */
+/*  level of verbosity (`-VVV') is specified.                                */
+/*                                                                           */
+/*****************************************************************************/
+
+void printsubseg(struct mesh *m, struct behavior *b, struct osub *s) {
+   struct osub printsh;
+   struct otri printtri;
+   vertex printvertex;
+
+   printf(
+         "subsegment x%lx with orientation %d and mark %d:\n", (unsigned long) s->ss, s->ssorient, mark(*s));
+   sdecode(s->ss[0], printsh);
+   if (printsh.ss == m->dummysub) {
+      printf("    [0] = No subsegment\n");
+   }
+   else {
+      printf("    [0] = x%lx  %d\n", (unsigned long) printsh.ss, printsh.ssorient);
+   }
+   sdecode(s->ss[1], printsh);
+   if (printsh.ss == m->dummysub) {
+      printf("    [1] = No subsegment\n");
+   }
+   else {
+      printf("    [1] = x%lx  %d\n", (unsigned long) printsh.ss, printsh.ssorient);
+   }
+
+   sorg(*s, printvertex);
+   if (printvertex == (vertex) NULL)
+      printf("    Origin[%d] = NULL\n", 2 + s->ssorient);
+   else
+      printf(
+            "    Origin[%d] = x%lx  (%.12g, %.12g)\n", 2 + s->ssorient, (unsigned long) printvertex, printvertex[0], printvertex[1]);
+   sdest(*s, printvertex);
+   if (printvertex == (vertex) NULL)
+      printf("    Dest  [%d] = NULL\n", 3 - s->ssorient);
+   else
+      printf(
+            "    Dest  [%d] = x%lx  (%.12g, %.12g)\n", 3 - s->ssorient, (unsigned long) printvertex, printvertex[0], printvertex[1]);
+
+   decode(s->ss[6], printtri);
+   if (printtri.tri == m->dummytri) {
+      printf("    [6] = Outer space\n");
+   }
+   else {
+      printf("    [6] = x%lx  %d\n", (unsigned long) printtri.tri, printtri.orient);
+   }
+   decode(s->ss[7], printtri);
+   if (printtri.tri == m->dummytri) {
+      printf("    [7] = Outer space\n");
+   }
+   else {
+      printf("    [7] = x%lx  %d\n", (unsigned long) printtri.tri, printtri.orient);
+   }
+
+   segorg(*s, printvertex);
+   if (printvertex == (vertex) NULL)
+      printf("    Segment origin[%d] = NULL\n", 4 + s->ssorient);
+   else
+      printf(
+            "    Segment origin[%d] = x%lx  (%.12g, %.12g)\n", 4 + s->ssorient, (unsigned long) printvertex, printvertex[0], printvertex[1]);
+   segdest(*s, printvertex);
+   if (printvertex == (vertex) NULL)
+      printf("    Segment dest  [%d] = NULL\n", 5 - s->ssorient);
+   else
+      printf(
+            "    Segment dest  [%d] = x%lx  (%.12g, %.12g)\n", 5 - s->ssorient, (unsigned long) printvertex, printvertex[0], printvertex[1]);
+}
+
+/**                                                                         **/
+/**                                                                         **/
+/********* Debugging routines end here                               *********/
--- a/vtm/jni/tessellate/LICENSE
+++ b/vtm/jni/tessellate/LICENSE
@@ -0,0 +1,37 @@
+Copyright notice and license for the libtess files (all source files besides
+tessellate.[ch] and main.c):
+
+SGI FREE SOFTWARE LICENSE B (Version 2.0, Sept. 18, 2008)
+Copyright (C) 1991-2000 Silicon Graphics, Inc. All Rights Reserved.
+
+Permission is hereby granted, free of charge, to any person obtaining a
+copy of this software and associated documentation files (the "Software"),
+to deal in the Software without restriction, including without limitation
+the rights to use, copy, modify, merge, publish, distribute, sublicense,
+and/or sell copies of the Software, and to permit persons to whom the
+Software is furnished to do so, subject to the following conditions:
+
+The above copyright notice including the dates of first publication and
+either this permission notice or a reference to
+http://oss.sgi.com/projects/FreeB/
+shall be included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
+OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
+SILICON GRAPHICS, INC. BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
+WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF
+OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
+
+Except as contained in this notice, the name of Silicon Graphics, Inc.
+shall not be used in advertising or otherwise to promote the sale, use or
+other dealings in this Software without prior written authorization from
+Silicon Graphics, Inc.
+
+--------------------------------------------------------------------------------
+
+Copyright notice for the other files:
+
+SGI FREE SOFTWARE LICENSE B (Version 2.0, Sept. 18, 2008)
+Copyright (C) 2013 AT&T Intellectual Property. All Rights Reserved.
--- a/vtm/jni/tessellate/Makefile
+++ b/vtm/jni/tessellate/Makefile
@@ -0,0 +1,2 @@
+all:
+	gcc dict.c mesh.c render.c tess.c geom.c memalloc.c normal.c priorityq.c sweep.c tessmono.c tessellate.c main.c -o tessellate
--- a/vtm/jni/tessellate/README.md
+++ b/vtm/jni/tessellate/README.md
@@ -0,0 +1,18 @@
+# A minimal, self-contained port of SGI's GLU libtess
+
+Polygon tessellation is a major pain in the neck. Have you ever tried
+writing fast and robust code for it? libtess is, to my knowledge, the
+only GPL-compatible, liberally-licensed, high-quality polygon
+triangulator out there.
+
+This repository includes a self-contained function (tessellate, in
+tessellate.c) that you can call to triangulate a polygon that is
+potentially self-intersecting, with holes, or with duplicate
+vertices. Simple examples of calling the tessellate function directly
+are located in main.c.
+
+More interestingly, this repository also includes an
+Emscripten-compiled module, _tessellate.js, and a Javascript-friendly
+wrapper, in tessellate.js. Simple examples are available under
+index.html.
+
--- a/vtm/jni/tessellate/dict-list.h
+++ b/vtm/jni/tessellate/dict-list.h
@@ -0,0 +1,100 @@
+/*
+ * SGI FREE SOFTWARE LICENSE B (Version 2.0, Sept. 18, 2008)
+ * Copyright (C) 1991-2000 Silicon Graphics, Inc. All Rights Reserved.
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a
+ * copy of this software and associated documentation files (the "Software"),
+ * to deal in the Software without restriction, including without limitation
+ * the rights to use, copy, modify, merge, publish, distribute, sublicense,
+ * and/or sell copies of the Software, and to permit persons to whom the
+ * Software is furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice including the dates of first publication and
+ * either this permission notice or a reference to
+ * http://oss.sgi.com/projects/FreeB/
+ * shall be included in all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
+ * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
+ * SILICON GRAPHICS, INC. BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
+ * WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF
+ * OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+ * SOFTWARE.
+ *
+ * Except as contained in this notice, the name of Silicon Graphics, Inc.
+ * shall not be used in advertising or otherwise to promote the sale, use or
+ * other dealings in this Software without prior written authorization from
+ * Silicon Graphics, Inc.
+ */
+/*
+** Author: Eric Veach, July 1994.
+**
+*/
+
+#ifndef __dict_list_h_
+#define __dict_list_h_
+
+/* Use #define's so that another heap implementation can use this one */
+
+#define DictKey		DictListKey
+#define Dict		DictList
+#define DictNode	DictListNode
+
+#define dictNewDict(frame,leq)		__gl_dictListNewDict(frame,leq)
+#define dictDeleteDict(dict)		__gl_dictListDeleteDict(dict)
+
+#define dictSearch(dict,key)		__gl_dictListSearch(dict,key)
+#define dictInsert(dict,key)		__gl_dictListInsert(dict,key)
+#define dictInsertBefore(dict,node,key)	__gl_dictListInsertBefore(dict,node,key)
+#define dictDelete(dict,node)		__gl_dictListDelete(dict,node)
+
+#define dictKey(n)			__gl_dictListKey(n)
+#define dictSucc(n)			__gl_dictListSucc(n)
+#define dictPred(n)			__gl_dictListPred(n)
+#define dictMin(d)			__gl_dictListMin(d)
+#define dictMax(d)			__gl_dictListMax(d)
+
+
+
+typedef void *DictKey;
+typedef struct Dict Dict;
+typedef struct DictNode DictNode;
+
+Dict		*dictNewDict(
+			void *frame,
+			int (*leq)(void *frame, DictKey key1, DictKey key2) );
+			
+void		dictDeleteDict( Dict *dict );
+
+/* Search returns the node with the smallest key greater than or equal
+ * to the given key.  If there is no such key, returns a node whose
+ * key is NULL.  Similarly, Succ(Max(d)) has a NULL key, etc.
+ */
+DictNode	*dictSearch( Dict *dict, DictKey key );
+DictNode	*dictInsertBefore( Dict *dict, DictNode *node, DictKey key );
+void		dictDelete( Dict *dict, DictNode *node );
+
+#define		__gl_dictListKey(n)	((n)->key)
+#define		__gl_dictListSucc(n)	((n)->next)
+#define		__gl_dictListPred(n)	((n)->prev)
+#define		__gl_dictListMin(d)	((d)->head.next)
+#define		__gl_dictListMax(d)	((d)->head.prev)
+#define	       __gl_dictListInsert(d,k) (dictInsertBefore((d),&(d)->head,(k)))
+
+
+/*** Private data structures ***/
+
+struct DictNode {
+  DictKey	key;
+  DictNode	*next;
+  DictNode	*prev;
+};
+
+struct Dict {
+  DictNode	head;
+  void		*frame;
+  int		(*leq)(void *frame, DictKey key1, DictKey key2);
+};
+
+#endif
--- a/vtm/jni/tessellate/dict.c
+++ b/vtm/jni/tessellate/dict.c
@@ -0,0 +1,111 @@
+/*
+ * SGI FREE SOFTWARE LICENSE B (Version 2.0, Sept. 18, 2008)
+ * Copyright (C) 1991-2000 Silicon Graphics, Inc. All Rights Reserved.
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a
+ * copy of this software and associated documentation files (the "Software"),
+ * to deal in the Software without restriction, including without limitation
+ * the rights to use, copy, modify, merge, publish, distribute, sublicense,
+ * and/or sell copies of the Software, and to permit persons to whom the
+ * Software is furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice including the dates of first publication and
+ * either this permission notice or a reference to
+ * http://oss.sgi.com/projects/FreeB/
+ * shall be included in all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
+ * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
+ * SILICON GRAPHICS, INC. BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
+ * WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF
+ * OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+ * SOFTWARE.
+ *
+ * Except as contained in this notice, the name of Silicon Graphics, Inc.
+ * shall not be used in advertising or otherwise to promote the sale, use or
+ * other dealings in this Software without prior written authorization from
+ * Silicon Graphics, Inc.
+ */
+/*
+** Author: Eric Veach, July 1994.
+**
+*/
+
+#include <stddef.h>
+#include "dict-list.h"
+#include "memalloc.h"
+
+/* really __gl_dictListNewDict */
+Dict *dictNewDict( void *frame,
+		   int (*leq)(void *frame, DictKey key1, DictKey key2) )
+{
+  Dict *dict = (Dict *) memAlloc( sizeof( Dict ));
+  DictNode *head;
+
+  if (dict == NULL) return NULL;
+
+  head = &dict->head;
+
+  head->key = NULL;
+  head->next = head;
+  head->prev = head;
+
+  dict->frame = frame;
+  dict->leq = leq;
+
+  return dict;
+}
+
+/* really __gl_dictListDeleteDict */
+void dictDeleteDict( Dict *dict )
+{
+  DictNode *node, *next;
+
+  for( node = dict->head.next; node != &dict->head; node = next ) {
+    next = node->next;
+    memFree( node );
+  }
+  memFree( dict );
+}
+
+/* really __gl_dictListInsertBefore */
+DictNode *dictInsertBefore( Dict *dict, DictNode *node, DictKey key )
+{
+  DictNode *newNode;
+
+  do {
+    node = node->prev;
+  } while( node->key != NULL && ! (*dict->leq)(dict->frame, node->key, key));
+
+  newNode = (DictNode *) memAlloc( sizeof( DictNode ));
+  if (newNode == NULL) return NULL;
+
+  newNode->key = key;
+  newNode->next = node->next;
+  node->next->prev = newNode;
+  newNode->prev = node;
+  node->next = newNode;
+
+  return newNode;
+}
+
+/* really __gl_dictListDelete */
+void dictDelete( Dict *dict, DictNode *node ) /*ARGSUSED*/
+{
+  node->next->prev = node->prev;
+  node->prev->next = node->next;
+  memFree( node );
+}
+
+/* really __gl_dictListSearch */
+DictNode *dictSearch( Dict *dict, DictKey key )
+{
+  DictNode *node = &dict->head;
+
+  do {
+    node = node->next;
+  } while( node->key != NULL && ! (*dict->leq)(dict->frame, key, node->key));
+
+  return node;
+}
--- a/vtm/jni/tessellate/dict.h
+++ b/vtm/jni/tessellate/dict.h
@@ -0,0 +1,100 @@
+/*
+ * SGI FREE SOFTWARE LICENSE B (Version 2.0, Sept. 18, 2008)
+ * Copyright (C) 1991-2000 Silicon Graphics, Inc. All Rights Reserved.
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a
+ * copy of this software and associated documentation files (the "Software"),
+ * to deal in the Software without restriction, including without limitation
+ * the rights to use, copy, modify, merge, publish, distribute, sublicense,
+ * and/or sell copies of the Software, and to permit persons to whom the
+ * Software is furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice including the dates of first publication and
+ * either this permission notice or a reference to
+ * http://oss.sgi.com/projects/FreeB/
+ * shall be included in all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
+ * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
+ * SILICON GRAPHICS, INC. BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
+ * WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF
+ * OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+ * SOFTWARE.
+ *
+ * Except as contained in this notice, the name of Silicon Graphics, Inc.
+ * shall not be used in advertising or otherwise to promote the sale, use or
+ * other dealings in this Software without prior written authorization from
+ * Silicon Graphics, Inc.
+ */
+/*
+** Author: Eric Veach, July 1994.
+**
+*/
+
+#ifndef __dict_list_h_
+#define __dict_list_h_
+
+/* Use #define's so that another heap implementation can use this one */
+
+#define DictKey		DictListKey
+#define Dict		DictList
+#define DictNode	DictListNode
+
+#define dictNewDict(frame,leq)		__gl_dictListNewDict(frame,leq)
+#define dictDeleteDict(dict)		__gl_dictListDeleteDict(dict)
+
+#define dictSearch(dict,key)		__gl_dictListSearch(dict,key)
+#define dictInsert(dict,key)		__gl_dictListInsert(dict,key)
+#define dictInsertBefore(dict,node,key)	__gl_dictListInsertBefore(dict,node,key)
+#define dictDelete(dict,node)		__gl_dictListDelete(dict,node)
+
+#define dictKey(n)			__gl_dictListKey(n)
+#define dictSucc(n)			__gl_dictListSucc(n)
+#define dictPred(n)			__gl_dictListPred(n)
+#define dictMin(d)			__gl_dictListMin(d)
+#define dictMax(d)			__gl_dictListMax(d)
+
+
+
+typedef void *DictKey;
+typedef struct Dict Dict;
+typedef struct DictNode DictNode;
+
+Dict		*dictNewDict(
+			void *frame,
+			int (*leq)(void *frame, DictKey key1, DictKey key2) );
+			
+void		dictDeleteDict( Dict *dict );
+
+/* Search returns the node with the smallest key greater than or equal
+ * to the given key.  If there is no such key, returns a node whose
+ * key is NULL.  Similarly, Succ(Max(d)) has a NULL key, etc.
+ */
+DictNode	*dictSearch( Dict *dict, DictKey key );
+DictNode	*dictInsertBefore( Dict *dict, DictNode *node, DictKey key );
+void		dictDelete( Dict *dict, DictNode *node );
+
+#define		__gl_dictListKey(n)	((n)->key)
+#define		__gl_dictListSucc(n)	((n)->next)
+#define		__gl_dictListPred(n)	((n)->prev)
+#define		__gl_dictListMin(d)	((d)->head.next)
+#define		__gl_dictListMax(d)	((d)->head.prev)
+#define	       __gl_dictListInsert(d,k) (dictInsertBefore((d),&(d)->head,(k)))
+
+
+/*** Private data structures ***/
+
+struct DictNode {
+  DictKey	key;
+  DictNode	*next;
+  DictNode	*prev;
+};
+
+struct Dict {
+  DictNode	head;
+  void		*frame;
+  int		(*leq)(void *frame, DictKey key1, DictKey key2);
+};
+
+#endif
--- a/vtm/jni/tessellate/geom.c
+++ b/vtm/jni/tessellate/geom.c
@@ -0,0 +1,264 @@
+/*
+ * SGI FREE SOFTWARE LICENSE B (Version 2.0, Sept. 18, 2008)
+ * Copyright (C) 1991-2000 Silicon Graphics, Inc. All Rights Reserved.
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a
+ * copy of this software and associated documentation files (the "Software"),
+ * to deal in the Software without restriction, including without limitation
+ * the rights to use, copy, modify, merge, publish, distribute, sublicense,
+ * and/or sell copies of the Software, and to permit persons to whom the
+ * Software is furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice including the dates of first publication and
+ * either this permission notice or a reference to
+ * http://oss.sgi.com/projects/FreeB/
+ * shall be included in all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
+ * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
+ * SILICON GRAPHICS, INC. BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
+ * WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF
+ * OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+ * SOFTWARE.
+ *
+ * Except as contained in this notice, the name of Silicon Graphics, Inc.
+ * shall not be used in advertising or otherwise to promote the sale, use or
+ * other dealings in this Software without prior written authorization from
+ * Silicon Graphics, Inc.
+ */
+/*
+** Author: Eric Veach, July 1994.
+**
+*/
+
+#include "gluos.h"
+#include <assert.h>
+#include "mesh.h"
+#include "geom.h"
+
+int __gl_vertLeq( GLUvertex *u, GLUvertex *v )
+{
+  /* Returns TRUE if u is lexicographically <= v. */
+
+  return VertLeq( u, v );
+}
+
+GLdouble __gl_edgeEval( GLUvertex *u, GLUvertex *v, GLUvertex *w )
+{
+  /* Given three vertices u,v,w such that VertLeq(u,v) && VertLeq(v,w),
+   * evaluates the t-coord of the edge uw at the s-coord of the vertex v.
+   * Returns v->t - (uw)(v->s), ie. the signed distance from uw to v.
+   * If uw is vertical (and thus passes thru v), the result is zero.
+   *
+   * The calculation is extremely accurate and stable, even when v
+   * is very close to u or w.  In particular if we set v->t = 0 and
+   * let r be the negated result (this evaluates (uw)(v->s)), then
+   * r is guaranteed to satisfy MIN(u->t,w->t) <= r <= MAX(u->t,w->t).
+   */
+  GLdouble gapL, gapR;
+
+  assert( VertLeq( u, v ) && VertLeq( v, w ));
+  
+  gapL = v->s - u->s;
+  gapR = w->s - v->s;
+
+  if( gapL + gapR > 0 ) {
+    if( gapL < gapR ) {
+      return (v->t - u->t) + (u->t - w->t) * (gapL / (gapL + gapR));
+    } else {
+      return (v->t - w->t) + (w->t - u->t) * (gapR / (gapL + gapR));
+    }
+  }
+  /* vertical line */
+  return 0;
+}
+
+GLdouble __gl_edgeSign( GLUvertex *u, GLUvertex *v, GLUvertex *w )
+{
+  /* Returns a number whose sign matches EdgeEval(u,v,w) but which
+   * is cheaper to evaluate.  Returns > 0, == 0 , or < 0
+   * as v is above, on, or below the edge uw.
+   */
+  GLdouble gapL, gapR;
+
+  assert( VertLeq( u, v ) && VertLeq( v, w ));
+  
+  gapL = v->s - u->s;
+  gapR = w->s - v->s;
+
+  if( gapL + gapR > 0 ) {
+    return (v->t - w->t) * gapL + (v->t - u->t) * gapR;
+  }
+  /* vertical line */
+  return 0;
+}
+
+
+/***********************************************************************
+ * Define versions of EdgeSign, EdgeEval with s and t transposed.
+ */
+
+GLdouble __gl_transEval( GLUvertex *u, GLUvertex *v, GLUvertex *w )
+{
+  /* Given three vertices u,v,w such that TransLeq(u,v) && TransLeq(v,w),
+   * evaluates the t-coord of the edge uw at the s-coord of the vertex v.
+   * Returns v->s - (uw)(v->t), ie. the signed distance from uw to v.
+   * If uw is vertical (and thus passes thru v), the result is zero.
+   *
+   * The calculation is extremely accurate and stable, even when v
+   * is very close to u or w.  In particular if we set v->s = 0 and
+   * let r be the negated result (this evaluates (uw)(v->t)), then
+   * r is guaranteed to satisfy MIN(u->s,w->s) <= r <= MAX(u->s,w->s).
+   */
+  GLdouble gapL, gapR;
+
+  assert( TransLeq( u, v ) && TransLeq( v, w ));
+  
+  gapL = v->t - u->t;
+  gapR = w->t - v->t;
+
+  if( gapL + gapR > 0 ) {
+    if( gapL < gapR ) {
+      return (v->s - u->s) + (u->s - w->s) * (gapL / (gapL + gapR));
+    } else {
+      return (v->s - w->s) + (w->s - u->s) * (gapR / (gapL + gapR));
+    }
+  }
+  /* vertical line */
+  return 0;
+}
+
+GLdouble __gl_transSign( GLUvertex *u, GLUvertex *v, GLUvertex *w )
+{
+  /* Returns a number whose sign matches TransEval(u,v,w) but which
+   * is cheaper to evaluate.  Returns > 0, == 0 , or < 0
+   * as v is above, on, or below the edge uw.
+   */
+  GLdouble gapL, gapR;
+
+  assert( TransLeq( u, v ) && TransLeq( v, w ));
+  
+  gapL = v->t - u->t;
+  gapR = w->t - v->t;
+
+  if( gapL + gapR > 0 ) {
+    return (v->s - w->s) * gapL + (v->s - u->s) * gapR;
+  }
+  /* vertical line */
+  return 0;
+}
+
+
+int __gl_vertCCW( GLUvertex *u, GLUvertex *v, GLUvertex *w )
+{
+  /* For almost-degenerate situations, the results are not reliable.
+   * Unless the floating-point arithmetic can be performed without
+   * rounding errors, *any* implementation will give incorrect results
+   * on some degenerate inputs, so the client must have some way to
+   * handle this situation.
+   */
+  return (u->s*(v->t - w->t) + v->s*(w->t - u->t) + w->s*(u->t - v->t)) >= 0;
+}
+
+/* Given parameters a,x,b,y returns the value (b*x+a*y)/(a+b),
+ * or (x+y)/2 if a==b==0.  It requires that a,b >= 0, and enforces
+ * this in the rare case that one argument is slightly negative.
+ * The implementation is extremely stable numerically.
+ * In particular it guarantees that the result r satisfies
+ * MIN(x,y) <= r <= MAX(x,y), and the results are very accurate
+ * even when a and b differ greatly in magnitude.
+ */
+#define RealInterpolate(a,x,b,y)			\
+  (a = (a < 0) ? 0 : a, b = (b < 0) ? 0 : b,		\
+  ((a <= b) ? ((b == 0) ? ((x+y) / 2)			\
+                        : (x + (y-x) * (a/(a+b))))	\
+            : (y + (x-y) * (b/(a+b)))))
+
+#ifndef FOR_TRITE_TEST_PROGRAM
+#define Interpolate(a,x,b,y)	RealInterpolate(a,x,b,y)
+#else
+
+/* Claim: the ONLY property the sweep algorithm relies on is that
+ * MIN(x,y) <= r <= MAX(x,y).  This is a nasty way to test that.
+ */
+#include <stdlib.h>
+extern int RandomInterpolate;
+
+GLdouble Interpolate( GLdouble a, GLdouble x, GLdouble b, GLdouble y)
+{
+printf("*********************%d\n",RandomInterpolate);
+  if( RandomInterpolate ) {
+    a = 1.2 * drand48() - 0.1;
+    a = (a < 0) ? 0 : ((a > 1) ? 1 : a);
+    b = 1.0 - a;
+  }
+  return RealInterpolate(a,x,b,y);
+}
+
+#endif
+
+#define Swap(a,b)	do { GLUvertex *t = a; a = b; b = t; } while (0)
+
+void __gl_edgeIntersect( GLUvertex *o1, GLUvertex *d1,
+			 GLUvertex *o2, GLUvertex *d2,
+			 GLUvertex *v )
+/* Given edges (o1,d1) and (o2,d2), compute their point of intersection.
+ * The computed point is guaranteed to lie in the intersection of the
+ * bounding rectangles defined by each edge.
+ */
+{
+  GLdouble z1, z2;
+
+  /* This is certainly not the most efficient way to find the intersection
+   * of two line segments, but it is very numerically stable.
+   *
+   * Strategy: find the two middle vertices in the VertLeq ordering,
+   * and interpolate the intersection s-value from these.  Then repeat
+   * using the TransLeq ordering to find the intersection t-value.
+   */
+
+  if( ! VertLeq( o1, d1 )) { Swap( o1, d1 ); }
+  if( ! VertLeq( o2, d2 )) { Swap( o2, d2 ); }
+  if( ! VertLeq( o1, o2 )) { Swap( o1, o2 ); Swap( d1, d2 ); }
+
+  if( ! VertLeq( o2, d1 )) {
+    /* Technically, no intersection -- do our best */
+    v->s = (o2->s + d1->s) / 2;
+  } else if( VertLeq( d1, d2 )) {
+    /* Interpolate between o2 and d1 */
+    z1 = EdgeEval( o1, o2, d1 );
+    z2 = EdgeEval( o2, d1, d2 );
+    if( z1+z2 < 0 ) { z1 = -z1; z2 = -z2; }
+    v->s = Interpolate( z1, o2->s, z2, d1->s );
+  } else {
+    /* Interpolate between o2 and d2 */
+    z1 = EdgeSign( o1, o2, d1 );
+    z2 = -EdgeSign( o1, d2, d1 );
+    if( z1+z2 < 0 ) { z1 = -z1; z2 = -z2; }
+    v->s = Interpolate( z1, o2->s, z2, d2->s );
+  }
+
+  /* Now repeat the process for t */
+
+  if( ! TransLeq( o1, d1 )) { Swap( o1, d1 ); }
+  if( ! TransLeq( o2, d2 )) { Swap( o2, d2 ); }
+  if( ! TransLeq( o1, o2 )) { Swap( o1, o2 ); Swap( d1, d2 ); }
+
+  if( ! TransLeq( o2, d1 )) {
+    /* Technically, no intersection -- do our best */
+    v->t = (o2->t + d1->t) / 2;
+  } else if( TransLeq( d1, d2 )) {
+    /* Interpolate between o2 and d1 */
+    z1 = TransEval( o1, o2, d1 );
+    z2 = TransEval( o2, d1, d2 );
+    if( z1+z2 < 0 ) { z1 = -z1; z2 = -z2; }
+    v->t = Interpolate( z1, o2->t, z2, d1->t );
+  } else {
+    /* Interpolate between o2 and d2 */
+    z1 = TransSign( o1, o2, d1 );
+    z2 = -TransSign( o1, d2, d1 );
+    if( z1+z2 < 0 ) { z1 = -z1; z2 = -z2; }
+    v->t = Interpolate( z1, o2->t, z2, d2->t );
+  }
+}
--- a/vtm/jni/tessellate/geom.h
+++ b/vtm/jni/tessellate/geom.h
@@ -0,0 +1,84 @@
+/*
+ * SGI FREE SOFTWARE LICENSE B (Version 2.0, Sept. 18, 2008)
+ * Copyright (C) 1991-2000 Silicon Graphics, Inc. All Rights Reserved.
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a
+ * copy of this software and associated documentation files (the "Software"),
+ * to deal in the Software without restriction, including without limitation
+ * the rights to use, copy, modify, merge, publish, distribute, sublicense,
+ * and/or sell copies of the Software, and to permit persons to whom the
+ * Software is furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice including the dates of first publication and
+ * either this permission notice or a reference to
+ * http://oss.sgi.com/projects/FreeB/
+ * shall be included in all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
+ * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
+ * SILICON GRAPHICS, INC. BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
+ * WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF
+ * OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+ * SOFTWARE.
+ *
+ * Except as contained in this notice, the name of Silicon Graphics, Inc.
+ * shall not be used in advertising or otherwise to promote the sale, use or
+ * other dealings in this Software without prior written authorization from
+ * Silicon Graphics, Inc.
+ */
+/*
+** Author: Eric Veach, July 1994.
+**
+*/
+
+#ifndef __geom_h_
+#define __geom_h_
+
+#include "mesh.h"
+
+#ifdef NO_BRANCH_CONDITIONS
+/* MIPS architecture has special instructions to evaluate boolean
+ * conditions -- more efficient than branching, IF you can get the
+ * compiler to generate the right instructions (SGI compiler doesn't)
+ */
+#define VertEq(u,v)	(((u)->s == (v)->s) & ((u)->t == (v)->t))
+#define VertLeq(u,v)	(((u)->s < (v)->s) | \
+                         ((u)->s == (v)->s & (u)->t <= (v)->t))
+#else
+#define VertEq(u,v)	((u)->s == (v)->s && (u)->t == (v)->t)
+#define VertLeq(u,v)	(((u)->s < (v)->s) || \
+                         ((u)->s == (v)->s && (u)->t <= (v)->t))
+#endif
+
+#define EdgeEval(u,v,w) __gl_edgeEval(u,v,w)
+#define EdgeSign(u,v,w) __gl_edgeSign(u,v,w)
+
+/* Versions of VertLeq, EdgeSign, EdgeEval with s and t transposed. */
+
+#define TransLeq(u,v)	(((u)->t < (v)->t) || \
+                         ((u)->t == (v)->t && (u)->s <= (v)->s))
+#define TransEval(u,v,w)	__gl_transEval(u,v,w)
+#define TransSign(u,v,w)	__gl_transSign(u,v,w)
+
+
+#define EdgeGoesLeft(e) 	VertLeq( (e)->Dst, (e)->Org )
+#define EdgeGoesRight(e)	VertLeq( (e)->Org, (e)->Dst )
+
+#undef	ABS
+#define ABS(x)	((x) < 0 ? -(x) : (x))
+#define VertL1dist(u,v) (ABS(u->s - v->s) + ABS(u->t - v->t))
+
+#define VertCCW(u,v,w)	__gl_vertCCW(u,v,w)
+
+int		__gl_vertLeq( GLUvertex *u, GLUvertex *v );
+GLdouble	__gl_edgeEval( GLUvertex *u, GLUvertex *v, GLUvertex *w );
+GLdouble	__gl_edgeSign( GLUvertex *u, GLUvertex *v, GLUvertex *w );
+GLdouble	__gl_transEval( GLUvertex *u, GLUvertex *v, GLUvertex *w );
+GLdouble	__gl_transSign( GLUvertex *u, GLUvertex *v, GLUvertex *w );
+int		__gl_vertCCW( GLUvertex *u, GLUvertex *v, GLUvertex *w );
+void		__gl_edgeIntersect( GLUvertex *o1, GLUvertex *d1,
+				    GLUvertex *o2, GLUvertex *d2,
+				    GLUvertex *v );
+
+#endif
--- a/vtm/jni/tessellate/glu.h
+++ b/vtm/jni/tessellate/glu.h
@@ -0,0 +1,356 @@
+/*
+ * SGI FREE SOFTWARE LICENSE B (Version 2.0, Sept. 18, 2008)
+ * Copyright (C) 1991-2000 Silicon Graphics, Inc. All Rights Reserved.
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a
+ * copy of this software and associated documentation files (the "Software"),
+ * to deal in the Software without restriction, including without limitation
+ * the rights to use, copy, modify, merge, publish, distribute, sublicense,
+ * and/or sell copies of the Software, and to permit persons to whom the
+ * Software is furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice including the dates of first publication and
+ * either this permission notice or a reference to
+ * http://oss.sgi.com/projects/FreeB/
+ * shall be included in all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
+ * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
+ * SILICON GRAPHICS, INC. BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
+ * WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF
+ * OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+ * SOFTWARE.
+ *
+ * Except as contained in this notice, the name of Silicon Graphics, Inc.
+ * shall not be used in advertising or otherwise to promote the sale, use or
+ * other dealings in this Software without prior written authorization from
+ * Silicon Graphics, Inc.
+ */
+
+#ifndef __glu_h__
+#define __glu_h__
+
+#define GLAPIENTRYP *
+#define GLAPIENTRY
+#define GLAPI
+
+typedef int GLint;
+typedef unsigned int GLenum;
+typedef unsigned int GLsizei;
+typedef float GLfloat;
+typedef double GLdouble;
+typedef unsigned char GLubyte;
+typedef int GLboolean;
+typedef void GLvoid;
+
+#define GL_FALSE 0
+#define GL_TRUE 1
+#define GL_LINE_LOOP                      0x0002
+#define GL_LINE_STRIP                     0x0003
+#define GL_TRIANGLES                      0x0004
+#define GL_TRIANGLE_STRIP                 0x0005
+#define GL_TRIANGLE_FAN                   0x0006
+
+// #if (defined(_MSC_VER) || defined(__MINGW32__)) && defined(BUILD_GLU32)
+// # undef GLAPI
+// # define GLAPI __declspec(dllexport)
+// #elif (defined(_MSC_VER) || defined(__MINGW32__)) && defined(_DLL)
+// /* tag specifying we're building for DLL runtime support */
+// # undef GLAPI
+// # define GLAPI __declspec(dllimport)
+// #elif !defined(GLAPI)
+// /* for use with static link lib build of Win32 edition only */
+// # define GLAPI extern
+// #endif /* _STATIC_MESA support */
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+/*************************************************************/
+
+/* Extensions */
+#define GLU_EXT_object_space_tess          1
+#define GLU_EXT_nurbs_tessellator          1
+
+/* Boolean */
+#define GLU_FALSE                          0
+#define GLU_TRUE                           1
+
+/* Version */
+#define GLU_VERSION_1_1                    1
+#define GLU_VERSION_1_2                    1
+#define GLU_VERSION_1_3                    1
+
+/* StringName */
+#define GLU_VERSION                        100800
+#define GLU_EXTENSIONS                     100801
+
+/* ErrorCode */
+#define GLU_INVALID_ENUM                   100900
+#define GLU_INVALID_VALUE                  100901
+#define GLU_OUT_OF_MEMORY                  100902
+#define GLU_INCOMPATIBLE_GL_VERSION        100903
+#define GLU_INVALID_OPERATION              100904
+
+/* NurbsDisplay */
+/*      GLU_FILL */
+#define GLU_OUTLINE_POLYGON                100240
+#define GLU_OUTLINE_PATCH                  100241
+
+/* NurbsCallback */
+#define GLU_NURBS_ERROR                    100103
+#define GLU_ERROR                          100103
+#define GLU_NURBS_BEGIN                    100164
+#define GLU_NURBS_BEGIN_EXT                100164
+#define GLU_NURBS_VERTEX                   100165
+#define GLU_NURBS_VERTEX_EXT               100165
+#define GLU_NURBS_NORMAL                   100166
+#define GLU_NURBS_NORMAL_EXT               100166
+#define GLU_NURBS_COLOR                    100167
+#define GLU_NURBS_COLOR_EXT                100167
+#define GLU_NURBS_TEXTURE_COORD            100168
+#define GLU_NURBS_TEX_COORD_EXT            100168
+#define GLU_NURBS_END                      100169
+#define GLU_NURBS_END_EXT                  100169
+#define GLU_NURBS_BEGIN_DATA               100170
+#define GLU_NURBS_BEGIN_DATA_EXT           100170
+#define GLU_NURBS_VERTEX_DATA              100171
+#define GLU_NURBS_VERTEX_DATA_EXT          100171
+#define GLU_NURBS_NORMAL_DATA              100172
+#define GLU_NURBS_NORMAL_DATA_EXT          100172
+#define GLU_NURBS_COLOR_DATA               100173
+#define GLU_NURBS_COLOR_DATA_EXT           100173
+#define GLU_NURBS_TEXTURE_COORD_DATA       100174
+#define GLU_NURBS_TEX_COORD_DATA_EXT       100174
+#define GLU_NURBS_END_DATA                 100175
+#define GLU_NURBS_END_DATA_EXT             100175
+
+/* NurbsError */
+#define GLU_NURBS_ERROR1                   100251
+#define GLU_NURBS_ERROR2                   100252
+#define GLU_NURBS_ERROR3                   100253
+#define GLU_NURBS_ERROR4                   100254
+#define GLU_NURBS_ERROR5                   100255
+#define GLU_NURBS_ERROR6                   100256
+#define GLU_NURBS_ERROR7                   100257
+#define GLU_NURBS_ERROR8                   100258
+#define GLU_NURBS_ERROR9                   100259
+#define GLU_NURBS_ERROR10                  100260
+#define GLU_NURBS_ERROR11                  100261
+#define GLU_NURBS_ERROR12                  100262
+#define GLU_NURBS_ERROR13                  100263
+#define GLU_NURBS_ERROR14                  100264
+#define GLU_NURBS_ERROR15                  100265
+#define GLU_NURBS_ERROR16                  100266
+#define GLU_NURBS_ERROR17                  100267
+#define GLU_NURBS_ERROR18                  100268
+#define GLU_NURBS_ERROR19                  100269
+#define GLU_NURBS_ERROR20                  100270
+#define GLU_NURBS_ERROR21                  100271
+#define GLU_NURBS_ERROR22                  100272
+#define GLU_NURBS_ERROR23                  100273
+#define GLU_NURBS_ERROR24                  100274
+#define GLU_NURBS_ERROR25                  100275
+#define GLU_NURBS_ERROR26                  100276
+#define GLU_NURBS_ERROR27                  100277
+#define GLU_NURBS_ERROR28                  100278
+#define GLU_NURBS_ERROR29                  100279
+#define GLU_NURBS_ERROR30                  100280
+#define GLU_NURBS_ERROR31                  100281
+#define GLU_NURBS_ERROR32                  100282
+#define GLU_NURBS_ERROR33                  100283
+#define GLU_NURBS_ERROR34                  100284
+#define GLU_NURBS_ERROR35                  100285
+#define GLU_NURBS_ERROR36                  100286
+#define GLU_NURBS_ERROR37                  100287
+
+/* NurbsProperty */
+#define GLU_AUTO_LOAD_MATRIX               100200
+#define GLU_CULLING                        100201
+#define GLU_SAMPLING_TOLERANCE             100203
+#define GLU_DISPLAY_MODE                   100204
+#define GLU_PARAMETRIC_TOLERANCE           100202
+#define GLU_SAMPLING_METHOD                100205
+#define GLU_U_STEP                         100206
+#define GLU_V_STEP                         100207
+#define GLU_NURBS_MODE                     100160
+#define GLU_NURBS_MODE_EXT                 100160
+#define GLU_NURBS_TESSELLATOR              100161
+#define GLU_NURBS_TESSELLATOR_EXT          100161
+#define GLU_NURBS_RENDERER                 100162
+#define GLU_NURBS_RENDERER_EXT             100162
+
+/* NurbsSampling */
+#define GLU_OBJECT_PARAMETRIC_ERROR        100208
+#define GLU_OBJECT_PARAMETRIC_ERROR_EXT    100208
+#define GLU_OBJECT_PATH_LENGTH             100209
+#define GLU_OBJECT_PATH_LENGTH_EXT         100209
+#define GLU_PATH_LENGTH                    100215
+#define GLU_PARAMETRIC_ERROR               100216
+#define GLU_DOMAIN_DISTANCE                100217
+
+/* NurbsTrim */
+#define GLU_MAP1_TRIM_2                    100210
+#define GLU_MAP1_TRIM_3                    100211
+
+/* QuadricDrawStyle */
+#define GLU_POINT                          100010
+#define GLU_LINE                           100011
+#define GLU_FILL                           100012
+#define GLU_SILHOUETTE                     100013
+
+/* QuadricCallback */
+/*      GLU_ERROR */
+
+/* QuadricNormal */
+#define GLU_SMOOTH                         100000
+#define GLU_FLAT                           100001
+#define GLU_NONE                           100002
+
+/* QuadricOrientation */
+#define GLU_OUTSIDE                        100020
+#define GLU_INSIDE                         100021
+
+/* TessCallback */
+#define GLU_TESS_BEGIN                     100100
+#define GLU_BEGIN                          100100
+#define GLU_TESS_VERTEX                    100101
+#define GLU_VERTEX                         100101
+#define GLU_TESS_END                       100102
+#define GLU_END                            100102
+#define GLU_TESS_ERROR                     100103
+#define GLU_TESS_EDGE_FLAG                 100104
+#define GLU_EDGE_FLAG                      100104
+#define GLU_TESS_COMBINE                   100105
+#define GLU_TESS_BEGIN_DATA                100106
+#define GLU_TESS_VERTEX_DATA               100107
+#define GLU_TESS_END_DATA                  100108
+#define GLU_TESS_ERROR_DATA                100109
+#define GLU_TESS_EDGE_FLAG_DATA            100110
+#define GLU_TESS_COMBINE_DATA              100111
+
+/* TessContour */
+#define GLU_CW                             100120
+#define GLU_CCW                            100121
+#define GLU_INTERIOR                       100122
+#define GLU_EXTERIOR                       100123
+#define GLU_UNKNOWN                        100124
+
+/* TessProperty */
+#define GLU_TESS_WINDING_RULE              100140
+#define GLU_TESS_BOUNDARY_ONLY             100141
+#define GLU_TESS_TOLERANCE                 100142
+
+/* TessError */
+#define GLU_TESS_ERROR1                    100151
+#define GLU_TESS_ERROR2                    100152
+#define GLU_TESS_ERROR3                    100153
+#define GLU_TESS_ERROR4                    100154
+#define GLU_TESS_ERROR5                    100155
+#define GLU_TESS_ERROR6                    100156
+#define GLU_TESS_ERROR7                    100157
+#define GLU_TESS_ERROR8                    100158
+#define GLU_TESS_MISSING_BEGIN_POLYGON     100151
+#define GLU_TESS_MISSING_BEGIN_CONTOUR     100152
+#define GLU_TESS_MISSING_END_POLYGON       100153
+#define GLU_TESS_MISSING_END_CONTOUR       100154
+#define GLU_TESS_COORD_TOO_LARGE           100155
+#define GLU_TESS_NEED_COMBINE_CALLBACK     100156
+
+/* TessWinding */
+#define GLU_TESS_WINDING_ODD               100130
+#define GLU_TESS_WINDING_NONZERO           100131
+#define GLU_TESS_WINDING_POSITIVE          100132
+#define GLU_TESS_WINDING_NEGATIVE          100133
+#define GLU_TESS_WINDING_ABS_GEQ_TWO       100134
+
+/*************************************************************/
+
+
+#ifdef __cplusplus
+class GLUnurbs;
+class GLUquadric;
+class GLUtesselator;
+#else
+typedef struct GLUnurbs GLUnurbs;
+typedef struct GLUquadric GLUquadric;
+typedef struct GLUtesselator GLUtesselator;
+#endif
+
+typedef GLUnurbs GLUnurbsObj;
+typedef GLUquadric GLUquadricObj;
+typedef GLUtesselator GLUtesselatorObj;
+typedef GLUtesselator GLUtriangulatorObj;
+
+#define GLU_TESS_MAX_COORD 1.0e150
+
+/* Internal convenience typedefs */
+typedef void (GLAPIENTRYP _GLUfuncptr)(void);
+
+GLAPI void GLAPIENTRY gluBeginCurve (GLUnurbs* nurb);
+GLAPI void GLAPIENTRY gluBeginPolygon (GLUtesselator* tess);
+GLAPI void GLAPIENTRY gluBeginSurface (GLUnurbs* nurb);
+GLAPI void GLAPIENTRY gluBeginTrim (GLUnurbs* nurb);
+GLAPI GLint GLAPIENTRY gluBuild1DMipmapLevels (GLenum target, GLint internalFormat, GLsizei width, GLenum format, GLenum type, GLint level, GLint base, GLint max, const void *data);
+GLAPI GLint GLAPIENTRY gluBuild1DMipmaps (GLenum target, GLint internalFormat, GLsizei width, GLenum format, GLenum type, const void *data);
+GLAPI GLint GLAPIENTRY gluBuild2DMipmapLevels (GLenum target, GLint internalFormat, GLsizei width, GLsizei height, GLenum format, GLenum type, GLint level, GLint base, GLint max, const void *data);
+GLAPI GLint GLAPIENTRY gluBuild2DMipmaps (GLenum target, GLint internalFormat, GLsizei width, GLsizei height, GLenum format, GLenum type, const void *data);
+GLAPI GLint GLAPIENTRY gluBuild3DMipmapLevels (GLenum target, GLint internalFormat, GLsizei width, GLsizei height, GLsizei depth, GLenum format, GLenum type, GLint level, GLint base, GLint max, const void *data);
+GLAPI GLint GLAPIENTRY gluBuild3DMipmaps (GLenum target, GLint internalFormat, GLsizei width, GLsizei height, GLsizei depth, GLenum format, GLenum type, const void *data);
+GLAPI GLboolean GLAPIENTRY gluCheckExtension (const GLubyte *extName, const GLubyte *extString);
+GLAPI void GLAPIENTRY gluCylinder (GLUquadric* quad, GLdouble base, GLdouble top, GLdouble height, GLint slices, GLint stacks);
+GLAPI void GLAPIENTRY gluDeleteNurbsRenderer (GLUnurbs* nurb);
+GLAPI void GLAPIENTRY gluDeleteQuadric (GLUquadric* quad);
+GLAPI void GLAPIENTRY gluDeleteTess (GLUtesselator* tess);
+GLAPI void GLAPIENTRY gluDisk (GLUquadric* quad, GLdouble inner, GLdouble outer, GLint slices, GLint loops);
+GLAPI void GLAPIENTRY gluEndCurve (GLUnurbs* nurb);
+GLAPI void GLAPIENTRY gluEndPolygon (GLUtesselator* tess);
+GLAPI void GLAPIENTRY gluEndSurface (GLUnurbs* nurb);
+GLAPI void GLAPIENTRY gluEndTrim (GLUnurbs* nurb);
+GLAPI const GLubyte * GLAPIENTRY gluErrorString (GLenum error);
+GLAPI void GLAPIENTRY gluGetNurbsProperty (GLUnurbs* nurb, GLenum property, GLfloat* data);
+GLAPI const GLubyte * GLAPIENTRY gluGetString (GLenum name);
+GLAPI void GLAPIENTRY gluGetTessProperty (GLUtesselator* tess, GLenum which, GLdouble* data);
+GLAPI void GLAPIENTRY gluLoadSamplingMatrices (GLUnurbs* nurb, const GLfloat *model, const GLfloat *perspective, const GLint *view);
+GLAPI void GLAPIENTRY gluLookAt (GLdouble eyeX, GLdouble eyeY, GLdouble eyeZ, GLdouble centerX, GLdouble centerY, GLdouble centerZ, GLdouble upX, GLdouble upY, GLdouble upZ);
+GLAPI GLUnurbs* GLAPIENTRY gluNewNurbsRenderer (void);
+GLAPI GLUquadric* GLAPIENTRY gluNewQuadric (void);
+GLAPI GLUtesselator* GLAPIENTRY gluNewTess (void);
+GLAPI void GLAPIENTRY gluNextContour (GLUtesselator* tess, GLenum type);
+GLAPI void GLAPIENTRY gluNurbsCallback (GLUnurbs* nurb, GLenum which, _GLUfuncptr CallBackFunc);
+GLAPI void GLAPIENTRY gluNurbsCallbackData (GLUnurbs* nurb, GLvoid* userData);
+GLAPI void GLAPIENTRY gluNurbsCallbackDataEXT (GLUnurbs* nurb, GLvoid* userData);
+GLAPI void GLAPIENTRY gluNurbsCurve (GLUnurbs* nurb, GLint knotCount, GLfloat *knots, GLint stride, GLfloat *control, GLint order, GLenum type);
+GLAPI void GLAPIENTRY gluNurbsProperty (GLUnurbs* nurb, GLenum property, GLfloat value);
+GLAPI void GLAPIENTRY gluNurbsSurface (GLUnurbs* nurb, GLint sKnotCount, GLfloat* sKnots, GLint tKnotCount, GLfloat* tKnots, GLint sStride, GLint tStride, GLfloat* control, GLint sOrder, GLint tOrder, GLenum type);
+GLAPI void GLAPIENTRY gluOrtho2D (GLdouble left, GLdouble right, GLdouble bottom, GLdouble top);
+GLAPI void GLAPIENTRY gluPartialDisk (GLUquadric* quad, GLdouble inner, GLdouble outer, GLint slices, GLint loops, GLdouble start, GLdouble sweep);
+GLAPI void GLAPIENTRY gluPerspective (GLdouble fovy, GLdouble aspect, GLdouble zNear, GLdouble zFar);
+GLAPI void GLAPIENTRY gluPickMatrix (GLdouble x, GLdouble y, GLdouble delX, GLdouble delY, GLint *viewport);
+GLAPI GLint GLAPIENTRY gluProject (GLdouble objX, GLdouble objY, GLdouble objZ, const GLdouble *model, const GLdouble *proj, const GLint *view, GLdouble* winX, GLdouble* winY, GLdouble* winZ);
+GLAPI void GLAPIENTRY gluPwlCurve (GLUnurbs* nurb, GLint count, GLfloat* data, GLint stride, GLenum type);
+GLAPI void GLAPIENTRY gluQuadricCallback (GLUquadric* quad, GLenum which, _GLUfuncptr CallBackFunc);
+GLAPI void GLAPIENTRY gluQuadricDrawStyle (GLUquadric* quad, GLenum draw);
+GLAPI void GLAPIENTRY gluQuadricNormals (GLUquadric* quad, GLenum normal);
+GLAPI void GLAPIENTRY gluQuadricOrientation (GLUquadric* quad, GLenum orientation);
+GLAPI void GLAPIENTRY gluQuadricTexture (GLUquadric* quad, GLboolean texture);
+GLAPI GLint GLAPIENTRY gluScaleImage (GLenum format, GLsizei wIn, GLsizei hIn, GLenum typeIn, const void *dataIn, GLsizei wOut, GLsizei hOut, GLenum typeOut, GLvoid* dataOut);
+GLAPI void GLAPIENTRY gluSphere (GLUquadric* quad, GLdouble radius, GLint slices, GLint stacks);
+GLAPI void GLAPIENTRY gluTessBeginContour (GLUtesselator* tess);
+GLAPI void GLAPIENTRY gluTessBeginPolygon (GLUtesselator* tess, GLvoid* data);
+GLAPI void GLAPIENTRY gluTessCallback (GLUtesselator* tess, GLenum which, _GLUfuncptr CallBackFunc);
+GLAPI void GLAPIENTRY gluTessEndContour (GLUtesselator* tess);
+GLAPI void GLAPIENTRY gluTessEndPolygon (GLUtesselator* tess);
+GLAPI void GLAPIENTRY gluTessNormal (GLUtesselator* tess, GLdouble valueX, GLdouble valueY, GLdouble valueZ);
+GLAPI void GLAPIENTRY gluTessProperty (GLUtesselator* tess, GLenum which, GLdouble data);
+GLAPI void GLAPIENTRY gluTessVertex (GLUtesselator* tess, GLdouble *location, GLvoid* data);
+GLAPI GLint GLAPIENTRY gluUnProject (GLdouble winX, GLdouble winY, GLdouble winZ, const GLdouble *model, const GLdouble *proj, const GLint *view, GLdouble* objX, GLdouble* objY, GLdouble* objZ);
+GLAPI GLint GLAPIENTRY gluUnProject4 (GLdouble winX, GLdouble winY, GLdouble winZ, GLdouble clipW, const GLdouble *model, const GLdouble *proj, const GLint *view, GLdouble nearVal, GLdouble farVal, GLdouble* objX, GLdouble* objY, GLdouble* objZ, GLdouble* objW);
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif /* __glu_h__ */
--- a/vtm/jni/tessellate/gluos.h
+++ b/vtm/jni/tessellate/gluos.h
@@ -0,0 +1,86 @@
+/*
+** gluos.h - operating system dependencies for GLU
+**
+*/
+#ifdef __VMS
+#ifdef __cplusplus
+#pragma message disable nocordel
+#pragma message disable codeunreachable
+#pragma message disable codcauunr
+#endif
+#endif
+
+#ifdef __WATCOMC__
+/* Disable *lots* of warnings to get a clean build. I can't be bothered fixing the
+ * code at the moment, as it is pretty ugly.
+ */
+#pragma warning 7   10
+#pragma warning 13  10
+#pragma warning 14  10
+#pragma warning 367 10
+#pragma warning 379 10
+#pragma warning 726 10
+#pragma warning 836 10
+#endif
+
+#ifdef BUILD_FOR_SNAP
+
+#include <stdlib.h>
+#include <stdio.h>
+#include <malloc.h>
+
+#elif defined(_WIN32)
+
+#include <stdlib.h>	    /* For _MAX_PATH definition */
+#include <stdio.h>
+#include <malloc.h>
+
+#define WIN32_LEAN_AND_MEAN
+#define NOGDI
+#define NOIME
+#define NOMINMAX
+
+#ifdef __MINGW64_VERSION_MAJOR
+  #undef _WIN32_WINNT
+#endif
+
+#ifndef _WIN32_WINNT
+  /* XXX: Workaround a bug in mingw-w64's headers when NOGDI is set and
+   * _WIN32_WINNT >= 0x0600 */
+  #define _WIN32_WINNT 0x0400
+#endif
+#ifndef STRICT
+  #define STRICT 1
+#endif
+
+#include <windows.h>
+
+/* Disable warnings */
+#if defined(_MSC_VER)
+#pragma warning(disable : 4101)
+#pragma warning(disable : 4244)
+#pragma warning(disable : 4761)
+#endif
+
+#if defined(_MSC_VER) && _MSC_VER >= 1200 && _MSC_VER < 1300
+#pragma comment(linker, "/OPT:NOWIN98")
+#endif
+
+#ifndef WINGDIAPI
+#define WINGDIAPI
+#endif
+
+#elif defined(__OS2__)
+
+#include <stdlib.h>
+#include <stdio.h>
+#include <malloc.h>
+#define WINGDIAPI
+
+#else
+
+/* Disable Microsoft-specific keywords */
+#define GLAPIENTRY
+#define WINGDIAPI
+
+#endif
--- a/vtm/jni/tessellate/main.c
+++ b/vtm/jni/tessellate/main.c
@@ -0,0 +1,54 @@
+#include "tessellate.h"
+#include <stdio.h>
+#include <stdlib.h>
+
+void run_example(const double vertices_array[],
+                 const double *contours_array[],
+                 int contours_size)
+{
+    double *coordinates_out;
+    int *tris_out;
+    int nverts, ntris, i;
+
+    const double *p = vertices_array;
+    /* const double **contours = contours_array; */
+
+    tessellate(&coordinates_out, &nverts,
+               &tris_out, &ntris,
+               contours_array, contours_array + contours_size);
+
+    for (i=0; i<2 * nverts; ++i) {
+        fprintf(stdout, "%g ", coordinates_out[i]);
+    }
+    fprintf(stdout, "\n");
+    for (i=0; i<3 * ntris; ++i) {
+        fprintf(stdout, "%d ", tris_out[i]);
+    }
+    fprintf(stdout, "\n");
+    free(coordinates_out);
+    if (tris_out)
+        free(tris_out);
+}
+
+int main()
+{
+    double a1[] = { 0, 0, 1,  5, 2, 0,  -1, 3, 3,  3 };
+    const double *c1[] = {a1, a1+10};
+    int s1 = 2;
+    run_example(a1, c1, 2);
+    printf("\n");
+    double a2[] = { 0, 0, 3, 0, 3, 3, 0, 3,
+                    1, 1, 2, 1, 2, 2, 1, 2 };
+    const double *c2[] = {a2, a2+8, a2+16};
+    int s2 = 3;
+    run_example(a2, c2, s2);
+    printf("\n");
+
+    double a3[] = { 441, 0, 326, 0, 326, 889, 12, 889, 12, 992, 755, 992, 755, 889, 441, 889 };
+    const double *c3[] = { a3, a3+16 };
+    int s3 = 2;
+    run_example(a3, c3, s3);
+    printf("\n");
+
+    return 0;
+}
--- a/vtm/jni/tessellate/memalloc.c
+++ b/vtm/jni/tessellate/memalloc.c
@@ -0,0 +1,55 @@
+/*
+ * SGI FREE SOFTWARE LICENSE B (Version 2.0, Sept. 18, 2008)
+ * Copyright (C) 1991-2000 Silicon Graphics, Inc. All Rights Reserved.
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a
+ * copy of this software and associated documentation files (the "Software"),
+ * to deal in the Software without restriction, including without limitation
+ * the rights to use, copy, modify, merge, publish, distribute, sublicense,
+ * and/or sell copies of the Software, and to permit persons to whom the
+ * Software is furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice including the dates of first publication and
+ * either this permission notice or a reference to
+ * http://oss.sgi.com/projects/FreeB/
+ * shall be included in all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
+ * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
+ * SILICON GRAPHICS, INC. BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
+ * WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF
+ * OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+ * SOFTWARE.
+ *
+ * Except as contained in this notice, the name of Silicon Graphics, Inc.
+ * shall not be used in advertising or otherwise to promote the sale, use or
+ * other dealings in this Software without prior written authorization from
+ * Silicon Graphics, Inc.
+ */
+/*
+** Author: Eric Veach, July 1994.
+**
+*/
+
+#include "memalloc.h"
+#include "string.h"
+
+int __gl_memInit( size_t maxFast )
+{
+#ifndef NO_MALLOPT
+/*  mallopt( M_MXFAST, maxFast );*/
+#ifdef MEMORY_DEBUG
+  mallopt( M_DEBUG, 1 );
+#endif
+#endif
+   return 1;
+}
+
+#ifdef MEMORY_DEBUG
+void *__gl_memAlloc( size_t n )
+{
+  return memset( malloc( n ), 0xa5, n );
+}
+#endif
+
--- a/vtm/jni/tessellate/memalloc.h
+++ b/vtm/jni/tessellate/memalloc.h
@@ -0,0 +1,54 @@
+/*
+ * SGI FREE SOFTWARE LICENSE B (Version 2.0, Sept. 18, 2008)
+ * Copyright (C) 1991-2000 Silicon Graphics, Inc. All Rights Reserved.
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a
+ * copy of this software and associated documentation files (the "Software"),
+ * to deal in the Software without restriction, including without limitation
+ * the rights to use, copy, modify, merge, publish, distribute, sublicense,
+ * and/or sell copies of the Software, and to permit persons to whom the
+ * Software is furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice including the dates of first publication and
+ * either this permission notice or a reference to
+ * http://oss.sgi.com/projects/FreeB/
+ * shall be included in all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
+ * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
+ * SILICON GRAPHICS, INC. BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
+ * WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF
+ * OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+ * SOFTWARE.
+ *
+ * Except as contained in this notice, the name of Silicon Graphics, Inc.
+ * shall not be used in advertising or otherwise to promote the sale, use or
+ * other dealings in this Software without prior written authorization from
+ * Silicon Graphics, Inc.
+ */
+/*
+** Author: Eric Veach, July 1994.
+**
+*/
+
+#ifndef __memalloc_simple_h_
+#define __memalloc_simple_h_
+
+#include <stdlib.h>
+
+#define memRealloc	realloc
+#define memFree		free
+
+#define memInit		__gl_memInit
+/*extern void		__gl_memInit( size_t );*/
+extern int		__gl_memInit( size_t );
+
+#ifndef MEMORY_DEBUG
+#define memAlloc	malloc
+#else
+#define memAlloc	__gl_memAlloc
+extern void *		__gl_memAlloc( size_t );
+#endif
+
+#endif
--- a/vtm/jni/tessellate/mesh.c
+++ b/vtm/jni/tessellate/mesh.c
@@ -0,0 +1,798 @@
+/*
+ * SGI FREE SOFTWARE LICENSE B (Version 2.0, Sept. 18, 2008)
+ * Copyright (C) 1991-2000 Silicon Graphics, Inc. All Rights Reserved.
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a
+ * copy of this software and associated documentation files (the "Software"),
+ * to deal in the Software without restriction, including without limitation
+ * the rights to use, copy, modify, merge, publish, distribute, sublicense,
+ * and/or sell copies of the Software, and to permit persons to whom the
+ * Software is furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice including the dates of first publication and
+ * either this permission notice or a reference to
+ * http://oss.sgi.com/projects/FreeB/
+ * shall be included in all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
+ * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
+ * SILICON GRAPHICS, INC. BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
+ * WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF
+ * OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+ * SOFTWARE.
+ *
+ * Except as contained in this notice, the name of Silicon Graphics, Inc.
+ * shall not be used in advertising or otherwise to promote the sale, use or
+ * other dealings in this Software without prior written authorization from
+ * Silicon Graphics, Inc.
+ */
+/*
+** Author: Eric Veach, July 1994.
+**
+*/
+
+#include "gluos.h"
+#include <stddef.h>
+#include <assert.h>
+#include "mesh.h"
+#include "memalloc.h"
+
+#ifndef TRUE
+#define TRUE 1
+#endif
+#ifndef FALSE
+#define FALSE 0
+#endif
+
+static GLUvertex *allocVertex()
+{
+   return (GLUvertex *)memAlloc( sizeof( GLUvertex ));
+}
+
+static GLUface *allocFace()
+{
+   return (GLUface *)memAlloc( sizeof( GLUface ));
+}
+
+/************************ Utility Routines ************************/
+
+/* Allocate and free half-edges in pairs for efficiency.
+ * The *only* place that should use this fact is allocation/free.
+ */
+typedef struct { GLUhalfEdge e, eSym; } EdgePair;
+
+/* MakeEdge creates a new pair of half-edges which form their own loop.
+ * No vertex or face structures are allocated, but these must be assigned
+ * before the current edge operation is completed.
+ */
+static GLUhalfEdge *MakeEdge( GLUhalfEdge *eNext )
+{
+  GLUhalfEdge *e;
+  GLUhalfEdge *eSym;
+  GLUhalfEdge *ePrev;
+  EdgePair *pair = (EdgePair *)memAlloc( sizeof( EdgePair ));
+  if (pair == NULL) return NULL;
+
+  e = &pair->e;
+  eSym = &pair->eSym;
+
+  /* Make sure eNext points to the first edge of the edge pair */
+  if( eNext->Sym < eNext ) { eNext = eNext->Sym; }
+
+  /* Insert in circular doubly-linked list before eNext.
+   * Note that the prev pointer is stored in Sym->next.
+   */
+  ePrev = eNext->Sym->next;
+  eSym->next = ePrev;
+  ePrev->Sym->next = e;
+  e->next = eNext;
+  eNext->Sym->next = eSym;
+
+  e->Sym = eSym;
+  e->Onext = e;
+  e->Lnext = eSym;
+  e->Org = NULL;
+  e->Lface = NULL;
+  e->winding = 0;
+  e->activeRegion = NULL;
+
+  eSym->Sym = e;
+  eSym->Onext = eSym;
+  eSym->Lnext = e;
+  eSym->Org = NULL;
+  eSym->Lface = NULL;
+  eSym->winding = 0;
+  eSym->activeRegion = NULL;
+
+  return e;
+}
+
+/* Splice( a, b ) is best described by the Guibas/Stolfi paper or the
+ * CS348a notes (see mesh.h).  Basically it modifies the mesh so that
+ * a->Onext and b->Onext are exchanged.  This can have various effects
+ * depending on whether a and b belong to different face or vertex rings.
+ * For more explanation see __gl_meshSplice() below.
+ */
+static void Splice( GLUhalfEdge *a, GLUhalfEdge *b )
+{
+  GLUhalfEdge *aOnext = a->Onext;
+  GLUhalfEdge *bOnext = b->Onext;
+
+  aOnext->Sym->Lnext = b;
+  bOnext->Sym->Lnext = a;
+  a->Onext = bOnext;
+  b->Onext = aOnext;
+}
+
+/* MakeVertex( newVertex, eOrig, vNext ) attaches a new vertex and makes it the
+ * origin of all edges in the vertex loop to which eOrig belongs. "vNext" gives
+ * a place to insert the new vertex in the global vertex list.  We insert
+ * the new vertex *before* vNext so that algorithms which walk the vertex
+ * list will not see the newly created vertices.
+ */
+static void MakeVertex( GLUvertex *newVertex, 
+			GLUhalfEdge *eOrig, GLUvertex *vNext )
+{
+  GLUhalfEdge *e;
+  GLUvertex *vPrev;
+  GLUvertex *vNew = newVertex;
+
+  assert(vNew != NULL);
+
+  /* insert in circular doubly-linked list before vNext */
+  vPrev = vNext->prev;
+  vNew->prev = vPrev;
+  vPrev->next = vNew;
+  vNew->next = vNext;
+  vNext->prev = vNew;
+
+  vNew->anEdge = eOrig;
+  vNew->data = NULL;
+  /* leave coords, s, t undefined */
+
+  /* fix other edges on this vertex loop */
+  e = eOrig;
+  do {
+    e->Org = vNew;
+    e = e->Onext;
+  } while( e != eOrig );
+}
+
+/* MakeFace( newFace, eOrig, fNext ) attaches a new face and makes it the left
+ * face of all edges in the face loop to which eOrig belongs.  "fNext" gives
+ * a place to insert the new face in the global face list.  We insert
+ * the new face *before* fNext so that algorithms which walk the face
+ * list will not see the newly created faces.
+ */
+static void MakeFace( GLUface *newFace, GLUhalfEdge *eOrig, GLUface *fNext )
+{
+  GLUhalfEdge *e;
+  GLUface *fPrev;
+  GLUface *fNew = newFace;
+
+  assert(fNew != NULL); 
+
+  /* insert in circular doubly-linked list before fNext */
+  fPrev = fNext->prev;
+  fNew->prev = fPrev;
+  fPrev->next = fNew;
+  fNew->next = fNext;
+  fNext->prev = fNew;
+
+  fNew->anEdge = eOrig;
+  fNew->data = NULL;
+  fNew->trail = NULL;
+  fNew->marked = FALSE;
+
+  /* The new face is marked "inside" if the old one was.  This is a
+   * convenience for the common case where a face has been split in two.
+   */
+  fNew->inside = fNext->inside;
+
+  /* fix other edges on this face loop */
+  e = eOrig;
+  do {
+    e->Lface = fNew;
+    e = e->Lnext;
+  } while( e != eOrig );
+}
+
+/* KillEdge( eDel ) destroys an edge (the half-edges eDel and eDel->Sym),
+ * and removes from the global edge list.
+ */
+static void KillEdge( GLUhalfEdge *eDel )
+{
+  GLUhalfEdge *ePrev, *eNext;
+
+  /* Half-edges are allocated in pairs, see EdgePair above */
+  if( eDel->Sym < eDel ) { eDel = eDel->Sym; }
+
+  /* delete from circular doubly-linked list */
+  eNext = eDel->next;
+  ePrev = eDel->Sym->next;
+  eNext->Sym->next = ePrev;
+  ePrev->Sym->next = eNext;
+
+  memFree( eDel );
+}
+
+
+/* KillVertex( vDel ) destroys a vertex and removes it from the global
+ * vertex list.  It updates the vertex loop to point to a given new vertex.
+ */
+static void KillVertex( GLUvertex *vDel, GLUvertex *newOrg )
+{
+  GLUhalfEdge *e, *eStart = vDel->anEdge;
+  GLUvertex *vPrev, *vNext;
+
+  /* change the origin of all affected edges */
+  e = eStart;
+  do {
+    e->Org = newOrg;
+    e = e->Onext;
+  } while( e != eStart );
+
+  /* delete from circular doubly-linked list */
+  vPrev = vDel->prev;
+  vNext = vDel->next;
+  vNext->prev = vPrev;
+  vPrev->next = vNext;
+
+  memFree( vDel );
+}
+
+/* KillFace( fDel ) destroys a face and removes it from the global face
+ * list.  It updates the face loop to point to a given new face.
+ */
+static void KillFace( GLUface *fDel, GLUface *newLface )
+{
+  GLUhalfEdge *e, *eStart = fDel->anEdge;
+  GLUface *fPrev, *fNext;
+
+  /* change the left face of all affected edges */
+  e = eStart;
+  do {
+    e->Lface = newLface;
+    e = e->Lnext;
+  } while( e != eStart );
+
+  /* delete from circular doubly-linked list */
+  fPrev = fDel->prev;
+  fNext = fDel->next;
+  fNext->prev = fPrev;
+  fPrev->next = fNext;
+
+  memFree( fDel );
+}
+
+
+/****************** Basic Edge Operations **********************/
+
+/* __gl_meshMakeEdge creates one edge, two vertices, and a loop (face).
+ * The loop consists of the two new half-edges.
+ */
+GLUhalfEdge *__gl_meshMakeEdge( GLUmesh *mesh )
+{
+  GLUvertex *newVertex1= allocVertex();
+  GLUvertex *newVertex2= allocVertex();
+  GLUface *newFace= allocFace();
+  GLUhalfEdge *e;
+
+  /* if any one is null then all get freed */
+  if (newVertex1 == NULL || newVertex2 == NULL || newFace == NULL) {
+     if (newVertex1 != NULL) memFree(newVertex1);
+     if (newVertex2 != NULL) memFree(newVertex2);
+     if (newFace != NULL) memFree(newFace);     
+     return NULL;
+  } 
+
+  e = MakeEdge( &mesh->eHead );
+  if (e == NULL) {
+     memFree(newVertex1);
+     memFree(newVertex2);
+     memFree(newFace);
+     return NULL;
+  }
+
+  MakeVertex( newVertex1, e, &mesh->vHead );
+  MakeVertex( newVertex2, e->Sym, &mesh->vHead );
+  MakeFace( newFace, e, &mesh->fHead );
+  return e;
+}
+  
+
+/* __gl_meshSplice( eOrg, eDst ) is the basic operation for changing the
+ * mesh connectivity and topology.  It changes the mesh so that
+ *	eOrg->Onext <- OLD( eDst->Onext )
+ *	eDst->Onext <- OLD( eOrg->Onext )
+ * where OLD(...) means the value before the meshSplice operation.
+ *
+ * This can have two effects on the vertex structure:
+ *  - if eOrg->Org != eDst->Org, the two vertices are merged together
+ *  - if eOrg->Org == eDst->Org, the origin is split into two vertices
+ * In both cases, eDst->Org is changed and eOrg->Org is untouched.
+ *
+ * Similarly (and independently) for the face structure,
+ *  - if eOrg->Lface == eDst->Lface, one loop is split into two
+ *  - if eOrg->Lface != eDst->Lface, two distinct loops are joined into one
+ * In both cases, eDst->Lface is changed and eOrg->Lface is unaffected.
+ *
+ * Some special cases:
+ * If eDst == eOrg, the operation has no effect.
+ * If eDst == eOrg->Lnext, the new face will have a single edge.
+ * If eDst == eOrg->Lprev, the old face will have a single edge.
+ * If eDst == eOrg->Onext, the new vertex will have a single edge.
+ * If eDst == eOrg->Oprev, the old vertex will have a single edge.
+ */
+int __gl_meshSplice( GLUhalfEdge *eOrg, GLUhalfEdge *eDst )
+{
+  int joiningLoops = FALSE;
+  int joiningVertices = FALSE;
+
+  if( eOrg == eDst ) return 1;
+
+  if( eDst->Org != eOrg->Org ) {
+    /* We are merging two disjoint vertices -- destroy eDst->Org */
+    joiningVertices = TRUE;
+    KillVertex( eDst->Org, eOrg->Org );
+  }
+  if( eDst->Lface != eOrg->Lface ) {
+    /* We are connecting two disjoint loops -- destroy eDst->Lface */
+    joiningLoops = TRUE;
+    KillFace( eDst->Lface, eOrg->Lface );
+  }
+
+  /* Change the edge structure */
+  Splice( eDst, eOrg );
+
+  if( ! joiningVertices ) {
+    GLUvertex *newVertex= allocVertex();
+    if (newVertex == NULL) return 0;
+
+    /* We split one vertex into two -- the new vertex is eDst->Org.
+     * Make sure the old vertex points to a valid half-edge.
+     */
+    MakeVertex( newVertex, eDst, eOrg->Org );
+    eOrg->Org->anEdge = eOrg;
+  }
+  if( ! joiningLoops ) {
+    GLUface *newFace= allocFace();  
+    if (newFace == NULL) return 0;
+
+    /* We split one loop into two -- the new loop is eDst->Lface.
+     * Make sure the old face points to a valid half-edge.
+     */
+    MakeFace( newFace, eDst, eOrg->Lface );
+    eOrg->Lface->anEdge = eOrg;
+  }
+
+  return 1;
+}
+
+
+/* __gl_meshDelete( eDel ) removes the edge eDel.  There are several cases:
+ * if (eDel->Lface != eDel->Rface), we join two loops into one; the loop
+ * eDel->Lface is deleted.  Otherwise, we are splitting one loop into two;
+ * the newly created loop will contain eDel->Dst.  If the deletion of eDel
+ * would create isolated vertices, those are deleted as well.
+ *
+ * This function could be implemented as two calls to __gl_meshSplice
+ * plus a few calls to memFree, but this would allocate and delete
+ * unnecessary vertices and faces.
+ */
+int __gl_meshDelete( GLUhalfEdge *eDel )
+{
+  GLUhalfEdge *eDelSym = eDel->Sym;
+  int joiningLoops = FALSE;
+
+  /* First step: disconnect the origin vertex eDel->Org.  We make all
+   * changes to get a consistent mesh in this "intermediate" state.
+   */
+  if( eDel->Lface != eDel->Rface ) {
+    /* We are joining two loops into one -- remove the left face */
+    joiningLoops = TRUE;
+    KillFace( eDel->Lface, eDel->Rface );
+  }
+
+  if( eDel->Onext == eDel ) {
+    KillVertex( eDel->Org, NULL );
+  } else {
+    /* Make sure that eDel->Org and eDel->Rface point to valid half-edges */
+    eDel->Rface->anEdge = eDel->Oprev;
+    eDel->Org->anEdge = eDel->Onext;
+
+    Splice( eDel, eDel->Oprev );
+    if( ! joiningLoops ) {
+      GLUface *newFace= allocFace();
+      if (newFace == NULL) return 0; 
+
+      /* We are splitting one loop into two -- create a new loop for eDel. */
+      MakeFace( newFace, eDel, eDel->Lface );
+    }
+  }
+
+  /* Claim: the mesh is now in a consistent state, except that eDel->Org
+   * may have been deleted.  Now we disconnect eDel->Dst.
+   */
+  if( eDelSym->Onext == eDelSym ) {
+    KillVertex( eDelSym->Org, NULL );
+    KillFace( eDelSym->Lface, NULL );
+  } else {
+    /* Make sure that eDel->Dst and eDel->Lface point to valid half-edges */
+    eDel->Lface->anEdge = eDelSym->Oprev;
+    eDelSym->Org->anEdge = eDelSym->Onext;
+    Splice( eDelSym, eDelSym->Oprev );
+  }
+
+  /* Any isolated vertices or faces have already been freed. */
+  KillEdge( eDel );
+
+  return 1;
+}
+
+
+/******************** Other Edge Operations **********************/
+
+/* All these routines can be implemented with the basic edge
+ * operations above.  They are provided for convenience and efficiency.
+ */
+
+
+/* __gl_meshAddEdgeVertex( eOrg ) creates a new edge eNew such that
+ * eNew == eOrg->Lnext, and eNew->Dst is a newly created vertex.
+ * eOrg and eNew will have the same left face.
+ */
+GLUhalfEdge *__gl_meshAddEdgeVertex( GLUhalfEdge *eOrg )
+{
+  GLUhalfEdge *eNewSym;
+  GLUhalfEdge *eNew = MakeEdge( eOrg );
+  if (eNew == NULL) return NULL;
+
+  eNewSym = eNew->Sym;
+
+  /* Connect the new edge appropriately */
+  Splice( eNew, eOrg->Lnext );
+
+  /* Set the vertex and face information */
+  eNew->Org = eOrg->Dst;
+  {
+    GLUvertex *newVertex= allocVertex();
+    if (newVertex == NULL) return NULL;
+
+    MakeVertex( newVertex, eNewSym, eNew->Org );
+  }
+  eNew->Lface = eNewSym->Lface = eOrg->Lface;
+
+  return eNew;
+}
+
+
+/* __gl_meshSplitEdge( eOrg ) splits eOrg into two edges eOrg and eNew,
+ * such that eNew == eOrg->Lnext.  The new vertex is eOrg->Dst == eNew->Org.
+ * eOrg and eNew will have the same left face.
+ */
+GLUhalfEdge *__gl_meshSplitEdge( GLUhalfEdge *eOrg )
+{
+  GLUhalfEdge *eNew;
+  GLUhalfEdge *tempHalfEdge= __gl_meshAddEdgeVertex( eOrg );
+  if (tempHalfEdge == NULL) return NULL;
+
+  eNew = tempHalfEdge->Sym;
+
+  /* Disconnect eOrg from eOrg->Dst and connect it to eNew->Org */
+  Splice( eOrg->Sym, eOrg->Sym->Oprev );
+  Splice( eOrg->Sym, eNew );
+
+  /* Set the vertex and face information */
+  eOrg->Dst = eNew->Org;
+  eNew->Dst->anEdge = eNew->Sym;	/* may have pointed to eOrg->Sym */
+  eNew->Rface = eOrg->Rface;
+  eNew->winding = eOrg->winding;	/* copy old winding information */
+  eNew->Sym->winding = eOrg->Sym->winding;
+
+  return eNew;
+}
+
+
+/* __gl_meshConnect( eOrg, eDst ) creates a new edge from eOrg->Dst
+ * to eDst->Org, and returns the corresponding half-edge eNew.
+ * If eOrg->Lface == eDst->Lface, this splits one loop into two,
+ * and the newly created loop is eNew->Lface.  Otherwise, two disjoint
+ * loops are merged into one, and the loop eDst->Lface is destroyed.
+ *
+ * If (eOrg == eDst), the new face will have only two edges.
+ * If (eOrg->Lnext == eDst), the old face is reduced to a single edge.
+ * If (eOrg->Lnext->Lnext == eDst), the old face is reduced to two edges.
+ */
+GLUhalfEdge *__gl_meshConnect( GLUhalfEdge *eOrg, GLUhalfEdge *eDst )
+{
+  GLUhalfEdge *eNewSym;
+  int joiningLoops = FALSE;  
+  GLUhalfEdge *eNew = MakeEdge( eOrg );
+  if (eNew == NULL) return NULL;
+
+  eNewSym = eNew->Sym;
+
+  if( eDst->Lface != eOrg->Lface ) {
+    /* We are connecting two disjoint loops -- destroy eDst->Lface */
+    joiningLoops = TRUE;
+    KillFace( eDst->Lface, eOrg->Lface );
+  }
+
+  /* Connect the new edge appropriately */
+  Splice( eNew, eOrg->Lnext );
+  Splice( eNewSym, eDst );
+
+  /* Set the vertex and face information */
+  eNew->Org = eOrg->Dst;
+  eNewSym->Org = eDst->Org;
+  eNew->Lface = eNewSym->Lface = eOrg->Lface;
+
+  /* Make sure the old face points to a valid half-edge */
+  eOrg->Lface->anEdge = eNewSym;
+
+  if( ! joiningLoops ) {
+    GLUface *newFace= allocFace();
+    if (newFace == NULL) return NULL;
+
+    /* We split one loop into two -- the new loop is eNew->Lface */
+    MakeFace( newFace, eNew, eOrg->Lface );
+  }
+  return eNew;
+}
+
+
+/******************** Other Operations **********************/
+
+/* __gl_meshZapFace( fZap ) destroys a face and removes it from the
+ * global face list.  All edges of fZap will have a NULL pointer as their
+ * left face.  Any edges which also have a NULL pointer as their right face
+ * are deleted entirely (along with any isolated vertices this produces).
+ * An entire mesh can be deleted by zapping its faces, one at a time,
+ * in any order.  Zapped faces cannot be used in further mesh operations!
+ */
+void __gl_meshZapFace( GLUface *fZap )
+{
+  GLUhalfEdge *eStart = fZap->anEdge;
+  GLUhalfEdge *e, *eNext, *eSym;
+  GLUface *fPrev, *fNext;
+
+  /* walk around face, deleting edges whose right face is also NULL */
+  eNext = eStart->Lnext;
+  do {
+    e = eNext;
+    eNext = e->Lnext;
+
+    e->Lface = NULL;
+    if( e->Rface == NULL ) {
+      /* delete the edge -- see __gl_MeshDelete above */
+
+      if( e->Onext == e ) {
+	KillVertex( e->Org, NULL );
+      } else {
+	/* Make sure that e->Org points to a valid half-edge */
+	e->Org->anEdge = e->Onext;
+	Splice( e, e->Oprev );
+      }
+      eSym = e->Sym;
+      if( eSym->Onext == eSym ) {
+	KillVertex( eSym->Org, NULL );
+      } else {
+	/* Make sure that eSym->Org points to a valid half-edge */
+	eSym->Org->anEdge = eSym->Onext;
+	Splice( eSym, eSym->Oprev );
+      }
+      KillEdge( e );
+    }
+  } while( e != eStart );
+
+  /* delete from circular doubly-linked list */
+  fPrev = fZap->prev;
+  fNext = fZap->next;
+  fNext->prev = fPrev;
+  fPrev->next = fNext;
+
+  memFree( fZap );
+}
+
+
+/* __gl_meshNewMesh() creates a new mesh with no edges, no vertices,
+ * and no loops (what we usually call a "face").
+ */
+GLUmesh *__gl_meshNewMesh( void )
+{
+  GLUvertex *v;
+  GLUface *f;
+  GLUhalfEdge *e;
+  GLUhalfEdge *eSym;
+  GLUmesh *mesh = (GLUmesh *)memAlloc( sizeof( GLUmesh ));
+  if (mesh == NULL) {
+     return NULL;
+  }
+  
+  v = &mesh->vHead;
+  f = &mesh->fHead;
+  e = &mesh->eHead;
+  eSym = &mesh->eHeadSym;
+
+  v->next = v->prev = v;
+  v->anEdge = NULL;
+  v->data = NULL;
+
+  f->next = f->prev = f;
+  f->anEdge = NULL;
+  f->data = NULL;
+  f->trail = NULL;
+  f->marked = FALSE;
+  f->inside = FALSE;
+
+  e->next = e;
+  e->Sym = eSym;
+  e->Onext = NULL;
+  e->Lnext = NULL;
+  e->Org = NULL;
+  e->Lface = NULL;
+  e->winding = 0;
+  e->activeRegion = NULL;
+
+  eSym->next = eSym;
+  eSym->Sym = e;
+  eSym->Onext = NULL;
+  eSym->Lnext = NULL;
+  eSym->Org = NULL;
+  eSym->Lface = NULL;
+  eSym->winding = 0;
+  eSym->activeRegion = NULL;
+
+  return mesh;
+}
+
+
+/* __gl_meshUnion( mesh1, mesh2 ) forms the union of all structures in
+ * both meshes, and returns the new mesh (the old meshes are destroyed).
+ */
+GLUmesh *__gl_meshUnion( GLUmesh *mesh1, GLUmesh *mesh2 )
+{
+  GLUface *f1 = &mesh1->fHead;
+  GLUvertex *v1 = &mesh1->vHead;
+  GLUhalfEdge *e1 = &mesh1->eHead;
+  GLUface *f2 = &mesh2->fHead;
+  GLUvertex *v2 = &mesh2->vHead;
+  GLUhalfEdge *e2 = &mesh2->eHead;
+
+  /* Add the faces, vertices, and edges of mesh2 to those of mesh1 */
+  if( f2->next != f2 ) {
+    f1->prev->next = f2->next;
+    f2->next->prev = f1->prev;
+    f2->prev->next = f1;
+    f1->prev = f2->prev;
+  }
+
+  if( v2->next != v2 ) {
+    v1->prev->next = v2->next;
+    v2->next->prev = v1->prev;
+    v2->prev->next = v1;
+    v1->prev = v2->prev;
+  }
+
+  if( e2->next != e2 ) {
+    e1->Sym->next->Sym->next = e2->next;
+    e2->next->Sym->next = e1->Sym->next;
+    e2->Sym->next->Sym->next = e1;
+    e1->Sym->next = e2->Sym->next;
+  }
+
+  memFree( mesh2 );
+  return mesh1;
+}
+
+
+#ifdef DELETE_BY_ZAPPING
+
+/* __gl_meshDeleteMesh( mesh ) will free all storage for any valid mesh.
+ */
+void __gl_meshDeleteMesh( GLUmesh *mesh )
+{
+  GLUface *fHead = &mesh->fHead;
+
+  while( fHead->next != fHead ) {
+    __gl_meshZapFace( fHead->next );
+  }
+  assert( mesh->vHead.next == &mesh->vHead );
+
+  memFree( mesh );
+}
+
+#else
+
+/* __gl_meshDeleteMesh( mesh ) will free all storage for any valid mesh.
+ */
+void __gl_meshDeleteMesh( GLUmesh *mesh )
+{
+  GLUface *f, *fNext;
+  GLUvertex *v, *vNext;
+  GLUhalfEdge *e, *eNext;
+
+  for( f = mesh->fHead.next; f != &mesh->fHead; f = fNext ) {
+    fNext = f->next;
+    memFree( f );
+  }
+
+  for( v = mesh->vHead.next; v != &mesh->vHead; v = vNext ) {
+    vNext = v->next;
+    memFree( v );
+  }
+
+  for( e = mesh->eHead.next; e != &mesh->eHead; e = eNext ) {
+    /* One call frees both e and e->Sym (see EdgePair above) */
+    eNext = e->next;
+    memFree( e );
+  }
+
+  memFree( mesh );
+}
+
+#endif
+
+#ifndef NDEBUG
+
+/* __gl_meshCheckMesh( mesh ) checks a mesh for self-consistency.
+ */
+void __gl_meshCheckMesh( GLUmesh *mesh )
+{
+  GLUface *fHead = &mesh->fHead;
+  GLUvertex *vHead = &mesh->vHead;
+  GLUhalfEdge *eHead = &mesh->eHead;
+  GLUface *f, *fPrev;
+  GLUvertex *v, *vPrev;
+  GLUhalfEdge *e, *ePrev;
+
+  fPrev = fHead;
+  for( fPrev = fHead ; (f = fPrev->next) != fHead; fPrev = f) {
+    assert( f->prev == fPrev );
+    e = f->anEdge;
+    do {
+      assert( e->Sym != e );
+      assert( e->Sym->Sym == e );
+      assert( e->Lnext->Onext->Sym == e );
+      assert( e->Onext->Sym->Lnext == e );
+      assert( e->Lface == f );
+      e = e->Lnext;
+    } while( e != f->anEdge );
+  }
+  assert( f->prev == fPrev && f->anEdge == NULL && f->data == NULL );
+
+  vPrev = vHead;
+  for( vPrev = vHead ; (v = vPrev->next) != vHead; vPrev = v) {
+    assert( v->prev == vPrev );
+    e = v->anEdge;
+    do {
+      assert( e->Sym != e );
+      assert( e->Sym->Sym == e );
+      assert( e->Lnext->Onext->Sym == e );
+      assert( e->Onext->Sym->Lnext == e );
+      assert( e->Org == v );
+      e = e->Onext;
+    } while( e != v->anEdge );
+  }
+  assert( v->prev == vPrev && v->anEdge == NULL && v->data == NULL );
+
+  ePrev = eHead;
+  for( ePrev = eHead ; (e = ePrev->next) != eHead; ePrev = e) {
+    assert( e->Sym->next == ePrev->Sym );
+    assert( e->Sym != e );
+    assert( e->Sym->Sym == e );
+    assert( e->Org != NULL );
+    assert( e->Dst != NULL );
+    assert( e->Lnext->Onext->Sym == e );
+    assert( e->Onext->Sym->Lnext == e );
+  }
+  assert( e->Sym->next == ePrev->Sym
+       && e->Sym == &mesh->eHeadSym
+       && e->Sym->Sym == e
+       && e->Org == NULL && e->Dst == NULL
+       && e->Lface == NULL && e->Rface == NULL );
+}
+
+#endif
--- a/vtm/jni/tessellate/mesh.h
+++ b/vtm/jni/tessellate/mesh.h
@@ -0,0 +1,266 @@
+/*
+ * SGI FREE SOFTWARE LICENSE B (Version 2.0, Sept. 18, 2008)
+ * Copyright (C) 1991-2000 Silicon Graphics, Inc. All Rights Reserved.
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a
+ * copy of this software and associated documentation files (the "Software"),
+ * to deal in the Software without restriction, including without limitation
+ * the rights to use, copy, modify, merge, publish, distribute, sublicense,
+ * and/or sell copies of the Software, and to permit persons to whom the
+ * Software is furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice including the dates of first publication and
+ * either this permission notice or a reference to
+ * http://oss.sgi.com/projects/FreeB/
+ * shall be included in all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
+ * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
+ * SILICON GRAPHICS, INC. BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
+ * WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF
+ * OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+ * SOFTWARE.
+ *
+ * Except as contained in this notice, the name of Silicon Graphics, Inc.
+ * shall not be used in advertising or otherwise to promote the sale, use or
+ * other dealings in this Software without prior written authorization from
+ * Silicon Graphics, Inc.
+ */
+/*
+** Author: Eric Veach, July 1994.
+**
+*/
+
+#ifndef __mesh_h_
+#define __mesh_h_
+
+#include "glu.h"
+
+typedef struct GLUmesh GLUmesh; 
+
+typedef struct GLUvertex GLUvertex;
+typedef struct GLUface GLUface;
+typedef struct GLUhalfEdge GLUhalfEdge;
+
+typedef struct ActiveRegion ActiveRegion;	/* Internal data */
+
+/* The mesh structure is similar in spirit, notation, and operations
+ * to the "quad-edge" structure (see L. Guibas and J. Stolfi, Primitives
+ * for the manipulation of general subdivisions and the computation of
+ * Voronoi diagrams, ACM Transactions on Graphics, 4(2):74-123, April 1985).
+ * For a simplified description, see the course notes for CS348a,
+ * "Mathematical Foundations of Computer Graphics", available at the
+ * Stanford bookstore (and taught during the fall quarter).
+ * The implementation also borrows a tiny subset of the graph-based approach
+ * use in Mantyla's Geometric Work Bench (see M. Mantyla, An Introduction
+ * to Sold Modeling, Computer Science Press, Rockville, Maryland, 1988).
+ *
+ * The fundamental data structure is the "half-edge".  Two half-edges
+ * go together to make an edge, but they point in opposite directions.
+ * Each half-edge has a pointer to its mate (the "symmetric" half-edge Sym),
+ * its origin vertex (Org), the face on its left side (Lface), and the
+ * adjacent half-edges in the CCW direction around the origin vertex
+ * (Onext) and around the left face (Lnext).  There is also a "next"
+ * pointer for the global edge list (see below).
+ *
+ * The notation used for mesh navigation:
+ *	Sym   = the mate of a half-edge (same edge, but opposite direction)
+ *	Onext = edge CCW around origin vertex (keep same origin)
+ *	Dnext = edge CCW around destination vertex (keep same dest)
+ *	Lnext = edge CCW around left face (dest becomes new origin)
+ *	Rnext = edge CCW around right face (origin becomes new dest)
+ *
+ * "prev" means to substitute CW for CCW in the definitions above.
+ *
+ * The mesh keeps global lists of all vertices, faces, and edges,
+ * stored as doubly-linked circular lists with a dummy header node.
+ * The mesh stores pointers to these dummy headers (vHead, fHead, eHead).
+ *
+ * The circular edge list is special; since half-edges always occur
+ * in pairs (e and e->Sym), each half-edge stores a pointer in only
+ * one direction.  Starting at eHead and following the e->next pointers
+ * will visit each *edge* once (ie. e or e->Sym, but not both).
+ * e->Sym stores a pointer in the opposite direction, thus it is
+ * always true that e->Sym->next->Sym->next == e.
+ *
+ * Each vertex has a pointer to next and previous vertices in the
+ * circular list, and a pointer to a half-edge with this vertex as
+ * the origin (NULL if this is the dummy header).  There is also a
+ * field "data" for client data.
+ *
+ * Each face has a pointer to the next and previous faces in the
+ * circular list, and a pointer to a half-edge with this face as
+ * the left face (NULL if this is the dummy header).  There is also
+ * a field "data" for client data.
+ *
+ * Note that what we call a "face" is really a loop; faces may consist
+ * of more than one loop (ie. not simply connected), but there is no
+ * record of this in the data structure.  The mesh may consist of
+ * several disconnected regions, so it may not be possible to visit
+ * the entire mesh by starting at a half-edge and traversing the edge
+ * structure.
+ *
+ * The mesh does NOT support isolated vertices; a vertex is deleted along
+ * with its last edge.  Similarly when two faces are merged, one of the
+ * faces is deleted (see __gl_meshDelete below).  For mesh operations,
+ * all face (loop) and vertex pointers must not be NULL.  However, once
+ * mesh manipulation is finished, __gl_MeshZapFace can be used to delete
+ * faces of the mesh, one at a time.  All external faces can be "zapped"
+ * before the mesh is returned to the client; then a NULL face indicates
+ * a region which is not part of the output polygon.
+ */
+
+struct GLUvertex {
+  GLUvertex	*next;		/* next vertex (never NULL) */
+  GLUvertex	*prev;		/* previous vertex (never NULL) */
+  GLUhalfEdge	*anEdge;	/* a half-edge with this origin */
+  void		*data;		/* client's data */
+
+  /* Internal data (keep hidden) */
+  GLdouble	coords[3];	/* vertex location in 3D */
+  GLdouble	s, t;		/* projection onto the sweep plane */
+  long		pqHandle;	/* to allow deletion from priority queue */
+};
+
+struct GLUface {
+  GLUface	*next;		/* next face (never NULL) */
+  GLUface	*prev;		/* previous face (never NULL) */
+  GLUhalfEdge	*anEdge;	/* a half edge with this left face */
+  void		*data;		/* room for client's data */
+
+  /* Internal data (keep hidden) */
+  GLUface	*trail;		/* "stack" for conversion to strips */
+  GLboolean	marked;		/* flag for conversion to strips */
+  GLboolean	inside;		/* this face is in the polygon interior */
+};
+
+struct GLUhalfEdge {
+  GLUhalfEdge	*next;		/* doubly-linked list (prev==Sym->next) */
+  GLUhalfEdge	*Sym;		/* same edge, opposite direction */
+  GLUhalfEdge	*Onext;		/* next edge CCW around origin */
+  GLUhalfEdge	*Lnext;		/* next edge CCW around left face */
+  GLUvertex	*Org;		/* origin vertex (Overtex too long) */
+  GLUface	*Lface;		/* left face */
+
+  /* Internal data (keep hidden) */
+  ActiveRegion	*activeRegion;	/* a region with this upper edge (sweep.c) */
+  int		winding;	/* change in winding number when crossing
+                                   from the right face to the left face */
+};
+
+#define	Rface	Sym->Lface
+#define Dst	Sym->Org
+
+#define Oprev	Sym->Lnext
+#define Lprev   Onext->Sym
+#define Dprev	Lnext->Sym
+#define Rprev	Sym->Onext
+#define Dnext	Rprev->Sym	/* 3 pointers */
+#define Rnext	Oprev->Sym	/* 3 pointers */
+
+
+struct GLUmesh {
+  GLUvertex	vHead;		/* dummy header for vertex list */
+  GLUface	fHead;		/* dummy header for face list */
+  GLUhalfEdge	eHead;		/* dummy header for edge list */
+  GLUhalfEdge	eHeadSym;	/* and its symmetric counterpart */
+};
+
+/* The mesh operations below have three motivations: completeness,
+ * convenience, and efficiency.  The basic mesh operations are MakeEdge,
+ * Splice, and Delete.  All the other edge operations can be implemented
+ * in terms of these.  The other operations are provided for convenience
+ * and/or efficiency.
+ *
+ * When a face is split or a vertex is added, they are inserted into the
+ * global list *before* the existing vertex or face (ie. e->Org or e->Lface).
+ * This makes it easier to process all vertices or faces in the global lists
+ * without worrying about processing the same data twice.  As a convenience,
+ * when a face is split, the "inside" flag is copied from the old face.
+ * Other internal data (v->data, v->activeRegion, f->data, f->marked,
+ * f->trail, e->winding) is set to zero.
+ *
+ * ********************** Basic Edge Operations **************************
+ *
+ * __gl_meshMakeEdge( mesh ) creates one edge, two vertices, and a loop.
+ * The loop (face) consists of the two new half-edges.
+ *
+ * __gl_meshSplice( eOrg, eDst ) is the basic operation for changing the
+ * mesh connectivity and topology.  It changes the mesh so that
+ *	eOrg->Onext <- OLD( eDst->Onext )
+ *	eDst->Onext <- OLD( eOrg->Onext )
+ * where OLD(...) means the value before the meshSplice operation.
+ *
+ * This can have two effects on the vertex structure:
+ *  - if eOrg->Org != eDst->Org, the two vertices are merged together
+ *  - if eOrg->Org == eDst->Org, the origin is split into two vertices
+ * In both cases, eDst->Org is changed and eOrg->Org is untouched.
+ *
+ * Similarly (and independently) for the face structure,
+ *  - if eOrg->Lface == eDst->Lface, one loop is split into two
+ *  - if eOrg->Lface != eDst->Lface, two distinct loops are joined into one
+ * In both cases, eDst->Lface is changed and eOrg->Lface is unaffected.
+ *
+ * __gl_meshDelete( eDel ) removes the edge eDel.  There are several cases:
+ * if (eDel->Lface != eDel->Rface), we join two loops into one; the loop
+ * eDel->Lface is deleted.  Otherwise, we are splitting one loop into two;
+ * the newly created loop will contain eDel->Dst.  If the deletion of eDel
+ * would create isolated vertices, those are deleted as well.
+ *
+ * ********************** Other Edge Operations **************************
+ *
+ * __gl_meshAddEdgeVertex( eOrg ) creates a new edge eNew such that
+ * eNew == eOrg->Lnext, and eNew->Dst is a newly created vertex.
+ * eOrg and eNew will have the same left face.
+ *
+ * __gl_meshSplitEdge( eOrg ) splits eOrg into two edges eOrg and eNew,
+ * such that eNew == eOrg->Lnext.  The new vertex is eOrg->Dst == eNew->Org.
+ * eOrg and eNew will have the same left face.
+ *
+ * __gl_meshConnect( eOrg, eDst ) creates a new edge from eOrg->Dst
+ * to eDst->Org, and returns the corresponding half-edge eNew.
+ * If eOrg->Lface == eDst->Lface, this splits one loop into two,
+ * and the newly created loop is eNew->Lface.  Otherwise, two disjoint
+ * loops are merged into one, and the loop eDst->Lface is destroyed.
+ *
+ * ************************ Other Operations *****************************
+ *
+ * __gl_meshNewMesh() creates a new mesh with no edges, no vertices,
+ * and no loops (what we usually call a "face").
+ *
+ * __gl_meshUnion( mesh1, mesh2 ) forms the union of all structures in
+ * both meshes, and returns the new mesh (the old meshes are destroyed).
+ *
+ * __gl_meshDeleteMesh( mesh ) will free all storage for any valid mesh.
+ *
+ * __gl_meshZapFace( fZap ) destroys a face and removes it from the
+ * global face list.  All edges of fZap will have a NULL pointer as their
+ * left face.  Any edges which also have a NULL pointer as their right face
+ * are deleted entirely (along with any isolated vertices this produces).
+ * An entire mesh can be deleted by zapping its faces, one at a time,
+ * in any order.  Zapped faces cannot be used in further mesh operations!
+ *
+ * __gl_meshCheckMesh( mesh ) checks a mesh for self-consistency.
+ */
+
+GLUhalfEdge	*__gl_meshMakeEdge( GLUmesh *mesh );
+int		__gl_meshSplice( GLUhalfEdge *eOrg, GLUhalfEdge *eDst );
+int		__gl_meshDelete( GLUhalfEdge *eDel );
+
+GLUhalfEdge	*__gl_meshAddEdgeVertex( GLUhalfEdge *eOrg );
+GLUhalfEdge	*__gl_meshSplitEdge( GLUhalfEdge *eOrg );
+GLUhalfEdge	*__gl_meshConnect( GLUhalfEdge *eOrg, GLUhalfEdge *eDst );
+
+GLUmesh		*__gl_meshNewMesh( void );
+GLUmesh		*__gl_meshUnion( GLUmesh *mesh1, GLUmesh *mesh2 );
+void		__gl_meshDeleteMesh( GLUmesh *mesh );
+void		__gl_meshZapFace( GLUface *fZap );
+
+#ifdef NDEBUG
+#define		__gl_meshCheckMesh( mesh )
+#else
+void		__gl_meshCheckMesh( GLUmesh *mesh );
+#endif
+
+#endif
--- a/vtm/jni/tessellate/normal.c
+++ b/vtm/jni/tessellate/normal.c
@@ -0,0 +1,257 @@
+/*
+ * SGI FREE SOFTWARE LICENSE B (Version 2.0, Sept. 18, 2008)
+ * Copyright (C) 1991-2000 Silicon Graphics, Inc. All Rights Reserved.
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a
+ * copy of this software and associated documentation files (the "Software"),
+ * to deal in the Software without restriction, including without limitation
+ * the rights to use, copy, modify, merge, publish, distribute, sublicense,
+ * and/or sell copies of the Software, and to permit persons to whom the
+ * Software is furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice including the dates of first publication and
+ * either this permission notice or a reference to
+ * http://oss.sgi.com/projects/FreeB/
+ * shall be included in all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
+ * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
+ * SILICON GRAPHICS, INC. BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
+ * WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF
+ * OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+ * SOFTWARE.
+ *
+ * Except as contained in this notice, the name of Silicon Graphics, Inc.
+ * shall not be used in advertising or otherwise to promote the sale, use or
+ * other dealings in this Software without prior written authorization from
+ * Silicon Graphics, Inc.
+ */
+/*
+** Author: Eric Veach, July 1994.
+**
+*/
+
+#include "gluos.h"
+#include "mesh.h"
+#include "tess.h"
+#include "normal.h"
+#include <math.h>
+#include <assert.h>
+
+#ifndef TRUE
+#define TRUE 1
+#endif
+#ifndef FALSE
+#define FALSE 0
+#endif
+
+#define Dot(u,v)	(u[0]*v[0] + u[1]*v[1] + u[2]*v[2])
+
+#if 0
+static void Normalize( GLdouble v[3] )
+{
+  GLdouble len = v[0]*v[0] + v[1]*v[1] + v[2]*v[2];
+
+  assert( len > 0 );
+  len = sqrt( len );
+  v[0] /= len;
+  v[1] /= len;
+  v[2] /= len;
+}
+#endif
+
+#undef	ABS
+#define ABS(x)	((x) < 0 ? -(x) : (x))
+
+static int LongAxis( GLdouble v[3] )
+{
+  int i = 0;
+
+  if( ABS(v[1]) > ABS(v[0]) ) { i = 1; }
+  if( ABS(v[2]) > ABS(v[i]) ) { i = 2; }
+  return i;
+}
+
+static void ComputeNormal( GLUtesselator *tess, GLdouble norm[3] )
+{
+  GLUvertex *v, *v1, *v2;
+  GLdouble c, tLen2, maxLen2;
+  GLdouble maxVal[3], minVal[3], d1[3], d2[3], tNorm[3];
+  GLUvertex *maxVert[3], *minVert[3];
+  GLUvertex *vHead = &tess->mesh->vHead;
+  int i;
+
+  maxVal[0] = maxVal[1] = maxVal[2] = -2 * GLU_TESS_MAX_COORD;
+  minVal[0] = minVal[1] = minVal[2] = 2 * GLU_TESS_MAX_COORD;
+
+  for( v = vHead->next; v != vHead; v = v->next ) {
+    for( i = 0; i < 3; ++i ) {
+      c = v->coords[i];
+      if( c < minVal[i] ) { minVal[i] = c; minVert[i] = v; }
+      if( c > maxVal[i] ) { maxVal[i] = c; maxVert[i] = v; }
+    }
+  }
+
+  /* Find two vertices separated by at least 1/sqrt(3) of the maximum
+   * distance between any two vertices
+   */
+  i = 0;
+  if( maxVal[1] - minVal[1] > maxVal[0] - minVal[0] ) { i = 1; }
+  if( maxVal[2] - minVal[2] > maxVal[i] - minVal[i] ) { i = 2; }
+  if( minVal[i] >= maxVal[i] ) {
+    /* All vertices are the same -- normal doesn't matter */
+    norm[0] = 0; norm[1] = 0; norm[2] = 1;
+    return;
+  }
+
+  /* Look for a third vertex which forms the triangle with maximum area
+   * (Length of normal == twice the triangle area)
+   */
+  maxLen2 = 0;
+  v1 = minVert[i];
+  v2 = maxVert[i];
+  d1[0] = v1->coords[0] - v2->coords[0];
+  d1[1] = v1->coords[1] - v2->coords[1];
+  d1[2] = v1->coords[2] - v2->coords[2];
+  for( v = vHead->next; v != vHead; v = v->next ) {
+    d2[0] = v->coords[0] - v2->coords[0];
+    d2[1] = v->coords[1] - v2->coords[1];
+    d2[2] = v->coords[2] - v2->coords[2];
+    tNorm[0] = d1[1]*d2[2] - d1[2]*d2[1];
+    tNorm[1] = d1[2]*d2[0] - d1[0]*d2[2];
+    tNorm[2] = d1[0]*d2[1] - d1[1]*d2[0];
+    tLen2 = tNorm[0]*tNorm[0] + tNorm[1]*tNorm[1] + tNorm[2]*tNorm[2];
+    if( tLen2 > maxLen2 ) {
+      maxLen2 = tLen2;
+      norm[0] = tNorm[0];
+      norm[1] = tNorm[1];
+      norm[2] = tNorm[2];
+    }
+  }
+
+  if( maxLen2 <= 0 ) {
+    /* All points lie on a single line -- any decent normal will do */
+    norm[0] = norm[1] = norm[2] = 0;
+    norm[LongAxis(d1)] = 1;
+  }
+}
+
+
+static void CheckOrientation( GLUtesselator *tess )
+{
+  GLdouble area;
+  GLUface *f, *fHead = &tess->mesh->fHead;
+  GLUvertex *v, *vHead = &tess->mesh->vHead;
+  GLUhalfEdge *e;
+
+  /* When we compute the normal automatically, we choose the orientation
+   * so that the sum of the signed areas of all contours is non-negative.
+   */
+  area = 0;
+  for( f = fHead->next; f != fHead; f = f->next ) {
+    e = f->anEdge;
+    if( e->winding <= 0 ) continue;
+    do {
+      area += (e->Org->s - e->Dst->s) * (e->Org->t + e->Dst->t);
+      e = e->Lnext;
+    } while( e != f->anEdge );
+  }
+  if( area < 0 ) {
+    /* Reverse the orientation by flipping all the t-coordinates */
+    for( v = vHead->next; v != vHead; v = v->next ) {
+      v->t = - v->t;
+    }
+    tess->tUnit[0] = - tess->tUnit[0];
+    tess->tUnit[1] = - tess->tUnit[1];
+    tess->tUnit[2] = - tess->tUnit[2];
+  }
+}
+
+#ifdef FOR_TRITE_TEST_PROGRAM
+#include <stdlib.h>
+extern int RandomSweep;
+#define S_UNIT_X	(RandomSweep ? (2*drand48()-1) : 1.0)
+#define S_UNIT_Y	(RandomSweep ? (2*drand48()-1) : 0.0)
+#else
+#if defined(SLANTED_SWEEP)
+/* The "feature merging" is not intended to be complete.  There are
+ * special cases where edges are nearly parallel to the sweep line
+ * which are not implemented.  The algorithm should still behave
+ * robustly (ie. produce a reasonable tesselation) in the presence
+ * of such edges, however it may miss features which could have been
+ * merged.  We could minimize this effect by choosing the sweep line
+ * direction to be something unusual (ie. not parallel to one of the
+ * coordinate axes).
+ */
+#define S_UNIT_X	0.50941539564955385	/* Pre-normalized */
+#define S_UNIT_Y	0.86052074622010633
+#else
+#define S_UNIT_X	1.0
+#define S_UNIT_Y	0.0
+#endif
+#endif
+
+/* Determine the polygon normal and project vertices onto the plane
+ * of the polygon.
+ */
+void __gl_projectPolygon( GLUtesselator *tess )
+{
+  GLUvertex *v, *vHead = &tess->mesh->vHead;
+  GLdouble norm[3];
+  GLdouble *sUnit, *tUnit;
+  int i, computedNormal = FALSE;
+
+  norm[0] = tess->normal[0];
+  norm[1] = tess->normal[1];
+  norm[2] = tess->normal[2];
+  if( norm[0] == 0 && norm[1] == 0 && norm[2] == 0 ) {
+    ComputeNormal( tess, norm );
+    computedNormal = TRUE;
+  }
+  sUnit = tess->sUnit;
+  tUnit = tess->tUnit;
+  i = LongAxis( norm );
+
+#if defined(FOR_TRITE_TEST_PROGRAM) || defined(TRUE_PROJECT)
+  /* Choose the initial sUnit vector to be approximately perpendicular
+   * to the normal.
+   */
+  Normalize( norm );
+
+  sUnit[i] = 0;
+  sUnit[(i+1)%3] = S_UNIT_X;
+  sUnit[(i+2)%3] = S_UNIT_Y;
+
+  /* Now make it exactly perpendicular */
+  w = Dot( sUnit, norm );
+  sUnit[0] -= w * norm[0];
+  sUnit[1] -= w * norm[1];
+  sUnit[2] -= w * norm[2];
+  Normalize( sUnit );
+
+  /* Choose tUnit so that (sUnit,tUnit,norm) form a right-handed frame */
+  tUnit[0] = norm[1]*sUnit[2] - norm[2]*sUnit[1];
+  tUnit[1] = norm[2]*sUnit[0] - norm[0]*sUnit[2];
+  tUnit[2] = norm[0]*sUnit[1] - norm[1]*sUnit[0];
+  Normalize( tUnit );
+#else
+  /* Project perpendicular to a coordinate axis -- better numerically */
+  sUnit[i] = 0;
+  sUnit[(i+1)%3] = S_UNIT_X;
+  sUnit[(i+2)%3] = S_UNIT_Y;
+
+  tUnit[i] = 0;
+  tUnit[(i+1)%3] = (norm[i] > 0) ? -S_UNIT_Y : S_UNIT_Y;
+  tUnit[(i+2)%3] = (norm[i] > 0) ? S_UNIT_X : -S_UNIT_X;
+#endif
+
+  /* Project the vertices onto the sweep plane */
+  for( v = vHead->next; v != vHead; v = v->next ) {
+    v->s = Dot( v->coords, sUnit );
+    v->t = Dot( v->coords, tUnit );
+  }
+  if( computedNormal ) {
+    CheckOrientation( tess );
+  }
+}
--- a/vtm/jni/tessellate/normal.h
+++ b/vtm/jni/tessellate/normal.h
@@ -0,0 +1,45 @@
+/*
+ * SGI FREE SOFTWARE LICENSE B (Version 2.0, Sept. 18, 2008)
+ * Copyright (C) 1991-2000 Silicon Graphics, Inc. All Rights Reserved.
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a
+ * copy of this software and associated documentation files (the "Software"),
+ * to deal in the Software without restriction, including without limitation
+ * the rights to use, copy, modify, merge, publish, distribute, sublicense,
+ * and/or sell copies of the Software, and to permit persons to whom the
+ * Software is furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice including the dates of first publication and
+ * either this permission notice or a reference to
+ * http://oss.sgi.com/projects/FreeB/
+ * shall be included in all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
+ * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
+ * SILICON GRAPHICS, INC. BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
+ * WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF
+ * OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+ * SOFTWARE.
+ *
+ * Except as contained in this notice, the name of Silicon Graphics, Inc.
+ * shall not be used in advertising or otherwise to promote the sale, use or
+ * other dealings in this Software without prior written authorization from
+ * Silicon Graphics, Inc.
+ */
+/*
+** Author: Eric Veach, July 1994.
+**
+*/
+
+#ifndef __normal_h_
+#define __normal_h_
+
+#include "tess.h"
+
+/* __gl_projectPolygon( tess ) determines the polygon normal
+ * and project vertices onto the plane of the polygon.
+ */
+void __gl_projectPolygon( GLUtesselator *tess );
+
+#endif
--- a/vtm/jni/tessellate/priorityq-heap.c
+++ b/vtm/jni/tessellate/priorityq-heap.c
@@ -0,0 +1,257 @@
+/*
+ * SGI FREE SOFTWARE LICENSE B (Version 2.0, Sept. 18, 2008)
+ * Copyright (C) 1991-2000 Silicon Graphics, Inc. All Rights Reserved.
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a
+ * copy of this software and associated documentation files (the "Software"),
+ * to deal in the Software without restriction, including without limitation
+ * the rights to use, copy, modify, merge, publish, distribute, sublicense,
+ * and/or sell copies of the Software, and to permit persons to whom the
+ * Software is furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice including the dates of first publication and
+ * either this permission notice or a reference to
+ * http://oss.sgi.com/projects/FreeB/
+ * shall be included in all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
+ * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
+ * SILICON GRAPHICS, INC. BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
+ * WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF
+ * OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+ * SOFTWARE.
+ *
+ * Except as contained in this notice, the name of Silicon Graphics, Inc.
+ * shall not be used in advertising or otherwise to promote the sale, use or
+ * other dealings in this Software without prior written authorization from
+ * Silicon Graphics, Inc.
+ */
+/*
+** Author: Eric Veach, July 1994.
+**
+*/
+
+#include <limits.h>
+#include <stddef.h>
+#include <assert.h>
+#include "priorityq-heap.h"
+#include "memalloc.h"
+
+#define INIT_SIZE	32
+
+#ifndef TRUE
+#define TRUE 1
+#endif
+#ifndef FALSE
+#define FALSE 0
+#endif
+
+#ifdef FOR_TRITE_TEST_PROGRAM
+#define LEQ(x,y)	(*pq->leq)(x,y)
+#else
+/* Violates modularity, but a little faster */
+#include "geom.h"
+#define LEQ(x,y)	VertLeq((GLUvertex *)x, (GLUvertex *)y)
+#endif
+
+/* really __gl_pqHeapNewPriorityQ */
+PriorityQ *pqNewPriorityQ( int (*leq)(PQkey key1, PQkey key2) )
+{
+  PriorityQ *pq = (PriorityQ *)memAlloc( sizeof( PriorityQ ));
+  if (pq == NULL) return NULL;
+
+  pq->size = 0;
+  pq->max = INIT_SIZE;
+  pq->nodes = (PQnode *)memAlloc( (INIT_SIZE + 1) * sizeof(pq->nodes[0]) );
+  if (pq->nodes == NULL) {
+     memFree(pq);
+     return NULL;
+  }
+
+  pq->handles = (PQhandleElem *)memAlloc( (INIT_SIZE + 1) * sizeof(pq->handles[0]) );
+  if (pq->handles == NULL) {
+     memFree(pq->nodes);
+     memFree(pq);
+     return NULL;
+  }
+
+  pq->initialized = FALSE;
+  pq->freeList = 0;
+  pq->leq = leq;
+
+  pq->nodes[1].handle = 1;	/* so that Minimum() returns NULL */
+  pq->handles[1].key = NULL;
+  return pq;
+}
+
+/* really __gl_pqHeapDeletePriorityQ */
+void pqDeletePriorityQ( PriorityQ *pq )
+{
+  memFree( pq->handles );
+  memFree( pq->nodes );
+  memFree( pq );
+}
+
+
+static void FloatDown( PriorityQ *pq, long curr )
+{
+  PQnode *n = pq->nodes;
+  PQhandleElem *h = pq->handles;
+  PQhandle hCurr, hChild;
+  long child;
+
+  hCurr = n[curr].handle;
+  for( ;; ) {
+    child = curr << 1;
+    if( child < pq->size && LEQ( h[n[child+1].handle].key,
+				 h[n[child].handle].key )) {
+      ++child;
+    }
+
+    assert(child <= pq->max);
+
+    hChild = n[child].handle;
+    if( child > pq->size || LEQ( h[hCurr].key, h[hChild].key )) {
+      n[curr].handle = hCurr;
+      h[hCurr].node = curr;
+      break;
+    }
+    n[curr].handle = hChild;
+    h[hChild].node = curr;
+    curr = child;
+  }
+}
+
+
+static void FloatUp( PriorityQ *pq, long curr )
+{
+  PQnode *n = pq->nodes;
+  PQhandleElem *h = pq->handles;
+  PQhandle hCurr, hParent;
+  long parent;
+
+  hCurr = n[curr].handle;
+  for( ;; ) {
+    parent = curr >> 1;
+    hParent = n[parent].handle;
+    if( parent == 0 || LEQ( h[hParent].key, h[hCurr].key )) {
+      n[curr].handle = hCurr;
+      h[hCurr].node = curr;
+      break;
+    }
+    n[curr].handle = hParent;
+    h[hParent].node = curr;
+    curr = parent;
+  }
+}
+
+/* really __gl_pqHeapInit */
+void pqInit( PriorityQ *pq )
+{
+  long i;
+
+  /* This method of building a heap is O(n), rather than O(n lg n). */
+
+  for( i = pq->size; i >= 1; --i ) {
+    FloatDown( pq, i );
+  }
+  pq->initialized = TRUE;
+}
+
+/* really __gl_pqHeapInsert */
+/* returns LONG_MAX iff out of memory */
+PQhandle pqInsert( PriorityQ *pq, PQkey keyNew )
+{
+  long curr;
+  PQhandle free_handle;
+
+  curr = ++ pq->size;
+  if( (curr*2) > pq->max ) {
+    PQnode *saveNodes= pq->nodes;
+    PQhandleElem *saveHandles= pq->handles;
+
+    /* If the heap overflows, double its size. */
+    pq->max <<= 1;
+    pq->nodes = (PQnode *)memRealloc( pq->nodes, 
+				     (size_t) 
+				     ((pq->max + 1) * sizeof( pq->nodes[0] )));
+    if (pq->nodes == NULL) {
+       pq->nodes = saveNodes;	/* restore ptr to free upon return */
+       return LONG_MAX;
+    }
+    pq->handles = (PQhandleElem *)memRealloc( pq->handles,
+			                     (size_t)
+			                      ((pq->max + 1) * 
+					       sizeof( pq->handles[0] )));
+    if (pq->handles == NULL) {
+       pq->handles = saveHandles; /* restore ptr to free upon return */
+       return LONG_MAX;
+    }
+  }
+
+  if( pq->freeList == 0 ) {
+    free_handle = curr;
+  } else {
+    free_handle = pq->freeList;
+    pq->freeList = pq->handles[free_handle].node;
+  }
+
+  pq->nodes[curr].handle = free_handle;
+  pq->handles[free_handle].node = curr;
+  pq->handles[free_handle].key = keyNew;
+
+  if( pq->initialized ) {
+    FloatUp( pq, curr );
+  }
+  assert(free_handle != LONG_MAX);
+  return free_handle;
+}
+
+/* really __gl_pqHeapExtractMin */
+PQkey pqExtractMin( PriorityQ *pq )
+{
+  PQnode *n = pq->nodes;
+  PQhandleElem *h = pq->handles;
+  PQhandle hMin = n[1].handle;
+  PQkey min = h[hMin].key;
+
+  if( pq->size > 0 ) {
+    n[1].handle = n[pq->size].handle;
+    h[n[1].handle].node = 1;
+
+    h[hMin].key = NULL;
+    h[hMin].node = pq->freeList;
+    pq->freeList = hMin;
+
+    if( -- pq->size > 0 ) {
+      FloatDown( pq, 1 );
+    }
+  }
+  return min;
+}
+
+/* really __gl_pqHeapDelete */
+void pqDelete( PriorityQ *pq, PQhandle hCurr )
+{
+  PQnode *n = pq->nodes;
+  PQhandleElem *h = pq->handles;
+  long curr;
+
+  assert( hCurr >= 1 && hCurr <= pq->max && h[hCurr].key != NULL );
+
+  curr = h[hCurr].node;
+  n[curr].handle = n[pq->size].handle;
+  h[n[curr].handle].node = curr;
+
+  if( curr <= -- pq->size ) {
+    if( curr <= 1 || LEQ( h[n[curr>>1].handle].key, h[n[curr].handle].key )) {
+      FloatDown( pq, curr );
+    } else {
+      FloatUp( pq, curr );
+    }
+  }
+  h[hCurr].key = NULL;
+  h[hCurr].node = pq->freeList;
+  pq->freeList = hCurr;
+}
--- a/vtm/jni/tessellate/priorityq-heap.h
+++ b/vtm/jni/tessellate/priorityq-heap.h
@@ -0,0 +1,107 @@
+/*
+ * SGI FREE SOFTWARE LICENSE B (Version 2.0, Sept. 18, 2008)
+ * Copyright (C) 1991-2000 Silicon Graphics, Inc. All Rights Reserved.
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a
+ * copy of this software and associated documentation files (the "Software"),
+ * to deal in the Software without restriction, including without limitation
+ * the rights to use, copy, modify, merge, publish, distribute, sublicense,
+ * and/or sell copies of the Software, and to permit persons to whom the
+ * Software is furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice including the dates of first publication and
+ * either this permission notice or a reference to
+ * http://oss.sgi.com/projects/FreeB/
+ * shall be included in all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
+ * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
+ * SILICON GRAPHICS, INC. BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
+ * WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF
+ * OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+ * SOFTWARE.
+ *
+ * Except as contained in this notice, the name of Silicon Graphics, Inc.
+ * shall not be used in advertising or otherwise to promote the sale, use or
+ * other dealings in this Software without prior written authorization from
+ * Silicon Graphics, Inc.
+ */
+/*
+** Author: Eric Veach, July 1994.
+**
+*/
+
+#ifndef __priorityq_heap_h_
+#define __priorityq_heap_h_
+
+/* Use #define's so that another heap implementation can use this one */
+
+#define PQkey			PQHeapKey
+#define PQhandle		PQHeapHandle
+#define PriorityQ		PriorityQHeap
+
+#define pqNewPriorityQ(leq)	__gl_pqHeapNewPriorityQ(leq)
+#define pqDeletePriorityQ(pq)	__gl_pqHeapDeletePriorityQ(pq)
+
+/* The basic operations are insertion of a new key (pqInsert),
+ * and examination/extraction of a key whose value is minimum
+ * (pqMinimum/pqExtractMin).  Deletion is also allowed (pqDelete);
+ * for this purpose pqInsert returns a "handle" which is supplied
+ * as the argument.
+ *
+ * An initial heap may be created efficiently by calling pqInsert
+ * repeatedly, then calling pqInit.  In any case pqInit must be called
+ * before any operations other than pqInsert are used.
+ *
+ * If the heap is empty, pqMinimum/pqExtractMin will return a NULL key.
+ * This may also be tested with pqIsEmpty.
+ */
+#define pqInit(pq)		__gl_pqHeapInit(pq)
+#define pqInsert(pq,key)	__gl_pqHeapInsert(pq,key)
+#define pqMinimum(pq)		__gl_pqHeapMinimum(pq)
+#define pqExtractMin(pq)	__gl_pqHeapExtractMin(pq)
+#define pqDelete(pq,handle)	__gl_pqHeapDelete(pq,handle)
+#define pqIsEmpty(pq)		__gl_pqHeapIsEmpty(pq)
+
+
+/* Since we support deletion the data structure is a little more
+ * complicated than an ordinary heap.  "nodes" is the heap itself;
+ * active nodes are stored in the range 1..pq->size.  When the
+ * heap exceeds its allocated size (pq->max), its size doubles.
+ * The children of node i are nodes 2i and 2i+1.
+ *
+ * Each node stores an index into an array "handles".  Each handle
+ * stores a key, plus a pointer back to the node which currently
+ * represents that key (ie. nodes[handles[i].node].handle == i).
+ */
+
+typedef void *PQkey;
+typedef long PQhandle;
+typedef struct PriorityQ PriorityQ;
+
+typedef struct { PQhandle handle; } PQnode;
+typedef struct { PQkey key; PQhandle node; } PQhandleElem;
+
+struct PriorityQ {
+  PQnode	*nodes;
+  PQhandleElem	*handles;
+  long		size, max;
+  PQhandle	freeList;
+  int		initialized;
+  int		(*leq)(PQkey key1, PQkey key2);
+};
+  
+PriorityQ	*pqNewPriorityQ( int (*leq)(PQkey key1, PQkey key2) );
+void		pqDeletePriorityQ( PriorityQ *pq );
+
+void		pqInit( PriorityQ *pq );
+PQhandle	pqInsert( PriorityQ *pq, PQkey key );
+PQkey		pqExtractMin( PriorityQ *pq );
+void		pqDelete( PriorityQ *pq, PQhandle handle );
+
+
+#define __gl_pqHeapMinimum(pq)	((pq)->handles[(pq)->nodes[1].handle].key)
+#define __gl_pqHeapIsEmpty(pq)	((pq)->size == 0)
+
+#endif
--- a/vtm/jni/tessellate/priorityq-sort.h
+++ b/vtm/jni/tessellate/priorityq-sort.h
@@ -0,0 +1,117 @@
+/*
+ * SGI FREE SOFTWARE LICENSE B (Version 2.0, Sept. 18, 2008)
+ * Copyright (C) 1991-2000 Silicon Graphics, Inc. All Rights Reserved.
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a
+ * copy of this software and associated documentation files (the "Software"),
+ * to deal in the Software without restriction, including without limitation
+ * the rights to use, copy, modify, merge, publish, distribute, sublicense,
+ * and/or sell copies of the Software, and to permit persons to whom the
+ * Software is furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice including the dates of first publication and
+ * either this permission notice or a reference to
+ * http://oss.sgi.com/projects/FreeB/
+ * shall be included in all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
+ * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
+ * SILICON GRAPHICS, INC. BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
+ * WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF
+ * OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+ * SOFTWARE.
+ *
+ * Except as contained in this notice, the name of Silicon Graphics, Inc.
+ * shall not be used in advertising or otherwise to promote the sale, use or
+ * other dealings in this Software without prior written authorization from
+ * Silicon Graphics, Inc.
+ */
+/*
+** Author: Eric Veach, July 1994.
+**
+*/
+
+#ifndef __priorityq_sort_h_
+#define __priorityq_sort_h_
+
+#include "priorityq-heap.h"
+
+#undef PQkey
+#undef PQhandle
+#undef PriorityQ
+#undef pqNewPriorityQ
+#undef pqDeletePriorityQ
+#undef pqInit
+#undef pqInsert
+#undef pqMinimum
+#undef pqExtractMin
+#undef pqDelete
+#undef pqIsEmpty
+
+/* Use #define's so that another heap implementation can use this one */
+
+#define PQkey			PQSortKey
+#define PQhandle		PQSortHandle
+#define PriorityQ		PriorityQSort
+
+#define pqNewPriorityQ(leq)	__gl_pqSortNewPriorityQ(leq)
+#define pqDeletePriorityQ(pq)	__gl_pqSortDeletePriorityQ(pq)
+
+/* The basic operations are insertion of a new key (pqInsert),
+ * and examination/extraction of a key whose value is minimum
+ * (pqMinimum/pqExtractMin).  Deletion is also allowed (pqDelete);
+ * for this purpose pqInsert returns a "handle" which is supplied
+ * as the argument.
+ *
+ * An initial heap may be created efficiently by calling pqInsert
+ * repeatedly, then calling pqInit.  In any case pqInit must be called
+ * before any operations other than pqInsert are used.
+ *
+ * If the heap is empty, pqMinimum/pqExtractMin will return a NULL key.
+ * This may also be tested with pqIsEmpty.
+ */
+#define pqInit(pq)		__gl_pqSortInit(pq)
+#define pqInsert(pq,key)	__gl_pqSortInsert(pq,key)
+#define pqMinimum(pq)		__gl_pqSortMinimum(pq)
+#define pqExtractMin(pq)	__gl_pqSortExtractMin(pq)
+#define pqDelete(pq,handle)	__gl_pqSortDelete(pq,handle)
+#define pqIsEmpty(pq)		__gl_pqSortIsEmpty(pq)
+
+
+/* Since we support deletion the data structure is a little more
+ * complicated than an ordinary heap.  "nodes" is the heap itself;
+ * active nodes are stored in the range 1..pq->size.  When the
+ * heap exceeds its allocated size (pq->max), its size doubles.
+ * The children of node i are nodes 2i and 2i+1.
+ *
+ * Each node stores an index into an array "handles".  Each handle
+ * stores a key, plus a pointer back to the node which currently
+ * represents that key (ie. nodes[handles[i].node].handle == i).
+ */
+
+typedef PQHeapKey PQkey;
+typedef PQHeapHandle PQhandle;
+typedef struct PriorityQ PriorityQ;
+
+struct PriorityQ {
+  PriorityQHeap	*heap;
+  PQkey		*keys;
+  PQkey		**order;
+  PQhandle	size, max;
+  int		initialized;
+  int		(*leq)(PQkey key1, PQkey key2);
+};
+  
+PriorityQ	*pqNewPriorityQ( int (*leq)(PQkey key1, PQkey key2) );
+void		pqDeletePriorityQ( PriorityQ *pq );
+
+int		pqInit( PriorityQ *pq );
+PQhandle	pqInsert( PriorityQ *pq, PQkey key );
+PQkey		pqExtractMin( PriorityQ *pq );
+void		pqDelete( PriorityQ *pq, PQhandle handle );
+
+PQkey		pqMinimum( PriorityQ *pq );
+int		pqIsEmpty( PriorityQ *pq );
+
+#endif
--- a/vtm/jni/tessellate/priorityq.c
+++ b/vtm/jni/tessellate/priorityq.c
@@ -0,0 +1,260 @@
+/*
+ * SGI FREE SOFTWARE LICENSE B (Version 2.0, Sept. 18, 2008)
+ * Copyright (C) 1991-2000 Silicon Graphics, Inc. All Rights Reserved.
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a
+ * copy of this software and associated documentation files (the "Software"),
+ * to deal in the Software without restriction, including without limitation
+ * the rights to use, copy, modify, merge, publish, distribute, sublicense,
+ * and/or sell copies of the Software, and to permit persons to whom the
+ * Software is furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice including the dates of first publication and
+ * either this permission notice or a reference to
+ * http://oss.sgi.com/projects/FreeB/
+ * shall be included in all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
+ * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
+ * SILICON GRAPHICS, INC. BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
+ * WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF
+ * OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+ * SOFTWARE.
+ *
+ * Except as contained in this notice, the name of Silicon Graphics, Inc.
+ * shall not be used in advertising or otherwise to promote the sale, use or
+ * other dealings in this Software without prior written authorization from
+ * Silicon Graphics, Inc.
+ */
+/*
+** Author: Eric Veach, July 1994.
+**
+*/
+
+#include "gluos.h"
+#include <stddef.h>
+#include <assert.h>
+#include <limits.h>		/* LONG_MAX */
+#include "memalloc.h"
+
+/* Include all the code for the regular heap-based queue here. */
+
+#include "priorityq-heap.c"
+
+/* Now redefine all the function names to map to their "Sort" versions. */
+
+#include "priorityq-sort.h"
+
+/* really __gl_pqSortNewPriorityQ */
+PriorityQ *pqNewPriorityQ( int (*leq)(PQkey key1, PQkey key2) )
+{
+  PriorityQ *pq = (PriorityQ *)memAlloc( sizeof( PriorityQ ));
+  if (pq == NULL) return NULL;
+
+  pq->heap = __gl_pqHeapNewPriorityQ( leq );
+  if (pq->heap == NULL) {
+     memFree(pq);
+     return NULL;
+  }
+
+  pq->keys = (PQHeapKey *)memAlloc( INIT_SIZE * sizeof(pq->keys[0]) );
+  if (pq->keys == NULL) {
+     __gl_pqHeapDeletePriorityQ(pq->heap);
+     memFree(pq);
+     return NULL;
+  }
+
+  pq->size = 0;
+  pq->max = INIT_SIZE;
+  pq->initialized = FALSE;
+  pq->leq = leq;
+  return pq;
+}
+
+/* really __gl_pqSortDeletePriorityQ */
+void pqDeletePriorityQ( PriorityQ *pq )
+{
+  assert(pq != NULL); 
+  if (pq->heap != NULL) __gl_pqHeapDeletePriorityQ( pq->heap );
+  if (pq->order != NULL) memFree( pq->order );
+  if (pq->keys != NULL) memFree( pq->keys );
+  memFree( pq );
+}
+
+
+#define LT(x,y)		(! LEQ(y,x))
+#define GT(x,y)		(! LEQ(x,y))
+#define Swap(a,b)	do{PQkey *tmp = *a; *a = *b; *b = tmp;}while(0)
+
+/* really __gl_pqSortInit */
+int pqInit( PriorityQ *pq )
+{
+  PQkey **p, **r, **i, **j, *piv;
+  struct { PQkey **p, **r; } Stack[50], *top = Stack;
+  unsigned long seed = 2016473283;
+
+  /* Create an array of indirect pointers to the keys, so that we
+   * the handles we have returned are still valid.
+   */
+/*
+  pq->order = (PQHeapKey **)memAlloc( (size_t)
+                                  (pq->size * sizeof(pq->order[0])) );
+*/
+  pq->order = (PQHeapKey **)memAlloc( (size_t)
+                                  ((pq->size+1) * sizeof(pq->order[0])) );
+/* the previous line is a patch to compensate for the fact that IBM */
+/* machines return a null on a malloc of zero bytes (unlike SGI),   */
+/* so we have to put in this defense to guard against a memory      */
+/* fault four lines down. from fossum@austin.ibm.com.               */
+  if (pq->order == NULL) return 0;
+
+  p = pq->order;
+  r = p + pq->size - 1;
+  for( piv = pq->keys, i = p; i <= r; ++piv, ++i ) {
+    *i = piv;
+  }
+
+  /* Sort the indirect pointers in descending order,
+   * using randomized Quicksort
+   */
+  top->p = p; top->r = r; ++top;
+  while( --top >= Stack ) {
+    p = top->p;
+    r = top->r;
+    while( r > p + 10 ) {
+      seed = seed * 1539415821 + 1;
+      i = p + seed % (r - p + 1);
+      piv = *i;
+      *i = *p;
+      *p = piv;
+      i = p - 1;
+      j = r + 1;
+      do {
+	do { ++i; } while( GT( **i, *piv ));
+	do { --j; } while( LT( **j, *piv ));
+	Swap( i, j );
+      } while( i < j );
+      Swap( i, j );	/* Undo last swap */
+      if( i - p < r - j ) {
+	top->p = j+1; top->r = r; ++top;
+	r = i-1;
+      } else {
+	top->p = p; top->r = i-1; ++top;
+	p = j+1;
+      }
+    }
+    /* Insertion sort small lists */
+    for( i = p+1; i <= r; ++i ) {
+      piv = *i;
+      for( j = i; j > p && LT( **(j-1), *piv ); --j ) {
+	*j = *(j-1);
+      }
+      *j = piv;
+    }
+  }
+  pq->max = pq->size;
+  pq->initialized = TRUE;
+  __gl_pqHeapInit( pq->heap );	/* always succeeds */
+
+#ifndef NDEBUG
+  p = pq->order;
+  r = p + pq->size - 1;
+  for( i = p; i < r; ++i ) {
+    assert( LEQ( **(i+1), **i ));
+  }
+#endif
+
+  return 1;
+}
+
+/* really __gl_pqSortInsert */
+/* returns LONG_MAX iff out of memory */ 
+PQhandle pqInsert( PriorityQ *pq, PQkey keyNew )
+{
+  long curr;
+
+  if( pq->initialized ) {
+    return __gl_pqHeapInsert( pq->heap, keyNew );
+  }
+  curr = pq->size;
+  if( ++ pq->size >= pq->max ) {
+    PQkey *saveKey= pq->keys;
+
+    /* If the heap overflows, double its size. */
+    pq->max <<= 1;
+    pq->keys = (PQHeapKey *)memRealloc( pq->keys, 
+	 	                        (size_t)
+	                                 (pq->max * sizeof( pq->keys[0] )));
+    if (pq->keys == NULL) {	
+       pq->keys = saveKey;	/* restore ptr to free upon return */
+       return LONG_MAX;
+    }
+  }
+  assert(curr != LONG_MAX);	
+  pq->keys[curr] = keyNew;
+
+  /* Negative handles index the sorted array. */
+  return -(curr+1);
+}
+
+/* really __gl_pqSortExtractMin */
+PQkey pqExtractMin( PriorityQ *pq )
+{
+  PQkey sortMin, heapMin;
+
+  if( pq->size == 0 ) {
+    return __gl_pqHeapExtractMin( pq->heap );
+  }
+  sortMin = *(pq->order[pq->size-1]);
+  if( ! __gl_pqHeapIsEmpty( pq->heap )) {
+    heapMin = __gl_pqHeapMinimum( pq->heap );
+    if( LEQ( heapMin, sortMin )) {
+      return __gl_pqHeapExtractMin( pq->heap );
+    }
+  }
+  do {
+    -- pq->size;
+  } while( pq->size > 0 && *(pq->order[pq->size-1]) == NULL );
+  return sortMin;
+}
+
+/* really __gl_pqSortMinimum */
+PQkey pqMinimum( PriorityQ *pq )
+{
+  PQkey sortMin, heapMin;
+
+  if( pq->size == 0 ) {
+    return __gl_pqHeapMinimum( pq->heap );
+  }
+  sortMin = *(pq->order[pq->size-1]);
+  if( ! __gl_pqHeapIsEmpty( pq->heap )) {
+    heapMin = __gl_pqHeapMinimum( pq->heap );
+    if( LEQ( heapMin, sortMin )) {
+      return heapMin;
+    }
+  }
+  return sortMin;
+}
+
+/* really __gl_pqSortIsEmpty */
+int pqIsEmpty( PriorityQ *pq )
+{
+  return (pq->size == 0) && __gl_pqHeapIsEmpty( pq->heap );
+}
+
+/* really __gl_pqSortDelete */
+void pqDelete( PriorityQ *pq, PQhandle curr )
+{
+  if( curr >= 0 ) {
+    __gl_pqHeapDelete( pq->heap, curr );
+    return;
+  }
+  curr = -(curr+1);
+  assert( curr < pq->max && pq->keys[curr] != NULL );
+
+  pq->keys[curr] = NULL;
+  while( pq->size > 0 && *(pq->order[pq->size-1]) == NULL ) {
+    -- pq->size;
+  }
+}
--- a/vtm/jni/tessellate/priorityq.h
+++ b/vtm/jni/tessellate/priorityq.h
@@ -0,0 +1,117 @@
+/*
+ * SGI FREE SOFTWARE LICENSE B (Version 2.0, Sept. 18, 2008)
+ * Copyright (C) 1991-2000 Silicon Graphics, Inc. All Rights Reserved.
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a
+ * copy of this software and associated documentation files (the "Software"),
+ * to deal in the Software without restriction, including without limitation
+ * the rights to use, copy, modify, merge, publish, distribute, sublicense,
+ * and/or sell copies of the Software, and to permit persons to whom the
+ * Software is furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice including the dates of first publication and
+ * either this permission notice or a reference to
+ * http://oss.sgi.com/projects/FreeB/
+ * shall be included in all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
+ * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
+ * SILICON GRAPHICS, INC. BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
+ * WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF
+ * OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+ * SOFTWARE.
+ *
+ * Except as contained in this notice, the name of Silicon Graphics, Inc.
+ * shall not be used in advertising or otherwise to promote the sale, use or
+ * other dealings in this Software without prior written authorization from
+ * Silicon Graphics, Inc.
+ */
+/*
+** Author: Eric Veach, July 1994.
+**
+*/
+
+#ifndef __priorityq_sort_h_
+#define __priorityq_sort_h_
+
+#include "priorityq-heap.h"
+
+#undef PQkey
+#undef PQhandle
+#undef PriorityQ
+#undef pqNewPriorityQ
+#undef pqDeletePriorityQ
+#undef pqInit
+#undef pqInsert
+#undef pqMinimum
+#undef pqExtractMin
+#undef pqDelete
+#undef pqIsEmpty
+
+/* Use #define's so that another heap implementation can use this one */
+
+#define PQkey			PQSortKey
+#define PQhandle		PQSortHandle
+#define PriorityQ		PriorityQSort
+
+#define pqNewPriorityQ(leq)	__gl_pqSortNewPriorityQ(leq)
+#define pqDeletePriorityQ(pq)	__gl_pqSortDeletePriorityQ(pq)
+
+/* The basic operations are insertion of a new key (pqInsert),
+ * and examination/extraction of a key whose value is minimum
+ * (pqMinimum/pqExtractMin).  Deletion is also allowed (pqDelete);
+ * for this purpose pqInsert returns a "handle" which is supplied
+ * as the argument.
+ *
+ * An initial heap may be created efficiently by calling pqInsert
+ * repeatedly, then calling pqInit.  In any case pqInit must be called
+ * before any operations other than pqInsert are used.
+ *
+ * If the heap is empty, pqMinimum/pqExtractMin will return a NULL key.
+ * This may also be tested with pqIsEmpty.
+ */
+#define pqInit(pq)		__gl_pqSortInit(pq)
+#define pqInsert(pq,key)	__gl_pqSortInsert(pq,key)
+#define pqMinimum(pq)		__gl_pqSortMinimum(pq)
+#define pqExtractMin(pq)	__gl_pqSortExtractMin(pq)
+#define pqDelete(pq,handle)	__gl_pqSortDelete(pq,handle)
+#define pqIsEmpty(pq)		__gl_pqSortIsEmpty(pq)
+
+
+/* Since we support deletion the data structure is a little more
+ * complicated than an ordinary heap.  "nodes" is the heap itself;
+ * active nodes are stored in the range 1..pq->size.  When the
+ * heap exceeds its allocated size (pq->max), its size doubles.
+ * The children of node i are nodes 2i and 2i+1.
+ *
+ * Each node stores an index into an array "handles".  Each handle
+ * stores a key, plus a pointer back to the node which currently
+ * represents that key (ie. nodes[handles[i].node].handle == i).
+ */
+
+typedef PQHeapKey PQkey;
+typedef PQHeapHandle PQhandle;
+typedef struct PriorityQ PriorityQ;
+
+struct PriorityQ {
+  PriorityQHeap	*heap;
+  PQkey		*keys;
+  PQkey		**order;
+  PQhandle	size, max;
+  int		initialized;
+  int		(*leq)(PQkey key1, PQkey key2);
+};
+  
+PriorityQ	*pqNewPriorityQ( int (*leq)(PQkey key1, PQkey key2) );
+void		pqDeletePriorityQ( PriorityQ *pq );
+
+int		pqInit( PriorityQ *pq );
+PQhandle	pqInsert( PriorityQ *pq, PQkey key );
+PQkey		pqExtractMin( PriorityQ *pq );
+void		pqDelete( PriorityQ *pq, PQhandle handle );
+
+PQkey		pqMinimum( PriorityQ *pq );
+int		pqIsEmpty( PriorityQ *pq );
+
+#endif
--- a/Show More
+++ b/Show More