Revision 490
tags/org.gvsig.dwg-2.0.109/org.gvsig.dwg.app/pom.xml | ||
---|---|---|
1 |
<?xml version="1.0" encoding="UTF-8"?> |
|
2 |
|
|
3 |
<project xmlns="http://maven.apache.org/POM/4.0.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://maven.apache.org/POM/4.0.0 http://maven.apache.org/xsd/maven-4.0.0.xsd"> |
|
4 |
|
|
5 |
<modelVersion>4.0.0</modelVersion> |
|
6 |
<artifactId>org.gvsig.dwg.app</artifactId> |
|
7 |
<packaging>pom</packaging> |
|
8 |
<name>${project.artifactId}</name> |
|
9 |
<parent> |
|
10 |
<groupId>org.gvsig</groupId> |
|
11 |
<artifactId>org.gvsig.dwg</artifactId> |
|
12 |
<version>2.0.109</version> |
|
13 |
</parent> |
|
14 |
|
|
15 |
<modules> |
|
16 |
<module>org.gvsig.dwg.app.mainplugin</module> |
|
17 |
</modules> |
|
18 |
|
|
19 |
|
|
20 |
</project> |
tags/org.gvsig.dwg-2.0.109/org.gvsig.dwg.app/org.gvsig.dwg.app.mainplugin/buildNumber.properties | ||
---|---|---|
1 |
#Mon Dec 23 20:39:20 CET 2019 |
|
2 |
buildNumber=2177 |
tags/org.gvsig.dwg-2.0.109/org.gvsig.dwg.app/org.gvsig.dwg.app.mainplugin/src/test/java/org/gvsig/dwg/fmap/dal/store/dwg/TestDWG.java | ||
---|---|---|
1 |
/* gvSIG. Geographic Information System of the Valencian Government |
|
2 |
* |
|
3 |
* Copyright (C) 2007-2008 Infrastructures and Transports Department |
|
4 |
* of the Valencian Government (CIT) |
|
5 |
* |
|
6 |
* This program is free software; you can redistribute it and/or |
|
7 |
* modify it under the terms of the GNU General Public License |
|
8 |
* as published by the Free Software Foundation; either version 2 |
|
9 |
* of the License, or (at your option) any later version. |
|
10 |
* |
|
11 |
* This program is distributed in the hope that it will be useful, |
|
12 |
* but WITHOUT ANY WARRANTY; without even the implied warranty of |
|
13 |
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
|
14 |
* GNU General Public License for more details. |
|
15 |
* |
|
16 |
* You should have received a copy of the GNU General Public License |
|
17 |
* along with this program; if not, write to the Free Software |
|
18 |
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, |
|
19 |
* MA 02110-1301, USA. |
|
20 |
* |
|
21 |
*/ |
|
22 |
|
|
23 |
/* |
|
24 |
* AUTHORS (In addition to CIT): |
|
25 |
* 2008 IVER T.I. S.A. {{Task}} |
|
26 |
*/ |
|
27 |
|
|
28 |
package org.gvsig.dwg.fmap.dal.store.dwg; |
|
29 |
|
|
30 |
import java.io.File; |
|
31 |
|
|
32 |
import org.gvsig.fmap.dal.DataStoreParameters; |
|
33 |
import org.gvsig.fmap.dal.exception.DataException; |
|
34 |
import org.gvsig.fmap.dal.feature.BaseTestFeatureStore; |
|
35 |
import org.gvsig.fmap.dal.feature.FeatureStore; |
|
36 |
|
|
37 |
public class TestDWG extends BaseTestFeatureStore { |
|
38 |
|
|
39 |
|
|
40 |
protected boolean testDXFInitialized = false; |
|
41 |
|
|
42 |
public static File file_prueba = new File(TestDWG.class.getResource( |
|
43 |
"data/V2000.dwg").getFile()); |
|
44 |
|
|
45 |
/* |
|
46 |
* (non-Javadoc) |
|
47 |
* |
|
48 |
* @see |
|
49 |
* org.gvsig.fmap.dal.feature.BaseTestFeatureStore#getDefaultDataStoreParameters |
|
50 |
* () |
|
51 |
*/ |
|
52 |
public DataStoreParameters getDefaultDataStoreParameters() |
|
53 |
throws DataException { |
|
54 |
DWGStoreParameters dwgParameters = null; |
|
55 |
|
|
56 |
dwgParameters = (DWGStoreParameters) dataManager |
|
57 |
.createStoreParameters(DWGStoreProvider.NAME); |
|
58 |
|
|
59 |
dwgParameters.setFile(file_prueba); |
|
60 |
dwgParameters.setCRS("EPSG:23030"); |
|
61 |
return dwgParameters; |
|
62 |
} |
|
63 |
|
|
64 |
/* |
|
65 |
* (non-Javadoc) |
|
66 |
* |
|
67 |
* @see org.gvsig.fmap.dal.feature.BaseTestFeatureStore#hasExplorer() |
|
68 |
*/ |
|
69 |
public boolean hasExplorer() { |
|
70 |
// TODO Auto-generated method stub |
|
71 |
return false; |
|
72 |
} |
|
73 |
|
|
74 |
public boolean usesResources() { |
|
75 |
return true; |
|
76 |
} |
|
77 |
|
|
78 |
|
|
79 |
public void testLegendAndLabeling() throws Exception { |
|
80 |
DataStoreParameters params = getDefaultDataStoreParameters(); |
|
81 |
FeatureStore store = (FeatureStore) dataManager.openStore(params |
|
82 |
.getDataStoreName(), params); |
|
83 |
|
|
84 |
assertNotNull(store.invokeDynMethod("getLegend", null)); |
|
85 |
assertNotNull(store.invokeDynMethod("getLabeling", null)); |
|
86 |
store.dispose(); |
|
87 |
} |
|
88 |
} |
tags/org.gvsig.dwg-2.0.109/org.gvsig.dwg.app/org.gvsig.dwg.app.mainplugin/src/test/java/org/gvsig/dwg/fmap/dal/store/dwg/TestDWG2004.java | ||
---|---|---|
1 |
/* gvSIG. Geographic Information System of the Valencian Government |
|
2 |
* |
|
3 |
* Copyright (C) 2007-2008 Infrastructures and Transports Department |
|
4 |
* of the Valencian Government (CIT) |
|
5 |
* |
|
6 |
* This program is free software; you can redistribute it and/or |
|
7 |
* modify it under the terms of the GNU General Public License |
|
8 |
* as published by the Free Software Foundation; either version 2 |
|
9 |
* of the License, or (at your option) any later version. |
|
10 |
* |
|
11 |
* This program is distributed in the hope that it will be useful, |
|
12 |
* but WITHOUT ANY WARRANTY; without even the implied warranty of |
|
13 |
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
|
14 |
* GNU General Public License for more details. |
|
15 |
* |
|
16 |
* You should have received a copy of the GNU General Public License |
|
17 |
* along with this program; if not, write to the Free Software |
|
18 |
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, |
|
19 |
* MA 02110-1301, USA. |
|
20 |
* |
|
21 |
*/ |
|
22 |
|
|
23 |
/* |
|
24 |
* AUTHORS (In addition to CIT): |
|
25 |
* 2009 IVER T.I {{Task}} |
|
26 |
*/ |
|
27 |
|
|
28 |
package org.gvsig.dwg.fmap.dal.store.dwg; |
|
29 |
|
|
30 |
import java.io.File; |
|
31 |
|
|
32 |
public class TestDWG2004 extends TestDWG { |
|
33 |
public static File file_prueba = new File(TestDWG.class.getResource( |
|
34 |
"data/V2004.dwg").getFile()); |
|
35 |
} |
tags/org.gvsig.dwg-2.0.109/org.gvsig.dwg.app/org.gvsig.dwg.app.mainplugin/src/main/assembly/gvsig-plugin-package.xml | ||
---|---|---|
1 |
<assembly> |
|
2 |
<id>gvsig-plugin-package</id> |
|
3 |
<formats> |
|
4 |
<format>zip</format> |
|
5 |
</formats> |
|
6 |
<baseDirectory>${project.artifactId}</baseDirectory> |
|
7 |
<includeBaseDirectory>true</includeBaseDirectory> |
|
8 |
<files> |
|
9 |
<file> |
|
10 |
<source>target/${project.artifactId}-${project.version}.jar</source> |
|
11 |
<outputDirectory>lib</outputDirectory> |
|
12 |
</file> |
|
13 |
<file> |
|
14 |
<source>target/package.info</source> |
|
15 |
</file> |
|
16 |
</files> |
|
17 |
|
|
18 |
<fileSets> |
|
19 |
<fileSet> |
|
20 |
<directory>src/main/resources-plugin</directory> |
|
21 |
<outputDirectory>.</outputDirectory> |
|
22 |
</fileSet> |
|
23 |
</fileSets> |
|
24 |
|
|
25 |
<dependencySets> |
|
26 |
<dependencySet> |
|
27 |
<useProjectArtifact>false</useProjectArtifact> |
|
28 |
<useTransitiveDependencies>false</useTransitiveDependencies> |
|
29 |
<outputDirectory>lib</outputDirectory> |
|
30 |
<includes> |
|
31 |
<include>org.gvsig:org.gvsig.dwg.provider.legend</include> |
|
32 |
<include>org.gvsig:org.gvsig.dwg.provider</include> |
|
33 |
<include>org.gvsig:org.gvsig.dwg.lib</include> |
|
34 |
</includes> |
|
35 |
</dependencySet> |
|
36 |
</dependencySets> |
|
37 |
|
|
38 |
</assembly> |
tags/org.gvsig.dwg-2.0.109/org.gvsig.dwg.app/org.gvsig.dwg.app.mainplugin/src/main/java/org/gvsig/dwg/DWGRegisterExtension.java | ||
---|---|---|
1 |
/* gvSIG. Geographic Information System of the Valencian Government |
|
2 |
* |
|
3 |
* Copyright (C) 2007-2008 Infrastructures and Transports Department |
|
4 |
* of the Valencian Government (CIT) |
|
5 |
* |
|
6 |
* This program is free software; you can redistribute it and/or |
|
7 |
* modify it under the terms of the GNU General Public License |
|
8 |
* as published by the Free Software Foundation; either version 2 |
|
9 |
* of the License, or (at your option) any later version. |
|
10 |
* |
|
11 |
* This program is distributed in the hope that it will be useful, |
|
12 |
* but WITHOUT ANY WARRANTY; without even the implied warranty of |
|
13 |
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
|
14 |
* GNU General Public License for more details. |
|
15 |
* |
|
16 |
* You should have received a copy of the GNU General Public License |
|
17 |
* along with this program; if not, write to the Free Software |
|
18 |
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, |
|
19 |
* MA 02110-1301, USA. |
|
20 |
* |
|
21 |
*/ |
|
22 |
package org.gvsig.dwg; |
|
23 |
|
|
24 |
import org.gvsig.andami.IconThemeHelper; |
|
25 |
import org.gvsig.andami.plugins.Extension; |
|
26 |
import org.gvsig.dwg.fmap.dal.store.dwg.DWGStoreProvider; |
|
27 |
import org.gvsig.fmap.mapcontext.MapContextLocator; |
|
28 |
|
|
29 |
/** |
|
30 |
* Dummy DWG extension, as all the registration happens in the |
|
31 |
* {@link DWGLibrary}. |
|
32 |
* |
|
33 |
* @author gvSIG Team |
|
34 |
*/ |
|
35 |
public class DWGRegisterExtension extends Extension { |
|
36 |
|
|
37 |
public void execute(String actionCommand) { |
|
38 |
// Nothing to do |
|
39 |
} |
|
40 |
|
|
41 |
public void initialize() { |
|
42 |
IconThemeHelper.registerIcon("layer", "layer-icon-dwg", this); |
|
43 |
} |
|
44 |
|
|
45 |
public void postInitialize() { |
|
46 |
MapContextLocator.getMapContextManager().registerIconLayer(DWGStoreProvider.NAME, "layer-icon-dwg"); |
|
47 |
} |
|
48 |
|
|
49 |
public boolean isEnabled() { |
|
50 |
// Nothing to do |
|
51 |
return false; |
|
52 |
} |
|
53 |
|
|
54 |
public boolean isVisible() { |
|
55 |
// Nothing to do |
|
56 |
return false; |
|
57 |
} |
|
58 |
|
|
59 |
} |
tags/org.gvsig.dwg-2.0.109/org.gvsig.dwg.app/org.gvsig.dwg.app.mainplugin/src/main/resources-plugin/config.xml | ||
---|---|---|
1 |
<?xml version="1.0" encoding="ISO-8859-1"?> |
|
2 |
<plugin-config> |
|
3 |
<libraries library-dir="lib"> |
|
4 |
</libraries> |
|
5 |
<depends plugin-name="org.gvsig.app.mainplugin"/> |
|
6 |
<resourceBundle name="text"/> |
|
7 |
<extensions> |
|
8 |
<extension class-name="org.gvsig.dwg.DWGRegisterExtension" |
|
9 |
description="DWG Driver" |
|
10 |
active="true"> |
|
11 |
</extension> |
|
12 |
|
|
13 |
</extensions> |
|
14 |
</plugin-config> |
tags/org.gvsig.dwg-2.0.109/org.gvsig.dwg.app/org.gvsig.dwg.app.mainplugin/pom.xml | ||
---|---|---|
1 |
<?xml version="1.0" encoding="UTF-8"?> |
|
2 |
|
|
3 |
<project xmlns="http://maven.apache.org/POM/4.0.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://maven.apache.org/POM/4.0.0 http://maven.apache.org/xsd/maven-4.0.0.xsd"> |
|
4 |
|
|
5 |
<modelVersion>4.0.0</modelVersion> |
|
6 |
<artifactId>org.gvsig.dwg.app.mainplugin</artifactId> |
|
7 |
<packaging>jar</packaging> |
|
8 |
<name>${project.artifactId}</name> |
|
9 |
<description> |
|
10 |
DWG file format support (read-only) |
|
11 |
|
|
12 |
Supported versions: |
|
13 |
- v12 |
|
14 |
- v14 |
|
15 |
- v15 |
|
16 |
- v2004 |
|
17 |
|
|
18 |
</description> |
|
19 |
<parent> |
|
20 |
<groupId>org.gvsig</groupId> |
|
21 |
<artifactId>org.gvsig.dwg.app</artifactId> |
|
22 |
<version>2.0.109</version> |
|
23 |
</parent> |
|
24 |
|
|
25 |
<dependencies> |
|
26 |
<dependency> |
|
27 |
<groupId>org.gvsig</groupId> |
|
28 |
<artifactId>org.gvsig.tools.lib</artifactId> |
|
29 |
<scope>compile</scope> |
|
30 |
</dependency> |
|
31 |
<dependency> |
|
32 |
<groupId>org.gvsig</groupId> |
|
33 |
<artifactId>org.gvsig.andami</artifactId> |
|
34 |
<scope>compile</scope> |
|
35 |
</dependency> |
|
36 |
<dependency> |
|
37 |
<groupId>org.gvsig</groupId> |
|
38 |
<artifactId>org.gvsig.dwg.provider</artifactId> |
|
39 |
<scope>compile</scope> |
|
40 |
</dependency> |
|
41 |
<dependency> |
|
42 |
<groupId>org.gvsig</groupId> |
|
43 |
<artifactId>org.gvsig.dwg.provider.legend</artifactId> |
|
44 |
<scope>compile</scope> |
|
45 |
</dependency> |
|
46 |
|
|
47 |
<dependency> |
|
48 |
<groupId>org.gvsig</groupId> |
|
49 |
<artifactId>org.gvsig.dwg.lib</artifactId> |
|
50 |
<scope>runtime</scope> |
|
51 |
</dependency> |
|
52 |
|
|
53 |
<!-- Tests --> |
|
54 |
|
|
55 |
<dependency> |
|
56 |
<groupId>org.gvsig</groupId> |
|
57 |
<artifactId>org.gvsig.fmap.dal.impl</artifactId> |
|
58 |
<type>test-jar</type> |
|
59 |
<scope>test</scope> |
|
60 |
</dependency> |
|
61 |
|
|
62 |
<dependency> |
|
63 |
<groupId>org.gvsig</groupId> |
|
64 |
<artifactId>org.gvsig.fmap.dal.impl</artifactId> |
|
65 |
<type>jar</type> |
|
66 |
<scope>test</scope> |
|
67 |
</dependency> |
|
68 |
|
|
69 |
</dependencies> |
|
70 |
|
|
71 |
<properties> |
|
72 |
<!-- Package info property values --> |
|
73 |
<!-- Default values in org.gvsig.desktop --> |
|
74 |
<gvsig.package.info.name>Formats: dwg file format support (read-only)</gvsig.package.info.name> |
|
75 |
<gvsig.package.info.state>testing</gvsig.package.info.state> |
|
76 |
<gvsig.package.info.official>true</gvsig.package.info.official> |
|
77 |
<gvsig.package.info.dependencies>required: org.gvsig.app.mainplugin -ge 2.1.0-A</gvsig.package.info.dependencies> |
|
78 |
<gvsig.package.info.categories>Formats,Vector</gvsig.package.info.categories> |
|
79 |
<gvsig.package.info.poolURL>https://devel.gvsig.org/download/projects/gvsig-dwg/pool</gvsig.package.info.poolURL> |
|
80 |
</properties> |
|
81 |
|
|
82 |
<build> |
|
83 |
<plugins> |
|
84 |
|
|
85 |
<plugin> |
|
86 |
<!-- Skip compilation tests --> |
|
87 |
<groupId>org.apache.maven.plugins</groupId> |
|
88 |
<artifactId>maven-compiler-plugin</artifactId> |
|
89 |
<executions> |
|
90 |
<execution> |
|
91 |
<id>default-testCompile</id> |
|
92 |
<phase>process-test-sources</phase> |
|
93 |
<goals> |
|
94 |
<goal>testCompile</goal> |
|
95 |
</goals> |
|
96 |
<configuration> |
|
97 |
<skip>true</skip> |
|
98 |
</configuration> |
|
99 |
</execution> |
|
100 |
</executions> |
|
101 |
</plugin> |
|
102 |
|
|
103 |
<plugin> |
|
104 |
<!-- Skip test execution --> |
|
105 |
<groupId>org.apache.maven.plugins</groupId> |
|
106 |
<artifactId>maven-surefire-plugin</artifactId> |
|
107 |
<configuration> |
|
108 |
<skipTests>true</skipTests> |
|
109 |
</configuration> |
|
110 |
</plugin> |
|
111 |
|
|
112 |
</plugins> |
|
113 |
</build> |
|
114 |
|
|
115 |
</project> |
|
116 |
|
|
0 | 117 |
tags/org.gvsig.dwg-2.0.109/org.gvsig.dwg.lib/src/test/java/org/gvsig/dwg/lib/DwgTestSuite.java | ||
---|---|---|
1 |
/* |
|
2 |
* Created on 08-feb-2007 |
|
3 |
* |
|
4 |
* gvSIG. Sistema de Informaci?n Geogr?fica de la Generalitat Valenciana |
|
5 |
* |
|
6 |
* Copyright (C) 2004 IVER T.I. and Generalitat Valenciana. |
|
7 |
* |
|
8 |
* This program is free software; you can redistribute it and/or |
|
9 |
* modify it under the terms of the GNU General Public License |
|
10 |
* as published by the Free Software Foundation; either version 2 |
|
11 |
* of the License, or (at your option) any later version. |
|
12 |
* |
|
13 |
* This program is distributed in the hope that it will be useful, |
|
14 |
* but WITHOUT ANY WARRANTY; without even the implied warranty of |
|
15 |
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
|
16 |
* GNU General Public License for more details. |
|
17 |
* |
|
18 |
* You should have received a copy of the GNU General Public License |
|
19 |
* along with this program; if not, write to the Free Software |
|
20 |
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,USA. |
|
21 |
* |
|
22 |
* For more information, contact: |
|
23 |
* |
|
24 |
* Generalitat Valenciana |
|
25 |
* Conselleria d'Infraestructures i Transport |
|
26 |
* Av. Blasco Ib??ez, 50 |
|
27 |
* 46010 VALENCIA |
|
28 |
* SPAIN |
|
29 |
* |
|
30 |
* +34 963862235 |
|
31 |
* gvsig@gva.es |
|
32 |
* www.gvsig.gva.es |
|
33 |
* |
|
34 |
* or |
|
35 |
* |
|
36 |
* IVER T.I. S.A |
|
37 |
* Salamanca 50 |
|
38 |
* 46005 Valencia |
|
39 |
* Spain |
|
40 |
* |
|
41 |
* +34 963163400 |
|
42 |
* dac@iver.es |
|
43 |
*/ |
|
44 |
/* CVS MESSAGES: |
|
45 |
* |
|
46 |
* $Id: DwgTestSuite.java 28970 2009-05-25 13:27:14Z jmvivo $ |
|
47 |
* $Log$ |
|
48 |
* Revision 1.1.2.1 2007-02-28 07:35:10 jmvivo |
|
49 |
* Actualizado desde el HEAD. |
|
50 |
* |
|
51 |
* Revision 1.1 2007/02/08 20:27:57 azabala |
|
52 |
* *** empty log message *** |
|
53 |
* |
|
54 |
* |
|
55 |
*/ |
|
56 |
package org.gvsig.dwg.lib; |
|
57 |
|
|
58 |
import junit.framework.Test; |
|
59 |
import junit.framework.TestSuite; |
|
60 |
|
|
61 |
public class DwgTestSuite { |
|
62 |
|
|
63 |
public static Test suite() { |
|
64 |
TestSuite suite = new TestSuite("Test for com.iver.cit.jdwglib.dwg"); |
|
65 |
//$JUnit-BEGIN$ |
|
66 |
suite.addTestSuite(DwgFileTest.class); |
|
67 |
//$JUnit-END$ |
|
68 |
return suite; |
|
69 |
} |
|
70 |
|
|
71 |
} |
|
72 |
|
tags/org.gvsig.dwg-2.0.109/org.gvsig.dwg.lib/src/test/java/org/gvsig/dwg/lib/DwgFileTest.java | ||
---|---|---|
1 |
package org.gvsig.dwg.lib; |
|
2 |
|
|
3 |
import java.io.File; |
|
4 |
import java.io.IOException; |
|
5 |
import java.net.URL; |
|
6 |
|
|
7 |
import junit.framework.TestCase; |
|
8 |
|
|
9 |
public class DwgFileTest extends TestCase { |
|
10 |
private File baseDataPath; |
|
11 |
|
|
12 |
protected void setUp() throws Exception { |
|
13 |
super.setUp(); |
|
14 |
URL url = this.getClass().getResource("data"); |
|
15 |
if (url == null) { |
|
16 |
throw new Exception("Can't find 'data' dir"); |
|
17 |
} |
|
18 |
|
|
19 |
baseDataPath = new File(url.getFile()); |
|
20 |
if (!baseDataPath.exists()) { |
|
21 |
throw new Exception("Can't find 'data' dir"); |
|
22 |
} |
|
23 |
|
|
24 |
} |
|
25 |
|
|
26 |
protected void tearDown() throws Exception { |
|
27 |
super.tearDown(); |
|
28 |
} |
|
29 |
public void test1() throws IOException, DwgVersionNotSupportedException { |
|
30 |
// String fileName = baseDataPath.getAbsolutePath()+"/Un punto.dwg"; |
|
31 |
// DwgFile dwg = new DwgFile(fileName); |
|
32 |
// |
|
33 |
// dwg.read(); |
|
34 |
// dwg.calculateGisModelDwgPolylines(); |
|
35 |
// dwg.blockManagement(); |
|
36 |
// LinkedList dwgObjects = dwg.getDwgObjects(); |
|
37 |
} |
|
38 |
|
|
39 |
public void test2() throws RuntimeException, CorruptedDwgEntityException{ |
|
40 |
//Dwg Object that is supposed to be |
|
41 |
//an LWPOLYLINE in V14 version |
|
42 |
/* |
|
43 |
int[] data = new int[]{61,64,64,183,19,227,104,16 |
|
44 |
,0,5,8,59,72,32,252,47,90,142, |
|
45 |
234,145,50,10,71,11,213,36,229, |
|
46 |
162,130,10,228,126,23,174,130, |
|
47 |
145,50,15,98,141,196,244,229, |
|
48 |
162,130,12,126,23,169,66,58, |
|
49 |
145,50,12,47,90,138,68,229, |
|
50 |
162,130,8,0,0,4,7,74,137,50, |
|
51 |
15,177,66,231,252,221,162,130, |
|
52 |
9,130,151,21,242,151,21,190, |
|
53 |
8,21,8,56}; |
|
54 |
*/ |
|
55 |
// int[] data = new int[]{62,128,64,71,99, |
|
56 |
// 40,48,0,5,8,27,72, |
|
57 |
// 100,126,23,169,68, |
|
58 |
// 178,105,50,13,114, |
|
59 |
// 63,11,82,165,162,130, |
|
60 |
// 13,114,63,11,210,138, |
|
61 |
// 105,50,8,173,114,59, |
|
62 |
// 138,205,162,130,15,98, |
|
63 |
// 141,192,241,58,105,50, |
|
64 |
// 11,51,51,52,178,229,162, |
|
65 |
// 130,14,110,102,98,97,234, |
|
66 |
// 105,50,11,51,51,52,179,21, |
|
67 |
// 162,130,10,149,192,240,42, |
|
68 |
// 162,105,50,14,189,27,131, |
|
69 |
// 107,69,162,130,14,31,169, |
|
70 |
// 66,227,74,105,50,9,240,86, |
|
71 |
// 185,27,117,162,130,11,59, |
|
72 |
// 51,51,52,234,105,50,13,114, |
|
73 |
// 63,11,83,85,162,130,9,74,228, |
|
74 |
// 126,22,186,105,50,11,51,51,50, |
|
75 |
// 51,53,162,130,11,137,232,82,190, |
|
76 |
// 58,105,50,9,74,228,122,147,13,162, |
|
77 |
// 130,11,137,232,82,189,106,105,50,9, |
|
78 |
// 74,228,122,146,213,162,130,9,74,228,122,20,202,105,50,12,126,23,171,194,173,162,130,12,126,23,169,68,178,105,50,13,114,63,11,82,165,162,130,9,130,151,22,10,136,182,8,21,8,120}; |
|
79 |
// //1er intento: suponemos que la LWPOLYLINE cumple la especificaci?n |
|
80 |
// //a rajatabla |
|
81 |
// int bitPos = 0; |
|
82 |
// List val = DwgUtil.getBitShort(data, bitPos); |
|
83 |
// bitPos = ((Integer) val.get(0)).intValue(); |
|
84 |
// int type = ((Integer) val.get(1)).intValue(); |
|
85 |
// System.out.println("type = " + type); |
|
86 |
// |
|
87 |
// DwgHandleReference hr = new DwgHandleReference(); |
|
88 |
// bitPos = hr.read(data, bitPos); |
|
89 |
// System.out.println("handle, code="+ |
|
90 |
// hr.getCode()+ |
|
91 |
// " ,offset="+ |
|
92 |
// hr.getOffset()); |
|
93 |
// |
|
94 |
// //Ahora pasamos a la extended data |
|
95 |
// val = DwgUtil.getBitShort(data, bitPos); |
|
96 |
// bitPos = ((Integer) val.get(0)).intValue(); |
|
97 |
// int extendedDataSize = ((Integer) val.get(1)).intValue(); |
|
98 |
// System.out.println("EED size="+extendedDataSize); |
|
99 |
// //como el size es 0, me lo salto |
|
100 |
// |
|
101 |
// //ver si tiene datos graficos |
|
102 |
// val = DwgUtil.testBit(data, bitPos); |
|
103 |
// bitPos = ((Integer) val.get(0)).intValue(); |
|
104 |
// boolean hasGraphicsData = ((Boolean) val.get(1)) |
|
105 |
// .booleanValue(); |
|
106 |
// System.out.println("graphics = "+hasGraphicsData); |
|
107 |
// |
|
108 |
// //como se que no hay graphics me lo salto |
|
109 |
// //tama?o en bits |
|
110 |
// val = DwgUtil.getRawLong(data, bitPos); |
|
111 |
// bitPos = ((Integer) val.get(0)).intValue(); |
|
112 |
// int sizeInBits = ((Integer) val.get(1)).intValue(); |
|
113 |
// System.out.println("sizeInBits = "+sizeInBits); |
|
114 |
// |
|
115 |
// /* |
|
116 |
// * Ahora, lo que viene es lo que en la spec se dice |
|
117 |
// * "Common entity data". Revisar bien pues PythonCAD no lo lee |
|
118 |
// * como en la spec. |
|
119 |
// * |
|
120 |
// * pag 42. |
|
121 |
// R13-R14 Only: |
|
122 |
// RL : Size of object data in bits |
|
123 |
// 6B : Flags (FEDCBA) |
|
124 |
// 6B : Common parameters (CCSSII) |
|
125 |
// Segun esto, deberia leer 6 bits y 6 bits |
|
126 |
// |
|
127 |
// FLAGS |
|
128 |
// Mas adelante (pag 43), dice: |
|
129 |
// DC : This is the number of reactors attached to an |
|
130 |
// entity as a bitshort. |
|
131 |
// This feature may have been dormant in R13, |
|
132 |
// but it appears in R14, and in files saved as R13 by R14. |
|
133 |
// |
|
134 |
// Ahora bien, pythoncad las est? leyendo como bitLong |
|
135 |
// ?En que quedamos, son 2 bits, 1 bitLong o 1 bitShort? |
|
136 |
// TODO REVISAR |
|
137 |
// |
|
138 |
// COMMON PARAMETERS |
|
139 |
// Al principio, dice que son 6 bits (CC, SS, II) |
|
140 |
// pero luego dice (pag 43): |
|
141 |
// CC : Color bitshort |
|
142 |
// SS : Linetype scale bitdouble |
|
143 |
// II : "Invisible" flag bitshort |
|
144 |
// |
|
145 |
// Pythoncad, en vez de como 2 bits, los est? leyendo |
|
146 |
// como BitShort, BitDouble y BitShort |
|
147 |
// |
|
148 |
// * */ |
|
149 |
// |
|
150 |
// Integer mode = (Integer) DwgUtil.getBits(data, 2, bitPos); |
|
151 |
// bitPos += 2; |
|
152 |
// System.out.println("mode = "+mode); |
|
153 |
// |
|
154 |
// /* |
|
155 |
// val = DwgUtil.getBitLong(data, bitPos); |
|
156 |
// bitPos = ((Integer) val.get(0)).intValue(); |
|
157 |
// int rnum = ((Integer) val.get(1)).intValue(); |
|
158 |
// System.out.println("numReactors = "+rnum); |
|
159 |
//*/ |
|
160 |
// val = DwgUtil.getBitShort(data, bitPos); |
|
161 |
// bitPos = ((Integer) val.get(0)).intValue(); |
|
162 |
// int rnum = ((Integer) val.get(1)).intValue(); |
|
163 |
// System.out.println("numReactors = "+rnum); |
|
164 |
// |
|
165 |
// |
|
166 |
// val = DwgUtil.testBit(data, bitPos); |
|
167 |
// bitPos = ((Integer) val.get(0)).intValue(); |
|
168 |
// boolean isLyrByLineType = ((Boolean) val.get(1)).booleanValue(); |
|
169 |
// System.out.println("isLyrByLineType="+isLyrByLineType); |
|
170 |
// |
|
171 |
// val = DwgUtil.testBit(data, bitPos); |
|
172 |
// bitPos = ((Integer) val.get(0)).intValue(); |
|
173 |
// boolean noLinks = ((Boolean) val.get(1)).booleanValue(); |
|
174 |
// System.out.println("noLinks="+noLinks); |
|
175 |
// |
|
176 |
// |
|
177 |
// val = DwgUtil.getBitShort(data, bitPos); |
|
178 |
// bitPos = ((Integer) val.get(0)).intValue(); |
|
179 |
// int color = ((Integer) val.get(1)).intValue(); |
|
180 |
// System.out.println("color="+color); |
|
181 |
// |
|
182 |
// |
|
183 |
// val = DwgUtil.getBitDouble(data, bitPos); |
|
184 |
// bitPos = ((Integer) val.get(0)).intValue(); |
|
185 |
// float ltscale = ((Double) val.get(1)).floatValue(); |
|
186 |
// System.out.println("ltscale="+ltscale); |
|
187 |
// |
|
188 |
// val = DwgUtil.getBitShort(data, bitPos); |
|
189 |
// bitPos = ((Integer) val.get(0)).intValue(); |
|
190 |
// int invis = ((Integer) val.get(1)).intValue(); |
|
191 |
// System.out.println("invis="+invis); |
|
192 |
// |
|
193 |
// val = DwgUtil.getBitShort(data, bitPos); |
|
194 |
// bitPos = ((Integer) val.get(0)).intValue(); |
|
195 |
// int flag = ((Integer) val.get(1)).intValue(); |
|
196 |
// System.out.println("flag="+flag); |
|
197 |
// |
|
198 |
// double dVal = 0d; |
|
199 |
// if((flag & 0x4) > 0){ |
|
200 |
// val = DwgUtil.getBitDouble(data, bitPos); |
|
201 |
// bitPos = ((Integer) val.get(0)).intValue(); |
|
202 |
// dVal = ((Double) val.get(1)).doubleValue(); |
|
203 |
// } |
|
204 |
// System.out.println("constWidth="+dVal); |
|
205 |
// |
|
206 |
// dVal = 0d; |
|
207 |
// if((flag & 0x8) > 0){ |
|
208 |
// val = DwgUtil.getBitDouble(data, bitPos); |
|
209 |
// bitPos = ((Integer) val.get(0)).intValue(); |
|
210 |
// dVal = ((Double) val.get(1)).doubleValue(); |
|
211 |
// } |
|
212 |
// System.out.println("elevation="+dVal); |
|
213 |
// |
|
214 |
// dVal = 0d; |
|
215 |
// if ((flag & 0x2) > 0){ |
|
216 |
// val = DwgUtil.getBitDouble(data, bitPos); |
|
217 |
// bitPos = ((Integer) val.get(0)).intValue(); |
|
218 |
// dVal = ((Double) val.get(1)).doubleValue(); |
|
219 |
// } |
|
220 |
// System.out.println("thickness="+dVal); |
|
221 |
// |
|
222 |
// double x, y, z ; |
|
223 |
// x = 0d; |
|
224 |
// y = 0d; |
|
225 |
// z = 0d; |
|
226 |
// |
|
227 |
// if ((flag & 0x1) > 0){ |
|
228 |
// val = DwgUtil.getBitDouble(data, bitPos); |
|
229 |
// bitPos = ((Integer) val.get(0)).intValue(); |
|
230 |
// x = ((Double) val.get(1)).doubleValue(); |
|
231 |
// |
|
232 |
// val = DwgUtil.getBitDouble(data, bitPos); |
|
233 |
// bitPos = ((Integer) val.get(0)).intValue(); |
|
234 |
// y = ((Double) val.get(1)).doubleValue(); |
|
235 |
// |
|
236 |
// val = DwgUtil.getBitDouble(data, bitPos); |
|
237 |
// bitPos = ((Integer) val.get(0)).intValue(); |
|
238 |
// z = ((Double) val.get(1)).doubleValue(); |
|
239 |
// } |
|
240 |
// System.out.println("normal="+x+","+y+","+z); |
|
241 |
// |
|
242 |
// val = DwgUtil.getBitLong(data, bitPos); |
|
243 |
// bitPos = ((Integer) val.get(0)).intValue(); |
|
244 |
// int np = ((Integer) val.get(1)).intValue(); |
|
245 |
// System.out.println("numPoints="+np); |
|
246 |
// |
|
247 |
// int nb = 0; |
|
248 |
// if((flag & 0x10) > 0){ |
|
249 |
// val = DwgUtil.getBitLong(data, bitPos); |
|
250 |
// bitPos = ((Integer) val.get(0)).intValue(); |
|
251 |
// nb = ((Integer) val.get(1)).intValue(); |
|
252 |
// } |
|
253 |
// System.out.println("numBulges="+nb); |
|
254 |
// int nw = 0; |
|
255 |
// if((flag & 0x20) > 0){ |
|
256 |
// val = DwgUtil.getBitLong(data, bitPos); |
|
257 |
// bitPos = ((Integer) val.get(0)).intValue(); |
|
258 |
// nw = ((Integer) val.get(1)).intValue(); |
|
259 |
// } |
|
260 |
// System.out.println("numWidths="+nw); |
|
261 |
// if(np > 0){ |
|
262 |
// Point2D[] points = new Point2D[np]; |
|
263 |
// for(int i = 0; i < np; i++){ |
|
264 |
// val = DwgUtil.getRawDouble(data, bitPos); |
|
265 |
// bitPos = ((Integer) val.get(0)).intValue(); |
|
266 |
// x = ((Double) val.get(1)).doubleValue(); |
|
267 |
// |
|
268 |
// val = DwgUtil.getRawDouble(data, bitPos); |
|
269 |
// bitPos = ((Integer) val.get(0)).intValue(); |
|
270 |
// y = ((Double) val.get(1)).doubleValue(); |
|
271 |
// |
|
272 |
// points[i] = new Point2D.Double(x, y); |
|
273 |
// System.out.println("Punto"+i+"="+x+","+y); |
|
274 |
// }//for |
|
275 |
// }//if np |
|
276 |
// |
|
277 |
// if(nb > 0){ |
|
278 |
// double[] bulges = new double[nb]; |
|
279 |
// for(int i = 0; i < nb; i++){ |
|
280 |
// val = DwgUtil.getRawDouble(data, bitPos); |
|
281 |
// bitPos = ((Integer) val.get(0)).intValue(); |
|
282 |
// bulges[i] = ((Double) val.get(1)).doubleValue(); |
|
283 |
// System.out.println("Bulge"+i+"="+bulges[i]); |
|
284 |
// }//for |
|
285 |
// |
|
286 |
// }//if nb |
|
287 |
// |
|
288 |
// if(nw > 0){ |
|
289 |
// double[][] widths = new double[nw][2]; |
|
290 |
// for(int i = 0; i < nw; i++){ |
|
291 |
// val = DwgUtil.getBitDouble(data, bitPos); |
|
292 |
// bitPos = ((Integer) val.get(0)).intValue(); |
|
293 |
// double sw = ((Double) val.get(1)).doubleValue(); |
|
294 |
// |
|
295 |
// val = DwgUtil.getBitDouble(data, bitPos); |
|
296 |
// bitPos = ((Integer) val.get(0)).intValue(); |
|
297 |
// double ew = ((Double) val.get(1)).doubleValue(); |
|
298 |
// |
|
299 |
// widths[i][0] = sw; |
|
300 |
// widths[i][1] = ew; |
|
301 |
// System.out.println("Width"+i+"="+sw+","+ew); |
|
302 |
// }//for |
|
303 |
// } |
|
304 |
} |
|
305 |
|
|
306 |
public void test3(){ |
|
307 |
//test of extrusion |
|
308 |
double[] coord = null; |
|
309 |
double[] extrusion = null; |
|
310 |
double[] extrusion2 = new double[]{0, 0, 1}; |
|
311 |
|
|
312 |
coord = new double[]{790089.65, 4477974.75, 9.560000000114087}; |
|
313 |
extrusion = new double[]{-0.5037965987025721, 0.07005064807841195, 0.8609772899673451}; |
|
314 |
//1. algoritmo original, vector normal distinto |
|
315 |
// double[] newCoord = AcadExtrusionCalculator.extrude(coord, extrusion); |
|
316 |
// newCoord = AcadExtrusionCalculator.extrude3(coord, extrusion); |
|
317 |
// |
|
318 |
//2? ahora con vector normal coincidente con eje Z |
|
319 |
// newCoord = AcadExtrusionCalculator.extrude(coord, extrusion2); |
|
320 |
// newCoord = AcadExtrusionCalculator.extrude3(coord, extrusion2); |
|
321 |
} |
|
322 |
} |
tags/org.gvsig.dwg-2.0.109/org.gvsig.dwg.lib/src/main/java/org/gvsig/dwg/lib/IDwgVertex.java | ||
---|---|---|
1 |
/* |
|
2 |
* Created on 04-mar-2007 |
|
3 |
* |
|
4 |
* gvSIG. Sistema de Informaci?n Geogr?fica de la Generalitat Valenciana |
|
5 |
* |
|
6 |
* Copyright (C) 2004 IVER T.I. and Generalitat Valenciana. |
|
7 |
* |
|
8 |
* This program is free software; you can redistribute it and/or |
|
9 |
* modify it under the terms of the GNU General Public License |
|
10 |
* as published by the Free Software Foundation; either version 2 |
|
11 |
* of the License, or (at your option) any later version. |
|
12 |
* |
|
13 |
* This program is distributed in the hope that it will be useful, |
|
14 |
* but WITHOUT ANY WARRANTY; without even the implied warranty of |
|
15 |
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
|
16 |
* GNU General Public License for more details. |
|
17 |
* |
|
18 |
* You should have received a copy of the GNU General Public License |
|
19 |
* along with this program; if not, write to the Free Software |
|
20 |
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,USA. |
|
21 |
* |
|
22 |
* For more information, contact: |
|
23 |
* |
|
24 |
* Generalitat Valenciana |
|
25 |
* Conselleria d'Infraestructures i Transport |
|
26 |
* Av. Blasco Ib??ez, 50 |
|
27 |
* 46010 VALENCIA |
|
28 |
* SPAIN |
|
29 |
* |
|
30 |
* +34 963862235 |
|
31 |
* gvsig@gva.es |
|
32 |
* www.gvsig.gva.es |
|
33 |
* |
|
34 |
* or |
|
35 |
* |
|
36 |
* IVER T.I. S.A |
|
37 |
* Salamanca 50 |
|
38 |
* 46005 Valencia |
|
39 |
* Spain |
|
40 |
* |
|
41 |
* +34 963163400 |
|
42 |
* dac@iver.es |
|
43 |
*/ |
|
44 |
/* CVS MESSAGES: |
|
45 |
* |
|
46 |
* $Id: IDwgVertex.java 28969 2009-05-25 13:23:12Z jmvivo $ |
|
47 |
* $Log$ |
|
48 |
* Revision 1.2.2.1 2007-03-21 19:49:16 azabala |
|
49 |
* implementation of dwg 12, 13, 14. |
|
50 |
* |
|
51 |
* Revision 1.2 2007/03/20 19:55:27 azabala |
|
52 |
* source code cleaning |
|
53 |
* |
|
54 |
* Revision 1.1 2007/03/06 19:39:38 azabala |
|
55 |
* Changes to adapt dwg 12 to general architecture |
|
56 |
* |
|
57 |
* |
|
58 |
*/ |
|
59 |
package org.gvsig.dwg.lib; |
|
60 |
|
|
61 |
/** |
|
62 |
* Base interface for all DWG vertices. |
|
63 |
* |
|
64 |
* @author azabala |
|
65 |
* |
|
66 |
* */ |
|
67 |
public interface IDwgVertex { |
|
68 |
public double[] getPoint(); |
|
69 |
public void setPoint(double[] point); |
|
70 |
} |
|
71 |
|
tags/org.gvsig.dwg-2.0.109/org.gvsig.dwg.lib/src/main/java/org/gvsig/dwg/lib/DwgHeader.java | ||
---|---|---|
1 |
/* jdwglib. Java Library for reading Dwg files. |
|
2 |
* |
|
3 |
* Author: Jose Morell Rama (jose.morell@gmail.com). |
|
4 |
* Port from the Pythoncad Dwg library by Art Haas. |
|
5 |
* |
|
6 |
* Copyright (C) 2005 Jose Morell, IVER TI S.A. and Generalitat Valenciana |
|
7 |
* |
|
8 |
* This program is free software; you can redistribute it and/or |
|
9 |
* modify it under the terms of the GNU General Public License |
|
10 |
* as published by the Free Software Foundation; either version 2 |
|
11 |
* of the License, or (at your option) any later version. |
|
12 |
* |
|
13 |
* This program is distributed in the hope that it will be useful, |
|
14 |
* but WITHOUT ANY WARRANTY; without even the implied warranty of |
|
15 |
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
|
16 |
* GNU General Public License for more details. |
|
17 |
* |
|
18 |
* You should have received a copy of the GNU General Public License |
|
19 |
* along with this program; if not, write to the Free Software |
|
20 |
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,USA. |
|
21 |
* |
|
22 |
* For more information, contact: |
|
23 |
* |
|
24 |
* Jose Morell (jose.morell@gmail.com) |
|
25 |
* |
|
26 |
* or |
|
27 |
* |
|
28 |
* IVER TI S.A. |
|
29 |
* C/Salamanca, 50 |
|
30 |
* 46005 Valencia |
|
31 |
* Spain |
|
32 |
* +34 963163400 |
|
33 |
* dac@iver.es |
|
34 |
*/ |
|
35 |
package org.gvsig.dwg.lib; |
|
36 |
|
|
37 |
/** |
|
38 |
* The DwgHeader class implements the Header of a DWG file |
|
39 |
* |
|
40 |
* @author jmorell |
|
41 |
*/ |
|
42 |
public class DwgHeader { |
|
43 |
} |
tags/org.gvsig.dwg-2.0.109/org.gvsig.dwg.lib/src/main/java/org/gvsig/dwg/lib/util/ArcFromBulgeCalculator.java | ||
---|---|---|
1 |
/* jdwglib. Java Library for reading Dwg files. |
|
2 |
* |
|
3 |
* Author: Jose Morell Rama (jose.morell@gmail.com). |
|
4 |
* Port from the Pythoncad Dwg library by Art Haas. |
|
5 |
* |
|
6 |
* Copyright (C) 2005 Jose Morell, IVER TI S.A. and Generalitat Valenciana |
|
7 |
* |
|
8 |
* This program is free software; you can redistribute it and/or |
|
9 |
* modify it under the terms of the GNU General Public License |
|
10 |
* as published by the Free Software Foundation; either version 2 |
|
11 |
* of the License, or (at your option) any later version. |
|
12 |
* |
|
13 |
* This program is distributed in the hope that it will be useful, |
|
14 |
* but WITHOUT ANY WARRANTY; without even the implied warranty of |
|
15 |
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
|
16 |
* GNU General Public License for more details. |
|
17 |
* |
|
18 |
* You should have received a copy of the GNU General Public License |
|
19 |
* along with this program; if not, write to the Free Software |
|
20 |
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,USA. |
|
21 |
* |
|
22 |
* For more information, contact: |
|
23 |
* |
|
24 |
* Jose Morell (jose.morell@gmail.com) |
|
25 |
* |
|
26 |
* or |
|
27 |
* |
|
28 |
* IVER TI S.A. |
|
29 |
* C/Salamanca, 50 |
|
30 |
* 46005 Valencia |
|
31 |
* Spain |
|
32 |
* +34 963163400 |
|
33 |
* dac@iver.es |
|
34 |
*/ |
|
35 |
package org.gvsig.dwg.lib.util; |
|
36 |
|
|
37 |
import java.awt.geom.Point2D; |
|
38 |
import java.util.Vector; |
|
39 |
|
|
40 |
/** |
|
41 |
* This class calculates an arc given by a start and end points and a bulge |
|
42 |
* |
|
43 |
* @author jmorell |
|
44 |
*/ |
|
45 |
public class ArcFromBulgeCalculator { |
|
46 |
private double[] coord1, coord2; |
|
47 |
private double[] center; |
|
48 |
private double radio, empieza, acaba; |
|
49 |
private double bulge; |
|
50 |
private double d, dd, aci; |
|
51 |
private double[] coordAux; |
|
52 |
|
|
53 |
/** |
|
54 |
* This method calculates an arc given by a start and end points and a bulge |
|
55 |
* |
|
56 |
* @param p1 Start point of the arc given by a Point2D |
|
57 |
* @param p2 End point of the arc given by a Point2D |
|
58 |
* @param bulge Bulge of the arc given by a double value |
|
59 |
*/ |
|
60 |
public ArcFromBulgeCalculator(double[] p1, double[] p2, double bulge) { |
|
61 |
this.bulge = bulge; |
|
62 |
if (bulge < 0.0) { |
|
63 |
coord1 = p2; |
|
64 |
coord2 = p1; |
|
65 |
} else { |
|
66 |
coord1 = p1; |
|
67 |
coord2 = p2; |
|
68 |
} |
|
69 |
calParams(); |
|
70 |
} |
|
71 |
|
|
72 |
private void calParams() { |
|
73 |
d = Math.sqrt((coord2[0]-coord1[0])*(coord2[0]-coord1[0]) + |
|
74 |
(coord2[1]-coord1[1])*(coord2[1]-coord1[1])); |
|
75 |
coordAux = new double[]{(coord1[0]+coord2[0])/2.0, (coord1[1]+coord2[1])/2.0}; |
|
76 |
double b = Math.abs(bulge); |
|
77 |
double beta = Math.atan(b); |
|
78 |
double alfa = beta*4.0; |
|
79 |
double landa = alfa/2.0; |
|
80 |
dd = (d/2.0)/(Math.tan(landa)); |
|
81 |
radio = (d/2.0)/(Math.sin(landa)); |
|
82 |
aci = Math.atan((coord2[0]-coord1[0])/(coord2[1]-coord1[1])); |
|
83 |
double aciDegree = aci*180.0/Math.PI; |
|
84 |
if (coord2[1] > coord1[1]) { |
|
85 |
aci += Math.PI; |
|
86 |
aciDegree = aci*180.0/Math.PI; |
|
87 |
} |
|
88 |
center = new double[]{coordAux[0] + dd*Math.sin(aci+(Math.PI/2.0)), coordAux[1] + dd*Math.cos(aci+(Math.PI/2.0))}; |
|
89 |
calEA(alfa); |
|
90 |
} |
|
91 |
|
|
92 |
private void calEA(double alfa){ |
|
93 |
empieza = Math.atan2(coord1[1]-center[1], coord1[0]-center[0]); |
|
94 |
acaba = (empieza + alfa); |
|
95 |
empieza = empieza*180.0/Math.PI; |
|
96 |
acaba = acaba*180.0/Math.PI; |
|
97 |
} |
|
98 |
|
|
99 |
/** |
|
100 |
* This method calculates an arc in a Gis geometry model. This arc is represented in |
|
101 |
* this model by a Vector of Point2D. The distance between points in the arc is given |
|
102 |
* as an argument |
|
103 |
* |
|
104 |
* @param inc Distance between points in the arc |
|
105 |
* @return Vector Vector with the set of Point2D that represents the arc |
|
106 |
*/ |
|
107 |
public Vector getPoints(double inc) { |
|
108 |
Vector arc = new Vector(); |
|
109 |
double angulo; |
|
110 |
int iempieza = (int) empieza + 1; |
|
111 |
int iacaba = (int) acaba; |
|
112 |
if (empieza <= acaba) { |
|
113 |
addNode(arc, empieza); |
|
114 |
for (angulo = iempieza; angulo <= iacaba; angulo += inc) { |
|
115 |
addNode(arc, angulo); |
|
116 |
} |
|
117 |
addNode(arc, acaba); |
|
118 |
} else { |
|
119 |
addNode(arc, empieza); |
|
120 |
for (angulo = iempieza ; angulo <= 360; angulo += inc) { |
|
121 |
addNode(arc, angulo); |
|
122 |
} |
|
123 |
for (angulo = 1; angulo <= iacaba; angulo += inc) { |
|
124 |
addNode(arc, angulo); |
|
125 |
} |
|
126 |
addNode(arc, angulo); |
|
127 |
} |
|
128 |
Point2D aux = (Point2D)arc.get(arc.size()-1); |
|
129 |
double aux1 = Math.abs(aux.getX()-coord2[0]); |
|
130 |
double aux2 = Math.abs(aux.getY()-coord2[1]); |
|
131 |
return arc; |
|
132 |
} |
|
133 |
|
|
134 |
/** |
|
135 |
* Method that allows to obtain a set of points located in the central zone of |
|
136 |
* this arc object |
|
137 |
*/ |
|
138 |
public Vector getCentralPoint() { |
|
139 |
Vector arc = new Vector(); |
|
140 |
if (empieza <= acaba) { |
|
141 |
addNode(arc, (empieza+acaba)/2.0); |
|
142 |
} else { |
|
143 |
addNode(arc, empieza); |
|
144 |
double alfa = 360-empieza; |
|
145 |
double beta = acaba; |
|
146 |
double an = alfa + beta; |
|
147 |
double mid = an/2.0; |
|
148 |
if (mid<=alfa) { |
|
149 |
addNode(arc, empieza+mid); |
|
150 |
} else { |
|
151 |
addNode(arc, mid-alfa); |
|
152 |
} |
|
153 |
} |
|
154 |
return arc; |
|
155 |
} |
|
156 |
|
|
157 |
private void addNode(Vector arc, double angulo) { |
|
158 |
double yy = center[1] + radio * Math.sin(angulo*Math.PI/180.0); |
|
159 |
double xx = center[0] + radio * Math.cos(angulo*Math.PI/180.0); |
|
160 |
arc.add(new Point2D.Double(xx,yy)); |
|
161 |
} |
|
162 |
} |
tags/org.gvsig.dwg-2.0.109/org.gvsig.dwg.lib/src/main/java/org/gvsig/dwg/lib/util/GisModelCurveCalculator.java | ||
---|---|---|
1 |
/* jdwglib. Java Library for reading Dwg files. |
|
2 |
* |
|
3 |
* Author: Jose Morell Rama (jose.morell@gmail.com). |
|
4 |
* Port from the Pythoncad Dwg library by Art Haas. |
|
5 |
* |
|
6 |
* Copyright (C) 2005 Jose Morell, IVER TI S.A. and Generalitat Valenciana |
|
7 |
* |
|
8 |
* This program is free software; you can redistribute it and/or |
|
9 |
* modify it under the terms of the GNU General Public License |
|
10 |
* as published by the Free Software Foundation; either version 2 |
|
11 |
* of the License, or (at your option) any later version. |
|
12 |
* |
|
13 |
* This program is distributed in the hope that it will be useful, |
|
14 |
* but WITHOUT ANY WARRANTY; without even the implied warranty of |
|
15 |
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
|
16 |
* GNU General Public License for more details. |
|
17 |
* |
|
18 |
* You should have received a copy of the GNU General Public License |
|
19 |
* along with this program; if not, write to the Free Software |
|
20 |
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,USA. |
|
21 |
* |
|
22 |
* For more information, contact: |
|
23 |
* |
|
24 |
* Jose Morell (jose.morell@gmail.com) |
|
25 |
* |
|
26 |
* or |
|
27 |
* |
|
28 |
* IVER TI S.A. |
|
29 |
* C/Salamanca, 50 |
|
30 |
* 46005 Valencia |
|
31 |
* Spain |
|
32 |
* +34 963163400 |
|
33 |
* dac@iver.es |
|
34 |
*/ |
|
35 |
package org.gvsig.dwg.lib.util; |
|
36 |
|
|
37 |
import java.awt.geom.Point2D; |
|
38 |
import java.util.ArrayList; |
|
39 |
import java.util.List; |
|
40 |
import java.util.Vector; |
|
41 |
|
|
42 |
/** |
|
43 |
* This class allows to obtain arcs and circles given by the most usual parameters, in a |
|
44 |
* Gis geometry model. In this model, an arc or a circle is given by a set of points that |
|
45 |
* defines it shape |
|
46 |
* |
|
47 |
* @author jmorell |
|
48 |
*/ |
|
49 |
public class GisModelCurveCalculator { |
|
50 |
|
|
51 |
/** |
|
52 |
* This method calculates an array of Point2D that represents a circle. The distance |
|
53 |
* between it points is 1 angular unit |
|
54 |
* |
|
55 |
* @param c Point2D that represents the center of the circle |
|
56 |
* @param r double value that represents the radius of the circle |
|
57 |
* @return Point2D[] An array of Point2D that represents the shape of the circle |
|
58 |
*/ |
|
59 |
public static List calculateGisModelCircle(Point2D c, double r) { |
|
60 |
List pts = new ArrayList(); |
|
61 |
int angulo = 0; |
|
62 |
for (angulo=0; angulo<360; angulo++) { |
|
63 |
double[] pt = new double[]{c.getX(), c.getY()}; |
|
64 |
pt[0] = pt[0] + r * Math.sin(angulo*Math.PI/(double)180.0); |
|
65 |
pt[1] = pt[1] + r * Math.cos(angulo*Math.PI/(double)180.0); |
|
66 |
|
|
67 |
pts.add(pt); |
|
68 |
} |
|
69 |
return pts; |
|
70 |
} |
|
71 |
|
|
72 |
/** |
|
73 |
* This method calculates an array of Point2D that represents a ellipse. The distance |
|
74 |
* between it points is 1 angular unit |
|
75 |
* |
|
76 |
* @param center Point2D that represents the center of the ellipse |
|
77 |
* @param majorAxisVector Point2D that represents the vector for the major axis |
|
78 |
* @param axisRatio double value that represents the axis ratio |
|
79 |
* @param initAngle double value that represents the start angle of the ellipse arc |
|
80 |
* @param endAngle double value that represents the end angle of the ellipse arc |
|
81 |
* @return Point2D[] An array of Point2D that represents the shape of the ellipse |
|
82 |
*/ |
|
83 |
public static List calculateGisModelEllipse(Point2D center, Point2D majorAxisVector, double axisRatio, double initAngle, double endAngle) { |
|
84 |
Point2D majorPoint = new Point2D.Double(center.getX()+majorAxisVector.getX(), center.getY()+majorAxisVector.getY()); |
|
85 |
double orientation = Math.atan(majorAxisVector.getY()/majorAxisVector.getX()); |
|
86 |
double semiMajorAxisLength = center.distance(majorPoint); |
|
87 |
double semiMinorAxisLength = semiMajorAxisLength*axisRatio; |
|
88 |
double eccentricity = Math.sqrt(1-((Math.pow(semiMinorAxisLength, 2))/(Math.pow(semiMajorAxisLength, 2)))); |
|
89 |
int isa = (int)initAngle; |
|
90 |
int iea = (int)endAngle; |
|
91 |
double angulo; |
|
92 |
List pts = new ArrayList(); |
|
93 |
if (initAngle <= endAngle) { |
|
94 |
angulo = initAngle; |
|
95 |
double r = semiMinorAxisLength/Math.sqrt(1-((Math.pow(eccentricity, 2))*(Math.pow(Math.cos(angulo*Math.PI/(double)180.0), 2)))); |
|
96 |
double x = r*Math.cos(angulo*Math.PI/(double)180.0); |
|
97 |
double y = r*Math.sin(angulo*Math.PI/(double)180.0); |
|
98 |
double xrot = x*Math.cos(orientation) - y*Math.sin(orientation); |
|
99 |
double yrot = x*Math.sin(orientation) + y*Math.cos(orientation); |
|
100 |
|
|
101 |
double[] pt = new double[]{center.getX() + xrot, center.getY() + yrot }; |
|
102 |
pts.add(pt); |
|
103 |
|
|
104 |
for (int i=1; i<=(iea-isa)+1; i++) { |
|
105 |
angulo = (double)(isa+i); |
|
106 |
r = semiMinorAxisLength/Math.sqrt(1-((Math.pow(eccentricity, 2))*(Math.pow(Math.cos(angulo*Math.PI/(double)180.0), 2)))); |
|
107 |
x = r*Math.cos(angulo*Math.PI/(double)180.0); |
|
108 |
y = r*Math.sin(angulo*Math.PI/(double)180.0); |
|
109 |
xrot = x*Math.cos(orientation) - y*Math.sin(orientation); |
|
110 |
yrot = x*Math.sin(orientation) + y*Math.cos(orientation); |
|
111 |
|
|
112 |
pt = new double[]{center.getX() + xrot, center.getY() + yrot}; |
|
113 |
pts.add(pt); |
|
114 |
} |
|
115 |
|
|
116 |
angulo = endAngle; |
|
117 |
r = semiMinorAxisLength/Math.sqrt(1-((Math.pow(eccentricity, 2))*(Math.pow(Math.cos(angulo*Math.PI/(double)180.0), 2)))); |
|
118 |
x = r*Math.cos(angulo*Math.PI/(double)180.0); |
|
119 |
y = r*Math.sin(angulo*Math.PI/(double)180.0); |
|
120 |
xrot = x*Math.cos(orientation) - y*Math.sin(orientation); |
|
121 |
yrot = x*Math.sin(orientation) + y*Math.cos(orientation); |
|
122 |
|
|
123 |
|
|
124 |
pt = new double[]{center.getX() + xrot, center.getY() + yrot}; |
|
125 |
pts.add(pt); |
|
126 |
|
|
127 |
} else { |
|
128 |
angulo = initAngle; |
|
129 |
double r = semiMinorAxisLength/Math.sqrt(1-((Math.pow(eccentricity, 2))*(Math.pow(Math.cos(angulo*Math.PI/(double)180.0), 2)))); |
|
130 |
double x = r*Math.cos(angulo*Math.PI/(double)180.0); |
|
131 |
double y = r*Math.sin(angulo*Math.PI/(double)180.0); |
|
132 |
double xrot = x*Math.cos(orientation) - y*Math.sin(orientation); |
|
133 |
double yrot = x*Math.sin(orientation) + y*Math.cos(orientation); |
|
134 |
|
|
135 |
|
|
136 |
double[] pt = new double[]{center.getX() + r*Math.cos(angulo*Math.PI/(double)180.0), center.getY() + r*Math.sin(angulo*Math.PI/(double)180.0)}; |
|
137 |
pts.add(pt); |
|
138 |
|
|
139 |
for (int i=1; i<=(360-isa); i++) { |
|
140 |
angulo = (double)(isa+i); |
|
141 |
r = semiMinorAxisLength/Math.sqrt(1-((Math.pow(eccentricity, 2))*(Math.pow(Math.cos(angulo*Math.PI/(double)180.0), 2)))); |
|
142 |
x = r*Math.cos(angulo*Math.PI/(double)180.0); |
|
143 |
y = r*Math.sin(angulo*Math.PI/(double)180.0); |
|
144 |
xrot = x*Math.cos(orientation) - y*Math.sin(orientation); |
|
145 |
yrot = x*Math.sin(orientation) + y*Math.cos(orientation); |
|
146 |
|
|
147 |
pt = new double[]{center.getX() + xrot, center.getY() + yrot}; |
|
148 |
pts.add(pt); |
|
149 |
} |
|
150 |
|
|
151 |
|
|
152 |
for (int i=(360-isa)+1; i<=(360-isa)+iea; i++) { |
|
153 |
angulo = (double)(i-(360-isa)); |
|
154 |
r = semiMinorAxisLength/Math.sqrt(1-((Math.pow(eccentricity, 2))*(Math.pow(Math.cos(angulo*Math.PI/(double)180.0), 2)))); |
|
155 |
x = r*Math.cos(angulo*Math.PI/(double)180.0); |
|
156 |
y = r*Math.sin(angulo*Math.PI/(double)180.0); |
|
157 |
xrot = x*Math.cos(orientation) - y*Math.sin(orientation); |
|
158 |
yrot = x*Math.sin(orientation) + y*Math.cos(orientation); |
|
159 |
|
|
160 |
pt = new double[]{center.getX() + xrot, center.getY() + yrot}; |
|
161 |
pts.add(pt); |
|
162 |
|
|
163 |
} |
|
164 |
|
|
165 |
angulo = endAngle; |
|
166 |
r = semiMinorAxisLength/Math.sqrt(1-((Math.pow(eccentricity, 2))*(Math.pow(Math.cos(angulo*Math.PI/(double)180.0), 2)))); |
|
167 |
x = r*Math.cos(angulo*Math.PI/(double)180.0); |
|
168 |
y = r*Math.sin(angulo*Math.PI/(double)180.0); |
|
169 |
xrot = x*Math.cos(orientation) - y*Math.sin(orientation); |
|
170 |
yrot = x*Math.sin(orientation) + y*Math.cos(orientation); |
|
171 |
|
|
172 |
pt = new double[]{center.getX() + xrot, center.getY() + yrot}; |
|
173 |
pts.add(pt); |
|
174 |
} |
|
175 |
return pts; |
|
176 |
} |
|
177 |
|
|
178 |
/** |
|
179 |
* This method calculates an array of Point2D that represents an arc. The distance |
|
180 |
* between it points is 1 angular unit |
|
181 |
* |
|
182 |
* @param c Point2D that represents the center of the arc |
|
183 |
* @param r double value that represents the radius of the arc |
|
184 |
* @param sa double value that represents the start angle of the arc |
|
185 |
* @param ea double value that represents the end angle of the arc |
|
186 |
* @return Point2D[] An array of Point2D that represents the shape of the arc |
|
187 |
*/ |
|
188 |
public static List calculateGisModelArc(double[] center, double r, double sa, double ea) { |
|
189 |
int isa = (int)sa; |
|
190 |
int iea = (int)ea; |
|
191 |
double angulo; |
|
192 |
List pts = new ArrayList(); |
|
193 |
if (sa <= ea) { |
|
194 |
angulo = sa; |
|
195 |
pts.add(new double[]{center[0] + r * Math.cos(angulo*Math.PI/(double)180.0), |
|
196 |
center[1] + r * Math.sin(angulo*Math.PI/(double)180.0)}); |
|
197 |
for (int i=1; i <= (iea-isa)+1; i++) { |
|
198 |
angulo = (double)(isa+i); |
|
199 |
double x = center[0] + r * Math.cos(angulo*Math.PI/(double)180.0); |
|
200 |
double y = center[1] + r * Math.sin(angulo*Math.PI/(double)180.0); |
|
201 |
pts.add(new double[]{x, y}); |
|
202 |
} |
|
203 |
angulo = ea; |
|
204 |
double x = center[0] + r * Math.cos(angulo*Math.PI/(double)180.0); |
|
205 |
double y = center[1] + r * Math.sin(angulo*Math.PI/(double)180.0); |
|
206 |
pts.add(new double[]{x, y}); |
|
207 |
} else { |
|
208 |
angulo = sa; |
|
209 |
double x = center[0] + r * Math.cos(angulo*Math.PI/(double)180.0); |
|
210 |
double y = center[1] + r * Math.sin(angulo*Math.PI/(double)180.0); |
|
211 |
pts.add(new double[]{x, y}); |
|
212 |
for (int i=1; i <= (360-isa); i++) { |
|
213 |
angulo = (double)(isa+i); |
|
214 |
x = center[0] + r * Math.cos(angulo*Math.PI/(double)180.0); |
|
215 |
y = center[1] + r * Math.sin(angulo*Math.PI/(double)180.0); |
|
216 |
pts.add(new double[]{x, y}); |
|
217 |
} |
|
218 |
|
|
219 |
for (int i=( 360-isa)+1; i <= (360-isa)+iea; i++) { |
|
220 |
angulo = (double)(i-(360-isa)); |
|
221 |
x = center[0] + r * Math.cos(angulo*Math.PI/(double)180.0); |
|
222 |
y = center[1] + r * Math.sin(angulo*Math.PI/(double)180.0); |
|
223 |
pts.add(new double[]{x, y}); |
|
224 |
} |
|
225 |
angulo = ea; |
|
226 |
x = center[0] + r * Math.cos(angulo*Math.PI/(double)180.0); |
|
227 |
y = center[1] + r * Math.sin(angulo*Math.PI/(double)180.0); |
|
228 |
pts.add(new double[]{x, y}); |
|
229 |
} |
|
230 |
return pts; |
|
231 |
} |
|
232 |
|
|
233 |
/** |
|
234 |
* This method applies an array of bulges to an array of Point2D that defines a |
|
235 |
* polyline. The result is a polyline with the input points with the addition of the |
|
236 |
* points that define the new arcs added to the polyline |
|
237 |
* |
|
238 |
* @param newPts Base points of the polyline |
|
239 |
* @param bulges Array of bulge parameters |
|
240 |
* @return Polyline with a new set of arcs added and defined by the bulge parameters |
|
241 |
*/ |
|
242 |
public static List calculateGisModelBulge(List newPts, double[] bulges) { |
|
243 |
Vector ptspol = new Vector(); |
|
244 |
double[] init = null; |
|
245 |
double[] end = null; |
|
246 |
for (int j=0; j<newPts.size(); j++) { |
|
247 |
init = (double[]) newPts.get(j); |
|
248 |
if (j != newPts.size()-1) |
|
249 |
end = (double[]) newPts.get(j+1); |
|
250 |
if (bulges[j]==0 || j== newPts.size()-1 || |
|
251 |
(init[0] == end[0] && init[1] == end[1])) { |
|
252 |
ptspol.add(init); |
|
253 |
} else { |
|
254 |
ArcFromBulgeCalculator arcCalculator = new ArcFromBulgeCalculator(init, end, bulges[j]); |
|
255 |
Vector arc = arcCalculator.getPoints(1); |
|
256 |
if (bulges[j]<0) { |
|
257 |
for (int k=arc.size()-1; k>=0; k--) { |
|
258 |
ptspol.add(arc.get(k)); |
|
259 |
} |
|
260 |
ptspol.remove(ptspol.size()-1); |
|
261 |
} else { |
|
262 |
for (int k=0;k<arc.size();k++) { |
|
263 |
ptspol.add(arc.get(k)); |
|
264 |
} |
|
265 |
ptspol.remove(ptspol.size()-1); |
|
266 |
} |
|
267 |
} |
|
268 |
} |
|
269 |
List points = new ArrayList(); |
|
270 |
for (int j=0;j<ptspol.size();j++) { |
|
271 |
points.add(ptspol.get(j)); |
|
272 |
} |
|
273 |
return points; |
|
274 |
} |
|
275 |
} |
tags/org.gvsig.dwg-2.0.109/org.gvsig.dwg.lib/src/main/java/org/gvsig/dwg/lib/util/HexUtil.java | ||
---|---|---|
1 |
package org.gvsig.dwg.lib.util; |
|
2 |
|
|
3 |
import java.util.BitSet; |
|
4 |
|
|
5 |
/** |
|
6 |
* Number in hexadecimal format are used throughout Freenet. |
|
7 |
* |
|
8 |
* <p>Unless otherwise stated, the conventions follow the rules outlined in the |
|
9 |
* Java Language Specification.</p> |
|
10 |
* |
|
11 |
* @author syoung |
|
12 |
*/ |
|
13 |
public class HexUtil { |
|
14 |
private HexUtil() { |
|
15 |
} |
|
16 |
|
|
17 |
|
|
18 |
/** |
|
19 |
* Converts a byte array into a string of upper case hex chars. |
|
20 |
* |
|
21 |
* @param bs |
|
22 |
* A byte array |
|
23 |
* @param off |
|
24 |
* The index of the first byte to read |
|
25 |
* @param length |
|
26 |
* The number of bytes to read. |
|
27 |
* @return the string of hex chars. |
|
28 |
*/ |
|
29 |
public static final String bytesToHex(byte[] bs, int off, int length) { |
|
30 |
StringBuffer sb = new StringBuffer(length * 2); |
|
31 |
bytesToHexAppend(bs, off, length, sb); |
|
32 |
return sb.toString(); |
|
33 |
} |
|
34 |
|
|
35 |
public static final void bytesToHexAppend( |
|
36 |
byte[] bs, |
|
37 |
int off, |
|
38 |
int length, |
|
39 |
StringBuffer sb) { |
|
40 |
sb.ensureCapacity(sb.length() + length * 2); |
|
41 |
for (int i = off; i < (off + length) && i < bs.length; i++) { |
|
42 |
sb.append(Character.forDigit((bs[i] >>> 4) & 0xf, 16)); |
|
43 |
sb.append(Character.forDigit(bs[i] & 0xf, 16)); |
|
44 |
} |
|
45 |
} |
|
46 |
|
|
47 |
public static final String bytesToHex(byte[] bs) { |
|
48 |
return bytesToHex(bs, 0, bs.length); |
|
49 |
} |
|
50 |
|
|
51 |
public static final byte[] hexToBytes(String s) { |
|
52 |
return hexToBytes(s, 0); |
|
53 |
} |
|
54 |
|
|
55 |
public static final byte[] hexToBytes(String s, int off) { |
|
56 |
byte[] bs = new byte[off + (1 + s.length()) / 2]; |
|
57 |
hexToBytes(s, bs, off); |
|
58 |
return bs; |
|
59 |
} |
|
60 |
|
Also available in: Unified diff