Latest Contributions by VijayGandhi

You would need to create a Feature Service using ArcMap (see What is a feature service?—Documentation | ArcGIS for Server ). It can then be added as a FeatureLayer to the Java application (Example: Feature layer feature service—ArcGIS Runtime SDK for Java (Quartz Beta) | ArcGIS for Developers ). If you simply want to display the data from the database, you could read data from the database (using JDBC for example), and then add the data as Graphics to a GraphicsOverlay (Example: Add graphics overlays to your app—ArcGIS Runtime SDK for Java (Quartz Beta) | ArcGIS for Developers ) ... View more

ArcGIS Runtime Java does not support running as an applet. Oracle/Java is planning to move away from the applet technology. Moving to a Plugin-Free Web (Java Platform Group, Product Management blog) ... View more

You could get the exception using the getException() method on the layer. This method could be invoked after the layer has initialized.     dynamicLayer = new ArcGISDynamicMapServiceLayer(URL_DYNAMIC_LAYER);     dynamicLayer.addLayerInitializeCompleteListener(new LayerInitializeCompleteListener() {       @Override       public void layerInitializeComplete(LayerInitializeCompleteEvent e) {         System.out.println("Error: " + dynamicLayer.getException());       }     }); ... View more

The supported format for a geodatabase file is a ".geodatabase". That database is created through a GeodatabaseFeatureTable - basically, it connects to a FeatureLayer and downloads data into a file. The workflow is described at Offline editing workflow | ArcGIS for Developers . An example is also available in the samples (Editing -> Offline editing workflow). ... View more

Hi Julien, There is a lot of computation here that could be avoided. Instead of checking intersection of every point with every polygon, you could create a spatial index using the polygons and then check every point against the spatial index. The complexity for the first case is O(n points x m polygons). In the second case, it could be reduced to O(m) + O(n x log m) (O(m) for building the index). The polygons in your data seem to be static, so a spatial index such as a grid-based or a quad-tree could be a good fit. An example of quad tree implementation is at http://gamedevelopment.tutsplus.com/tutorials/quick-tip-use-quadtrees-to-detect-likely-collisions-in-2d-space--gamedev-3… ). Another spatial index at aled/jsi · GitHub Some other thoughts: 1) You could spawn multiple threads that run concurrently. 2) In general, using Geometry.intersects() takes less time compared to Geometry.intersect() followed by checking whether it returned something. Vijay ... View more

Hi Jerry, We don't an API to do that. However, since the source code of ScaleBarOverlay is publicly available, you could customize it. Here is the source code of ScaleBarOverlay that does not display miles - ScaleBarOverlay without miles.‌ The changes made are: 1) In createScaleBar(), I have commented out the code that was creating the second row and text (miles). 2) In onPaint(), I removed code that was drawing the second row and text. ... View more