Before any measured data can be transfered via Bluetooth from your 3D metal detector to OKM's visualizing software, the appropriate Bluetooth drivers have to be installed. You can download the free Bluetooth drivers here. Please pay attention that you choose the right Bluetooth driver for your model of Bluetooth dongle. Use the pictures to find the right one.
You will receive this Software Key after purchasing the desired software edition. Proceed to product Visualizer 3D Studio ». The software Visualizer 3D includes an automatic update function, which you can execute by using the menu item Help - Internet Update. If your software program does not provide this function, you have to download the program for the internet update and install it at first. This program updates your version of Visualizer 3D software.
Attention: Unzip the file webupdate. Please read the short tutorial about the installation, which you can download as PDF document. All product highlights, special features and areas of application at a glance: Here you find our current OKM product brochures.
Quick Start Guides serve as a first aid for operating your metal detector or ground scanner. Detailed information on operating modes, application and measurement details can be found in the respective manual - see Device Specific Downloads. Selected OKM 3D ground scanners and metal detectors utilize software applications which can be installed and used on Android smartphones and tablets.
These Android Apps are used as graphical user interface GUI to control the detector and visualizes the measured data in three-dimensional graphics. Some of these are necessary to operate the website and its functions, others are used for statistical or marketing purposes.
By choosing 'Only accept necessary cookies' we will respect your privacy and not set cookies that are not necessary for the operation of the website. Accept all. Only accept functional cookies.
Individual settings. Functional cookies enable basic functions and are necessary for the proper functioning of the website. Marketing cookies are used to display personalized advertising by tracking visitors across websites. HOME Downloads. USB Drivers. Bluetooth drivers. Visualizer 3D Studio. Visualizer 3D Updates - The software Visualizer 3D includes an automatic update function, which you can execute by using the menu item Help - Internet Update.
Visualizer 3D Manual EN 1. Visualizer 3D Manual DE 1. Visualizer 3D Manual FR 1. Visualizer 3D Manual AR 1. Visualizer 3D Manual ES 1. Visualizer 3D Manual GR 1. Product Flyers and Brochures. Treasure Hunting brochure 5. OKM eXp Product flyer 1. Quick Start Guides. Detailed information on operating modes, application and measurement details can be found in the respective manual - see Device Specific Downloads Evolution NTX 3. Fusion Professional 2. Fusion Professional Quick Start Guide 1.
Fusion Professional Plus 2. Pulse Nova Quick Start Guide 5. OKM Android Apps. Bionic X4. Evolution NTX. Fusion Light. Fusion Light Fusion Light Product flyer 2. Fusion Professional. Fusion Professional Plus. Gepard GPR 3D. GeoSeeker Mini. Gold Labor Au Pulse Nova. Rover C4. OKM Rover C4 version 3. Rover UC. Power Pack. Previous Products. Bionic 01 Bionic 01 Manual EN Added to cart successfully!
Please login and you will add product to your wishlist Sign In Register. We use cookies. Functional Functional cookies enable basic functions and are necessary for the proper functioning of the website.
Privacy policy Legal notice Terms of service. Bionic X4 Manual EN. Bionic X4 Manual DE. Bionic X4 Manual FR. Bionic X4 Manual ES. OKM eXp Product flyer. Visualizer 3D Manual EN. Visualizer 3D Manual DE. Visualizer 3D Manual FR. Scan through blocks of tree, O n and O n 2. Mainten a sliding window with start and curr point, O n and O n. Sort with condition, O nlogn and O 1 2.
Scan all and split odd and even number into different array, O n and O n 3. Place odd and even number in odd and even place, not sort is needed.
Two points with quick sort swap idea, O n and O 1. Comstom Sort, O nlogn and O 1 2. Separete letter logs and digit logs, then sort letter logs and merge with digit logs, O nlogn and O n Minimum Increment to Make Array Unique Python Java Sort, then list duplicate and missing value in sorted list. Sort index by value, then transfer problem into finding max gap between index, O nlogn and O 1 2. Sort, O nlogn and O n 2. Sort and get 0-K, O nlogn and O 1 2.
Sort and get position in sorted nums, O nlogn and O n 2. Go through the array, O n and O 1 2. MIT License. Releases No releases published. Packages 0 No packages published. You signed in with another tab or window. Reload to refresh your session.
You signed out in another tab or window. Python Java. Longest Substring Without Repeating Characters. Median of Two Sorted Arrays. An extension of median of two sorted arrays of equal size problem. Longest Palindromic Substring. Background knowledge 1. Manacher algorithm. String to Integer atoi. Container With Most Water. Background knowledge Just like digit number, divide and minus. Two pointers, first pointer goes to n position, then move both pointers until reach tail, O n and O n.
Merge Two Sorted Lists. Merge k Sorted Lists. Swap Nodes in Pairs. Search Insert Position. Only two variables are needed, O n and O 1. Background 1. DP O n space. Binary Tree Inorder Traversal. Stack and check left and right, O n and O n. Validate Binary Search Tree. Maximum Depth of Binary Tree. Bottom-up recursion O n and O lgn. Balanced Binary Tree. Minimum Depth of Binary Tree. BFS check by level right most , which is much faster than recursion.
Binary Tree Maximum Path Sum. Longest Consecutive Sequence. Copy List with Random Pointer. Linked List Cycle II. Binary Tree Preorder Traversal.
Binary Tree Postorder Traversal. Stack and isinstance curr, TreeNode , O n and O n. Evaluate Reverse Polish Notation. Reverse Words in a String. Maximum Product Subarray. Find Minimum in Rotated Sorted Array.
Add another stack for min stack, maintance this stack when the main stack pop or push: 1. Edit distance. Fraction to Recurring Decimal. Two Sum II - Input array is sorted.
Sort before find, O 1 for add, O nlogn for find, O n space. Python Java CPP. Sieve of Eratosthenes , O nloglogn and O n. Reverse Linked List. Recursion, O n and O 1. Kth Largest Element in an Array. Combination Sum III. Contains Duplicate. Contains Duplicate II. Maintenance a set that contains previous k numbers, and check if curr in set. Contains Duplicate III. Lowest Common Ancestor of a Binary Tree. Store parents during traversing tree, reverse check their lowest common parent, O n and O n.
Product of Array Except Self. Shortest Word Distance. O nlogn and O n. Iteratively compare root result with current kid's result left or right , O logn and O logn. Integer to English Words. Counting sort, O n and O n. DP based on Sprague-Grundy Function. Number of Islands II. Maintain a sliding window with at most k distinct characters and a count for this window.
Top K Frequent Elements. Using Priority queue to remove older logs, O n and O n. Recursively check level and return them, O n and O n. Valid Perfect Square.
Integer square root 1. Newton's method. Largest Divisible Subset. Two points, the first to the tail, the second to the latest place that is not 9, O n and O 1. Fisher—Yates shuffle , O n and O n. First Unique Character in a String. Longest Absolute File Path.
Find the Difference. Based on solution 1, bit manipulate. Sum of Left Leaves. The same DFS based on stack. Convert a Number to Hexadecimal. Two's complement 1. Longest Palindrome. Python Java Cpp. Third Maximum Number. Partition Equal Subset Sum. Number of Segments in a String. Find All Anagrams in a String. Build a char count list with length. String Compression. Find All Numbers Disappeared in an Array. Value 1, n and index 0, n Each move is equal to minus one element in array, so the answer is the sum of all elements after minus min.
Largest Palindrome Product. License Key Formatting. Max Consecutive Ones. Right first DFS with a variable recording sum of node. Reverse Morris In-order Traversal. Reverse String II. Diameter of Binary Tree. String handle: Split with space than reverse word, O n and O n. Subarray Sum Equals K. Add sum into hash, check if sum - k is in hash, O n and O n. Subtree of Another Tree. Shortest Unsorted Continuous Subarray.
Find min and max of unordered array, O n and O 1. Merge Two Binary Trees. Maximum Product of Three Numbers. Actually, we should only care about min1, min2 and max1-max3, to find these five elements, we can use 1. Single scan with 5 elements keep, O n and O 1.
Maximum Binary Tree. Non-decreasing Array. Replace broken point with correct value, then check if there are more than 1 broken point, O n and O 1. Kth Smallest Number in Multiplication Table. Note that min value is root: 1. Longest Continuous Increasing Subsequence. Valid Palindrome II. Top K Frequent Words. Find top k with Heap, O nlogk and O n. Max Area of Island.
Degree of an Array. Go through nums, remember left most pos and right most for each value, O n and O n. Search in a Binary Search Tree. Kth Largest Element in a Stream. Find second last zero reversely, O n and O 1. Longest Word in Dictionary. Self Dividing Numbers. Network Delay Time. Find Anagram Mappings. Jewels and Stones. Count given char in string.
0コメント